An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions

An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions

0.00 Avg rating0 Votes
Article ID: iaor201526157
Volume: 69
Issue: 2
Start Page Number: 397
End Page Number: 413
Publication Date: Jun 2015
Journal: Numerical Algorithms
Authors: ,
Keywords: decomposition, least squares
Abstract:

This paper presents an algorithm for computing a decomposition of a non‐negative real polynomial as a sum of squares of rational functions. Rational functions in our algorithm have the denominators that are powers of the sum of squares of coordinate functions. Numerical experiments are performed for several well‐known polynomials such as Motzkin polynomials, Choi‐Lam polynomials and Robinson polynomials.

Reviews

Required fields are marked *. Your email address will not be published.