A fast Hankel solver based on an inversion formula for Loewner matrices
From MaRDI portal
Publication:1809103
DOI10.1016/S0024-3795(98)10079-4zbMath0943.65041WikidataQ127841529 ScholiaQ127841529MaRDI QIDQ1809103
Peter Kravanja, Marc Van Barel
Publication date: 21 August 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
complexityrational interpolationfast Fourier transformHankel matricespivoting strategyLoewner matrices
Approximation by rational functions (41A20) Numerical methods for discrete and fast Fourier transforms (65T50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (4)
A superfast method for solving Toeplitz linear least squares problems. ⋮ Look-ahead methods for block Hankel systems ⋮ Extension of the rissanen algorithm to the factorization of block-Hankel matrices for solving systems of linear equations ⋮ A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- A new approach to the rational interpolation problem
- Inverses of Löwner matrices
- Hankel and Loewner matrices
- Algebraic methods for Toeplitz-like matrices and operators
- Newton interpolation at Leja points
- Efficient solution of linear systems of equations with recursive structure
- Solving Toeplitz systems after extension and transformation
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- A multi-step algorithm for Hankel matrices
- A look-ahead algorithm for the solution of general Hankel systems
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
- A lookahead algorithm for the solution of block Toeplitz systems
- Remarks on complexity of polynomial and special matrix computations
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Inversion of a block Löwner matrix
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- High performance algorithms for Toeplitz and block Toeplitz matrices
- An inversion formula and fast algorithms for Cauchy-Vandermonde matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A look-ahead Levinson algorithm for general Toeplitz systems
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm
This page was built for publication: A fast Hankel solver based on an inversion formula for Loewner matrices
