This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n7http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://purl.org/net/nknouf/ns/bibtex#
n13http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n22http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F04%3A03100059%21RIV%2F2005%2FAV0%2F212305%2FN/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F04%3A03100059%21RIV%2F2005%2FAV0%2F212305%2FN
rdf:type
n20:Vysledek skos:Concept
dcterms:description
We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decomposition of a problem is performed using a graph partitioning. It results in sparse submatrices with balanced sizes. An envelope method is used to factorize these submatrices. However, the memory requirements to store them and the computational cost to factorize them depends heavily on their structure. We propose a technique that modifies the multilevel graph partitioning schema to balance real computational load or memory requirements of the solver. Není k dispozici We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decomposition of a problem is performed using a graph partitioning. It results in sparse submatrices with balanced sizes. An envelope method is used to factorize these submatrices. However, the memory requirements to store them and the computational cost to factorize them depends heavily on their structure. We propose a technique that modifies the multilevel graph partitioning schema to balance real computational load or memory requirements of the solver.
dcterms:title
Není k dispozici Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
skos:prefLabel
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method Není k dispozici
skos:notation
RIV/68407700:21230/04:03100059!RIV/2005/AV0/212305/N
n3:strany
734 ; 741
n3:aktivita
n16:P n16:Z
n3:aktivity
P(IBS3086102), Z(MSM 212300014)
n3:dodaniDat
n6:2005
n3:domaciTvurceVysledku
n19:9540814 n19:1515977
n3:druhVysledku
n9:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n22:predkladatel
n3:idSjednocenehoVysledku
571678
n3:idVysledku
RIV/68407700:21230/04:03100059
n3:jazykVysledku
n12:eng
n3:klicovaSlova
domain decomposition; envelope method; load balancing; parallel solver
n3:klicoveSlovo
n10:envelope%20method n10:parallel%20solver n10:domain%20decomposition n10:load%20balancing
n3:kontrolniKodProRIV
[E1023B246681]
n3:mistoKonaniAkce
Pisa
n3:mistoVydani
Berlin
n3:nazevZdroje
Euro-Par 2004 Parallel Processing
n3:obor
n17:JD
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n14:IBS3086102
n3:rokUplatneniVysledku
n6:2004
n3:tvurceVysledku
Medek, Ondřej Tvrdík, Pavel Kruis, J.
n3:typAkce
n7:WRD
n3:zahajeniAkce
2004-08-31+02:00
n3:zamer
n11:MSM%20212300014
s:numberOfPages
8
n15:hasPublisher
Springer-Verlag
n18:isbn
3-540-22924-8
n13:organizacniJednotka
21230