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

start0.0ms (0%)

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

analyze39.0ms (3.3%)

Memory

5.5MiB live, 48.8MiB allocated; 6ms 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)

sample724.0ms (62.6%)

Memory

23.1MiB live, 961.6MiB allocated; 196ms collecting garbage

Samples

432.0ms

8 256×

valid

Precisions

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

ival-mult: 110.0ms (60.5% of total)

ival-div: 67.0ms (36.8% of total)

adjust: 2.0ms (1.1% of total)

ival-assert: 2.0ms (1.1% of total)

Bogosity

explain47.0ms (4%)

Memory

35.6MiB live, 82.7MiB allocated; 2ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
26	-	3	(-2.344624615400049e-188 5.161790722523436e-129 2.871746973459992e-5)	`(/.f64 (*.f64 x y) z)`
0	-	0	-	`y`
0	-	0	-	`z`
0	-	0	-	`(*.f64 x y)`
0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 (*.f64 x y) z)`	o/n	14	0
↳	`(*.f64 x y)`	overflow	32
`/.f64`	`(/.f64 (*.f64 x y) z)`	u/n	9	0
↳	`(*.f64 x y)`	underflow	20

Confusion

	Predicted +	Predicted -
+	23	3
-	0	230

Precision

1.0

Recall

0.8846153846153846

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	23	0	3
-	0	0	230

Precision?

1.0

Recall?

0.8846153846153846

Freqs

test

number	freq
0	233
1	23

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

21.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 4.0ms (48.9% of total)

ival-mult: 4.0ms (48.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess25.0ms (2.2%)

Memory

-17.7MiB live, 33.5MiB allocated; 8ms 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
0	5	5
0	7	5
1	10	5
2	13	5
3	14	5
0	14	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(negabs x)

(negabs y)

(negabs z)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series9.0ms (0.7%)

Memory

14.0MiB live, 14.0MiB allocated; 0ms 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	x	@	inf	((/ (* x y) z) (* x y) x y z)
1.0ms	x	@	0	((/ (* x y) z) (* x y) x y z)
1.0ms	y	@	inf	((/ (* x y) z) (* x y) x y z)

rewrite18.0ms (1.6%)

Memory

-20.4MiB live, 25.8MiB allocated; 4ms 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)

eval2.0ms (0.2%)

Memory: 3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 154 to 45 computations (70.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

99.9%

Counts

25 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	91.1%	(/.f64 (*.f64 x y) z)
▶	90.5%	(*.f64 (/.f64 y z) x)
▶	89.5%	(*.f64 (/.f64 x z) y)

Compiler

Compiled 15 to 15 computations (0% saved)

series7.0ms (0.6%)

Memory

13.3MiB live, 13.3MiB 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	x	@	0	((* (/ x z) y) (/ x z) x z y (* (/ y z) x) (/ y z))

rewrite11.0ms (0.9%)

Memory

-33.7MiB live, 12.7MiB allocated; 2ms 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)

eval3.0ms (0.2%)

Memory: 4.6MiB live, 4.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 206 to 53 computations (74.3% saved)

prune4.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	32	0	32
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	32	3	35

Accuracy

99.9%

Counts

35 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	91.1%	(/.f64 (*.f64 x y) z)
✓	90.5%	(*.f64 (/.f64 y z) x)
✓	89.5%	(*.f64 (/.f64 x z) y)

Compiler

Compiled 30 to 24 computations (20% saved)

regimes8.0ms (0.7%)

Memory

17.3MiB live, 17.3MiB allocated; 0ms 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 y z) x)
(*.f64 (/.f64 x z) y)

Calls

5 calls:

2.0ms	y
2.0ms	x
2.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.3%	2	`x`
96.8%	3	`y`
99.7%	2	`z`

Compiler

Compiled 11 to 18 computations (-63.6% saved)

regimes5.0ms (0.4%)

Memory

13.3MiB live, 13.3MiB 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	y
1.0ms	z
1.0ms	x
1.0ms	(*.f64 x y)
1.0ms	(/.f64 (*.f64 x y) z)

Results

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

Compiler

Compiled 11 to 18 computations (-63.6% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	2.108242408421593e+57	1.052096861907975e+67

Compiler

Compiled 8 to 11 computations (-37.5% saved)

simplify9.0ms (0.8%)

Memory

-31.2MiB live, 15.9MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	23

Stop Event

1×

saturated

Calls

Call 1

Inputs
(if (<=.f64 (/.f64 (.f64 x y) z) #s(literal 4000000000000000193386768462214636230113579383562057023488 binary64)) (.f64 (/.f64 y z) x) (*.f64 (/.f64 x z) y))
(*.f64 (/.f64 x z) y)

Outputs
(if (<=.f64 (/.f64 (.f64 x y) z) #s(literal 4000000000000000193386768462214636230113579383562057023488 binary64)) (.f64 (/.f64 y z) x) (*.f64 (/.f64 x z) y))
(*.f64 (/.f64 x z) y)

derivations2.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 23 to 12 computations (47.8% saved)

preprocess242.0ms (20.9%)

Memory: 26.7MiB live, 305.5MiB allocated; 46ms collecting garbage
Compiler: Compiled 246 to 160 computations (35% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze39.0ms (3.3%)

sample724.0ms (62.6%)

explain47.0ms (4%)

preprocess25.0ms (2.2%)

eval0.0ms (0%)

prune0.0ms (0%)

series9.0ms (0.7%)

rewrite18.0ms (1.6%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series7.0ms (0.6%)

rewrite11.0ms (0.9%)

eval3.0ms (0.2%)

prune4.0ms (0.3%)

regimes8.0ms (0.7%)

regimes5.0ms (0.4%)

bsearch0.0ms (0%)

simplify9.0ms (0.8%)

derivations2.0ms (0.2%)

preprocess242.0ms (20.9%)

end0.0ms (0%)

Profiling