|
|
Sparse
| University of Florida Sparse Matrix Collection
|
Update Link / Bad Link? |
|
The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry: structural engineering, computational fluid dynamics, model reduction, electromagnetics, semiconductor devices, thermodynamics, materials, acoustics, computer graphics/vision, robotics/kinematics, and other discretizations; and those that typically do not have such geometry: optimization, circuit simulation, networks and graphs (including web connectivity matrices), economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, and power networks. As of March 2007, the collection contains 1840 sparse matrix problems (about 8GB total, as *.mat files).
Matrices such as these are crucial for the development and testing of sparse matrix algorithms (randomly generated sparse matrix are almost completely useless, resulting in misleading performance results).
With the easy-to-use UFget interface, the MATLAB statement "UFget(matrixname)" downloads the matrix (if not already downloaded), caches it locally, and loads it into the MATLAB workspace.
Submitted Mar 09, 2007
by Tim Davis
Updated Mar 12, 2007
Rating:
(8 Ratings)
Rate this link
Total Visits: 1164
|
| Iterative Methods for Linear Systems
|
Update Link / Bad Link? |
|
Scripts for solving non-symmetric systems of linear equations iteratively with the Conjugate
Gradient on Normal Equations method, and the Bi-Conjugate Gradient method. Octave and MATLAB sources included.
Rating:
(6 Ratings)
Rate this link
Total Visits: 746
|
| speig.m
|
Update Link / Bad Link? |
|
This is not speig.m from MATLAB 5. Rather, it is a script to give partial solutions to the general, symmetric eigenvalue problem [K]{phi} = lambda [M]{phi} for sparse [K] and [M].
- gives a few solutions near a user provided shift value. - [K] and [M] must be symmetric, positive semi-definite.
Submitted Jul 19, 1999
Rating:
(4 Ratings)
Rate this link
Total Visits: 403
|
| SuiteSparse: UMFPACK, CHOLMOD, and many other MATLAB built-in functions
|
Update Link / Bad Link? |
|
SuiteSparse is a suite of sparse matrix packages, many of which are used in MATLAB (x=A\b, lu, chol, ordering methods, and more). SuiteSparse contains additional features not available in MATLAB (such as a sparse cholupdate, and the ability to read/write sparse matrices in various file formats (Matrix Market and Rutherford/Boeing), for example).
Submitted Jul 29, 2006
by Tim Davis
Updated Dec 04, 2006
by Tim Davis
Rating:
(3 Ratings)
Rate this link
Total Visits: 374
|
| Sparse matrix converter
|
Update Link / Bad Link? |
|
The BeBOP Sparse Matrix Converter is a library and standalone utility, written in portable ANSI C, for converting between various file formats for sparse matrices. Harwell-Boeing, MatrixMarket and Matlab ASCII format are supported. The Sparse Matrix Converter is distributed under a BSD license.
Submitted Feb 24, 2006
by Mark Hoemmen
Updated Mar 01, 2006
Rating:
(9 Ratings)
Rate this link
Total Visits: 345
|
| Expokit
|
Update Link / Bad Link? |
|
Expokit, the matrix exponential package, computes w(t) = exp(t*A)v for large/sparse
matrices.
Submitted Jul 01, 1999
Rating:
N/A
Rate this link
Total Visits: 330
|
| Video seminar : Direct methods for sparse linear systems : the MATLAB sparse backslash
|
Update Link / Bad Link? |
|
This presentation was given as a plenary talk at the SIAM 2006 Annual Meeting. It describes how x=A\b works when A is sparse.
Submitted Sep 16, 2006
by Tim Davis
Updated Sep 18, 2006
Rating:
(4 Ratings)
Rate this link
Total Visits: 243
|
| Terms of Use: |
|
| NOTICE: Links you submit to Mathtools.net Link Exchange will
be accessible from any part of the world via the web. Any information such
links contain may be used by The MathWorks and the public, both within
and outside the country from which you posted. Read
complete disclaimer prior to use. |
|