A New Maple Package for Solving Parametric Polynomial Systems

نویسندگان

  • David J. Jeffrey
  • Songxin Liang
چکیده

A new Maple package RootFinding[Parametric]for solving parametric systems of polynomial equations and inequalities is described. The main idea for solving such a system is as follows. The parameter space R is divided into two parts: the discriminant variety W and its complement Rd\W . The discriminant variety is a generalization of the well-known discriminant of a univariate polynomial and contains all those parameter values leading to non-generic solutions of the system. The complement Rd\W can be expressed as a finite union of open cells such that the number of real solutions of the input system is constant on each cell. In this way, all parameter values leading to generic solutions of the system can be described systematically. The underlying techniques used are Gröbner bases, polynomial real root finding, and Cylindrical Algebraic Decomposition. This package offers a friendly interface for scientists and engineers to solve parametric problems, as illustrated by an example from control theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing with Constructible Sets in Maple

Constructible sets are the geometrical objects naturally attached to triangular decompositions, as polynomial ideals are the algebraic concept underlying the computation of Gröbner bases. This relation becomes even more complex and essential in the case of polynomial systems with infinitely many solutions. In this paper, we introduce ConstructibleSetTools a new module of the RegularChains libra...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

Automated Deduction in Real Geometry

Including three aspects, problem solving, theorem proving and theorem discovering, automated deduction in real geometry essentially depends upon the semi-algebraic system solving. A “semi-algebraic system” is a system consisting of polynomial equations, polynomial inequations and polynomial inequalities, where all the polynomials are of integer coefficients. We give three practical algorithms f...

متن کامل

DISCOVERER : A tool for solving problems involving polynomial inequalities ∗

discoverer, developed under Maple, is a package aiming at discovering and proving inequality-type theorems. It can discover new inequalities automatically, without requiring us to put forward any conjectures beforehand. It is also applied to the classification of the real physical solutions of geometric constraint problems. Many inequalities with various backgrounds have been discovered or re-d...

متن کامل

Deciding Nonnegativity of Polynomials by MAPLE

There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple’s library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassification, one can prove and discover polynomial inequalities. This paper is more or less a user guide on using RealRootClassification to prove the nonnegativity of polynomials. We show by example...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007