Conjugate Gradient Methods for Toeplitz Systems

نویسندگان

  • Raymond H. Chan
  • Michael K. Ng
چکیده

A list of technical reports, including some abstracts and copies of some full reports may be found at: Object test coverage using finite state machines. September 1995. On balancing workload in a highly mobile environment. August 1995. Error analysis of a partial pivoting method for structured matrices. June 1995. Abstract In this expository paper, we survey some of the latest developments on using precondi-tioned 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 log 2 n) operations required by fast direct Toeplitz solvers. Diierent preconditioners proposed for Toeplitz systems are reviewed. Applications to Toeplitz-related systems arising from partial diierential equations, queueing networks, signal and image processing, integral equations, and time series analysis are given. To appear in SIAM Review.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey of Preconditioners for Ill-Conditioned Toeplitz Systems

In this paper, we survey some of latest developments in using preconditioned conjugate gradient methods for solving mildly ill-conditioned Toeplitz systems where the condition numbers of the systems grow like O(n) for some > 0. This corresponds to Toeplitz matrices generated by functions having zeros of order. Because of the ill-conditioning, the number of iterations required for convergence in...

متن کامل

Parallelizing the Conjugate Gradient Algorithm for Multilevel Toeplitz Systems

Multilevel Toeplitz linear systems appear in a wide range of scientific and engineering applications. While several fast direct solvers exist for the basic 1-level Toeplitz matrices, in the multilevel case an iterative solver provides the most general and practical solution. Furthermore, iterative methods are asymptotically faster than many stable direct methods even for the 1-level case. This ...

متن کامل

A parallel linear solver for multilevel Toeplitz systems with possibly several right-hand sides

A Toeplitz matrix has constant diagonals; a multilevel Toeplitz matrix is defined recursively with respect to the levels by replacing the matrix elements with Toeplitz blocks. Multilevel Toeplitz linear systems appear in a wide range of applications in science and engineering. This paper discusses an MPI implementation for solving such a linear system by using the conjugate gradient algorithm. ...

متن کامل

A Total Least Squares Methodfor Toeplitz

A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...

متن کامل

Using ω-circulant matrices for the preconditioning of Toeplitz systems

Toeplitz systems can be solved efficiently by using iterative methods such as the conjugate gradient algorithm. If a suitable preconditioner is used, the overall cost of the method is O(n logn) arithmetic operations. Circulant matrices are frequently employed for the preconditioning of Toeplitz systems. They can be chosen as preconditioners themselves, or they can be used for the computation of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Review

دوره 38  شماره 

صفحات  -

تاریخ انتشار 1996