A Fast Triangular Factorization Algorithm of the Inversion of Toeplitz Type Matrix
Meng Xu
Abstract
Meng Xu
Abstract
According to triangular factorization of ″type″ matrix,a fast triangular factorization algorithm for the inversion of Toeplitz type matrix is presented. Firstly,let A be nonsingular,with the solution of linear equations,a recursive expression of A -1 is presented,a triangular factorization of A -1 is also given with the recursion. Secondly,with the theory given in the paper,the fast triangular factorization algorithm for the inversion of Toeplitz type matrix is presented. It is an O(mn 2) algorithm. Finally,numerical examples demonstrate the reliability.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to triangular factorization of ″type″ matrix,a fast triangular factorization algorithm for the inversion of Toeplitz type matrix is presented. Firstly,let A be nonsingular,with the solution of linear equations,a recursive expression of A -1 is presented,a triangular factorization of A -1 is also given with the recursion. Secondly,with the theory given in the paper,the fast triangular factorization algorithm for the inversion of Toeplitz type matrix is presented. It is an O(mn 2) algorithm. Finally,numerical examples demonstrate the reliability.
Key concepts: Toeplitz matrix, Invertible matrix, Incomplete LU factorization, Factorization, Triangular matrix, Incomplete Cholesky factorization, Dixon's factorization method, Mathematics