Fast and stable rational interpolation in roots of unity and Chebyshev points
From MaRDI portal
Recommendations
Cited in
(17)- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
- Stable polefinding and rational least-squares fitting via eigenvalues
- Rigorous numerics for ODEs using Chebyshev series and domain decomposition
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
- Alternation points, weights and orthogonal polynomials
- Rotation invariant patterns for a nonlinear Laplace-Beltrami equation: a Taylor-Chebyshev series approach
- Robust rational interpolation and least-squares
- Bandwidth truncation for Chebyshev polynomial and ultraspherical/Chebyshev Galerkin discretizations of differential equations: restrictions and two improvements
- Orthogonal polynomials on planar cubic curves
- A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
- Vandermonde with Arnoldi
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Chebyshev approximation of multivariable functions by a constrained rational expression
- Fast barycentric rational interpolations for complex functions with some singularities
- Practical algorithms for multivariate rational approximation
- On Bernoulli's method
- A Lagrange interpolation with preprocessing to nearly eliminate oscillations
This page was built for publication: Fast and stable rational interpolation in roots of unity and Chebyshev points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903057)