Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 0;
V_correct = 1.0;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
1
|
2 | Pass |
n = 1;
V_correct = 1.0;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
1
|
3 | Pass |
n = 2;
V_correct = 0.433012701892219;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
0.4330
|
4 | Pass |
n = 3;
V_correct = 0.117851130197758;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
0.1179
|
5 | Pass |
n = 4;
V_correct = 0.023292374765623;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
0.0233
|
6 | Pass |
n = 5;
V_correct = 0.003608439182435;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
0.0036
|
7 | Pass |
n = 6;
V_correct = 0.000459331824838;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
4.5933e-04
|
8 | Pass |
n = 7;
V_correct = 0.000049603174603;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
4.9603e-05
|
9 | Pass |
n = 8;
V_correct = 0.000004650297619;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
4.6503e-06
|
10 | Pass |
n = 9;
V_correct = 0.000000385125244;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
3.8513e-07
|
11 | Pass |
n = 10;
V_correct = 0.000000028561653;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
2.8562e-08
|
12 | Pass |
n = 11;
V_correct = 0.000000001917653;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
1.9177e-09
|
13 | Pass |
n = 12;
V_correct = 0.000000000117613;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
1.1761e-10
|
14 | Pass |
n = 13;
V_correct = 0.000000000006639;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
6.6388e-12
|
15 | Pass |
n = 14;
V_correct = 0.000000000000347;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
3.4708e-13
|
16 | Pass |
n = 15;
V_correct = 0.000000000000017;
assert(abs(simplexvolume(n)-V_correct)<4*eps)
V =
1.6898e-14
|
119 Solvers
62 Solvers
Do Fast Fourier Transformation
177 Solvers
Number of odd and even elements within matrix
100 Solvers
205 Solvers