Metrics for Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, A

start0.0ms (0%)

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

analyze65.0ms (5.4%)

Memory

-1.2MiB live, 50.6MiB allocated; 20ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
0%	0%	99.9%	0.1%	0%	0%	0%	3
50%	49.9%	49.9%	0.1%	0%	0%	0%	4
50%	49.9%	49.9%	0.1%	0%	0%	0%	5
50%	49.9%	49.9%	0.1%	0%	0%	0%	6
75%	74.9%	25%	0.1%	0%	0%	0%	7
75%	74.9%	25%	0.1%	0%	0%	0%	8
75%	74.9%	25%	0.1%	0%	0%	0%	9
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	10
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	11
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample608.0ms (50.3%)

Memory

1.3MiB live, 953.8MiB allocated; 112ms collecting garbage

Samples

411.0ms

8 256×

valid

Precisions

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

ival-div!: 95.0ms (54.7% of total)

ival-mult!: 78.0ms (44.9% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess12.0ms (1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	53
1	46	53
2	86	53
3	145	53
4	210	53
5	280	53

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	94.4%	(/.f64 (*.f64 x y) z)

Symmetry

(negabs x)

(negabs y)

(negabs z)

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series38.0ms (3.2%)

Memory

-29.0MiB live, 17.3MiB allocated; 4ms collecting garbage

Counts

5 → 5

Calls

Call 1

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

Outputs
#s(approx (/ (* x y) z) #s(hole binary64 (/ (* x y) z)))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
2.0ms	y	@	-inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	-inf	((/ (* x y) z) (* x y) x y z)
1.0ms	y	@	inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	0	((/ (* x y) z) (* x y) x y z)

rewrite19.0ms (1.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	38
0	13	38
1	19	38
2	36	38
3	71	38
4	107	38
0	107	38

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

10 → 24

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) z)
(*.f64 x y)
x
y
z
#s(approx (/ (* x y) z) #s(hole binary64 (/ (* x y) z)))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
#s(approx z #s(hole binary64 z))

Outputs
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
(*.f64 (/.f64 x z) y)
(*.f64 (neg.f64 x) (/.f64 (neg.f64 y) z))
(*.f64 (neg.f64 y) (/.f64 (neg.f64 x) z))
(*.f64 (/.f64 y z) x)
(*.f64 y (/.f64 x z))
(*.f64 x (/.f64 y z))
(/.f64 (*.f64 (neg.f64 x) y) (neg.f64 z))
(/.f64 (*.f64 y x) z)
(neg.f64 (*.f64 (/.f64 (neg.f64 x) z) y))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 x) y))
x
y
z
#s(approx (/ (* x y) z) (/.f64 (*.f64 y x) z))
#s(approx (* x y) (*.f64 y x))
#s(approx x x)
#s(approx y y)
#s(approx z z)

eval29.0ms (2.4%)

Memory: -41.6MiB live, 5.2MiB allocated; 3ms collecting garbage
Compiler: Compiled 69 to 44 computations (36.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	18	2	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	18	3	21

Accuracy

99.9%

Counts

21 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	94.4%	(/.f64 (*.f64 x y) z)
▶	90.9%	(*.f64 (/.f64 y z) x)
▶	92.9%	(*.f64 (/.f64 x z) y)

Compiler

Compiled 15 to 15 computations (0% saved)

series7.0ms (0.6%)

Memory

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

Counts

7 → 7

Calls

Call 1

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

Outputs
#s(approx (* (/ x z) y) #s(hole binary64 (/ (* x y) z)))
#s(approx (/ x z) #s(hole binary64 (/ x z)))
#s(approx x #s(hole binary64 x))
#s(approx (* (/ y z) x) #s(hole binary64 (/ (* x y) z)))
#s(approx y #s(hole binary64 y))
#s(approx (/ y z) #s(hole binary64 (/ y z)))
#s(approx z #s(hole binary64 z))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	z	@	-inf	((* (/ x z) y) (/ x z) x z y (* (/ y z) x) (/ y z))
1.0ms	x	@	-inf	((* (/ x z) y) (/ x z) x z y (* (/ y z) x) (/ y z))
1.0ms	y	@	-inf	((* (/ x z) y) (/ x z) x z y (* (/ y z) x) (/ y z))
1.0ms	x	@	inf	((* (/ x z) y) (/ x z) x z y (* (/ y z) x) (/ y z))
1.0ms	y	@	inf	((* (/ x z) y) (/ x z) x z y (* (/ y z) x) (/ y z))

rewrite9.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	64
0	24	64
1	36	64
2	59	64
3	110	64
4	114	64
0	114	64

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

14 → 38

Calls

Call 1

Inputs
(*.f64 (/.f64 x z) y)
(/.f64 x z)
x
z
y
(*.f64 (/.f64 y z) x)
(/.f64 y z)
#s(approx (* (/ x z) y) #s(hole binary64 (/ (* x y) z)))
#s(approx (/ x z) #s(hole binary64 (/ x z)))
#s(approx x #s(hole binary64 x))
#s(approx (* (/ y z) x) #s(hole binary64 (/ (* x y) z)))
#s(approx y #s(hole binary64 y))
#s(approx (/ y z) #s(hole binary64 (/ y z)))
#s(approx z #s(hole binary64 z))

Outputs
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 (neg.f64 y) (/.f64 (neg.f64 x) z))
(*.f64 (neg.f64 x) (/.f64 (neg.f64 y) z))
(*.f64 (/.f64 y z) x)
(*.f64 (/.f64 x z) y)
(*.f64 y (/.f64 x z))
(*.f64 x (/.f64 y z))
(/.f64 (*.f64 (neg.f64 y) x) (neg.f64 z))
(/.f64 (*.f64 y x) z)
(neg.f64 (*.f64 (/.f64 (neg.f64 y) z) x))
(/.f64 (neg.f64 x) (neg.f64 z))
(/.f64 x z)
(neg.f64 (/.f64 (neg.f64 x) z))
x
z
y
(*.f64 (/.f64 (neg.f64 y) z) (neg.f64 x))
(*.f64 (/.f64 (neg.f64 x) z) (neg.f64 y))
(*.f64 (neg.f64 y) (/.f64 (neg.f64 x) z))
(*.f64 (neg.f64 x) (/.f64 (neg.f64 y) z))
(*.f64 (/.f64 y z) x)
(*.f64 (/.f64 x z) y)
(*.f64 y (/.f64 x z))
(*.f64 x (/.f64 y z))
(/.f64 (*.f64 (neg.f64 y) x) (neg.f64 z))
(/.f64 (*.f64 y x) z)
(neg.f64 (*.f64 (/.f64 (neg.f64 y) z) x))
(/.f64 (neg.f64 y) (neg.f64 z))
(/.f64 y z)
(neg.f64 (/.f64 (neg.f64 y) z))
#s(approx (* (/ y z) x) (*.f64 (/.f64 x z) y))
#s(approx (/ x z) (/.f64 x z))
#s(approx x x)
#s(approx (* (/ y z) x) (*.f64 (/.f64 x z) y))
#s(approx y y)
#s(approx (/ y z) (/.f64 y z))
#s(approx z z)

eval2.0ms (0.1%)

Memory: 4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 80 to 52 computations (35% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	22	0	22
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	22	3	25

Accuracy

99.9%

Counts

25 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	94.4%	(/.f64 (*.f64 x y) z)
✓	90.9%	(*.f64 (/.f64 y z) x)
✓	92.9%	(*.f64 (/.f64 x z) y)

Compiler

Compiled 24 to 24 computations (0% saved)

regimes28.0ms (2.3%)

Memory

-27.0MiB live, 20.3MiB allocated; 2ms collecting garbage

Counts

3 → 2

Calls

Call 1

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

Outputs
(*.f64 (/.f64 x z) y)
(*.f64 (/.f64 y z) x)

Calls

5 calls:

22.0ms	y
2.0ms	x
1.0ms	z
1.0ms	(*.f64 x y)
1.0ms	(/.f64 (*.f64 x y) z)

Results

Accuracy	Segments	Branch
99.7%	3	`(*.f64 x y)`
99.7%	2	`(/.f64 (*.f64 x y) z)`
96.9%	2	`x`
97.2%	2	`y`
99.7%	2	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes5.0ms (0.4%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

Outputs
(*.f64 (/.f64 x z) y)

Calls

5 calls:

1.0ms	z
1.0ms	x
1.0ms	y
1.0ms	(*.f64 x y)
1.0ms	(/.f64 (*.f64 x y) z)

Results

Accuracy	Segments	Branch
92.9%	1	`x`
92.9%	1	`y`
92.9%	1	`(*.f64 x y)`
92.9%	1	`(/.f64 (*.f64 x y) z)`
92.9%	1	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

bsearch3.0ms (0.2%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	predicate-same

Steps

Time	Left	Right
2.0ms	6.857072379353795e-13	3.24205108313352e-10

Samples

1.0ms

32×

valid

Compiler

Compiled 28 to 35 computations (-25% saved)

Precisions

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

adjust: 0.0ms (0% of total)

ival-mult!: 0.0ms (0% of total)

ival-div!: 0.0ms (0% of total)

derivations2.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 10 computations (0% saved)

preprocess378.0ms (31.3%)

Memory

-1.0MiB live, 438.2MiB allocated; 122ms collecting garbage

Remove

(negabs z)

(negabs y)

Compiler

Compiled 155 to 155 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze65.0ms (5.4%)

sample608.0ms (50.3%)

preprocess12.0ms (1%)

series38.0ms (3.2%)

rewrite19.0ms (1.6%)

eval29.0ms (2.4%)

prune1.0ms (0.1%)

series7.0ms (0.6%)

rewrite9.0ms (0.8%)

eval2.0ms (0.1%)

prune2.0ms (0.2%)

regimes28.0ms (2.3%)

regimes5.0ms (0.4%)

bsearch3.0ms (0.2%)

derivations2.0ms (0.2%)

preprocess378.0ms (31.3%)

end0.0ms (0%)

Profiling