The SOR method on parallel computers
From MaRDI portal
Publication:1124272
DOI10.1007/BF01409787zbMath0678.65022MaRDI QIDQ1124272
Publication date: 1989
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133394
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Related Items (5)
A new parallel Gauss-Seidel method based on alternating group explicit method and domain decomposition method ⋮ Inexact Newton methods on a vector supercomputer ⋮ Pipeline implementation of cellular automata for structural design on message-passing multiprocessors ⋮ A note on the implementation of the successive overrelaxation method for linear complementarity problems ⋮ On the spectrum of the SOR operator for symmetric positive definite matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling parallel iterative methods on multiprocessor systems
- Convergence of parallel multisplitting iterative methods for M-matrices
- A parallelized point rowwise successive over-relaxation method on a multiprocessor
- Comments on scheduling parallel iterative methods on multiprocessor systems
- Comparisons of weak regular splittings and multisplitting methods
- Parallel interval multisplittings
- Pipelined iterative methods for shared memory machines
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Solution of Partial Differential Equations on Vector and Parallel Computers
- A Survey of Parallel Algorithms in Numerical Linear Algebra
This page was built for publication: The SOR method on parallel computers