• DEVEX

  • Referenced in 100 articles [sw08378]
  • methods of the devex LP code. Pivot column and row selection methods used ... gradient column. The consequent effect of this column selection on rounding error is observed ... computer would imply, a wider choice of pivot row is made available, so making room...
  • SuiteSparseQR

  • Referenced in 45 articles [sw07348]
  • advantage of not requiring column pivoting and thus does not interfere with the fill-reducing...
  • SuperLU

  • Referenced in 196 articles [sw00930]
  • will perform an LU decomposition with partial pivoting and triangular system solves through forward ... performed only for square matrices. The matrix columns may be preordered (before factorization) either through...
  • COLAMD

  • Referenced in 33 articles [sw00145]
  • contexts: (1) sparse partial pivoting, which requires a sparsity preserving column pre-ordering prior...
  • ABDPACK

  • Referenced in 15 articles [sw01221]
  • based on an alternate column and row pivoting scheme which avoids most of the fill...
  • SuperLU-DIST

  • Referenced in 94 articles [sw00002]
  • will perform an LU decomposition with partial pivoting and triangular system solves through forward ... performed only for square matrices. The matrix columns may be preordered (before factorization) either through...
  • HPL

  • Referenced in 10 articles [sw21404]
  • depths - Recursive panel factorization with pivot search and column broadcast combined - Various virtual panel broadcast...
  • randUTV

  • Referenced in 4 articles [sw30518]
  • also demonstrate that in comparison to column-pivoted QR, which is another factorization that...
  • Algorithm 977

  • Referenced in 3 articles [sw25562]
  • with column (or complete row and column) pivoting, also already available in LAPACK as xGEQP3...
  • ILUCP

  • Referenced in 3 articles [sw20260]
  • formulation of Gaussian elimination with pivoting by columns. It is usually faster than ILUTP, which ... delayed update version of Gaussian elimination with pivoting, but requires more memory. For applications where...
  • Algorithm 844

  • Referenced in 18 articles [sw04407]
  • first, the SPQR, approximation, is a pivoted, $Q$-less QR approximation of the form $(XR11 ... where $X$ consists of columns of $A$. The second, the SCR approximation...
  • TAUCS

  • Referenced in 32 articles [sw04014]
  • approach with row lists. LDL^T Factorization. Column-based left-looking with row lists ... Core Sparse LU with Partial Pivoting Factor and Solve. Can solve huge unsymmetric linear systems ... line per nonzero, specifying the row, column, and value. Also routines to read matrices...
  • ILU++

  • Referenced in 9 articles [sw20261]
  • columns prior to factorisation to make the matrix more suitable for LU-factorisation), different pivoting...
  • AMD

  • Referenced in 61 articles [sw00039]
  • Algorithm 837: AMD is a set of routines...
  • ATLAS

  • Referenced in 199 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • BPMPD

  • Referenced in 41 articles [sw00088]
  • BPMPD is a state-of-the-art implementation...
  • HSL

  • Referenced in 284 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • LAPACK

  • Referenced in 1713 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LSQR

  • Referenced in 410 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...
  • MA48

  • Referenced in 27 articles [sw00535]
  • The design of MA48: A code for the...