Assessments of Implementation of the Minimum Degree Ordering Algorithms

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61388998%3A_____%2F09%3A00334746" target="_blank" >RIV/61388998:_____/09:00334746 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Assessments of Implementation of the Minimum Degree Ordering Algorithms

Original language description

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 algorithms to find the most suitable configuration for the use in the Finite Element Method. The results obtained and their assessments arepresented along with the minimum degree ordering algorithms overview.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA101%2F09%2F1630" target="_blank" >GA101/09/1630: Numerical solution to steady-state and transient wave dispersion in mechanical systems on different scales</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Pollack Periodica

ISSN

1788-1994

e-ISSN

—

Volume of the periodical

4

Issue of the periodical within the volume

3

Country of publishing house

HU - HUNGARY

Number of pages

8

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—