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

start0.0ms (0.0%)

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

analyze0.0ms (0.0%)

Memory

1.2MiB live, 1.2MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0.0%	0.0%	99.9%	0.1%	0.0%	0.0%	0.0%	0
100.0%	99.9%	0.0%	0.1%	0.0%	0.0%	0.0%	1

Compiler

Compiled 7 to 7 computations (0.0% saved)

sample580.0ms (65.4%)

Memory

15.8MiB live, 1 233.2MiB allocated; 274ms collecting garbage

Samples

279.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 76.0ms

ival-mult!: 55.0ms (72.1% of total)

ival-sub!: 20.0ms (26.2% of total)

adjust: 1.0ms (1.3% of total)

Bogosity

preprocess25.0ms (2.8%)

Memory

27.5MiB live, 71.6MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	53
1	66	53
2	136	53
3	207	53
4	210	53

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x (*.f64 y z))

Symmetry

(sort y z)

Compiler

Compiled 10 to 10 computations (0.0% saved)

sample0.0ms (0.0%)

Memory

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

Calls

Call 1

Inputs

Outputs

series37.0ms (4.2%)

Memory

-21.5MiB live, 32.0MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	45	149

Stop Event

1×	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:

Time	Variable	Point
1.0ms	y	-inf
1.0ms	z	-inf
1.0ms	x	-inf
1.0ms	y	inf
0.0ms	z	inf

rewrite232.0ms (26.2%)

Memory

26.9MiB live, 221.7MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	32	11
2	91	11
3	190	11
4	319	11
5	646	11
6	3324	11
0	4462	11

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

5 → 29

Calls

Call 1

Inputs
(-.f64 x (*.f64 y z))
x
(*.f64 y z)
y
z

Outputs
(.f64 (-.f64 #s(literal 1 binary64) (/.f64 (neg.f64 x) (.f64 (neg.f64 y) z))) (*.f64 (neg.f64 y) z))
(.f64 (+.f64 #s(literal 1 binary64) (/.f64 x (.f64 (neg.f64 y) z))) (*.f64 (neg.f64 y) z))
(.f64 (-.f64 #s(literal 1 binary64) (/.f64 (.f64 z y) x)) x)
(.f64 (+.f64 #s(literal 1 binary64) (/.f64 (.f64 (neg.f64 y) z) x)) x)
(/.f64 (-.f64 (.f64 (.f64 (neg.f64 y) z) (.f64 (neg.f64 y) z)) (.f64 (neg.f64 x) (neg.f64 x))) (+.f64 (*.f64 (neg.f64 y) z) (neg.f64 x)))
(/.f64 (-.f64 (pow.f64 (.f64 (neg.f64 y) z) #s(literal 3 binary64)) (pow.f64 (neg.f64 x) #s(literal 3 binary64))) (fma.f64 (.f64 (neg.f64 y) z) (.f64 (neg.f64 y) z) (fma.f64 (neg.f64 x) (neg.f64 x) (.f64 (*.f64 (neg.f64 y) z) (neg.f64 x)))))
(/.f64 (-.f64 (.f64 (.f64 (neg.f64 y) z) (.f64 (neg.f64 y) z)) (.f64 x x)) (-.f64 (*.f64 (neg.f64 y) z) x))
(/.f64 (+.f64 (pow.f64 (.f64 (neg.f64 y) z) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 (neg.f64 y) z) (.f64 (neg.f64 y) z) (-.f64 (.f64 x x) (.f64 (.f64 (neg.f64 y) z) x))))
(/.f64 (-.f64 (.f64 x x) (.f64 (.f64 (neg.f64 y) z) (.f64 (neg.f64 y) z))) (-.f64 x (*.f64 (neg.f64 y) z)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 y) z) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 (.f64 (neg.f64 y) z) (.f64 (neg.f64 y) z)) (.f64 x (.f64 (neg.f64 y) z)))))
(/.f64 (-.f64 (.f64 x x) (.f64 (.f64 z y) (.f64 z y))) (+.f64 x (*.f64 z y)))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 z y) #s(literal 3 binary64))) (fma.f64 x x (fma.f64 (.f64 z y) (.f64 z y) (.f64 x (*.f64 z y)))))
(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

eval5.0ms (0.6%)

Memory: -33.8MiB live, 13.3MiB allocated; 2ms collecting garbage
Compiler: Compiled 483 to 127 computations (73.7% saved)

prune1.0ms (0.1%)

Memory

4.8MiB live, 4.8MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	38	0	38
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	38	1	39

Accuracy

100.0%

Counts

39 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 x (*.f64 y z))

Compiler

Compiled 10 to 10 computations (0.0% saved)

derivations0.0ms (0.0%)

Memory

0.3MiB live, 0.3MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 5 to 5 computations (0.0% saved)

preprocess6.0ms (0.7%)

Memory: 21.1MiB live, 21.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 20 to 20 computations (0.0% saved)

end0.0ms (0.0%)

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

start0.0ms (0.0%)

analyze0.0ms (0.0%)

sample580.0ms (65.4%)

preprocess25.0ms (2.8%)

sample0.0ms (0.0%)

series37.0ms (4.2%)

rewrite232.0ms (26.2%)

eval5.0ms (0.6%)

prune1.0ms (0.1%)

derivations0.0ms (0.0%)

preprocess6.0ms (0.7%)

end0.0ms (0.0%)

Profiling