File size: 5,633 Bytes
389d072 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 |
from visma.solvers.polynomial.roots import rootFinder
from visma.solvers.simulEqn import simulSolver
from visma.solvers.solve import solveFor
from tests.tester import quickTest
############################
# solvers.polynomial.roots #
############################
def test_rootFinder():
# Tests for Quadratic (2nd Degree) Equations
assert quickTest("x^2 + 2x + 1 = 0", rootFinder) == "(x+1.0)^(2)=0"
assert quickTest("x^2 + 2x = - 1", rootFinder) == "(x+1.0)^(2)=0"
assert quickTest("x^2 = - 2x - 1", rootFinder) == "(x+1.0)^(2)=0"
assert quickTest("0 = x^2 + 2x + 1", rootFinder) == "(x+1.0)^(2)=0"
assert quickTest("x^2 + 1 - 2x = 0", rootFinder) == "(x-1.0)^(2)=0"
assert quickTest("x^2 + 1 = 2x", rootFinder) == "(x-1.0)^(2)=0"
assert quickTest("x^2 = 2x - 1", rootFinder) == "(x-1.0)^(2)=0"
assert quickTest("-2x = - x^2 - 1", rootFinder) == "(x-1.0)^(2)=0"
# FIXME: assert quickTest("0 = 2x - x^2 - 1", rootFinder) == "(x-1.0)^(2)=0"
# assert quickTest("0 = 2x - x^2 - 1", rootFinder) == "(x-1.0)^(2)=0"
assert quickTest("2x^2 - 4x - 6 = 0", rootFinder) == "(x+1.0)*(x-3.0)=0"
assert quickTest("3x^2 + 7x + 1 = 0", rootFinder) == "(x+2.18)*(x+0.15)=0"
assert quickTest("3x^2 - 7x + 1 = 0", rootFinder) == "(x-0.15)*(x-2.18)=0"
assert quickTest("x^2 + x + 1 = 0", rootFinder) == "(x+0.5+0.87*sqrt[2](-1))*(x+0.5-0.87*sqrt[2](-1))=0"
assert quickTest("x^2 - x + 1 = 0", rootFinder) == "(x-0.5+0.87*sqrt[2](-1))*(x-0.5-0.87*sqrt[2](-1))=0"
# Tests for Cubic (3rd Degree) Equations
assert quickTest("2x^3 - 4x^2 - 22x + 24 = 0", rootFinder) == "(x-4.0)*(x+3.0)*(x-1.0)=0"
assert quickTest("x^3 + 6x^2 + 12x + 8 = 0", rootFinder) == "(x+2.0)^(3)=0"
assert quickTest("x^3 = 1", rootFinder) == "(x-1.0)*(x-(-0.5+0.87*sqrt[2](-1)))*(x-(-0.5-0.87*sqrt[2](-1)))=0"
# Tests for Quartic (4th Degree) Equations
assert quickTest("3x^4 + 6x^3 - 123x^2 - 126x + 1080 = 0", rootFinder) == "(x-5.0)*(x+4.0)*(x-3.0)*(x+6.0)=0"
assert quickTest("-20x^4 + 5x^3 + 17x^2 - 29x + 87 = 0", rootFinder) == "(x-1.49)*(x-(0.22+1.3*sqrt[2](-1)))*(x-(0.22-1.3*sqrt[2](-1)))*(x+1.69)=0"
assert quickTest("2x^4 + 4x^3 + 6x^2 + 8x + 10 = 0", rootFinder) == "(x-(0.28+1.42*sqrt[2](-1)))*(x-(-1.28+0.85*sqrt[2](-1)))*(x-(-1.28-0.85*sqrt[2](-1)))*(x-(0.28-1.42*sqrt[2](-1)))=0"
###############################
# solvers.simulEqn #
###############################
def test_simulSolvers():
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver, 'x') == "x=0.0"
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver, 'y') == "y=1.33"
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver, 'z') == "z=-0.0"
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'x') == "x=-0.0"
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'y') == "y=-1.0"
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'z') == "z=2.0"
assert quickTest("1x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'x') == "NoTrivialSolution"
assert quickTest("1x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'y') == "NoTrivialSolution"
assert quickTest("1x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'z') == "NoTrivialSolution"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver, 'a') == "a=0.0"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver, 'y') == "y=1.33"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver, 'w') == "w=-0.0"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver, 'a') == "a=0.0"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver, 'y') == "y=1.2"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver, 'w') == "w=0.11"
# Tests for testing 'solve for all variable' option in case no variable is specified by user.
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver) == "z=-0.0;y=1.33;x=0.0"
assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver) == "z=2.0;y=-1.0;x=-0.0"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver) == "y=1.33;w=-0.0;a=0.0"
assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver) == "y=1.2;w=0.11;a=0.0"
#################
# solvers.solve #
#################
def test_solveFor():
assert quickTest("x - 1 + 2 = 0", solveFor, 'x') == "x=(-1.0)"
assert quickTest("1 + y^2 = 0", solveFor, 'y') == "y=(-1.0)^(0.5)"
assert quickTest("x^2 - 1 = 0", solveFor, 'x') == "x=(1.0)^(0.5)"
assert quickTest("x - yz + 1= 0", solveFor, 'x') == "x=(-1.0+yz)"
assert quickTest("x - 2yz + 1= 0", solveFor, 'y') == "y=-0.5*((-1.0-x)/z)"
assert quickTest("x - 5yz + 1= 0", solveFor, 'z') == "z=-0.2*((-1.0-x)/y)"
assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'w') == "w=(-x^(2.0)-yz^(3.0)+1.0)"
assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'x') == "x=(-w-yz^(3.0)+1.0)^(0.5)"
assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'y') == "y=((-w-x^(2.0)+1.0)/z^(3.0))"
assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'z') == "z=((-w-x^(2.0)+1.0)/y)^(0.3333333333333333)"
|