Performance tests of the minimum degree ordering implementation

Abstract eng:
The minimum degree ordering is one of the most widely used algorithms to preorder a symmetric sparse matrix prior to numerical factorization. There are number of variants which try to reduce the computational complexity of the original algorithm while maintaining a reasonable ordering quality. An in-house finite element solver is used to test several minimum degree ordering algorithm variants to find the most suitable configuration for the use in the Finite Element Method. The performance results obtained and their assessments are presented along with the minimum degree ordering algorithm overview.

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket