000003947 001__ 3947
000003947 005__ 20141118153341.0
000003947 04107 $$acze
000003947 046__ $$k2009-05-11
000003947 100__ $$aPařík, P.
000003947 24500 $$aPerformance tests of the minimum degree ordering implementation

000003947 24630 $$n15.$$pEngineering Mechanics 2009
000003947 260__ $$bInstitute of Theoretical and Applied Mechanics AS CR, v.v.i., Prague
000003947 506__ $$arestricted
000003947 520__ $$2eng$$aThe 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.

000003947 540__ $$aText je chráněný podle autorského zákona č. 121/2000 Sb.
000003947 653__ $$a

000003947 7112_ $$aEngineering Mechanics 2009$$cSvratka (CZ)$$d2009-05-11 / 2009-05-14$$gEM2009
000003947 720__ $$aPařík, P.
000003947 8560_ $$ffischerc@itam.cas.cz
000003947 8564_ $$s207566$$uhttps://invenio.itam.cas.cz/record/3947/files/Parik-137-PT.pdf$$y
             Original version of the author's contribution as presented on CD, 137.
            
000003947 962__ $$r3852
000003947 980__ $$aPAPER