Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
From MaRDI portal
Publication:1260790
DOI10.1016/0024-3795(93)90471-YzbMath0777.65011MaRDI QIDQ1260790
Roland W. Freund, Hongyuan Zha
Publication date: 25 August 1993
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
A look-ahead algorithm for the solution of general Hankel systems, Stability analysis of a general Toeplitz system solver, Formal orthogonal polynomials and Hankel/Toeplitz duality, A lookahead algorithm for the solution of block Toeplitz systems, Optimized look-ahead recurrences for adjacent rows in the Padé table, Characterization of orthogonal polynomials with respect to a functional, Inversion of a block Löwner matrix, Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations, Look-ahead methods for block Hankel systems, A stabilized superfast solver for indefinite Hankel systems, Computations with Gohberg-Semencul-type formulas for Toeplitz matrices, High performance algorithms for Toeplitz and block Toeplitz matrices, A fast approach to stabilize two Toeplitz solvers of the Levinson type, Acoustic multiple scattering using recursive algorithms, 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, A fast Hankel solver based on an inversion formula for Loewner matrices, A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
Cites Work
- Algebraic methods for Toeplitz-like matrices and operators
- Fast block Toeplitz orthogonalization
- Laurent series and their Padé approximations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Fast projection methods for minimal design problems in linear system theory
- 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
- A look-ahead algorithm for the solution of general Hankel systems
- Recursive partial realization from the combined sequence of Markov parameters and moments
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- Polynomials defined by a difference system
- Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
- The Fitting of Time-Series Models
- Stability of Methods for Solving Toeplitz Systems of Equations
- An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
- Toeplitz eigensystem solver
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
- Combined sequence of Markov parameters and moments in linear systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A look-ahead Levinson algorithm for general Toeplitz systems
- A view of three decades of linear filtering theory
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- The Solution of a Toeplitz Set of Linear Equations
- Inversion of Toeplitz Matrices which are not Strongly Non-singular
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
- Some properties of biorthogonal polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
