• ShearLab

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

  • Referenced in 60 articles [sw04819]
  • left- and right-singular vectors) for large sparse matrices. The package has been ported ... need to compute large rank approximations to sparse term-document 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...
  • BFSAI-IC

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

  • Referenced in 61 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...
  • GPstuff

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

  • Referenced in 21 articles [sw06454]
  • based algorithms for the problem of sparse approximation in terms of highly coherent, redundant dictionaries...
  • Algorithm 844

  • Referenced in 17 articles [sw04407]
  • Algorithm 844: Computing sparse reduced-rank 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 low-rank approximations. The first, the SPQR, approximation, is a pivoted...
  • SNOPT

  • Referenced in 503 articles [sw02300]
  • available and that the constraint gradients are sparse. We discuss an SQP algorithm that uses ... based on a limited-memory quasi-Newton approximation to the Hessian of the Lagrangian...
  • QUIC

  • Referenced in 23 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...
  • Spinterp

  • Referenced in 37 articles [sw00902]
  • recover or approximate smooth multivariate functions, sparse grids are superior to full grids...
  • 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 1-norm solution to an underdetermined...
  • ADMiRA

  • Referenced in 31 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 low-rank matrix and extending ... algorithm named atomic decomposition for minimum rank approximation (ADMiRA) that extends Needell and Tropp ... noisy measurements and approximately low-rank solution. With a sparse measurement operator...
  • AMD

  • Referenced in 52 articles [sw00039]
  • that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical...
  • 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...
  • FE-gMG

  • Referenced in 8 articles [sw10365]
  • solvers with strong smoothers based on sparse approximate inverses. We describe our FE-gMG solver ... oriented implementation technique based on cascades of sparse matrix-vector 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...
  • MSPAI

  • Referenced in 9 articles [sw11522]
  • efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class ... numerical parts as the code switches to sparse QR decomposition methods wherever profitable. The optimized...
  • SpAMM

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