Shalhav Zohar
Abstract
The algorithm of W. F. Trench for the inversion of Toeplitz matrices is presented with a detailed proof for the case of non-Hermitian matrices. The only condition necessary to insure the validity of the algorithm is that all principal minors be nonzero.
- 1 TRENCH, W.F. An algorithm for the inversion of finite Toeplitz matrices. J. SIAM 12, 3 (Sept. 1964), 515-522.Google Scholar
Index Terms
- Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
Recommendations
Generalized matrix inversion is not harder than matrix multiplication
Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given ...
Shift-Invert Arnoldi Approximation to the Toeplitz Matrix Exponential
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and recurrence coefficients produced by this method are exploited to ...
Comments