Discrete linearized least-squares rational approximation on the unit circle
DOI10.1016/0377-0427(94)90327-1zbMath0810.65011OpenAlexW2078155277MaRDI QIDQ1334798
Marc Van Barel, Adhemar Bultheel
Publication date: 22 September 1994
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(94)90327-1
algorithmrational interpolationparallel computationorthonormal polynomialsrational approximationblock Hessenberg matricesblock Schur parametrizationrational least squares problem
Approximation by rational functions (41A20) Numerical interpolation (65D05) Parallel numerical computation (65Y05) Algorithms for approximation of functions (65D15)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to the rational interpolation problem
- The numerically stable reconstruction of Jacobi matrices from spectral data
- A new approach to the rational interpolation problem: The vector case
- Padé techniques for model reduction in linear system theory: a survey
- Near-circularity of the error curve in complex Chebyshev approximation
- A parallel algorithm for discrete least squares rational approximation
- Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
- Discrete Least Squares Approximation by Trigonometric Polynomials
- A survey of matrix inverse eigenvalue problems
- $O( n^2 )$ Reduction Algorithms for the Construction of a Band Matrix from Spectral Data
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- Two simple algorithms for discrete rational approximation
This page was built for publication: Discrete linearized least-squares rational approximation on the unit circle