Contents
- Computer Algebra
- Ordinary Differential Equation Problems
- Eigenvalues and Eigenvectors of Real Symmetric Matrices
- Eigenvalues and Eigenvectors of Real General Matrices
- Eigenvalues and Eigenvectors of Hermitian Matrices
- Random Numbers
- Simple Functions
- Sorting
- Linear Programming ie minimization of a linear function subject to linear constraints
- Solution of Linear Equations, also inverses and determinants
- Computations with Matrices and Vectors
- Solution of Complex Linear Equations and other calculations for complex matrices
- Computations with Complex Matrices and Vectors
- Iterative Methods for Sparse Matrices
- MPI Dependent Packages
- Solution of Systems of Nonlinear Equations in Several Unknowns
- Input and output aids
- Zero's of Polynomials
- Estimation of derivatives by finite differences
- Optimization and Non Linear Data Fitting
- Minimization of a General Function Subject to Linear Constraints
- Minimization of a General Function Subject to Nonlinear Constraints
- Minimization of Function of Integer Variables
- Test Program Generator
- Timing, Machine Constants etc.
- Computer Algebra
- HSL_AD02: Automatic differentiation
- Ordinary Differential Equation Problems
- HSL_DC05: Ordinary differential equations or differential algebraic equations of index 1
- DD14: Two-point boundary-value ordinary differential equation
- Eigenvalues and Eigenvectors of Real Symmetric Matrices
- EA16: Compute selected eigenpairs using rational Lanczos method
- HSL_EA19: Sparse symmetric or Hermitian: leftmost eigenpairs NEW!
- EA22: Sparse symmetric: simultaneous iteration
- EA23: Full symmetric: Jacobi's method
- EA25: Sparse symmetric: Lanczos for the spectrum
- Eigenvalues and Eigenvectors of Real General Matrices
- EB13: Sparse unsymmetrical: Arnoldi's method
- EB22: Sparse unsymmetrical: subspace iteration
- Eigenvalues and Eigenvectors of Hermitian Matrices
- EC23: Full Hermitian matrix: classical Jacobi's method
- EP25: Sparse symmetric: Lanczos for the spectrum
- Random Numbers
- FA14: Uniform distribution
- HSL_FA14: Uniform distribution
- Simple Functions
- FD15: Real-valued machine constants
- Sorting
- KB05: Sort numbers into ascending order using Quicksort
- KB06: Sort numbers into descending order using Quicksort
- KB07: Sort numbers into ascending order with indexing using Quicksort
- KB08: Sort numbers into descending order with indexing using Quicksort
- HSL_KB22: Sorting reals using the Heapsort method NEW!
- Linear Programming ie minimization of a linear function subject to linear constraints
- LA04: Sparse linear programming: steepest-edge simplex method
- LA15: Sparse mathematical programming bases: factorize and update
- Solution of Linear Equations, also inverses and determinants
- MA38: Sparse unsymmetric: multifrontal method
- MA41: Sparse unsymmetric system: multifrontal method
- MA42: Sparse unsymmetric system: out-of-core frontal method
- HSL_MA42: Sparse unsymmetric system: out-of-core frontal method
- HSL_MA42_ELEMENT: Unsymmetric finite-element system: out-of-core frontal method (real and complex)
- MA43: Sparse unsymmetric system: row-by-row frontal method
- MA44: Over-determined linear system: least-squares solution
- MA46: Sparse unsymmetric finite-element systems: multifrontal
- MA48: Sparse unsymmetric: driver for conventional direct method
- HSL_MA48: Sparse unsymmetric: driver for conventional direct method
- MA49: Sparse over-determined: least squares by QR
- MA50: Sparse unsymmetric: conventional direct method
- MA51: Auxiliary for MA48 and MA50: identify ignored rows or columns in the rectangular or rank-deficient case
- MA52: Sparse unsymmetric finite-element system: out-of-core multiple front method
- HSL_MA54: Kernel code for HSL_MA77 (definite case) NEW!
- HSL_MA55: Band symmetric positive-definite system
- MA57: Sparse symmetric: multifrontal method
- HSL_MA57: Sparse symmetric: multifrontal method
- MA60: Iterative refinement and error estimation
- MA61: Sparse symmetric positive-definite: incomplete factorization
- MA62: Sparse symmetric finite-element equations; out-of-core frontal method
- HSL_MA64: Kernel code for HSL_MA77 (indefinite case) Coming soon!
- MA65: Solution of unsymmetric banded system of linear equations
- MA67: Sparse symmetric, zeros on diagonal: blocked conventional
- MA69: Unsymmetric system whose leading subsystem is easy to solve
- HSL_MA69: Unsymmetric system whose leading subsystem is easy to solve
- MA72: Sparse symmetric finite-element equations: out-of-core multiple
- HSL_MA74: Kernel code for HSL_MA78 NEW!
- MA75: Sparse over-determined system: weighted least squares
- HSL_MA77: Sparse symmetric system: multifrontal out of core NEW!
- HSL_MA78: Sparse unsymmetric system: multifrontal out of core NEW!
- Computations with Matrices and Vectors
- MC13: Permute a sparse matrix to block triangular form
- MC21: Permute a sparse matrix to put entries on the diagonal
- MC22: Permute a sparse matrix given row and column permutations
- MC25: Permute a sparse matrix to block triangular form
- MC26: Sparse rectangular matrix: compute normal matrix
- MC29: Sparse unsymmetric matrix: calculate scaling factors
- MC30: Sparse symmetric matrix: calculate scaling factors
- MC33: Sparse unsymmetric: permute to bordered block triangular form
- MC34: Sparse symmetric structure: expand from lower triangle
- MC37: Sparse symmetric matrix: represent as a sum of element matrices
- MC38: Sparse rectangular matrix held by columns: transpose
- MC44: Unassembled finite-element matrix: find supervariales
- MC46: Sparse rectangular matrix held by rows: transpose
- MC47: Sparse symmetric pattern: approximate minimum-degree ordering
- MC53: Generate an ordering for finite-element matrices within a subdomain
- MC54: Write a sparse matrix in Rutherford-Boeing format
- MC55: Write a supplementary file in Rutherford-Boeing format
- MC56: Read a file or supplementary file held in Rutherford-Boeing format
- MC57: Assemble a set of finite-element matrices
- MC58: Estimate rank and find independent rows/columns of a sparse unsymmetric or rectangular matrix Coming soon!
- MC59: Sort a sparse matrix to an ordering by columns
- MC60: Symmetric sparsity pattern: reduce the profile and wavefront
- MC61: Straightforward interface to MC60
- MC62: Generate a row ordering for a row-by-row frontal solver
- MC63: Generate an element assembly ordering for a frontal solver
- MC64: Find permutation that place large entries on the diagonal
- HSL_MC64: Permute and scale a sparse unsymmetric or rectangular matrix to put large entries on the diagonal NEW!
- HSL_MC65: Construct and manipulate matrices in compressed sparse row format
- HSL_MC66: Order unsymmetric matrix into singly bordered block diagonal form
- MC67: Refine a profile-reducing permutation of a symmetric matrix
- HSL_MC68 Symmetric sparse matrix: compute elimination orderings NEW!
- MC71: Unsymmetric matrix: estimate 1-norm
- MC72 Full unsymmetric matrix: calculate scaling factors
- HSL_MC73: Sparse symmetric matrix: compute Fielder vector and permute to reduce the profile and wavefront
- MC75: Sparse unsymmetric matrix: estimate condition number
- MC77: Sparse unsymmetric matrix: calculate scaling factors
- Solution of Complex Linear Equations and other calculations for complex matrices
- ME22: Permute a sparse matrix given row and column permutations
- ME38: Sparse unsymmetric: multifrontal method
- ME42: Sparse unsymmetric system: out-of-core frontal method
- ME43: Sparse unsymmetric system: row-by-row frontal method
- ME48: Sparse unsymmetric: driver for conventional direct method
- ME50: Sparse unsymmetric: conventional direct method
- ME57: Sparse symmetric system: multifrontal method
- ME62: Sparse Hermitian or complex symmetric finite-element system: out-of-core frontal method
- Computations with Complex Matrices and Vectors
- MF29: Sparse unsymmetric matrix: calculate scaling factors
- MF30: Sparse symmetric matrix: calculate scaling factors
- MF64: Permute and scale a sparse complex unsymmetric matrix to put large entries on the diagonal NEW!
- MF71: Unsymmetric matrix: estimate 1-norm
- Iterative Methods for Sparse Matrices
- HSL_MI02: Symmetric possibly-indefinite system: SYMMBK method
- MI11: Unsymmetric system: incomplete LU factorization
- MI12: Unsymmetric system: approximate-inverse preconditioner
- HSL_MI13: Preconditioners for saddle point systems NEW!
- MI15 Unsymmetric system: flexible GMRES NEW!
- HSL_MI20 Unsymmetric system: algebraic multigrid NEW!
- MI21: Symmetric positive-definite system: conjugate gradient method
- MI23: Unsymmetric system: CGS (conjugate gradient squared) method
- MI24: Unsymmetric system: GMRES (generalized minimal residual) method
- MI25: Unsymmetric system: BiCG (BiConjugate Gradient) method
- MI26: Unsymmetric system: BiCGStab (BiConjugate Gradient Stabilized) method
- HSL_MI31: Symmetric positive-definite system: conjugate gradient method, stopping according to the A-norm of the error
- MPI Dependent Packages
- HSL_MP42: Unsymmetric finite-element system: multiple-front method, element entry
- HSL_MP43: Sparse unsymmetric finite-element system: multiple-front method, equation entry
- HSL_MP48: Sparse unsymmetric system: parallel direct method
- HSL_MP62: Symmetric finite-element system: multiple-front method
- Solution of Systems of Nonlinear Equations in Several Unknowns
- NS12: Sparse nonlinear equations: Powell dog-leg algorithm
- NS23: Sparse nonlinear over-determined equations: Marquardt method
- Input and output aids
- HSL_OF01: Fortran virtual memory NEW!
- Zero's of Polynomials
- PA16: Complex coefficients: all roots by the method of Madsen and Reid
- PA17: Real coefficients: all roots by the method of Madsen and Reid
- Estimation of derivatives by finite differences
- TD22: Approximate Jacobian matrix using finite differences
- Optimization and Non Linear Data Fitting
- VA08: Minimize a function of several variables: Fletcher-Reeves method
- V34: Minimize a function of a huge number of variables: conjugate gradients
- VA35: Minimize a function of many variables: limited-memory BFGS method
- Minimization of a General Function Subject to Linear Constraints
- VE08: Minimize a sum of finite-element functions
- VE10: Minimize a sum of squares of element functions
- HSL_VE12: Quadratic programming problem: interior-point trust-region method
- HSL_VE13: Constrained least distance problem:interior-point trust-region method
- HSL_VE15: Quadratic programming: reorder the problem
- HSL_VE19: Quadratic programming problem: working-set method
- VE24: Quadratic programming problem within a region defined by simple bounds
- Minimization of a General Function Subject to Nonlinear Constraints
- HSL_VF05: Approximate minimization of sparse quadratic function with norm constraint
- HSL_VF06: Global minimization of a sparse quadratic function with norm constraint
- Minimization of Function of Integer Variables
- HSL_VH01: Genetic algorithm for the smallest value of a function of binary variables
- Test Program Generator
- YM11: Generate a random sparse matrix
- Timing, Machine Constants etc.
- ZA02: CPU time
- HSL_ZA03: Kind values for 1- and 2-byte Fortran 90 logicals ZD Derived types
- HSL_ZB01: Reallocate an array NEW!
- HSL_ZD01: Derived type for a variety of sparse matrix storage schemes
- HSL_ZD02: Derived type for quadratic programming
- HSL_ZD11: Derived type for sparse matrix storage schemes NEW!