𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing sparse approximations deterministically

✍ Scribed by Thomas Hofmeister; Hanno Lefmann

Book ID
107826668
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
565 KB
Volume
240
Category
Article
ISSN
0024-3795

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

Computing with sparse matrices
Computing with sparse matrices
✍ T. S. Chow; J. S. Kowalik πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 866 KB
Computing sparse permanents faster
Computing sparse permanents faster
✍ Rocco A. Servedio; Andrew Wan πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 80 KB