Pages that link to "Item:Q1864779"
From MaRDI portal
The following pages link to Backward stability of Clenshaw's algorithm (Q1864779):
Displaying 11 items.
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable (Q494669) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- A new efficient algorithm for polynomial interpolation (Q873149) (← links)
- On improving the accuracy of Horner's and Goertzel's algorithms (Q1773083) (← links)
- Towards a reliable implementation of least-squares collocation for higher index differential-algebraic equations. I: Basics and ansatz function choices (Q2116034) (← links)
- Accurate evaluation of polynomials in Legendre basis (Q2336684) (← links)
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation (Q3119538) (← links)
- Limited‐memory polynomial methods for large‐scale matrix functions (Q6068267) (← links)
- On computing modified moments for half-range Hermite weights (Q6200847) (← links)
- An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation (Q6559445) (← links)
- Chebyshev subdivision and reduction methods for solving multivariable systems of equations (Q6650577) (← links)
