RegularChains[SemiAlgebraicSetTools][LinearSolve] - solve a linear semi-algebraic system
|
Calling Sequence
|
|
LinearSolve(F, R)
|
|
Parameters
|
|
F
|
-
|
list of linear equations, inequations and inequalities of R
|
R
|
-
|
polynomial ring
|
|
|
|
|
Description
|
|
•
|
LinearSolve(F, R) returns an equivalent linear semi-algebraic system of triangular shape to the input linear semi-algebraic system F. This assume that R is the field of rational numbers.
|
•
|
The output linear triangular semi-algebraic system satisfies the following properties: Firstly, the output constraints are still linear and are sorted in an ascending order according to the largest variable appearing in them. Secondly, the projection of the solutions of input system F onto any lower dimensional space, say the space formed by the smallest variables, are exactly the solutions of those constraints in the output which only involve the smallest smallest variables. The algorithm behind this function is a variant of Fourier-Motzkin elimination.
|
|
|
Compatibility
|
|
•
|
The RegularChains[SemiAlgebraicSetTools][LinearSolve] command was introduced in Maple 16.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
Define a ring of polynomials. The order of variables is z>y>x.
>
|
|
| (1) |
Define a set of linear equations and inequalities.
>
|
|
| (2) |
We eliminate variables according to the order z>y>x.
>
|
|
| (3) |
The output is a set of equivalent linear equations and inequalities sorted in ascending order according to the larget variables appearing in the constraints. It provides conditions on lower order variables such that higher order variables having solutions.
|
|
Download Help Document
Was this information helpful?