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

Computing with sparse matrices

โœ Scribed by T. S. Chow; J. S. Kowalik


Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
866 KB
Volume
7
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Computational methods for sparse matrice
โœ C.M.M. Nex ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

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.

Computing permanents via determinants fo
โœ 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.

Sparse orthogonal matrices
โœ Gi-Sang Cheon; Suk-Geun Hwang; Seog-Hoon Rim; Bryan L. Shader; Seok-Zun Song ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

The minimum number of nonzero entries in an n by n orthogonal matrix which has a column of nonzeros is known to be In this note the sparsity of orthogonal matrices which have both a column and a row of nonzeros is studied. For each integer n 2 we construct an n by n orthogonal matrix which has both

Local inversion of matrices with sparse
โœ Charles R. Johnson; Michael Lundquist ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 274 KB

We demonstrate that subject to certain regularity conditions any invertible matrix whose inverse is subordinate to a chordal graph G may be inverted via a simple formula involving only the inverses of its principal submatrices corresponding to the maximal cliques and minimal vertex separators of the