Solving large nonsymmetric sparse linear systems using MCSPARSE
- 1 December 1996
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 22 (10) , 1291-1333
- https://doi.org/10.1016/s0167-8191(96)00047-6
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1990
- A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU FactorizationSIAM Journal on Matrix Analysis and Applications, 1990
- Parallel pivoting combined with parallel reduction and fill-in controlParallel Computing, 1989
- Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equationsIEEE Transactions on Computers, 1988
- Progress in Sparse Matrix Methods for Large Linear Systems On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- Parallel implementation of multifrontal schemesParallel Computing, 1986
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- Analysis of Sparse EliminationSIAM Journal on Numerical Analysis, 1974
- The bordered triangular matrix and minimum essential sets of a digraphIEEE Transactions on Circuits and Systems, 1974