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

Simple item page
dc.creatorKanhouche, Rami
dc.date2004-04-06
dc.date2004-08-13
dc.date.accessioned2026-07-07T05:07:12Z
dc.date.available2026-07-07T05:07:12Z
dc.descriptionA 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)^3)((n2)^2), 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
dc.identifierhttps://arxiv.org/abs/math/0404119
dc.identifierhttp://arxiv.org/abs/math/0404119
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70764
dc.subjectSpectral Theory
dc.titleGeneralized Reflection Coefficients in Toeplitz-Block-Toeplitz Matrix Case and Fast Inverse 2D levinson Algorithm
dc.typetext

Files

Collections

arXiv