The use of profile reduction algorithms with a frontal code
We study profile reduction algorithms when used to order the elements for the frontal solution of a system of linear equations with a symmetric sparsity pattern. We consider two distinct procedures for producing an efficient element ordering; one based on assembling the pattern of the finite‐element...
Gespeichert in:
Veröffentlicht in: | International journal for numerical methods in engineering 1989-11, Vol.28 (11), p.2555-2568 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We study profile reduction algorithms when used to order the elements for the frontal solution of a system of linear equations with a symmetric sparsity pattern. We consider two distinct procedures for producing an efficient element ordering; one based on assembling the pattern of the finite‐element matrix, reordering the variables and using the new variable order to resequence the elements, and the other based on generating adjacency lists for the elements themselves and reordering the elements directly.
We compare the results of using several variants of these algorithms in conjunction with the Harwell frontal code, MA32, on the CRAY‐2 for a range of practical problems. We find that, given suitable enhancements, both approaches are practical and neither is consistently superior to the other. |
---|---|
ISSN: | 0029-5981 1097-0207 |
DOI: | 10.1002/nme.1620281106 |