Convergence of relaxed parallel multisplitting methods with different weighting schemes

DOI10.1016/S0096-3003(98)10120-0zbMath1026.65026OpenAlexW2064776809MaRDI QIDQ1569110

Zhong-Yun Liu, Zhi-Hao Cao

Publication date: 25 June 2000

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(98)10120-0

zbMATH Keywords

convergencecomparison of methodslinear systemparallel computation\(M\)-matrixrelaxationextrapolation methodmultisplitting methodsmonotone matrix

Mathematics Subject Classification ID

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

Related Items (6)

Convergence improvement of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems ⋮ The iterative methods for centrosymmetric matrices ⋮ A note on the inner-outer iterative method for solving the linear equation \(Ax = b\) ⋮ Preconditioned parallel multisplitting USAOR method for \(H\)-matrices linear systems ⋮ Global relaxed non-stationary multisplitting multi-parameter methods ⋮ GRPM-style methods and comparisons of convergent and divergent rates

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• Comparisons of weak regular splittings and multisplitting methods
• Convergence of relaxed parallel multisplitting methods
• On the theory and practice of multisplitting methods in parallel computation
• On convergence of nested stationary iterative methods
• Multisplitting of a Symmetric Positive Definite Matrix
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Multisplitting with Different Weighting Schemes

This page was built for publication: Convergence of relaxed parallel multisplitting methods with different weighting schemes