A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
From MaRDI portal
Recommendations
Cited in
(16)- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- scientific article; zbMATH DE number 7709336 (Why is no real title available?)
- A recursive algorithm on rational interpolation
- Solution of a nonlinear eigenvalue problem from photonic crystal fiber applications discretized by a boundary element method
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
- Rational interpolation via orthogonal plynomials
- scientific article; zbMATH DE number 6257292 (Why is no real title available?)
- Fast conversion algorithms for orthogonal polynomials
- Fast algorithms using orthogonal polynomials
- The set of unattainable points for the rational Hermite interpolation problem
- Hybrid rational function approximation and its accuracy analysis
- Fast and stable rational interpolation in roots of unity and Chebyshev points
- A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
- A new approach to the rational interpolation problem: The vector case
- On rational Lagrange interpolation with poles at the boundary
This page was built for publication: A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827461)