All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Assessments of Implementation of the Minimum Degree Ordering Algorithms

Result 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.

Keywords

minimum degree orderingdirect methodssparse solver

The result's identifiers

Alternative languages

  • 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

Classification

  • Type

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

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Others

  • Publication year

    2009

  • Confidentiality

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

Data specific for result type

  • 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

Basic information

Result type

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

Jx

CEP

BA - General mathematics

Year of implementation

2009