Matrix-free methods

In computational mathematics, a matrix-free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not store the coefficient matrix explicitly, but accesses the matrix by evaluating matrix-vector products. Such methods can be preferable when the matrix is so big that storing and manipulating it would cost a lot of memory and computer time, even with the use of methods for sparse matrices. Many iterative methods allow for a matrix-free implementation, including:

• the power method,
• the Lanczos algorithm^[1],
• Wiedemann's coordinate recurrence algorithm^[2], and
• the conjugate gradient method^[3].

Distributed solutions have also been explored using coarse-grain parallel software systems to achieve homogeneous solutions of linear systems.^[4].

It is generally used in solving non-linear equations like Euler's equations in Computational Fluid Dynamics. Solving these equations requires the calculation of the jacobian which is costly in terms of CPU time and storage. To avoid this expense, matrix free methods are employed. In order to remove the need to calculate the jacobian, the jacobian vector product is formed instead, which is in fact a vector itself. Manipulating and calculating this vector is easier than working with a large matrix or linear system.

References

• Langville, Amy N.; Meyer, Carl D. (2006), Google's PageRank and beyond: the science of search engine rankings, Princeton University Press, p. 40, ISBN 978-0-691-12202-1 .

1. ^ Coppersmith (1991) 
2. ^ Wiedemann (1986) 
3. ^ LaMacchia; Odlyzko (1991) 
4. ^ Kaltofen, E.; Lobo, A. (1996), "Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields", Algorithmica 24: 311–348, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7470