On the Toeplitz embedding of an arbitrary matrix
From MaRDI portal
Publication:793123
DOI10.1016/0024-3795(83)90151-9zbMath0538.15008OpenAlexW2037739163MaRDI QIDQ793123
Y. Genin, Y. Kamp, Philippe Delsarte
Publication date: 1983
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(83)90151-9
Levinson algorithmSchur parametersChristoffel-Darboux formulablock Toeplitz matricesToeplitz embeddingTrench algorithms
Theory of matrix inversion and generalized inverses (15A09) Hermitian, skew-Hermitian, and related matrices (15B57) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (2)
Inversion and factorization of non-Hermitian quasi-Toeplitz matrices ⋮ Equivalence Classes of Hermitian Matrices and Their Schur Parametrization
Cites Work
- Unnamed Item
- Unnamed Item
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Displacement ranks of matrices and linear equations
- Matrix-valued Toeplitz operators
- Polynomials defined by a difference system
- Schur Parametrization of Positive Definite Block-Toeplitz Systems
- A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Orthogonal polynomial matrices on the unit circle
- The Solution of a Toeplitz Set of Linear Equations
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Block Toeplitz Matrix Inversion
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
- A Convergence Equivalence Related to Polynomials Orthogonal on the Unit Circle
This page was built for publication: On the Toeplitz embedding of an arbitrary matrix