scientific article; zbMATH DE number 176169
[For the entire collection see Zbl 0753.00013.] Preconditioning may be used to obtain faster convergence for the solution of linear systems by iterative methods. The rate of convergence generally depends on the condition number of the matrix. The condition number may be very large when the system appears as the result of discretization of an elliptic partial differential equation. The purpose of this paper is to derive asymptotic bounds for such systems when using the techniques of symmetric successive overrelaxation (SSOR) preconditioning. It is shown that the spectral condition number is reduced by this techniques by one order of magnitude for the case when the matrix corresponds to an elliptic difference operator of order \(2m\).
- Preconditioning strategies for asymptotically ill-conditioned block Toeplitz systems
- Preconditioners for ill-conditioned Toeplitz matrices
- Analysis of Preconditioning Techniques for Ill-Conditioned Toeplitz Matrices
- scientific article; zbMATH DE number 3988619
- Iterative methods for ill-conditioned Toeplitz matrices
- On the eigenvalue distribution of a class of preconditioning methods
- On the rate of convergence of the preconditioned conjugate gradient method
- On the convergence rate of the conjugate gradients in presence of rounding errors
- scientific article; zbMATH DE number 3988619 (Why is no real title available?)
- Fast superoptimal preconditioning of multiindex Toeplitz matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035272)