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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68145535%3A_____%2F10%3A00353469%21RIV11-AV0-68145535/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68145535%3A_____%2F10%3A00353469%21RIV11-AV0-68145535
rdf:type
skos:Concept n16:Vysledek
dcterms:description
Domain decomposition methods enable parallel computation during the iterative solution of partial differential equations of elliptic tupe. In order to limit the number of iterations one must then use an efficient preconditioner which can significantlz reduce the condition number of the given problem and, at the same time, is highly parallelizable. In this paper we describe and analyzse such a preconditioner, which is based on local subdomain inverse matrices and is applicable for various types of domain decomposition methods. Domain decomposition methods enable parallel computation during the iterative solution of partial differential equations of elliptic tupe. In order to limit the number of iterations one must then use an efficient preconditioner which can significantlz reduce the condition number of the given problem and, at the same time, is highly parallelizable. In this paper we describe and analyzse such a preconditioner, which is based on local subdomain inverse matrices and is applicable for various types of domain decomposition methods.
dcterms:title
An additive matrix preconditioning method with application for domain decomposition and two-level matrix partitionings An additive matrix preconditioning method with application for domain decomposition and two-level matrix partitionings
skos:prefLabel
An additive matrix preconditioning method with application for domain decomposition and two-level matrix partitionings An additive matrix preconditioning method with application for domain decomposition and two-level matrix partitionings
skos:notation
RIV/68145535:_____/10:00353469!RIV11-AV0-68145535
n4:aktivita
n7:P n7:Z
n4:aktivity
P(1ET400300415), Z(AV0Z30860518)
n4:cisloPeriodika
-
n4:dodaniDat
n14:2011
n4:domaciTvurceVysledku
Axelsson, Owe
n4:druhVysledku
n17:J
n4:duvernostUdaju
n13:S
n4:entitaPredkladatele
n8:predkladatel
n4:idSjednocenehoVysledku
246143
n4:idVysledku
RIV/68145535:_____/10:00353469
n4:jazykVysledku
n10:eng
n4:klicovaSlova
additive matrix; condition number; domain decomposition
n4:klicoveSlovo
n11:additive%20matrix n11:domain%20decomposition n11:condition%20number
n4:kodStatuVydavatele
DE - Spolková republika Německo
n4:kontrolniKodProRIV
[CE2394290505]
n4:nazevZdroje
Lecture Notes in Computer Science
n4:obor
n9:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n15:1ET400300415
n4:rokUplatneniVysledku
n14:2010
n4:svazekPeriodika
5910
n4:tvurceVysledku
Axelsson, Owe
n4:zamer
n12:AV0Z30860518
s:issn
0302-9743
s:numberOfPages
8