Parallel iterative methods for solving linear equations

1982 ◽  
Vol 11 (3-4) ◽  
pp. 247-284 ◽  
Author(s):  
D.J. Evans ◽  
R. Sojoodi Haghighi
Keyword(s):  
Iterative Methods ◽  
Linear Equations ◽  
Parallel Iterative Methods ◽  
Parallel Iterative

scholarly journals Convergence of relaxed chaotic parallel iterative methods

1994 ◽  
Vol 50 (1) ◽  
pp. 167-176 ◽  
Author(s):  
Peter E. Kloeden ◽  
Dong-Jin Yuan
Keyword(s):  
Iterative Methods ◽  
Large Scale ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
System Of Linear Equations ◽  
Parallel Iterative Methods ◽  
Parallel Iterative

Sufficient conditions involving uniform multisplittings are established for the convergence of relaxed and AOR versions of asynchronous or chaotic parallel iterative methods for solving a large scale nonsingular system of linear equations Ax = b.

Parallel Iterative Methods for the Helmholtz Equation With Exact Nonreflecting Boundaries

2002 ◽  
Author(s):  
Cristian Ianculescu ◽  
Lonny L. Thompson
Keyword(s):  
Helmholtz Equation ◽  
Iterative Methods ◽  
Scale Up ◽  
Low Rank ◽  
Interprocessor Communication ◽  
Parallel Iterative Methods ◽  
Local Boundary Condition ◽  
Non Local ◽  
Parallel Iterative ◽  
Low Rank Update

Parallel iterative methods for fast solution of large-scale acoustic radiation and scattering problems are developed using exact Dirichlet-to-Neumann (DtN), nonreflecting boundaries. A separable elliptic nonreflecting boundary is used to efficiently model unbounded regions surrounding elongated structures. We exploit the special structure of the non-local DtN map as a low-rank update of the system matrix to efficiently compute the matrix-by-vector products found in Krylov subspace based iterative methods. For the complex non-hermitian matrices resulting from the Helmholtz equation, we use a distributed-memory parallel BICG-STAB iterative method in conjunction with a parallel Jacobi preconditioner. Domain decomposition with interface minimization was performed to ensure optimal interprocessor communication. For the architectures tested, and using the MPICH version of MPI, we show that when implemented as a low-rank update, the non-local character of the DtN map does not signicantly decrease the scale up and parallel eciency versus a purely approximate local boundary condition.

Sign in / Sign up

Export Citation Format

Share Document