A massive parallel fast marching method
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A10229626" target="_blank" >RIV/61989100:27240/16:10229626 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/16:10229626
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-18827-0_30" target="_blank" >http://dx.doi.org/10.1007/978-3-319-18827-0_30</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-18827-0_30" target="_blank" >10.1007/978-3-319-18827-0_30</a>
Alternative languages
Result language
angličtina
Original language name
A massive parallel fast marching method
Original language description
In this paper we present a novel technique based on domain decomposition which enables us to perform the fast marching method (FMM) [4] on massive parallel high performance computers (HPC) for given triangulated geometries. The FMM is a widely used numerical method and one of the fastest serial state-of-the-art techniques for computing the solution to the Eikonal equation.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computational Science and Engineering. Volume 104
ISBN
978-3-319-18826-3
ISSN
1439-7358
e-ISSN
—
Number of pages
8
Pages from-to
311-318
Publisher name
Springer
Place of publication
Berlin
Event location
Lugano
Event date
Sep 16, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—