SparseM: A Sparse Matrix Package forR
Roger W. Koenker, Pin Ng · Journal of Statistical Software · 2003
SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the package is illustrated by a family of linear model fitting functions that implement least squares methods for problems with sparse design matrices. Significant performance improvements in memory utilization and computational speed are possible for applications involving large sparse matrices.
Cited by 57 works. doi:10.18637/jss.v008.i06
Authors
References
- Direct Methods for Sparse Matrices
- Sweave: Dynamic Generation of Statistical Reports Using Literate Data Analysis
- SPARSKIT: A basic tool kit for sparse matrix computations
- Quantile Smoothing Splines
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- An overview of the sparse basic linear algebra subprograms
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
- Penalized Triograms: Total Variation Regularization for Bivariate Smoothing
- COBS: qualitatively constrained smoothing via linear programming
- MUltifrontal Massively Parallel Solver (MUMPS Version 4.3) Users' guide