Parallel pivoting combined with parallel reduction and fill-in control☆
References (24)
Structuring parallel algorithms in an MIMD, shared memory environment
Parallel Comput.
(1986)Parallel pivoting algorithms for sparse symmetric matrices
Parallel Comput.
(1984)Multiprocessor sparse LU decomposition with controlled fill-in
- et al.
Parallelizing a sparse matrix package
- et al.
Multiprocessor sparse L/U decomposition with controlled fill-in
- et al.
Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor
Parallel solution of sparse simultaneous linear equations
Parallel implementation of multifrontal scheme
Argonne National Laboratory, Mathematics and Computer Science Division, Technical Memorandum No. 49
(1985)- et al.
Optimal parallel triangulation of a sparse matrix
IEEE Trans. Circuits and Systems
(1979)
A data structure for parallel LU decomposition
IEEE Trans. Comput.
(1982)
Parallel computation with the Force
Cited by (15)
A block-tridiagonal solver with two-level parallelization for finite element-spectral codes
2014, Computer Physics CommunicationsGaussian elimination for the solution of linear systems of equations
2000, Handbook of Numerical AnalysisSolving large nonsymmetric sparse linear systems using MCSPARSE
1996, Parallel ComputingParallel sparse matrix solution and performance
1995, Parallel ComputingSparse Matrix Computations on the Hypercube and Related Networks
1994, Journal of Parallel and Distributed ComputingAn optimal algorithm for Gaussian elimination of band matrices on an MIMD computer
1990, Parallel Computing
- ☆
Research was supported in part by NASA Contract No. NAS1-17070 and by the Air Force Office of Scientific Research under Grant No. AFOSR 85-1089 while the author was in residence at ICASE, NASA Langley Research Center, Hampton, VA 23665.
Copyright © 1989 Published by Elsevier B.V.