Languages
- 3641
- Matran
- Fortran 95 wrapper that implements matrix operations and computes matrix decompositions using Lapack and the Blas.
- 3644
- BILUM
- Code by Yousef Saad and Jun Zhang to solve general sparse linear systems by using Krylov subspace methods preconditioned by some multi-level block ILU (BILUM) preconditioning techniques.
- 3645
- MUMPS: A Multifrontal Massively Parallel Sparse Direct Solver
- Fortran 90 package for solving linear systems of equations of the form A*x = b, where the matrix A is sparse and can be either unsymmetric, symmetric positive definite, or general symmetric. Released in the public domain. Includes documentation, related publications, and an FAQ.
- 3646
- OptimQR
- The optimqr program will read a description of the sparsity pattern of some system matrix for system of linear equations. It will then apply heuristic branch and bound search to find a near-optimal ordering of the rows and columns of the system matrix. The ordering is written to disk. The codegen.pl program can then read the system ordering, and create a solver written in Fortran 77, that will solve the system using sparse QR factorization (using Givens rotations).
- 3647
- PROPACK
- Software by Rasmus Munk Larsen for large and sparse SVD calculations, with versions in Fortran and Matlab.
- 3649
- SVDPACK
- Comprised of four numerical (iterative) methods for computing the singular value decomposition (SVD) of large sparse matrices using double precision Fortran 77.
- 3650
- Systems Optimization Laboratory
- Code for sparse linear equations (symmetric or general) and sparse least squares, and updating a dense square factorization L C = U.
- 3651
- Y12m
- Fortran 77 code that solves sparse systems of linear algebraic equations by Gaussian elimination.
- 3652
- CirCut
- Fortran 90 package for finding approximate solutions of certain binary quadratic programs, currently including the Max-Cut and the Max-Bisection problems.
- 3653
- Fortran 95 Codes for Convex Network Optimization
- Modules for random number generation, plotting, sorting, ranking, combinatorics, network optimization, and optimization. Written in FWEB by Aleksandar Donev.
- 3654
- Linear Programming
- Ratfor code for the primal-dual log barrier form of the interior point LP solver of Lustig, Marsten and Shanno, ORSA J Opt 1992.
- 3655
- Minpack
- Fortran 77 code for solving nonlinear equations and nonlinear least squares problems. Five algorithmic paths each include a core subroutine and an easy-to-use driver. The algorithms proceed either from an analytic specification of the Jacobian matrix or directly from the problem functions.
- 3657
- Quadratic Assignment Problem Library (QAPLIB)
- By R.E. Burkard, E. Çela, S.E. Karisch and F. Rendl.
- 3658
- SUBPLEX
- Subspace-searching simplex method for the unconstrained optimization of general multivariate functions, generalizing the Nelder-Mead simplex method.
- 3659
- Stanford Business Software
- Sells Fortran 77 optimization codes MINOS (linear programming and nonlinear optimization), SNOPT (large-scale quadratic and nonlinear programming), NPSOL (nonlinear programming), LSSOL (Linearly constrained linear least squares problems and convex quadratic programming), and QPOPT (linear and quadratic programming).