scholarly journals Solution of large, sparse systems of linear equations in massively parallel applications

2003 ◽  
Author(s):  
M.T. Jones ◽  
P.E. Plassmann
Keyword(s):  
Linear Equations ◽  
Parallel Applications ◽  
Massively Parallel ◽  
Systems Of Linear Equations ◽  
Sparse Systems ◽  
Large Sparse Systems

scholarly journals A nested decomposition algorithm for parallel computations of very large sparse systems

1995 ◽  
Vol 1 (1) ◽  
pp. 41-57 ◽  
Author(s):  
D. D. Šiljak ◽  
A. I. Zečević
Keyword(s):  
Parallel Computation ◽  
Linear Equations ◽  
Parallel Computations ◽  
Decomposition Algorithm ◽  
Parallel Solution ◽  
Engineering Problems ◽  
Systems Of Linear Equations ◽  
Sparse Systems ◽  
Block Diagonal ◽  
Large Sparse Systems

In this paper we present a generalization of the balanced border block diagonal (BBD) decomposition algorithm, which was developed for the parallel computation of sparse systems of linear equations. The efficiency of the new procedure is substantially higher, and it extends the applicability of the BBD decomposition to extremely large problems. Examples of the decomposition are provided for matrices as large as250,000×250,000, and its performance is compared to other sparse decompositions. Applications to the parallel solution of sparse systems are discussed for a variety of engineering problems.

Sign in / Sign up

Export Citation Format

Share Document