Engineering Mechanics

International Conference

Proceedings Vol. 15 (2009)


May 11 – 14, 2009, Svratka, Czech Republic
Editors: Jiří Náprstek and Cyril Fischer

Copyright © 2009 Institute of Theoretical and Applied Mechanics, Academy of Sciences of the Czech Republic, v.v.i., Prague

ISBN 978-80-86246-35-2 (printed, Extended Abstracts)
ISSN 1805-8248 (printed)
ISSN 1805-8256 (electronic)

list of papers scientific commitee

Performance tests of the minimum degree ordering implementation
P. Pařík
pages 929 - 935, full text

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.

back to list of papers

Text and facts may be copied and used freely, but credit should be given to these Proceedings.

All papers were reviewed by members of the scientific committee.

imce   Powered by Imce 3.13  © 2020, Pavel Formánek, Institute of Thermomechanics AS CR, v.v.i. [generated: 0.0290s]