Fast matrix factorizations via discrete transmission lines

From MaRDI portal





It is shown that simple arguments, related to the so called discrete transmission lines, can be used to derive the fast Cholesky algorithm for triangular factorization of symmetric positive definite Toeplitz matrices and their inverses. The transmission-line derivation provides clear physical interpretation of the classical Schur and Levinson algorithms and the Toeplitz inversion formula of Gohberg and Semencul.











This page was built for publication: Fast matrix factorizations via discrete transmission lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082033)