A fast Hankel solver based on an inversion formula for Loewner matrices
type: Item
instance of: scholarly article
title: A fast Hankel solver based on an inversion formula for Loewner matrices
zbMATH Open document ID: 0943.65041
DOI: 10.1016/S0024-3795(98)10079-4
author: Peter Kravanja
author: Marc van Barel
published in: Linear Algebra and its Applications
publication date: 2000-08-21T00:00:00Z
review text: Linear equations with Hankel matrices are transformed to systems with Loewner matrices by the fast Fourier transform. The latter systems are solved via two rational interpolation problems on the unit circle. In principle, singularities of rational expressions may be encountered. Therefore the authors introduce a pivoting strategy. The complexity of the algorithm is \(O (n^2)\).
reviewed by: D. Braess
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 41A20
zbMATH DE Number: 1370169
zbMATH Keywords: Hankel matrices
zbMATH Keywords: Loewner matrices
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: rational interpolation
zbMATH Keywords: pivoting strategy
zbMATH Keywords: complexity
describes a project that uses: LAPACK
MaRDI profile type: Publication
cites work: Q4314299
cites work: A multi-step algorithm for Hankel matrices
cites work: Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices
cites work: Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm
cites work: A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
cites work: A look-ahead Levinson algorithm for general Toeplitz systems
cites work: A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
cites work: Hankel and Loewner matrices
cites work: An inversion formula and fast algorithms for Cauchy-Vandermonde matrices
cites work: A look-ahead Bareiss algorithm for general Toeplitz matrices
cites work: Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
cites work: A look-ahead algorithm for the solution of general Hankel systems
cites work: Q4327531
cites work: High performance algorithms for Toeplitz and block Toeplitz matrices
cites work: Efficient solution of linear systems of equations with recursive structure
cites work: Linear complexity parallel algorithms for linear systems of equations with recursive structure
cites work: Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
cites work: Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
cites work: Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
cites work: Look-ahead Levinson- and Schur-type recurrences in the Padé table
cites work: Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
cites work: Q4312678
cites work: Solving Toeplitz systems after extension and transformation
cites work: Q4230004
cites work: Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
cites work: Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
cites work: Algebraic methods for Toeplitz-like matrices and operators
cites work: Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
cites work: Q4327532
cites work: Q5820720
cites work: Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
cites work: Displacement Structure: Theory and Applications
cites work: A fast block Hankel solver based on an inversion formula for block Loewner matrices
cites work: Q4003887
cites work: Newton interpolation at Leja points
cites work: A new approach to the rational interpolation problem
cites work: A general module theoretic framework for vector M-Padé and matrix rational interpolation
cites work: A lookahead algorithm for the solution of block Toeplitz systems
cites work: Inversion of a block Löwner matrix
cites work: Remarks on complexity of polynomial and special matrix computations
cites work: Inverses of Löwner matrices
Wikidata QID: Q127841529
description: scientific article; zbMATH DE number 1370169