An efficient conjugate gradient preconditioner for Toeplitz systems
From MaRDI portal
(Redirected from An efficient conjugate gradient preconditioner for Toeplitz systems)
The authors consider the conjugate gradient method for the solution of a system of linear equations with a possibly perturbed positive definite Toeplitz matrix T. They suggest a preconditioning matrix which arises naturally from the triangular decomposition of a characteristic submatrix of T. Some analysis of the presented method is given and its performance is tested numerically. The method is a variant of incomplete factorization methods.
Recommendations
Cites work
- An Optimal Circulant Preconditioner for Toeplitz Systems
- Cholesky factorization of positive definite bi-infinite matrices
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 4002053 (Why is no real title available?)
- scientific article; zbMATH DE number 4030822 (Why is no real title available?)
- scientific article; zbMATH DE number 3787980 (Why is no real title available?)
Cited in
(10)- Preconditioned conjugate gradients, radial basis functions, and Toeplitz matrices
- A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers
- C. G. preconditioning for Toeplitz matrices
- The preconditioner for Hermitian Toeplitz systems
- Toeplitz Equations by Conjugate Gradients with Circulant Preconditioner
- Toeplitz Preconditioners Constructed from Linear Approximation Processes
- scientific article; zbMATH DE number 2069439 (Why is no real title available?)
- scientific article; zbMATH DE number 1475263 (Why is no real title available?)
- scientific article; zbMATH DE number 822859 (Why is no real title available?)
- A modified T. Chan's preconditioner for Toeplitz systems
This page was built for publication: An efficient conjugate gradient preconditioner for Toeplitz systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582805)