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
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27740%2F14%3A86091207%21RIV15-MSM-27740___/
n21http://localhost/temp/predkladatel/
n9http://purl.org/net/nknouf/ns/bibtex#
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n22http://bibframe.org/vocab/
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/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27740%2F14%3A86091207%21RIV15-MSM-27740___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
The FETI (Finite Element Tearing and Interconnecting) method turned out to be one of the most successful methods for the parallel solution of elliptic partial differential equations. The FETI-1 is based on the decomposition of the spatial domain into non-overlapping subdomains that are glued by Lagrange multipliers. Total-FETI (TFETI) by Dostal et al. simplifes the inversion of stiffness matrices of subdomains by using Lagrange multipliers not only for gluing the subdomains along the auxiliary interfaces, but also to enforce the Dirichlet boundary conditions. In this work we compare two parallel implementations of TFETI method based on either PETSc or Trilinos software frameworks. Both these libraries are widely used for the developement of scientiffc codes. While PETSc is based almost entirely on pure C, Trilinos utilizes features of the modern C++ including templates and object oriented design. We focus on the parallel effciency of both codes, mainly on the treatment of the solution of the coarse problem and the action of orthogonal projectors to the kernel of the constraints matrix G, which seem to be main bottlenecks of the TFETI parallel implementations. Although the usual applications of TFETI method lie in the field of material sciences and structural mechanics, we demonstrate the applicability of our codes to the problem of the image registration of computer tomography and magnetic resonance imaging data using elastic registration method. The numerical benchmarks were run on HECToR supercomputer at EPCC in the UK which is the part of the PRACE HPC ecosystem. The FETI (Finite Element Tearing and Interconnecting) method turned out to be one of the most successful methods for the parallel solution of elliptic partial differential equations. The FETI-1 is based on the decomposition of the spatial domain into non-overlapping subdomains that are glued by Lagrange multipliers. Total-FETI (TFETI) by Dostal et al. simplifes the inversion of stiffness matrices of subdomains by using Lagrange multipliers not only for gluing the subdomains along the auxiliary interfaces, but also to enforce the Dirichlet boundary conditions. In this work we compare two parallel implementations of TFETI method based on either PETSc or Trilinos software frameworks. Both these libraries are widely used for the developement of scientiffc codes. While PETSc is based almost entirely on pure C, Trilinos utilizes features of the modern C++ including templates and object oriented design. We focus on the parallel effciency of both codes, mainly on the treatment of the solution of the coarse problem and the action of orthogonal projectors to the kernel of the constraints matrix G, which seem to be main bottlenecks of the TFETI parallel implementations. Although the usual applications of TFETI method lie in the field of material sciences and structural mechanics, we demonstrate the applicability of our codes to the problem of the image registration of computer tomography and magnetic resonance imaging data using elastic registration method. The numerical benchmarks were run on HECToR supercomputer at EPCC in the UK which is the part of the PRACE HPC ecosystem.
dcterms:title
Parallel implementation of total-FETI DDM with application to medical image registration Parallel implementation of total-FETI DDM with application to medical image registration
skos:prefLabel
Parallel implementation of total-FETI DDM with application to medical image registration Parallel implementation of total-FETI DDM with application to medical image registration
skos:notation
RIV/61989100:27740/14:86091207!RIV15-MSM-27740___
n3:aktivita
n14:P
n3:aktivity
P(ED1.1.00/02.0070), P(EE.2.3.20.0070)
n3:dodaniDat
n16:2015
n3:domaciTvurceVysledku
n8:6660177 n8:7610173 n8:4982940 n8:8867461
n3:druhVysledku
n18:D
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
35704
n3:idVysledku
RIV/61989100:27740/14:86091207
n3:jazykVysledku
n15:eng
n3:klicovaSlova
parallel computing; image registration; Total-FETI
n3:klicoveSlovo
n10:parallel%20computing n10:image%20registration n10:Total-FETI
n3:kontrolniKodProRIV
[7749F8828410]
n3:mistoKonaniAkce
Rennes
n3:mistoVydani
Berlin
n3:nazevZdroje
Lecture Notes in Computational Science and Engineering. Volume 98
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
4
n3:pocetTvurcuVysledku
4
n3:projekt
n6:EE.2.3.20.0070 n6:ED1.1.00%2F02.0070
n3:rokUplatneniVysledku
n16:2014
n3:tvurceVysledku
Vašatová, Alena Merta, Michal Horák, David Hapla, Václav
n3:typAkce
n12:WRD
n3:wos
000347877900089
n3:zahajeniAkce
2012-06-25+02:00
s:issn
1439-7358
s:numberOfPages
9
n22:doi
10.1007/978-3-319-05789-7_89
n9:hasPublisher
Springer-Verlag
n19:isbn
978-3-319-05788-0
n21:organizacniJednotka
27740