Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices

DOI10.1016/S0168-9274(01)00170-2zbMath1025.65021MaRDI QIDQ1862017

Zhong-Yun Liu

Publication date: 10 March 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergencecomparison of methodsparallel computationrelaxationsuccessive overrelaxationdiagonally compensated reductionmultisplitting methodsaccelerated overrelaxationsymmetric positive definite matrix

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (1)

On parallel multisplitting methods for symmetric positive semidefinite linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• On the convergence of the parallel multisplitting AOR algorithm
• Comparisons of weak regular splittings and multisplitting methods
• Convergence of relaxed parallel multisplitting methods
• A note on comparison theorems for splittings and multisplittings of Hermitian positive definite matrices
• Nonstationary parallel relaxed multisplitting methods
• Convergence of nested classical iterative methods for linear systems
• Multisplitting of a Symmetric Positive Definite Matrix
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Convergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices
• Multisplitting with Different Weighting Schemes
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• Diagonally compensated reduction and related preconditioning methods
• Two-stage Multisplitting Methods with Overlapping Blocks

This page was built for publication: Convergence of generalized relaxed multisplitting methods for symmetric positive definite matrices