Back to Search Start Over

The nearest polynomial to multiple given polynomials with a given zero in the real case

Authors :
Hiroshi Sekigawa
Source :
Theoretical Computer Science. 681:167-175
Publication Year :
2017
Publisher :
Elsevier BV, 2017.

Abstract

Given multiple univariate or multivariate real polynomials f 1 , … , f n and a desired real zero z, we investigate a problem of finding the nearest polynomial f ˜ to f 1 , … , f n having z as a zero. We use a pair of norms to define the nearest polynomial. We remark that the difficulty of the problem depends on the norm pairs and give computing methods when the norm pairs consist of the p-norm and the q-norm for ( p , q ) = ( 2 , 2 ) , ( 2 , ∞ ) , and ( ∞ , ∞ ) .

Details

ISSN :
03043975
Volume :
681
Database :
OpenAIRE
Journal :
Theoretical Computer Science
Accession number :
edsair.doi...........71fbfcf2656563805d98adfd6a183914
Full Text :
https://doi.org/10.1016/j.tcs.2017.03.033