Parallel Sparse Lu Decomposition on a Mesh Network of Transputers *

@inproceedings{AParallelSL,
  title={Parallel Sparse Lu Decomposition on a Mesh Network of Transputers *},
  author={A.. and FRANK VAN DER STAPPENt and Rob and H.. and BISSELINGt and Johannes and G. GuillermoCabrera and VAN DE VORST}
}
  • A.., FRANK VAN DER STAPPENt, +5 authors VAN DE VORST
A parallel algorithm is presented for the LU decomposition of a general sparse matrix on a distributed-memory MIMD multiprocessor with a square mesh communication network. In the algorithm, matrix elements are assigned to processors according to the grid distribution. Each processor represents the nonzero elements of its part of the matrix by a local, ordered, two-dimensional linked-list data structure. The complexity of important operations on this data structure and on several others is… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Evaluation of orderings for unsymmetric sparse matrices

J. G. LEWIS, AND H. D. SIMON Jt.
ACM Trans . Math . Software • 1989

Similar Papers

Loading similar papers…