About: Variable Reordering for a Parallel Envelope Method

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

About: Variable 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 method for solving large sparse linear systems arising from the finite element (FE) method. A FE mesh is decomposed into the submeshes by a domain decomposition method. The submatrices formed from the submeshes consist of internal and boundary variables. The internal variables are factorized by an envelope method. Prior to the solution, the variables of each submatrix are reordered to minimize the size of its envelope. The boundary variables are ordered last. The Sloan algorithm is used to perform the reordering, but it does not distinguish between internal and boundary variables. We introduce a modified version of the Sloan algorithm that takes the boundary variables into consideration. Experiments show that submatrices produced by the proposed algorithm have profiles smaller by approximately 15% and the time of solving FE problems with a parallel envelope is reduced by 23%. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element (FE) method. A FE mesh is decomposed into the submeshes by a domain decomposition method. The submatrices formed from the submeshes consist of internal and boundary variables. The internal variables are factorized by an envelope method. Prior to the solution, the variables of each submatrix are reordered to minimize the size of its envelope. The boundary variables are ordered last. The Sloan algorithm is used to perform the reordering, but it does not distinguish between internal and boundary variables. We introduce a modified version of the Sloan algorithm that takes the boundary variables into consideration. Experiments show that submatrices produced by the proposed algorithm have profiles smaller by approximately 15% and the time of solving FE problems with a parallel envelope is reduced by 23%. (en)
Title	Není k dispozici (cs) Variable Reordering for a Parallel Envelope Method Variable Reordering for a Parallel Envelope Method (en)
skos:prefLabel	Není k dispozici (cs) Variable Reordering for a Parallel Envelope Method Variable Reordering for a Parallel Envelope Method (en)
skos:notation	RIV/68407700:21230/04:03099629!RIV/2005/AV0/212305/N
http://linked.open.../vavai/riv/strany	254 ; 261
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(IBS3086102), Z(MSM 212300014)
http://linked.open...vai/riv/dodaniDat	2005
http://linked.open...aciTvurceVysledku	Medek, Ondřej Tvrdík, Pavel
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	592137
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/04:03099629
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...ontrolniKodProRIV	[2BA8AF6EB7EB]
http://linked.open...v/mistoKonaniAkce	Montreal, Quebec
http://linked.open...i/riv/mistoVydani	Los Alamitos
http://linked.open...i/riv/nazevZdroje	Proceedings of the 2004 International Conference on Parallel Processing Workshops
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Parallel Algorithms for Large Scale Simulation on PC Clusters
http://linked.open...UplatneniVysledku	2004
http://linked.open...iv/tvurceVysledku	Tvrdík, Pavel Medek, Ondřej
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2004-08-15 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20212300014
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society Press
https://schema.org/isbn	0-7695-2198-3
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, 91 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software