GRPM-style methods and comparisons of convergent and divergent rates

DOI10.1016/j.camwa.2008.08.001zbMath1165.65332OpenAlexW2022786108MaRDI QIDQ1029841

Li-Tao Zhang, Ting-Zhu Huang

Publication date: 13 July 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.08.001

zbMATH Keywords

convergencelinear systems\(H\)-matrixparallel multisplittingglobal relaxed method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (2)

Convergence improvement of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems ⋮ A note on the inner-outer iterative method for solving the linear equation \(Ax = b\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of the parallel multisplitting AOR algorithm
• Convergence of relaxed parallel multisplitting methods
• On the theory and practice of multisplitting methods in parallel computation
• Convergence of relaxed parallel multisplitting methods with different weighting schemes
• On convergence of nested stationary iterative methods
• Convergence analysis of the parallel multisplitting TOR method
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Relaxed parallel two-stage multisplitting methods^∗
• Convergence of parallel multisplitting methods for h-matrices

This page was built for publication: GRPM-style methods and comparisons of convergent and divergent rates