Back to Search
Start Over
The nearest polynomial with a zero in a given domain
- Source :
-
Theoretical Computer Science . Dec2008, Vol. 409 Issue 2, p282-291. 10p. - Publication Year :
- 2008
-
Abstract
- Abstract: For a real univariate polynomial and a closed domain whose boundary is represented by a piecewise rational function, we provide a rigorous method for finding a real univariate polynomial such that has a zero in and is minimal. First, we prove that if a nearest polynomial exists, there is a nearest polynomial such that the absolute value of every coefficient of is with at most one exception. Using this property and the representation of , we reduce the problem to solving systems of algebraic equations, each of which consists of two equations with two variables. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 409
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 35329666
- Full Text :
- https://doi.org/10.1016/j.tcs.2008.09.006