Systolic bandwidth and profile reduction of sparse matrices on pipenets

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