Numerical condition of polynomials in different forms
From MaRDI portal
Recommendations
Cited in
(12)- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Robust plotting of generalized lemniscates
- Robust and retunable state realizations of transfer functions with known poles and zeros
- Polynomial sequences: elementary basic methods and application hints. A survey
- scientific article; zbMATH DE number 3951890 (Why is no real title available?)
- scientific article; zbMATH DE number 1487787 (Why is no real title available?)
- scientific article; zbMATH DE number 2143198 (Why is no real title available?)
- Pseudozeros of multivariate polynomials
- High Order Terms for Condition Estimation of Univariate Polynomials
- Accurate evaluation of a polynomial in Chebyshev form
- Error in homotopy methods for random roots
- Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
This page was built for publication: Numerical condition of polynomials in different forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929610)