enter search term and/or author name
We propose a standard for generating, manipulating, and storing metadata describing numerical problems, in particular properties of matrices and linear systems. The standard comprises:
–an API for metadata generating and querying...
CONTEST: A Controllable Test Matrix Toolbox for MATLAB
Alan Taylor, Desmond J. Higham
Article No.: 26
Large, sparse networks that describe complex interactions are a common feature across a number of disciplines, giving rise to many challenging matrix computational tasks. Several random graph models have been proposed that capture key properties...
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves
Timothy A. Davis, William W. Hager
Article No.: 27
The supernodal method for sparse Cholesky factorization represents the factor L as a set of supernodes, each consisting of a contiguous set of columns of L with identical nonzero pattern. A conventional supernode is stored as a dense...
Extra-Precise Iterative Refinement for Overdetermined Least Squares Problems
James Demmel, Yozo Hida, E. Jason Riedy, Xiaoye S. Li
Article No.: 28
We present the algorithm, error bounds, and numerical results for extra-precise iterative refinement applied to overdetermined linear least squares (LLS) problems. We apply our linear system refinement algorithm to Björck’s augmented...
Algorithm 890: Sparco: A Testing Framework for Sparse Reconstruction
Ewout van den Berg, Michael P. Friedlander, Gilles Hennenfent, Felix J. Herrmann, Rayan Saab, Özgür Yilmaz
Article No.: 29
Sparco is a framework for testing and benchmarking algorithms for sparse reconstruction. It includes a large collection of sparse reconstruction problems drawn from the imaging, compressed sensing, and geophysics literature. Sparco is also a...