𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A spectral algorithm for envelope reduction of sparse matrices

✍ Scribed by Stephen T. Barnard; Alex Pothen; Horst Simon

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
889 KB
Volume
2
Category
Article
ISSN
1070-5325

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