✦ LIBER ✦

On computing the inverse of a sparse matrix

✍ Scribed by H. Niessner; K. Reichert

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 697 KB
Volume: 19
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620191009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient computation of sparse approxim

Efficient computation of sparse approximate inverses

✍ Thomas K. Huckle 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 2 views

We investigate different methods for computing a sparse approximate inverse M for a given sparse matrix A by minimizing AM -E in the Frobenius norm. Such methods are very useful for deriving preconditioners in iterative solvers, especially in a parallel environment. We compare different strategies f

Finding the inverse and connections of a

Finding the inverse and connections of a type of large sparse matrix

✍ Martin Hershkowitz; Stedman B. Noble 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

series is d e c o m p o s e d i n t o t e r m s which a r e p r o d u c t s of connected coefficients: the p r o c e d u r e lends itself to an efficient method of truncation that obtains a n a p p r o x im a t i o n t o the i n v e r s e m a t r i x . While t h i s a l g o r i t h m might not be e

On Efficient Sparse Integer Matrix Smith

On Efficient Sparse Integer Matrix Smith Normal Form Computations

✍ Jean-Guillaume Dumas; B. David Saunders; Gilles Villard 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 576 KB

We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of word-size primes. Consequently, the algorithm does not suffer from coefficient growth. We ha

Load-Balanced Sparse Matrix–Vector Multi

Load-Balanced Sparse Matrix–Vector Multiplication on Parallel Computers

✍ Sorin G. Nastea; Ophir Frieder; Tarek El-Ghazawi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors on parallel computers. We propose a method that combines fast load-balancing with efficient message-passing techniques to alleviate computational and inter-node communications challenges. The per

A Lanczos Approach to the Inverse Square

A Lanczos Approach to the Inverse Square Root of a Large and Sparse Matrix

✍ Artan Boriçi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 57 KB

Maximizing Sparse Matrix–Vector Product

Maximizing Sparse Matrix–Vector Product Performance on RISC Based MIMD Computers

✍ R.T. McLay; S. Swift; G.F. Carey 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 303 KB

The matrix-vector product kernel can represent most of the computation in a gradient iterative solver. Thus, an efficient solver requires that the matrix-vector product kernel be fast. We show that standard approaches with Fortran or C may not deliver good performance and present a strategy involvin