Pages that link to "Item:Q2840398"

The following pages link to A general condition number for polynomials (Q2840398):

Displaying 14 items.

• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable (Q494669) (← links)
• Are the coefficients of a polynomial well-conditioned functions of its roots? (Q1203402) (← links)
• Polynomial evaluation and associated polynomials (Q1392419) (← links)
• A statistical analysis of the numerical condition of multiple roots of polynomials. (Q1416369) (← links)
• Backward stability of Clenshaw's algorithm (Q1864779) (← links)
• On the best conditioned bases of quadratic polynomials (Q1881674) (← links)
• Accurate and efficient evaluation of Chebyshev tensor product surface (Q1992395) (← links)
• \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives (Q2102504) (← links)
• Accurate evaluation of polynomials in Legendre basis (Q2336684) (← links)
• Complexity of Bezout's theorem. III: Condition number and packing (Q2365839) (← links)
• A comparison of the average case numerical condition of the power and bernstein polynomial bases (Q2752257) (← links)
• (Q4469464) (← links)
• A condition number theorem for underdetermined polynomial systems (Q4517526) (← links)
• Numerical condition of polynomials in different forms (Q5929610) (← links)