Look-ahead methods for block Hankel systems
From MaRDI portal
Publication:1379009
DOI10.1016/S0377-0427(97)00164-7zbMATH Open0913.65018OpenAlexW2171586573MaRDI QIDQ1379009FDOQ1379009
Authors: Marc van Barel, Adhemar Bultheel 
Publication date: 24 August 1998
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00164-7
Recommendations
- A look-ahead algorithm for the solution of general Hankel systems
- A lookahead algorithm for the solution of block Toeplitz systems
- Block boundary value methods for linear Hamiltonian systems
- New look-ahead Lanczos-type algorithms for linear systems
- scientific article; zbMATH DE number 4037687
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- Introduction to block-oriented nonlinear systems
- scientific article; zbMATH DE number 4081381
- Block variants of Hammarling's method for solving Lyapunov equations
- A look-ahead Levinson algorithm for general Toeplitz systems
Cites Work
- Fast projection methods for minimal design problems in linear system theory
- Title not available (Why is that?)
- The stability of inversion formulas for Toeplitz matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Title not available (Why is that?)
- Displacement Structure: Theory and Applications
- Algebraic methods for Toeplitz-like matrices and operators
- Efficient solution of linear systems of equations with recursive structure
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A look-ahead Levinson algorithm for general Toeplitz systems
- Padé-type approximation and general orthogonal polynomials
- Title not available (Why is that?)
- The Inverses of Block Hankel and Block Toeplitz Matrices
- 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
- Polynômes orthogonaux formels - applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Orthonormal polynomial vectors and least squares approximation for a discrete inner product
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- A look-ahead algorithm for the solution of general Hankel systems
- Laurent series and their Padé approximations
- Linear algebra, rational approximation and orthogonal polynomials
- Formal orthogonal polynomials and Hankel/Toeplitz duality
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- A multi-step algorithm for Hankel matrices
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- Title not available (Why is that?)
- Matrix Padé Fractions and Their Computation
- Stabilizing the Generalized Schur Algorithm
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Title not available (Why is that?)
- A fast Hankel solver based on an inversion formula for Loewner matrices
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Title not available (Why is that?)
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Look-ahead methods for block Hankel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379009)
