A general condition number for polynomials
The condition number of a polynomial with respect to a certain basis is an important quantity when it comes to the actual evaluation of this polynomial in finite precision arithmetic. The paper is devoted to the development of a general concept for such condition numbers that includes the well-known special cases where the basis consists of monomials or Bernstein polynomials and, in particular, allows to treat bases consisting of orthogonal polynomials. The properties of this condition number are studied in detail, and applications to some important special cases are discussed.
- 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.
- Are the coefficients of a polynomial well-conditioned functions of its roots?
- A statistical analysis of the numerical condition of multiple roots of polynomials.
- Backward stability of Clenshaw's algorithm
- On the best conditioned bases of quadratic polynomials
- Accurate and efficient evaluation of Chebyshev tensor product surface
- \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives
- Accurate evaluation of polynomials in Legendre basis
- Complexity of Bezout's theorem. III: Condition number and packing
- A comparison of the average case numerical condition of the power and bernstein polynomial bases
- Mixed norm condition numbers for the univariate Bernstein basis
- scientific article; zbMATH DE number 2074989 (Why is no real title available?)
- scientific article; zbMATH DE number 1487787 (Why is no real title available?)
- A condition number theorem for underdetermined polynomial systems
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- On the minimum value of the condition number of polynomials
- A sequence of polynomials with optimal condition number
- Numerical condition of polynomials in different forms
- An exchange algorithm for optimizing both approximation and finite-precision evaluation errors in polynomial approximations
- Fast evaluation of real and complex 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)
