Chebyshev acceleration for SOR-like method
The authors present a new iteration method for systems of linear algebraic equations with a symmetric matrix of order \(m+n\) (\(m\geq n\)) consisting of one positive-definite block of order \(m\) and one zero block of order \(n\) in the main diagonal and of two mutually transposed off diagonal blocks of rank \(n\). This new method, called a generalized successive overrelaxation (SOR)-like method using Chebyshev semi-iteration (GSOR SI), is motivated as an improvement of the SOR-like method from \textit{G. H. Golub, X. Wu} and \textit{J.-Y. Yuan} [BIT 41, 71--85 (2001; Zbl 0991.65036)]. Convergence of the GSOR SI is proved and the asymptotic rate of convergence of the GSOR SI is shown to be greater than that of the SOR-like method under some assumptions concerning the preconditioner and the value of relaxation parameter. Two concrete examples illustrate that indeed the GSOR SI is more effective than the SOR-like method.
- Chebyshev acceleration of the method of Cimmino
- scientific article; zbMATH DE number 672005
- Chebyshev acceleration of iterative refinement
- scientific article; zbMATH DE number 567659
- Chebyshev acceleration of Picard-Lindelöf iteration
- scientific article; zbMATH DE number 1421707
- The Chebyshev accelerating method for progressive iterative approximation
- Chebyshev-like root-finding methods with accelerated convergence
- Chebyshev collocation methods for fast orbit determination
- Two classes of multisecant methods for nonlinear acceleration
- On the modified symmetric successive over-relaxation method for augmented systems
- On Chebyshev accelerated iteration methods for two-by-two block linear systems
- A new modified SSOR iteration method for solving augmented linear systems
- Iterative algorithm for minimal norm least squares solution to general linear matrix equations
- scientific article; zbMATH DE number 672005 (Why is no real title available?)
- scientific article; zbMATH DE number 2095769 (Why is no real title available?)
- SOR-like Methods with Optimization Model for Augmented Linear Systems
- Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem
- Gradient-based maximal convergence rate iterative method for solving linear matrix equations
- Quasi-Chebyshev accelerated iteration methods based on optimization for linear systems
This page was built for publication: Chebyshev acceleration for SOR-like method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460572)