Pages that link to "Item:Q1129510"
From MaRDI portal
The following pages link to New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set (Q1129510):
Displaying 8 items.
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Fast evaluation and interpolation at the Chebyshev sets of points (Q918113) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- A Chebychev-Vandermonde solver (Q1194520) (← links)
- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid (Q1206566) (← links)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- On the filtered polynomial interpolation at Chebyshev nodes (Q2029171) (← links)
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions (Q2967967) (← links)