๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational methods for sparse matrices

โœ Scribed by C.M.M. Nex

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
371 KB
Volume
20
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper is a survey of methods currently available for processing sparse matrices in a digital computer; specifically in the solution of linear algebraic equations and the eigenproblem.

๐Ÿ“œ SIMILAR VOLUMES

Computing with sparse matrices
Computing with sparse matrices
โœ T. S. Chow; J. S. Kowalik ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 866 KB
Computing permanents via determinants fo
Computing permanents via determinants for some classes of sparse matrices
โœ Giovanni Resta; Giovanni Sburlati ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

Starting from recent formulas for calculating the permanents of some sparse circulant matrices, we obtain more general formulas expressing the permanents of a wider class of matrices as a linear combination of appropriate determinants.

Efficient computation of the exponential
Efficient computation of the exponential operator for large, sparse, symmetric matrices
โœ Luca Bergamaschi; Marco Vianello ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 261 KB ๐Ÿ‘ 2 views

In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretizatio