[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## [Axiom-developer] [#170 Axiom fails to solve "separable" system of equat

**From**: |
kratt6 |

**Subject**: |
[Axiom-developer] [#170 Axiom fails to solve "separable" system of equations] |

**Date**: |
Thu, 16 Jun 2005 06:03:21 -0500 |

Changes
http://page.axiom-developer.org/zope/mathaction/170AxiomFailsToSolveSeparableSystemOfEquations/diff
--
??changed:
-really has no solution.
really has no solution. As far as I know, this would have to be done in the
very last function defined in 'syssolp.spad', which is::
-- general solver. Input in polynomial style --
solve(lr:L F,vl:L SE) ==
empty? vl => empty()
checkLinear(lr,vl) =>
-- linear system --
soln := linSolve(lr, vl)
soln case "failed" => []
eqns: L EQ F := []
for i in 1..#vl repeat
lhs := (vl.i::(P R))::F
rhs := rhs soln.i
eqns := append(eqns, [lhs = rhs])
[eqns]
-- polynomial system --
if R has GcdDomain then
parRes:=triangularSystems(lr,vl)
[[makeEq(map(makeR2F,f)\$PP2,vl) for f in pr]
for pr in parRes]
else [[]]
The letter 'F' is a macro for 'FRAC POLY R' here. To check whether an equation
contains a variable we have to check numerator and denominator of both sides of
the equation with 'variables\$POLY R'. I do not know however, how to find out
whether the equations independent of 'vl' are contradicting.
--
forwarded from http://page.axiom-developer.org/zope/mathaction/address@hidden