RegularChains[SemiAlgebraicSetTools][RealRootCounting] - number of distinct real solutions of a semi-algebraic system
|
Calling Sequence
|
|
RealRootCounting(F, N, P, H, R)
|
|
Parameters
|
|
R
|
-
|
polynomial ring
|
F
|
-
|
list of polynomials of R
|
N
|
-
|
list of polynomials of R
|
P
|
-
|
list of polynomials of R
|
H
|
-
|
list of polynomials of R
|
|
|
|
|
Description
|
|
•
|
The command RealRootCounting(F, N, P, H, R) returns the number of distinct real solutions of the system whose equations, inequations, positive polynomials, and non-negative polynomials are given by F, H, P and N respectively.
|
•
|
This computation assumes that the polynomial system given by F and H (as equations and inequations respectively) has finitely many complex solutions.
|
•
|
The base field of R is meant to be the field of rational numbers.
|
•
|
The algorithm is described in the paper by Xia, B., Hou, X.: "A complete algorithm for counting real solutions of polynomial systems of equations and inequalities." Computers and Mathematics with applications, Vol. 44 (2002): pp.633-642.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
>
|
|
| (1) |
Compute the number of nonnegative solutions.
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
Require c to be positive here.
| (6) |
>
|
|
| (7) |
|
|
Download Help Document
Was this information helpful?