Look-ahead methods for block Hankel systems
From MaRDI portal
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
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 1256367 (Why is no real title available?)
- scientific article; zbMATH DE number 683544 (Why is no real title available?)
- scientific article; zbMATH DE number 741187 (Why is no real title available?)
- scientific article; zbMATH DE number 741188 (Why is no real title available?)
- scientific article; zbMATH DE number 749853 (Why is no real title available?)
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- A fast Hankel solver based on an inversion formula for Loewner matrices
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- A look-ahead Levinson algorithm for general Toeplitz systems
- A look-ahead algorithm for the solution of general Hankel systems
- A multi-step algorithm for Hankel matrices
- Algebraic methods for Toeplitz-like matrices and operators
- 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
- Displacement Structure: Theory and Applications
- Efficient solution of linear systems of equations with recursive structure
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast projection methods for minimal design problems in linear system theory
- Formal orthogonal polynomials and Hankel/Toeplitz duality
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Laurent series and their Padé approximations
- Linear algebra, rational approximation and orthogonal polynomials
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- Matrix Padé Fractions and Their Computation
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Orthonormal polynomial vectors and least squares approximation for a discrete inner product
- Padé-type approximation and general orthogonal polynomials
- Polynômes orthogonaux formels - applications
- Stabilizing the Generalized Schur Algorithm
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- The Inverses of Block Hankel and Block Toeplitz Matrices
- The stability of inversion formulas for Toeplitz matrices
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)
