Some convergence conditions for a class of parallel decomposition-type linear relaxation methods

DOI10.1016/S0168-9274(01)00111-8zbMath0996.65035OpenAlexW2068945607MaRDI QIDQ1349133

Ljiljana Cvetković

Publication date: 21 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0168-9274(01)00111-8

zbMATH Keywords

convergenceparallel computationlarge sparse linear systemsdiagonally dominant matricesaccelerated overrelaxation algorithmsblock H-matricesparallel decomposition methodsSIMD multiprocessor systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (3)

A convergence analysis of block accelerated over-relaxation iterative methods for weak block \(H\)-matrices to partition \(\pi \) ⋮ New subclasses of block \(H\)-matrices with applications to parallel decomposition-type relaxation methods ⋮ Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of a class of parallel decomposition-type relaxation methods
• Some convergence results of PD relaxation methods
• A class of parallel decomposition-type relaxation methods for large sparse systems of linear equations
• Accelerated Overrelaxation Method

This page was built for publication: Some convergence conditions for a class of parallel decomposition-type linear relaxation methods