Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, C

Time bar (total: 626.0ms)

start0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0.1%)

Memory
0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 7 to 7 computations (0% saved)

sample555.0ms (88.6%)

Memory
14.1MiB live, 899.5MiB allocated; 185ms collecting garbage
Samples
377.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 117.0ms
ival-mult!: 76.0ms (64.9% of total)
ival-sub!: 40.0ms (34.2% of total)
adjust: 2.0ms (1.7% of total)
Bogosity

preprocess35.0ms (5.7%)

Memory
-19.2MiB live, 40.7MiB allocated; 44ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02253
16653
213653
320753
421053
Stop Event
saturated
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(-.f64 x (*.f64 y z))
Symmetry

(sort y z)

Compiler

Compiled 10 to 10 computations (0% saved)

series12.0ms (2%)

Memory
-18.8MiB live, 28.6MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
045149
Stop Event
iter-limit
Counts
5 → 13
Calls
Call 1
Inputs
(-.f64 x (*.f64 y z))
x
(*.f64 y z)
y
z
Outputs
#s(approx (- x (* y z)) (*.f64 #s(literal -1 binary64) (*.f64 y z)))
#s(approx (- x (* y z)) (-.f64 x (*.f64 y z)))
#s(approx x x)
#s(approx (- x (* y z)) (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1 binary64) (/.f64 (*.f64 y z) x)))))
#s(approx (- x (* y z)) (*.f64 #s(literal -1 binary64) (*.f64 x (-.f64 (/.f64 (*.f64 y z) x) #s(literal 1 binary64)))))
#s(approx (- x (* y z)) (+.f64 x (*.f64 #s(literal -1 binary64) (*.f64 y z))))
#s(approx (* y z) (*.f64 y z))
#s(approx y y)
#s(approx (- x (* y z)) (*.f64 y (-.f64 (/.f64 x y) z)))
#s(approx (- x (* y z)) (*.f64 #s(literal -1 binary64) (*.f64 y (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 x y)) (*.f64 #s(literal -1 binary64) z)))))
#s(approx z z)
#s(approx (- x (* y z)) (*.f64 z (-.f64 (/.f64 x z) y)))
#s(approx (- x (* y z)) (*.f64 #s(literal -1 binary64) (*.f64 z (-.f64 (*.f64 #s(literal -1 binary64) (/.f64 x z)) (*.f64 #s(literal -1 binary64) y)))))
Calls

9 calls:

TimeVariablePoint
1.0ms
y
-inf
1.0ms
z
-inf
1.0ms
x
-inf
1.0ms
y
inf
0.0ms
z
inf

rewrite9.0ms (1.5%)

Memory
17.5MiB live, 17.5MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0511
0711
11511
23111
35911
47911
07911
Stop Event
iter-limit
saturated
iter-limit
Counts
5 → 17
Calls
Call 1
Inputs
(-.f64 x (*.f64 y z))
x
(*.f64 y z)
y
z
Outputs
(neg.f64 (-.f64 (*.f64 z y) x))
(fma.f64 (neg.f64 z) y x)
(fma.f64 (neg.f64 y) z x)
(fma.f64 z (neg.f64 y) x)
(fma.f64 y (neg.f64 z) x)
(-.f64 (*.f64 (neg.f64 y) z) (neg.f64 x))
(-.f64 x (*.f64 z y))
(+.f64 (*.f64 (neg.f64 y) z) x)
(+.f64 x (*.f64 (neg.f64 y) z))
x
(*.f64 (neg.f64 z) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 z))
(*.f64 z y)
(*.f64 y z)
(neg.f64 (*.f64 (neg.f64 y) z))
y
z

eval2.0ms (0.4%)

Memory
5.2MiB live, 5.2MiB allocated; 0ms collecting garbage
Compiler

Compiled 239 to 74 computations (69% saved)

prune1.0ms (0.2%)

Memory
3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New26026
Fresh000
Picked011
Done000
Total26127
Accuracy
100.0%
Counts
27 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(-.f64 x (*.f64 y z))
Compiler

Compiled 10 to 10 computations (0% saved)

derivations0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 5 to 5 computations (0% saved)

preprocess10.0ms (1.6%)

Memory
-23.5MiB live, 22.0MiB allocated; 4ms collecting garbage
Remove

(sort y z)

Compiler

Compiled 20 to 20 computations (0% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

Profiling

Loading profile data...