Victor Magron
Abstract
Let Q (resp. R) be the field of rational (resp. real) numbers and X = (X1, ... , Xn) be variables. Deciding the non-negativity of polynomials in Q[X] over Rn or over semi-algebraic domains defined by polynomial constraints in Q[X] is a classical algorithmic problem for symbolic computation.
The Maple package RealCertify tackles this decision problem by computing sum of squares certificates of non-negativity for inputs where such certificates hold over the rational numbers. It can be applied to numerous problems coming from engineering sciences, program verification and cyber-physical systems. It is based on hybrid symbolic-numeric algorithms based on semi-definite programming.
- S. Chevillard, J. Harrison, M. Joldes, and C. Lauter. Efficient and accurate computation of upper bounds of approximation errors. Theoretical Computer Science, 412(16):1523 -- 1543, 2011. Google Scholar
Digital Library
- G. E Collins. Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In ATFL 2nd GI Conf. Kaiserslautern, pages 134--183, 1975. Google ScholarDigital Library
- E. Kaltofen, B. Li, Z. Yang, and L. Zhi. Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. In Proceedings of ISSAC, pp. 155--164. ACM, 2008. Google ScholarDigital Library
- J.-B. Lasserre. Global Optimization with Polynomials and the Problem of Moments. SIAM Journal on Optimization, 11(3):796--817, 2001. Google ScholarDigital Library
- V. Magron and M. Safey El Din. On Exact Polya and Putinar's Representations. To appear in Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (ISSAC). Google ScholarDigital Library
- V. Magron, M. Safey El Din, and M. Schweighofer. Algorithms for Weighted Sum of Squares Decomposition of Non-negative Univariate Polynomials. Journal of Symbolic ComputationGoogle Scholar
- M. Nakata. A numerical evaluation of highly accurate multiple-precision arithmetic version of semidefinite programming solver: SDPA-GMP, -QD and -DD. In CACSD, pages 29--34, 2010.Google ScholarCross Ref
- P. A. Parrilo. Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Inst. Tech., 2000.Google Scholar
- H. Peyrl and P.A. Parrilo. Computing sum of squares decompositions with rational coefficients. Theoretical Computer Science, 409(2):269--281, 2008. Google ScholarDigital Library
Recommendations
Wronskian type determinants of orthogonal polynomials, Selberg type formulas and constant term identities
Let (p"n)"n be a sequence of orthogonal polynomials with respect to the measure @m. Let T be a linear operator acting in the linear space of polynomials P and satisfying deg(T(p))=deg(p)-1, for all polynomial p. We then construct a sequence of ...
Certain classes of polynomial expansions and multiplication formulas
The authors first present a class of expansions in a series of Bernoulli polyomials and then show how this general result can be applied to yield various (known or new) polynomial expansions. The corresponding expansion problem involving the Euler ...
Positive interpolatory quadrature formulas and para-orthogonal polynomials
Special issue: Proceedings of the conference on orthogonal functions and related topics held in honor of Olav NjåstadWe establish a relation between quadrature formulas on the interval [-1,1] that approximate integrals of the form J"@m(F)=@!"-"1^1F(x)@m(x)dx and Szego quadrature formulas on the unit circle that approximate integrals of the form I"@w(f)=@!"-"@p^@pf(e^i^...
Comments