Parallel performance of multisplitting methods with preweighting

DOI10.4134/JKMS.2012.49.4.805MaRDI QIDQ2898902zbMATH OpenFDO

Authors Yu Du Han, Jae Heon Yun

Publication date 12 July 2012

Published in Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/JKMS.2012.49.4.805

zbMATH Keywords

convergenceKrylov subspace methodmultisplitting methodnumerical resultsparallel computationpreconditionerpreweightingsuccessive overrelaxation

Mathematics Subject Classification ID

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

Review text

This paper first gives out a study on the convergence of a special type of multisplitting methods with preweighting for solving linear system. Then it introduces a parallel implementation of the successive overrelaxation (SOR)-like multisplitting method with preweighting and applies it to a parallel preconditioner of Krylov subspace method. At last, it provides the parallel performance results of both the SOR-like multisplitting method with preweighting and Krylov subspace method with the parallel preconditioner. The numerical results show that parallel performance of the method is quite efficient and its application to parallel preconditioner of Krylov subspace method is quite successful.

Recommendations

• On the theory and practice of multisplitting methods in parallel computation
• Convergence of multisplitting methods with different weighting schemes
• Multisplitting with Different Weighting Schemes
• Comparison results for parallel multisplitting methods with applications to AOR methods
• CONVERGENCE OF MULTISPLITTING METHODS WITH PREWEIGHTING FOR AN H-MATRIX

This page was built for publication: Parallel performance of multisplitting methods with preweighting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898902)