Abstract:
: We have extended the matrix computation language and environment MATLAB to include sparse matrix storage and operations. The only change to the outward appearance of the MATLAB language is a pair of commands to create full or sparse matrices. Nearly all the operations of MATLAB now apply equally to full or sparse matrices, without any explicit action by the user. The sparse data structure represents a matrix in space proportional to the number of nonzero entries, and most of the operations compute sparse results in time proportional to the number of arithmetic operations on nonzeros. Keywords: MATLAB, mathematical software, matrix computation, sparse matrix algorithms. AMS subject classifications: 65--04, 65F05, 65F20, 65F50, 68N15, 68R10 Computing Reviews descriptors: D.2.6 (Interactive programming environments) , F.2.1 (Computations on matrices), G.1.3 (Numerical linear algebra: Sparse and very large systems), G.4 (Mathematical software: Portability) . Xerox Palo Alto Resear...
Citations
|
689
|
Depth-first search and linear graph algorithms
– Tarjan
- 1972
|
|
402
|
Computer solution of large sparse positive definite systems
– George, Liu
- 1981
|
|
363
|
An n 5=2 algorithm for maximum matchings in bipartite graphs
– Hopcroft, Karp
- 1973
|
|
275
|
UNPACK Users' Guide
– DONGARRA, BUNCH, et al.
- 1979
|
|
255
|
Sparse Matrix Test Problems
– Duff, Grimes, et al.
- 1989
|
|
161
|
The multifrontal solution of indefinite sparse symmetric linear systems
– Duff, Reid
- 1983
|
|
132
|
The role of elimination trees in sparse factorization
– Liu
- 1990
|
|
106
|
The evolution of the minimum degree ordering algorithm
– George, Liu
- 1989
|
|
56
|
Matrix Eigensystem Routines — EISPACK Guide
– Smith, Boyle, et al.
- 1976
|
|
46
|
Sparse partial pivoting in time proportional to arithmetic operations
– Gilbert, Peierls
- 1988
|
|
46
|
Computing the block triangular form of a sparse matrix
– Pothen, Fan
- 1990
|
|
43
|
On algorithms for obtaining a maximum transversal
– Duff
- 1981
|
|
39
|
Progress in sparse matrix methods for large linear systems on vector supercomputers
– Ashcraft, Grimes, et al.
- 1987
|
|
37
|
A new implementation of sparse Gaussian elimination
– Schreiber
- 1982
|
|
33
|
Predicting structure in sparse matrix computations
– Gilbert
- 1994
|
|
26
|
On finding supernodes for sparse matrix computations
– Liu, Ng, et al.
- 1993
|
|
24
|
Some design features of a sparse matrix code
– Duff, Reid
- 1979
|
|
21
|
Predicting fill for sparse orthogonal factorization
– Coleman, Edenbrandt, et al.
- 1986
|
|
20
|
Algorithms and data structures for sparse symmetric Gaussian elimination
– Eisenstat, Schultz, et al.
- 1981
|
|
9
|
The generalized element method
– Speelpenning
- 1978
|
|
9
|
An efficient parallel sparse partial pivoting algorithm
– Gilbert
- 1988
|
|
6
|
Matrix computations with Fortran and paging
– MOLER
- 1972
|
|
5
|
Remarks on implementations of O(n 1/2 #) assignment algorithms
– Duff, Wiberg
- 1988
|
|
5
|
Sparse null bases and marriage theorems
– Pothen
- 1984
|
|
3
|
Tridiagonalization of a symmetric band matrix
– Schwartz
- 1968
|
|
3
|
Atomic Energy Authority, Harwell subroutine library: A catalogue of subroutines
– Kingdom
- 1988
|
|
2
|
Parallel preordering for sparse matrix factorization
– Gilbert, Lewis, et al.
|
|
2
|
Linear algebra, volume 2 of Handbook for automatic computation
– Wilkinson, Reinsch
- 1971
|
|
1
|
de Rijk, On the augmented system approach to leastsquares problems
– Arioli, Duff, et al.
- 1989
|
|
1
|
orck, A note on scaling in the augmented system methods (unpublished manuscript
– Bj
- 1991
|
|
1
|
A note on scaling in the augmented system methods (unpublished manuscript
– Bjorck
- 1991
|
|
