Non-stationary parallel multisplitting algorithms for almost linear systems

DOI10.1002/(SICI)1099-1506(199903)6:2%3C79::AID-NLA148%3E3.0.CO;2-WMaRDI QIDQ2760342zbMATH OpenFDO

Authors Josep Arnal, Violeta Migallón, José Penadés

Publication date 19 December 2001

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/(SICI)1099-1506(199903)6:2%3C79::AID-NLA148%3E3.0.CO;2-W

zbMATH Keywords

accelerated overrelaxation methodsalmost linear systemsasynchronous algorithmconvergenceH-matricesM-matricesmultisplitting methodsnonlinear algorithmnumerical experimentsparallel computationperformance

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Review text

Non-stationary parallel multisplitting iterative methods for the solution of almost linear systems are introduced. The methods are extensions of non-stationary methods for the solution of such systems. A non-stationary parallel nonlinear algorithm based on the accelerated overrelaxation-type methods is introduced. Its extension to asynchronous algorithm is also considered. Convergence properties of synchronous and asynchronous versions of these methods are studied for M-matrices and H-matrices. In the last section some numerical experiments on a distributed memory multiprocessor illustrating the performance of these algorithms are discussed.

Recommendations

• Non-stationary parallel multisplitting methods
• Non-stationary parallel multisplitting AOR methods
• Nonstationary parallel relaxed multisplitting methods
• The weaker convergence of non-stationary matrix multisplitting methods for almost linear systems
• Parallel, synchronous and asynchronous two-stage multisplitting methods

Cited in

(9)

• Some convergence results for almost linear parallel iterations
• On asynchronous iterations
• Multisplittings and parallel iterative methods
• Efficient split algorithms for continuous-time and discrete-time systems
• Non-stationary parallel multisplitting methods
• scientific article; zbMATH DE number 1830948 (Why is no real title available?)
• scientific article; zbMATH DE number 879000 (Why is no real title available?)
• The weaker convergence of non-stationary matrix multisplitting methods for almost linear systems
• Asynchronous multisplitting GAOR method and asynchronous multisplitting SSOR method for systems of weakly nonlinear equations

This page was built for publication: Non-stationary parallel multisplitting algorithms for almost linear systems

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