Generalized Reflection Coefficients in Toeplitz-Block-Toeplitz Matrix Case and Fast Inverse 2D levinson Algorithm

2004/04/06 by Rami Kanhouche, Kanhouche, Rami
Mathematics · Physics and Astronomy · #Electromagnetic Scattering and Analysis #FOS: Mathematics #Spectral Theory (math.SP) #math.SP

paper · pdf · doi:10.48550/arxiv.math/0404119

openalex publication_date 2004/04/06 · arxiv created 2004/08/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity of ((n1)³)((n2)²), where n1 is the block size, and n2 is the block matrix size. A 2D levinson algorithm is introduced that outperform Wittle, Wiggins and Robinson Algorithm

Citations

• A Modified Burg Algorithm Equivalent In Results to Levinson Algorithm

Related

• Generalized Reflection Coefficients and Inverse Factorization of Hermetian Block Toeplitz Matrix
• Generalized inversion of Toeplitz-plus-Hankel matrices
• Explicit inverse of symmetric, tridiagonal near Toeplitz matrices with strictly diagonally dominant Toeplitz part
• Explicit inverse of symmetric, tridiagonal near Toeplitz matrices Part II: with weakly diagonally dominant Toeplitz
• An Iterative Block Matrix Inversion (IBMI) Algorithm for Symmetric Positive Definite Matrices with Applications to Covariance Matrices