|
705
|
SPLASH: Stanford Parallel Applications for Shared Memory
– Singh, Weber, et al.
- 1992
|
|
617
|
A set of level 3 basic linear algebra subprograms
– Dongarra, Croz, et al.
- 1990
|
|
432
|
Direct Methods for Sparse Matrices
– DUFF, ERISMAN, et al.
- 1986
|
|
389
|
W.H.: Computer Solution of Large Sparse Positive Definite Systems
– George, Liu
- 1981
|
|
366
|
An extended set of Fortran basic linear algebra subprograms: model implementation and test programs
– Dongarra, Croz, et al.
- 1988
|
|
266
|
Sparse Matrix Test Problems
– Duff, Grimes, et al.
- 1989
|
|
264
|
Numerical Methods for Least Squares Problems
– Bjorck
- 1996
|
|
253
|
A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
– Barnard, Simon
- 1993
|
|
237
|
Users' guide for the Harwell-Boeing sparse matrix collection (release I).Technical Report TR/PA/92/86, Research and Technology Division, Boeing Computer Services
– Duff, Grimes, et al.
- 1992
|
|
162
|
A column approximate minimum degree ordering algorithm
– Davis, Gilbert, et al.
|
|
162
|
The multifrontal solution of indefinite sparse symmetric linear systems
– Duff, Reid
- 1983
|
|
154
|
Optimizing matrix multiply using PHiPAC: A portable, highperformance, ANSI C coding methodology
– Bilmes, Asanovic, et al.
- 1997
|
|
141
|
ScaLAPACK: a Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performance," presented at Supercomputing '96
– Blackford, al
- 1996
|
|
141
|
A Supernodal Approach to Sparse Partial Pivoting
– Demmel, Eisenstat, et al.
- 1999
|
|
139
|
The role of elimination trees in sparse factorization
– Liu
- 1990
|
|
117
|
Parallel algorithms for sparse linear systems
– Heath, Ng, et al.
- 1991
|
|
115
|
Nested dissection of a regular finite element mesh
– George
- 1973
|
|
108
|
The evolution of the minimum degree ordering algorithm
– George, Liu
- 1989
|
|
100
|
The transitive reduction of a directed graph
– Aho, MR, et al.
- 1972
|
|
89
|
An unsymmetric-pattern multifrontal method for sparse LU factorization
– Davis, Duff
- 1997
|
|
87
|
Sparse matrices in Matlab: Design and implementation
– GILBERT, MOLER, et al.
- 1991
|
|
75
|
The elimination form of the inverse and its application to linear programming
– Markowitz
- 1957
|
|
72
|
Vectorization of a multiprocessor multifrontal code
– Amestoy, Duff
- 1989
|
|
68
|
Solving sparse linear systems with sparse backward error
– Arioli, Demmel, et al.
- 1989
|
|
67
|
The multifrontal solution of unsymmetric sets of linear systems
– Duff, Reid
- 1984
|
|
64
|
B.W.: Block sparse Cholesky algorithm on advanced uniprocessor computers
– Ng, Peyton
- 1993
|
|
49
|
Implementing linear algebra algorithms for dense matrices on a vector pipeline machine
– Dongarra, Gustafson, et al.
- 1984
|
|
49
|
Computing the block triangular form of a sparse matrix
– Pothen, Fan
- 1990
|
|
48
|
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
– Davis, Duff
- 1999
|
|
47
|
Improved load distribution in parallel sparse Cholesky factorization
– Rothberg, Schreiber
- 1994
|
|
46
|
Robust Ordering of Sparse Matrices Using Multisection
– Ashcraft, Liu
- 1996
|
|
46
|
Improving the runtime and quality of nested dissection ordering
– Hendrickson, Rothberg
- 1999
|
|
44
|
Elimination structures for unsymmetric sparse LU factors
– Gilbert, Liu
- 1993
|
|
44
|
Sparse partial pivoting in time proportional to arithmetic operations
– GILBERT, PEIERLS
- 1988
|
|
44
|
Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 andParagon systems
– Rothberg
- 1994
|
|
41
|
Task scheduling for parallel sparse Cholesky factorization
– Geist, Ng
- 1989
|
|
39
|
Compressed graphs and the minimum degree algorithm
– Ashcraft
- 1995
|
|
39
|
Exploiting the memory hierarchy in sequential and parallel sparse cholesky factorization
– Rothberg
- 1992
|
|
39
|
The design of a new frontal code for solving sparse unsymmetric systems
– Duff, Scott
- 1996
|
|
38
|
Towards a Fast Implementation of Spectral Nested Dissection
– Pothen, Simon, et al.
- 1992
|
|
37
|
A new implementation of sparse Gaussian elimination
– Schreiber
- 1982
|
|
37
|
Computational Methods for General Sparse Matrices
– Zlatev
- 1991
|
|
36
|
The influence of relaxed supernode partitions on the multifrontal method
– Ashcraft, Grimes
- 1989
|
|
36
|
Symbolic factorization for sparse Gaussian elimination with partial pivoting
– George, Ng
- 1987
|
|
36
|
Predicting structure in sparse matrix computations
– GILBERT
- 1986
|
|
35
|
Computer Solution to Large Sparse Positive De nite Systems
– George, Liu
- 1981
|
|
34
|
An implementation of Gaussian elimination with partial pivoting for sparse systems
– George, Ng
- 1985
|
|
32
|
Scalability of sparse direct solvers
– Schreiber
- 1992
|
|
31
|
A FORTRAN code for direct solution of sparse unsymmetric linear systems of equations
– Duff, Reid
- 1993
|
|
30
|
Reordering sparse matrices for parallel elimination
– Liu
- 1989
|
|
