• CHOLMOD

  • Referenced in 74 articles [sw04412]
  • Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. CHOLMOD is a set of routines ... factorizing sparse symmetric positive definite matrices of the form A or AAT, updating/downdating a sparse ... Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system ... symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level...
  • SuperLU-DIST

  • Referenced in 69 articles [sw00002]
  • through forward and back substitution. The LU factorization routines can handle non-square matrices ... matrix columns may be preordered (before factorization) either through library or user supplied routines. This ... sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided...
  • Rcpp

  • Referenced in 110 articles [sw08385]
  • Dominick Samperi. This code has been factored out of Rcpp into the package RcppClassic...
  • SETHEO

  • Referenced in 107 articles [sw00707]
  • proof procedure is realized as a WAM, factorization, lemma generation and the application of proof...
  • ILUM

  • Referenced in 60 articles [sw07244]
  • preconditioning techniques based on incomplete LU (ILU) factorizations offer a limited degree of parallelism ... polynomial precoditioning or applying the usual ILU factorization to a matrix obtained from a multicolor ... ordering.par We present an incomplete factorization technique based on independent set orderings and multicoloring ... ILUs based on threshold techniques. The ILUM factorization described in this paper is in this...
  • TRON

  • Referenced in 99 articles [sw04714]
  • conjugate gradient method with an incomplete Cholesky factorization to generate a direction, and a projected...
  • DEVEX

  • Referenced in 97 articles [sw08378]
  • process, the author introduces dynamic column weighting factors as a means of estimating gradients...
  • SPADE

  • Referenced in 85 articles [sw02226]
  • outperforms the best previous algorithm by a factor of two, and by an order...
  • ARMS

  • Referenced in 60 articles [sw00048]
  • based on a block incomplete LU factorization. The ARMS is fully recursive and employs ... slower than ILUT and ILUTP (incomplete LU factorization with threshold and with threshold and pivoting...
  • FastSLAM

  • Referenced in 57 articles [sw13538]
  • FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem. The ability to simultaneously ... This algorithm is based on an exact factorization of the posterior into a product...
  • LIPSOL

  • Referenced in 75 articles [sw04712]
  • from two Fortran packages: a sparse Cholesky factorization package developed by Esmond Ng and Barry...
  • Latent GOLD

  • Referenced in 74 articles [sw11673]
  • more traditional latent variable approaches such as factor analysis, structural equation models, and random-effects...
  • TESTPACK

  • Referenced in 73 articles [sw12713]
  • spatial dimensions, parameter values, and difficulty factors...
  • Hull

  • Referenced in 71 articles [sw11670]
  • with a moderate speed penalty. (Typically a factor of 2 or 3 for Delaunay triangulation...
  • LOF

  • Referenced in 71 articles [sw19311]
  • This degree is called the local outlier factor (LOF) of an object. It is local...
  • MA57

  • Referenced in 70 articles [sw00536]
  • facilities, matrix modification, partial solution for matrix factors, solution of multiple right-hand sides...
  • HOPDM

  • Referenced in 69 articles [sw04342]
  • time. HOPDM automatically chooses the most efficient factorization method for a given problem (either normal...
  • SYMMGRP.MAX

  • Referenced in 68 articles [sw10756]
  • determining equations which is free of redundant factors, repetitions and trivial differential consequences...
  • TAUCS

  • Referenced in 29 articles [sw04014]
  • includes the following functionality: Multifrontal Supernodal Cholesky Factorization. This code is quite fast (several times ... uses the BLAS to factor and compute updates from fundamental supernodes, but it does ... relaxed supernodes. Left-Looking Supernodal Cholesky Factorization. Slower than the multifrontal solver but uses less ... memory. Drop-Tolerance Incomplete-Cholesky Factorization. Much slower than the supernodal solvers when it factors...
  • SOM

  • Referenced in 59 articles [sw07375]
  • reports or other feedback. The common factor for us is to have been employed...