LINPACK
A collection of Fortran subroutines that analyze and solve linear equations and linear least-squares problems. The package solves linear systems whose matrices are general, banded, symmetric indefinite, symmetric positive definite, triangular, and tridiagonal square. In addition, the package computes the QR and singular value decompositions of rectangular matrices and applies them to least-squares problems.
LUMOD
Updates a dense square factorization L*C = U, when rows and columns of C are added, deleted or replaced.
Matran
Fortran 95 wrapper that implements matrix operations and computes matrix decompositions using Lapack and the Blas.
Parallel Algorithms Project
Codes to solve linear systems with the GMRES and conjugate gradient methods, among other topics.
Parallel LANSO (PLANSO)
Implements a Lanczos iteration for symmetric generalized eigenvalue problems. The current version uses the Omega-recurrence to detect loss of orthogonality among the Lanczos vectors.
RECSY
Library by Isak Jonsson and Bo Kågström for solving triangular Sylvester-type matrix equations.
Software Iterative Methods: GMRESR and BiCGstab(ell)
Fortran 77 subroutines by Henk A. van der Vorst for the iterative methods GMRESR and BiCGstab(ell). These are methods for the iterative solution of large and typically sparse systems of linear equations with a nonsymmetric matrix.
Subroutines for Manipulating Large Systems of Equations
Fortran 90 codes by Matt Newman for Gaussian elimination and forward reduction to solve linear equations, diagonal preconditioned gradient to solve linear equations, and subspace iteration to determine the first p eigenvalues of the generalized eigenvalue problem for a system of size q where q>>p.
Results: Previous 1 2 3
Site
Menu 
