Article ID Journal Published Year Pages File Type
4952086 Theoretical Computer Science 2017 9 Pages PDF
Abstract
Given multiple univariate or multivariate real polynomials f1,…,fn and a desired real zero z, we investigate a problem of finding the nearest polynomial f˜ to f1,…,fn 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 (∞,∞).
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,