Font Size:
Keynote: The DVS algorithms: General description and evidences that they are top for treating PDEs in highly parallelized computers.
Last modified: 2016-06-09
Abstract
Ideally, DDMs seek the DDM-paradigm: “constructing the global solution by solving local problems, exclusively”. To achieve it, it is essential to disconnect the subdomain-problems. This explains in part the success of non-overlapping DDMs. However, a limitation of standard versions of such methods is that some nodes are shared by several subdomains. Recently such a limitation has been removed in an improved kind of non-overlapping DDMs: the derived-vector-space (DVS) approach to the parallel processing of PDEs. In this paper a general description of DVS-methods is presented, together with numerical results that exhibit their outstanding performances of the order of 90% parallelization efficiencies.
Keywords
HPC; DDM; PDEs
An account with this site is required in order to view papers. Click here to create an account.