Numerical condition of polynomials in different forms

zbMath0974.65046MaRDI QIDQ5929610

Hong Zhang

Publication date: 9 May 2001

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121427

zbMATH Keywords

conditioninghigh-degree polynomialsiterative refinement algorithmpolynomial pseudozero setszero-finding software

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Differential algebra (12H05)

Related Items (7)

Pseudozeros of multivariate polynomials ⋮ Robust plotting of generalized lemniscates ⋮ Robust and retunable state realizations of transfer functions with known poles and zeros ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems ⋮ An improved Toeplitz algorithm for polynomial matrix null-space computation ⋮ Polynomial sequences: elementary basic methods and application hints. A survey

Uses Software

• CPOLY

This page was built for publication: Numerical condition of polynomials in different forms