Languages
- 3641
- Pipelined phase-rotation FFT
- By David O'Halloran. The Welchel phase-rotation FFT is a new form of the fast Fourier transform (FFT) that replaces data movement at runtime with equivalent multiplications by precomputed constants. The result is an FFT that is easy to pipeline.
- 3642
- Fortran 2003 Interface to OpenGL
- By Anthony Stone and Aleksandar Donev. Also provides an interface to the GLU and GLUT toolkits.
- 3643
- MPLOT
- Package of MATLAB-style-callable routines for plain graphics by Valery E.Grikurov, Professor of Mathematics and Mathematical Physics. RGB color scheme is used (TrueColor mode supported).
- 3645
- FMLIB Multiple precision package
- David Smith's package for multi-precision arithmetic. Unlike most other packages, the components of these large numbers are stored as REALs. This is usually much more efficient than storing them as integers. This is TOMS algorithm 786.
- 3647
- Multiple precision arithmetic
- This is Richard Brent's classic MP package, which was published as TOMS algorithm 524. Contains some features such as the Bernoulli numbers, which are not available in either Smith or Bailey's packages. Dates from 1981.
- 3648
- Expokit
- Software package for computing small dense and large sparse matrix exponentials in Fortran and Matlab. Usable in C/C++.
- 3649
- Fast Hankel and Toeplitz solvers
- In Fortran 90, by the MaSe (Matrices Having Structure) Team of the University of Leuven.
- 3650
- LAPACK
- Fortran 77 routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems.
- 3652
- LGSOLV
- Modification of known Gauss method for pivot element elimination that uses internal rows-transposition-vector and works with matrix strictly "col-by-col". The algorithm factorizes the source matrix so that created factor-matrix may be used several times for quick solution of linear systems with many right hand sides.
- 3653
- 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.
- 3654
- Lapack BLAS Fortran Windows Win32 download
- Binaries compiled with Intel Fortran 9.0, links to LAPACK source code, and make file to create binaries. By David Svoboda.
- 3655
- Matran
- Fortran 95 wrapper that implements matrix operations and computes matrix decompositions using Lapack and the Blas.
- 3658
- 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.
- 3659
- 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.
- 3660
- 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).