Node Reordering for a Parallel Envelope Method

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03099630" target="_blank" >RIV/68407700:21230/04:03099630 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Node Reordering for a Parallel Envelope Method

Original language description

We use a parallel direct solver based on the Schur complement Metod for solving large sparse linear systems arising from the finite element method. A finite element mesh is decomposed into the submeshes by a domain decomposition. The submeshes consist ofinternal and boundary nodes, containing variables. The submatrices, formed from the submeshes, are factorised by an envelope method. Prior to the solution, the nodes of the mesh are reordered to minimise the envelope of the resulting matrix. The boundary nodes are ordered last. The Sloan algorithm is used to perform reordering, but it doesn't distinguish between internal and boundary nodes. We discuss issues of reordering nodes in submeshes and introduce a modified version of the Sloan algorithm that takes into consideration the boundary nodes.

Czech name

Není k dispozici

Czech description

Není k dispozici

Type

A - Audiovisual production

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2004

Confidentiality

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

ISBN

—

Place of publication

Praha

Publisher/client name

—

Version

—

Carrier ID

neuvedeno