Polynomials with coefficients of limited accuracy

MaRDI QIDQ3156429zbMATH OpenFDO

Authors Hans J. Stetter

Publication date 7 January 2005

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• On the evaluation of polynomial coefficients
• Are the coefficients of a polynomial well-conditioned functions of its roots?
• scientific article; zbMATH DE number 1428942
• Detection and validation of clusters of polynomial zeros
• scientific article; zbMATH DE number 5124811

Cited in

(10)

• Almost vanishing polynomials for sets of limited precision points
• The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach
• Computing the nearest polynomial to multiple given polynomials with a given zero via \(l_{2,q}\)-norm minimization
• Overdetermined Weierstrass iteration and the nearest consistent system
• Pseudozeros of multivariate polynomials
• Real and complex pseudozero sets for polynomials with applications
• The nearest complex polynomial with a zero in a given complex domain
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
• Adaptive polynomial Kalman filter for nonlinear state estimation in modified AR time series with fixed coefficients
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems

This page was built for publication: Polynomials with coefficients of limited accuracy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156429)