Pages that link to "Item:Q5957927"

The following pages link to Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series (Q5957927):

Displaying 15 items.

• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable (Q494669) (← links)
• Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems (Q521243) (← links)
• Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
• Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms (Q557692) (← links)
• Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability (Q557693) (← links)
• Algorithms for the integration and derivation of Chebyshev series. (Q1428590) (← links)
• Numerical evaluation of the \(p\)th derivative of Jacobi series (Q1861986) (← links)
• On the numerical evaluation of linear recurrences (Q1863682) (← links)
• \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives (Q2102504) (← links)
• Towards a reliable implementation of least-squares collocation for higher index differential-algebraic equations. I: Basics and ansatz function choices (Q2116034) (← links)
• Three term recurrence for the evaluation of multivariate orthogonal polynomials (Q2268566) (← links)
• Accurate evaluation of polynomials in Legendre basis (Q2336684) (← links)
• Computing Derivatives of Jacobi Polynomials Using Bernstein Transformation and Differentiation Matrix (Q3514744) (← links)
• Limited‐memory polynomial methods for large‐scale matrix functions (Q6068267) (← links)
• Rounding error analysis of linear recurrences using generating series (Q6163326) (← links)