Answers are grounded in this paper and cite their sources.
We show that general sparse sets of linear equations whose pattern is symmetric (or nearly so) can be solved efficiently by a multifrontal technique. The main advantages are that the analysis time is small compared to the factorization time and that analysis can be performed in a predictable amount of storage. Additionally, there is scope for extra performance during factorization and solution on a vector or parallel machine. We show performance figures for examples run on the IBM 3081K and CRAY-1 computers.
No takes yet. Share an insight, caveat, or question.
Duff et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: