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”

Numerical tests and assements of the Minimum Degree Ordering algorithms

Result description

Assesment of several variants of the minimum degree algorithm is presented. The algorithms were tested and compared using actual implementation of a sparse direct solver, which was built as a replacement for the frontal solver used in our in-house finiteelement analysis code. This new sparse solver is going to be used to solve very large finite element problems (number of equations n > 106) for which the frontal solver is unsuitable due to its slowness and excessive storage requirements.

Keywords

minimum degree orderingdirect methodssparse solver

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Numerical tests and assements of the Minimum Degree Ordering algorithms

  • Original language description

    Assesment of several variants of the minimum degree algorithm is presented. The algorithms were tested and compared using actual implementation of a sparse direct solver, which was built as a replacement for the frontal solver used in our in-house finiteelement analysis code. This new sparse solver is going to be used to solve very large finite element problems (number of equations n > 106) for which the frontal solver is unsuitable due to its slowness and excessive storage requirements.

  • Czech name

    Numerické testy a zhodnocení minimum degree ordering algoritmů

  • Czech description

    Bylo provedeno zhodnocení několika variant minimum degree algoritmu. Algoritmy byly testovány a porovnány na implementaci řídkého řešiče, který byl vytvořen jako náhrada za frontální řešič našeho výpočtového MKP systému. Tento nový řešič bude použit k výpočtům na velkých sítích (počet rovnic n > 106), pro které je frontální řešič nevhodný pro svou pomalost a obrovské paměťové nároky.

Classification

  • Type

    O - Miscellaneous

  • CEP classification

    BI - Acoustics and oscillation

  • OECD FORD branch

Result continuities

Others

  • Publication year

    2008

  • Confidentiality

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

Basic information

Result type

O - Miscellaneous

O

CEP

BI - Acoustics and oscillation

Year of implementation

2008