
ShearLab
 Referenced in 49 articles
[sw06721]
 which have been proposed to deliver sparse approximations of such features is the utilization...

svdpack
 Referenced in 60 articles
[sw04819]
 left and rightsingular vectors) for large sparse matrices. The package has been ported ... need to compute large rank approximations to sparse termdocument matrices from information retrieval applications...

ParaSails
 Referenced in 27 articles
[sw11521]
 ParaSails is a parallel sparse approximate inverse preconditioner for the iterative solution of large, sparse ... Frobenius norm) minimization to compute a sparse approximate inverse. The sparsity pattern used...

BFSAIIC
 Referenced in 24 articles
[sw12938]
 matrices. It combines a generalized factored sparse approximate inverse (FSAI) with an incomplete...

SparsePOP
 Referenced in 60 articles
[sw04331]
 implementation of the sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution ... proposed by Waki et al. [2006]. The sparse SDP relaxation exploits a sparse structure ... Lasserre [2006]. The efficiency of SparsePOP to approximate optimal solutions of POPs is thus increased...

Algorithm 844
 Referenced in 17 articles
[sw04407]
 Algorithm 844: Computing sparse reducedrank approximations to sparse matrices In many applications  latent semantic ... obtain a reduced rank approximation to a sparse matrix A. Unfortunately, the approximations based ... decompositions, are not in general sparse. {it G. W. Stewart} [Numer. Math ... obtain two kinds of lowrank approximations. The first, the SPQR, approximation, is a pivoted...

GPstuff
 Referenced in 20 articles
[sw12867]
 include, among others, various inference methods, sparse approximations and model assessment methods. The GPstuff toolbox...

BLOOMP
 Referenced in 20 articles
[sw06454]
 based algorithms for the problem of sparse approximation in terms of highly coherent, redundant dictionaries...

SNOPT
 Referenced in 492 articles
[sw02300]
 available and that the constraint gradients are sparse. We discuss an SQP algorithm that uses ... based on a limitedmemory quasiNewton approximation to the Hessian of the Lagrangian...

ParNes
 Referenced in 12 articles
[sw08366]
 accurate recovery of sparse and approximately sparse signals In this article, we propose an algorithm ... basis pursuit denoising (bpdn) problem (i.e., approximating the minimum 1norm solution to an underdetermined...

Spinterp
 Referenced in 34 articles
[sw00902]
 recover or approximate smooth multivariate functions, sparse grids are superior to full grids...

QUIC
 Referenced in 19 articles
[sw11795]
 QUIC: quadratic approximation for sparse inverse covariance estimation. The ℓ 1 regularized Gaussian maximum likelihood ... have strong statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying ... quadratic approximation, but with some modifications that leverage the structure of the sparse Gaussian...

Algorithm 769
 Referenced in 15 articles
[sw13886]
 Algorithm 769: Fortran subroutine for approximate solution of sparse quadratic assignment problem using GRASP ... describe Fortran subroutines for finding approximate solutions of sparse instances of the quadratic assignment problem...

FSAIPACK
 Referenced in 12 articles
[sw14000]
 high performance FSAI preconditioning. The Factorized Sparse Approximate Inverse (FSAI) is an efficient technique ... preconditioning parallel solvers of symmetric positive definite sparse linear systems. The key factor controlling FSAI...

ADMiRA
 Referenced in 27 articles
[sw31664]
 minimum rank solution satisfying a prescribed data approximation bound. We propose an atomic decomposition providing ... analogy between parsimonious representations of a sparse vector and a lowrank matrix and extending ... algorithm named atomic decomposition for minimum rank approximation (ADMiRA) that extends Needell and Tropp ... noisy measurements and approximately lowrank solution. With a sparse measurement operator...

AMD
 Referenced in 51 articles
[sw00039]
 that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical...

FEgMG
 Referenced in 8 articles
[sw10365]
 solvers with strong smoothers based on sparse approximate inverses. We describe our FEgMG solver ... oriented implementation technique based on cascades of sparse matrixvector multiplication by applying ... strong smoothers. In particular, we employ Sparse Approximate Inverse (SPAI) and Stabilised Approximate Inverse (SAINV...

WORHP
 Referenced in 15 articles
[sw10824]
 Shanno (BFGS) update techniques for Hessian approximations, and sparse linear algebra. Furthermore it is based...

SpAMM
 Referenced in 6 articles
[sw12769]
 optimized sparse approximate matrix multiply for matrices with decay. We present an optimized singleprecision ... implementation of the sparse approximate matrix multiply (SpAMM) [M. Challacombe and N. Bock, “Fast multiplication...

COLAMD
 Referenced in 28 articles
[sw00145]
 SYMAMD, that compute approximate minimum degree orderings for sparse matrices in two contexts: (1) sparse...