Abstract

AbstractA modification is presented of the classical O(n2) algorithm of Trench for the direct solution of Toeplitz systems of equations. The Trench algorithm is stable for symmetric matrices that are positive definite, but can be unstable for the indefinite case (and for general matrices). Our modification permits extension of the algorithm to compute approximate inverses of indefinite symmetric Toeplitz matrices, for which the unmodified algorithm breaks down when principal submatrices are singular. As a preconditioner, the approximate inverse has an advantage that only matrix—vector multiplications are required for the solution of a linear system, without forward and backward solves. The approximate inverse so obtained can be sufficiently accurate, moreover, that, when it is used as a preconditioner for the applications investigated, subsequent iteration may not even be necessary. Numerical results are given for several test matrices. The perturbation to the original matrix that defines the modification is related to a perturbation in a quantity generated in the Trench algorithm; the associated stability of the Trench algorithm is discussed.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.