Solving unsymmetric sparse systems of linear equations with PARDISO
Top Cited Papers
- 1 April 2004
- journal article
- Published by Elsevier in Future Generation Computer Systems
- Vol. 20 (3), 475-487
- https://doi.org/10.1016/j.future.2003.07.011
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equationsACM Transactions on Mathematical Software, 2002
- Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systemsParallel Computing, 2002
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU FactorizationSIAM Journal on Matrix Analysis and Applications, 1997
- An Approximate Minimum Degree Ordering AlgorithmSIAM Journal on Matrix Analysis and Applications, 1996
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor ComputersSIAM Journal on Scientific Computing, 1993
- The influence of relaxed supernode partitions on the multifrontal methodACM Transactions on Mathematical Software, 1989
- Solving Sparse Linear Systems with Sparse Backward ErrorSIAM Journal on Matrix Analysis and Applications, 1989
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systemsSIAM Journal on Scientific and Statistical Computing, 1989
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985