A general condition number for polynomials
From MaRDI portal
Recommendations
- A unified rounding error bound for polynomial evaluation
- On the numerical evaluation of linear recurrences
- scientific article; zbMATH DE number 1487787
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- A statistical analysis of the numerical condition of multiple roots of polynomials.
Cited in
(18)- A sequence of polynomials with optimal condition number
- Backward stability of Clenshaw's algorithm
- Accurate and efficient evaluation of Chebyshev tensor product surface
- Are the coefficients of a polynomial well-conditioned functions of its roots?
- On the best conditioned bases of quadratic polynomials
- A statistical analysis of the numerical condition of multiple roots of polynomials.
- \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives
- Numerical condition of polynomials in different forms
- Accurate evaluation of polynomials in Legendre basis
- scientific article; zbMATH DE number 2074989 (Why is no real title available?)
- Mixed norm condition numbers for the univariate Bernstein basis
- Fast evaluation of real and complex polynomials
- A condition number theorem for underdetermined polynomial systems
- An exchange algorithm for optimizing both approximation and finite-precision evaluation errors in polynomial approximations
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- A comparison of the average case numerical condition of the power and bernstein polynomial bases
- Complexity of Bezout's theorem. III: Condition number and packing
- On the minimum value of the condition number of polynomials
This page was built for publication: A general condition number for polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840398)
