Bounds on absolute positiveness of multivariate polynomials
type: Item
instance of: scholarly article
title: Bounds on absolute positiveness of multivariate polynomials
zbMATH Open document ID: 1198.26017
author: Prashant Batra
author: Vikram Sharma
published in: Journal of Symbolic Computation
publication date: 2010-05-21T00:00:00Z
review text: A multivariate polynomial \(P(x_1,\dots,x_n)\) with real coefficients is said to be absolutely positive from a real value \(B\) if \(P\) and all its non-zero partial derivatives of arbitrary order are positive for \(x_1 \geq B,\ldots,x_n \geq B\). The authors present a framework for obtaining bounds \(B\) on absolute positiveness of \(P\). The structure of \(P\) is governed by the signs of the coefficients and a special coefficient weight matrix \(\Delta\) with certain constraints on its entries. The bound of [\textit{H. Hong}, J. Symb. Comput. 25, No.~5, 571--585 (1998; Zbl 0913.65013)] is obtained for a special choice of \(\Delta\), and it is shown to be at most a multiplicative factor of \(O(n)\) from the best possible bound within this framework. Moreover, the overestimation factor (i.e., the ratio to the infimum of all bounds on absolute positiveness of \(P\)) is estimated for any \(B_\Delta\), and an iterative way to improve it is given. In the univariate case, the authors derive the minimum number of weights necessary to obtain a bound within the framework with limited overestimation.
reviewed by: Armin Rainer
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5710824
zbMATH Keywords: root bounds
zbMATH Keywords: multivariate polynomials
zbMATH Keywords: absolute positiveness
describes a project that uses: BRENT
MaRDI profile type: Publication
full work available at URL: j.jsc.2010.01.012
OpenAlex ID: W1972252297
cites work: Q3801620
cites work: Implementations of a new theorem for computing bounds for positive roots of polynomials
cites work: Q5192796
cites work: Q5657612
cites work: Testing positiveness of polynomials
cites work: Bounds for absolute positiveness of multivariate polynomials
cites work: Bounds for positive roots of polynomials
cites work: Faster algorithms for computing Hong's bound on absolute positiveness
cites work: Q4023802
cites work: Upperbounds for roots of polynomials
cites work: A Linear Programming Approach to the Synthesis of Fixed-Structure Controllers
cites work: Q4953977
DOI: 10.1016/J.JSC.2010.01.012
Recommended article: Improved Bounds on Absolute Positiveness of Multivariate Polynomials
Recommended article: Bounds for absolute positiveness of multivariate polynomials
Recommended article: A New Polynomial Bound and Its Efficiency
Recommended article: Improved bounds on absolute positiveness of multivariate polynomials
Recommended article: Q3052836
Recommended article: Quality of positive root bounds
Recommended article: Computation of Sum of Squares Polynomials from Data Points
Recommended article: A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
Recommended article: Estimations of positive roots of polynomials
Recommended article: A Lower Bound for Computing Lagrange’s Real Root Bound
description: scientific article; zbMATH DE number 5710824