Conjugate gradient methods for Toeplitz systems
In this expository paper, we survey some of the latest developments on using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of solving a large class of n-by-n Toeplitz systems is reduced to O(n log n) operations as compared to O(n log2 n) operations required by fast direct Toeplitz solvers. Different preconditioners proposed for Toeplitz systems are reviewed. Applications to Toeplitz-related systems arising from partial...[Show more]
|Collections||ANU Research Publications|
|1607-01.2003-07-03T06:12:19Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-95-07.pdf||587.68 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.