A fast block Hankel solver based on an inversion formula for block Loewner matrices
DOI10.1007/BF02575714zbMath0904.65031MaRDI QIDQ1127943
Peter Kravanja, Marc Van Barel
Publication date: 19 January 1999
Published in: Calcolo (Search for Journal in Brave)
algorithmcomputational complexitynumerical examplesrational interpolationfast Fourier transformsinversion formulablock Hankel systemblock Loewner system
Theory of matrix inversion and generalized inverses (15A09) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Hankel and Loewner matrices
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- Über monotone Matrixfunktionen
- Inversion of a block Löwner matrix
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
This page was built for publication: A fast block Hankel solver based on an inversion formula for block Loewner matrices