• SINGULAR

  • Referenced in 1523 articles [sw00866]
  • Mora’s Tangent Cone algorithm. Furthermore, it provides polynomial factorizations, resultant, characteristic...
  • mctoolbox

  • Referenced in 1521 articles [sw04827]
  • functions for constructing test matrices, computing matrix factorizations, visualizing matrices, and carrying out direct search ... book Accuracy and Stability of Numerical Algorithms (SIAM, Second edition, August...
  • TensorToolbox

  • Referenced in 186 articles [sw04185]
  • Efficient MATLAB computations with sparse and factored tensors. The term tensor refers simply ... those typical to tensor decomposition algorithms. Second, we study factored tensors, which have the property...
  • SDPLR

  • Referenced in 148 articles [sw04745]
  • first-order algorithm that is based on the idea of low-rank factorization. A specialized ... Lovasz Theta SDP. The details of the algorithm used by SDPLR can be found ... Nonlinear Programming Algorithm for Semidefinite Programs via Low-rank Factorization” written by S. Burer...
  • SPADE

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

  • Referenced in 329 articles [sw08225]
  • method is a combination of the CGS algorithm (a “squared” conjugate gradient method) with ... preconditioning called ILLU (an incomplete line-LU-factorization). The conclusion of the author is that...
  • LAPACK

  • Referenced in 1713 articles [sw00503]
  • computations such as reordering of the Schur factorizations and estimating condition numbers. Dense and banded ... LAPACK addresses this problem by reorganizing the algorithms to use block matrix operations, such...
  • CHOLMOD

  • Referenced in 115 articles [sw04412]
  • Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. CHOLMOD is a set of routines...
  • ARPACK

  • Referenced in 848 articles [sw04218]
  • operations. This software is based upon an algorithmic variant of the Arnoldi process called ... problems. For many standard problems, a matrix factorization is not required. Only the action...
  • FastSLAM

  • Referenced in 63 articles [sw13538]
  • FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem. The ability to simultaneously ... present in real environments. Kalman filter-based algorithms, for example, require time quadratic ... This algorithm is based on an exact factorization of the posterior into a product ... distribution over robot paths. The algorithm has been run successfully on as many...
  • LZ77

  • Referenced in 19 articles [sw32964]
  • LZ77 factorization algorithms: This webpage is devoted to algorithms computing Lempel-Ziv factorization (also known ... parsing). We present C++ implementations of different algorithms varying in speed and space consumption...
  • KLU

  • Referenced in 16 articles [sw06365]
  • Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems. KLU is a software ... Gilbert/Peierls’ sparse left-looking LU factorization algorithm to factorize each block. The package is written...
  • Berlekamp Zassenhaus

  • Referenced in 9 articles [sw28596]
  • Factorization Algorithm of Berlekamp and Zassenhaus. We formalize the Berlekamp-Zassenhaus algorithm for factoring square ... formalization of Yun’s square-free factorization algorithm to integer polynomials, and thus provide ... efficient and certified factorization algorithm for arbitrary univariate polynomials. The algorithm first performs a factorization ... Through experiments we verify that our algorithm factors polynomials of degree 100 within seconds...
  • CALU

  • Referenced in 11 articles [sw06433]
  • CALU: A communication optimal LU factorization algorithm The authors discussed CALU, a communication avoiding ... factorization algorithm. The main part of the paper focuses on showing that CALU is stable ... CALU and upper bounds of the growth factor of CALU. Experimental results for random matrices ... like factorization are discussed. In Section 5 parallel and sequential CALU algorithms and their performance...
  • AMD

  • Referenced in 61 articles [sw00039]
  • minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions...
  • dbscan

  • Referenced in 13 articles [sw16291]
  • algorithms and the LOF (local outlier factor) algorithm. The implementations uses the kd-tree data...
  • RRQR

  • Referenced in 22 articles [sw04673]
  • Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices. This article describes ... efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly ... strategy and improved versions of the RRQR algorithms for triangular matrices orginally suggersted by Chandrasekaran...
  • CONOPT

  • Referenced in 172 articles [sw02791]
  • verbal and intuitive comparison of the GRG algorithm with the popular methods based on sequential ... critical components in a GRG code: basis factorizations, search directions, line-searches, and Newton iterations...
  • toms/782

  • Referenced in 22 articles [sw05211]
  • Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices. This article describes ... drivers for computing rank-revealing QR (RRQR) factorizations of dense matrices [cf. the authors paper ... efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly ... improved versions of the RRQR algorithms for triangular matrices originally suggested by {it S. Chandrasekaran...
  • FDL3DI

  • Referenced in 54 articles [sw24948]
  • High-Order Schemes for Navier-Stokes Equations: Algorithm and Implementation Into FDL3DI. A spectrum ... coupling the approximately-factored procedure with these compact-difference based algorithms and by incorporating...