Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis
Autor: | Hassan Al-Zoubi, Mohammed Ali, Tareq Hamadneh |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2020 |
Předmět: |
Convex hull
Polynomial General Mathematics rational functions 02 engineering and technology Rational function Bernstein polynomials 01 natural sciences 0202 electrical engineering electronic engineering information engineering Computer Science (miscellaneous) Applied mathematics bounding functions Engineering (miscellaneous) Global optimization Mathematics Basis (linear algebra) lcsh:Mathematics global optimization 020207 software engineering Function (mathematics) lcsh:QA1-939 Bernstein polynomial 0104 chemical sciences 010404 medicinal & biomolecular chemistry function of linear least squares Affine transformation |
Zdroj: | Mathematics Volume 8 Issue 2 Mathematics, Vol 8, Iss 2, p 283 (2020) |
ISSN: | 2227-7390 |
DOI: | 10.3390/math8020283 |
Popis: | In this paper, we provide tight linear lower bounding functions for multivariate polynomials given over boxes. These functions are obtained by the expansion of polynomials into Bernstein basis and using the linear least squares function. Convergence properties for the absolute difference between the given polynomials and their lower bounds are shown with respect to raising the degree and the width of boxes and subdivision. Subsequently, we provide a new method for constructing an affine lower bounding function for a multivariate continuous rational function based on the Bernstein control points, the convex hull of a non-positive polynomial s, and degree elevation. Numerical comparisons with the well-known Bernstein constant lower bounding function are given. Finally, with these affine functions, the positivity of polynomials and rational functions can be certified by computing the Bernstein coefficients of their linear lower bounds. |
Databáze: | OpenAIRE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |