𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of algorithms for profile reduction of sparse matrices

✍ Scribed by I.L. Lim; I.W. Johnston; S.K. Choi

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
585 KB
Volume
57
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Simulated annealing for profile and fill
Simulated annealing for profile and fill reduction of sparse matrices
✍ Robert R. Lewis πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 900 KB

## Abstract Simulated annealing can minimize both profile and fill of sparse matrices. We applied these techniques to a number of sparse matrices from the Harwell–Boeing sparse matrix collection. We were able to reduce profile typically to about 80 per cent of that attained by conventional profile