Abstract

The solution of symmetric positive definite Toeplitz systems Ax=b by the preconditioned conjugate gradient (PCG) method was recently proposed by Strang (1986) and analyzed by Chan (1989) and Chan and Strang (1989). The convergence rate of the PCG method depends on the choice of preconditioners for the given Toeplitz matrices. The authors present a general approach to the design of Toeplitz preconditioners based on the idea to approximate a partially characterized linear deconvolution with circular deconvolutions. All resulting preconditioners can therefore be inverted via various fast transform algorithms with O(N log N) operations. For a wide class of problems, the PCG method converges in a finite number of iterations independent of N so that the computational complexity for solving these Toeplitz systems is O(N log N). >

Full Text
Paper version not known

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.