• # CSparse

• Referenced in 185 articles [sw20382]
• Direct methods for sparse linear systems. Computational scientists often encounter problems requiring the solution ... found in sparse matrix software libraries. Here, Davis presents the fundamentals of sparse matrix algorithms ... book includes CSparse, a concise downloadable sparse matrix package that illustrates the algorithms and theorems ... programming language, Direct Methods for Sparse Linear Systems equips readers with the working knowledge required...
• # ODEPACK

• Referenced in 160 articles [sw08341]
• solvers use general sparse matrix solvers for the linear systems that arise. Two others ... iterative (preconditioned Krylov) methods instead of direct methods for these linear systems. The most recent ... LSODIS, which solves implicit problems with general sparse treatment of all matrices involved...
• # HSL_MA77

• Referenced in 15 articles [sw13924]
• core sparse Cholesky solver. Direct methods for solving large sparse linear systems of equations ... first release of a new symmetric direct solver that aims to circumvent this limitation...
• # CONOPT

• Referenced in 162 articles [sw02791]
• solving large-scale nonlinear programs involving sparse nonlinear constraints. The paper will discuss strategic ... algorithm with the popular methods based on sequential linearized subproblems forms the basis for discussions ... code: basis factorizations, search directions, line-searches, and Newton iterations. The paper contains performance statistics...
• # flare

• Referenced in 17 articles [sw12406]
• estimating high dimensional sparse linear model. We adopt the alternating direction method of multipliers ... adopted for further acceleration. Besides the sparse linear model estimation, we also provide the extension...
• # BILUM

• Referenced in 47 articles [sw04015]
• solving general sparse linear systems by using Krylov subspace methods preconditioned by some multi-level ... those of grid-independent convergence of multigrid methods. The multi-level algorithms implemented by BILUM ... small enough to be solved by a direct method or a preconditioned iterative method...
• # DSCPACK

• Referenced in 8 articles [sw12615]
• used to solve sparse linear systems using direct methods on multiprocessors and networks-of-workstations ... where the coefficient matrix is symmetric and sparse. This solver is written...
• # QRUP

• Referenced in 3 articles [sw04458]
• this respect they adapt the sparse direct methodology of Å. Björck [Numer. Math ... Oreborn [A direct method for sparse nonnegative least squares problems, Lic. Thesis, Dept. Math., Linköping...
• # Amesos2

• Referenced in 9 articles [sw18349]
• Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2 ... project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers ... common interface to many different sparse matrix factorization codes, and can handle any implementation...
• # NSPCG

• Referenced in 30 articles [sw00636]
• computers.\parSince the vectorizability of an iterative method depends greatly on the matrix structure, NSPCG ... several different matrix data storage schemes. These sparse data formats allow matrices with a wide ... unstructured sparse matrices. Alternatively, the package allows the user to call the accelerators directly with ... basic preconditioners that are available are point methods such as Jacobi, incomplete $LU$ decomposition...
• # DQGMRES

• Referenced in 13 articles [sw02177]
• DQGMRES: a direct quasi-minimal residual algorithm based on incomplete orthogonalization ... truncated version of the GMRES method for solving large sparse systems of linear algebraic equations...
• # QPOPT

• Referenced in 17 articles [sw07859]
• reduced Hessian to obtain search directions. The method is most efficient when many constraints ... solution. QPOPT is not intended for large sparse problems, but there is no fixed limit...