Sparse matrix
From Encyclopedia of Mathematics
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
A matrix with a small number of non-zero entries. Systems of linear equations with such matrices occur, in particular, in approximating differential equations by finite differences or variational-differences equations (cf. Approximation of a differential equation by difference equations).
Comments
Sparseness of a matrix is a property that can be advantageously exploited in numerical linear algebra, cf. [a1] for a survey.
References
[a1] | Z. Zlatev, "Iterative improvement of direct solutions of large and sparse problems" , Kluwer (1991) (Translated from Russian) |
How to Cite This Entry:
Sparse matrix. N.S. Bakhvalov (originator), Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Sparse_matrix&oldid=11250
Sparse matrix. N.S. Bakhvalov (originator), Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Sparse_matrix&oldid=11250
This text originally appeared in Encyclopedia of Mathematics - ISBN 1402006098