About: Node Reordering for a Parallel Envelope Method

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Node Reordering for a Parallel Envelope Method Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Není k dispozici (cs) 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 of internal 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. 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 of internal 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. (en)
Title	Není k dispozici (cs) Node Reordering for a Parallel Envelope Method Node Reordering for a Parallel Envelope Method (en)
skos:prefLabel	Není k dispozici (cs) Node Reordering for a Parallel Envelope Method Node Reordering for a Parallel Envelope Method (en)
skos:notation	RIV/68407700:21230/04:03099630!RIV07-GA0-21230___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA103/04/1320), P(GA103/04/1394), P(GP103/03/D145), Z(MSM 212300014)
http://linked.open...vai/riv/dodaniDat	2007
http://linked.open...aciTvurceVysledku	Medek, Ondřej
http://linked.open.../riv/druhVysledku	A(V) - Audiovizuální tvorba se vzdáleným přístupem
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	576326
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/04:03099630
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	envelope method; paralellel solver; reordering; system of linear equations (en)
http://linked.open.../riv/klicoveSlovo	reordering paralellel solver system of linear equations envelope method
http://linked.open...i/riv/kodPristupu	L
http://linked.open...ontrolniKodProRIV	[813AD80A21FB]
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...n/vavai/riv/nosic	neuvedeno
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Application of fuzzy set theory in modelling of material uncertainties in concrete structures Simulation of fresh concrete flow Multi-scale modeling of cement-based composites
http://linked.open...UplatneniVysledku	2004
http://linked.open...iv/tvurceVysledku	Medek, Ondřej
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20212300014
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software