This title appears in the Scientific Report :
2014
Please use the identifier:
http://dx.doi.org/10.1007/978-3-319-05789-7_61 in citations.
Integrating an N-Body Problem with SDC and PFASST
Integrating an N-Body Problem with SDC and PFASST
Vortex methods for the Navier–Stokes equations are based on a Lagrangian particle discretization, which reduces the governing equations to a first-order initial value system of ordinary differential equations for the position and vorticity of N particles. In this paper, the accuracy of solving this...
Saved in:
Personal Name(s): | Speck, Robert (Corresponding Author) |
---|---|
Ruprecht, Daniel / Krause, Rolf / Emmett, Matthew / Minion, Michael / Winkel, Mathias / Gibbon, Paul | |
Contributing Institute: |
Jülich Supercomputing Center; JSC |
Imprint: |
Springer International Publishing
2014
|
Physical Description: |
637 - 645 |
ISBN: |
978-3-319-05788-0 (print) 978-3-319-05789-7 (electronic) |
DOI: |
10.1007/978-3-319-05789-7_61 |
Conference: | Domain Decomposition Methods in Science and Engineering XXI, Rennes (France), 2012-06-25 - 2012-06-29 |
Document Type: |
Contribution to a conference proceedings |
Research Program: |
Raum-Zeit-parallele Simulation multimodale Energiesystemen Computational Science and Mathematical Methods |
Series Title: |
Lecture Notes in Computational Science and Engineering
98 |
Publikationsportal JuSER |
Vortex methods for the Navier–Stokes equations are based on a Lagrangian particle discretization, which reduces the governing equations to a first-order initial value system of ordinary differential equations for the position and vorticity of N particles. In this paper, the accuracy of solving this system by time-serial spectral deferred corrections (SDC) as well as by the time-parallel Parallel Full Approximation Scheme in Space and Time (PFASST) is investigated. PFASST is based on intertwining SDC iterations with differing resolution in a manner similar to the Parareal algorithm and uses a Full Approximation Scheme (FAS) correction to improve the accuracy of coarser SDC iterations. It is demonstrated that SDC and PFASST can generate highly accurate solutions, and the performance in terms of function evaluations required for a certain accuracy is analyzed and compared to a standard Runge–Kutta method. |