Maple Professional
Maple Academic
Maple Student Edition
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professional
MapleSim Academic
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
Aerospace
Vehicle Engineering
Robotics
Power Industries
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Robotics/Motion Control/Mechatronics
Other Application Areas
Mathematics Education
Engineering Education
High Schools & Two-Year Colleges
Testing & Assessment
Students
Financial Modeling
Operations Research
High Performance Computing
Physics
Live Webinars
Recorded Webinars
Upcoming Events
MaplePrimes
Maplesoft Blog
Maplesoft Membership
Maple Ambassador Program
MapleCloud
Technical Whitepapers
E-Mail Newsletters
Maple Books
Math Matters
Application Center
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
RegularChains[ParametricSystemTools][BorderPolynomial] - compute the border polynomial of a semi-algebraic system
Calling Sequence
BorderPolynomial(F, N, P, H, d, R)
Parameters
R
-
polynomial ring
F
list of polynomials of R
N
P
H
d
positive integer
Description
The input is a parametric semi-algebraic system whose parameters are the last d variables of R and whose polynomial equations, non-negative polynomial inequalities, (strictly) positive polynomial inequalities, and polynomial inequations are given respectively by F, N, P, and H.
The command BorderPolynomial returns an object of type border_polynomial. It is a list of polynomials of R the product of which is the border polynomial of the input system.
If the output border polynomial only contains the parameters, above each parameter value not canceling the border polynomial, the input parametric system has finitely many solutions. Determining conditions on the parameters for the input system to have a prescribed (finite) number of solutions is achieved by the command RealRootClassification.
If the input system is not sufficiently generic (and in particular if it is not generically zero-dimensional with respect to the d parameters) then the output is set to a special value, as shown in the examples below.
The base field of R is meant to be the field of real numbers. Thus R must be of characteristic zero and must have no parameters (in the sense of the RegularChains library).
Examples
The reason why border polynomials must form of type (and cannot just be seen as lists of polynomials) is that under special circumstances, the border polynomial of a parametric semi-algebraic system takes an exceptional value.
The first such case is when the parameters do not appear in the system of polynomials; then there are no border polynomials as in the example below.
Another special circumstance is that of overdetermined or inconsistent systems, as in the example below
A last special circumstance is when the input system has "generically" infinitely many complex solutions, as in the example below (this is because of the d=2).
See Also
ComplexRootClassification, DiscriminantSequence, RealRootClassification , RegularChains
References
Yang, L.; Hou, X.; and Xia, B. "A complete algorithm for automated discovering of a class of inequality-type theorems." Science China, F. Vol. 44, (2001): 33-49.
Download Help Document