𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ordering symmetric sparse matrices for small profile and wavefront

✍ Scribed by J. K. Reid; J. A. Scott

Book ID
101235076
Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
139 KB
Volume
45
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis

The ordering of large sparse symmetric matrices for small pro"le and wavefront or for small bandwidth is important for the e$ciency of frontal and variable-band solvers. In this paper, we look at the computation of pseudoperipheral nodes and compare the e!ectiveness of using an algorithm based on level-set structures with using the spectral method as the basis of the Reverse Cuthill}McKee algorithm for bandwidth reduction. We also consider a number of ways of improving the performance and e$ciency of Sloan's algorithm for pro"le and wavefront reduction, including the use of di!erent weights, the use of supervariables, and implementing the priority queue as a binary heap. We also examine the use of the spectral ordering in combination with Sloan's algorithm. The design of software to implement the reverse Cuthill}McKee algorithm and a modi"ed Sloan's algorithm is discussed. Extensive numerical experiments that justify our choice of algorithm are reported on.

πŸ“œ SIMILAR VOLUMES

A block solver for large, unsymmetric, s
A block solver for large, unsymmetric, sparse, banded matrices with symmetric profiles
✍ K. G. Manoj; S. K. Bhattacharyya πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 375 KB

A block equation solver for the solution of large, sparse, banded unsymmetric system of linear equations is presented in this paper. The method employs Crout variation of Gauss elimination technique for the solution. The solver ensures the efficient use of the available memory by doing block factori

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

Efficient computation of the exponential
Efficient computation of the exponential operator for large, sparse, symmetric matrices
✍ Luca Bergamaschi; Marco Vianello πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 2 views

In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretizatio