Parallel algorithms for successive convolution
From MaRDI portal
Abstract: In this work, we consider alternative discretizations for PDEs which use expansions involving integral operators to approximate spatial derivatives. These constructions use explicit information within the integral terms, but treat boundary data implicitly, which contributes to the overall speed of the method. This approach is provably unconditionally stable for linear problems and stability has been demonstrated experimentally for nonlinear problems. Additionally, it is matrix-free in the sense that it is not necessary to invert linear systems and iteration is not required for nonlinear terms. Moreover, the scheme employs a fast summation algorithm that yields a method with a computational complexity of , where is the number of mesh points along a direction. While much work has been done to explore the theory behind these methods, their practicality in large scale computing environments is a largely unexplored topic. In this work, we explore the performance of these methods by developing a domain decomposition algorithm suitable for distributed memory systems along with shared memory algorithms. As a first pass, we derive an artificial CFL condition that enforces a nearest-neighbor communication pattern and briefly discuss possible generalizations. We also analyze several approaches for implementing the parallel algorithms by optimizing predominant loop structures and maximizing data reuse. Using a hybrid design that employs MPI and Kokkos for the distributed and shared memory components of the algorithms, respectively, we show that our methods are efficient and can sustain an update rate DOF/node/s. We provide results that demonstrate the scalability and versatility of our algorithms using several different PDE test problems, including a nonlinear example, which employs an adaptive time-stepping rule.
Recommendations
Cites work
- scientific article; zbMATH DE number 1417959 (Why is no real title available?)
- A WENO-based method of lines transpose approach for Vlasov simulations
- A boundary-integral framework to simulate viscous erosion of a porous medium
- A fast solver for the Stokes equations with distributed forces in complex geometries.
- A high-order 3D boundary integral equation solver for elliptic PDEs in smooth domains
- A kernel based high order ``explicit unconditionally stable scheme for time dependent Hamilton-Jacobi equations
- A kernel-based explicit unconditionally stable scheme for Hamilton-Jacobi equations on nonuniform meshes
- A parallel fast multipole accelerated integral equation scheme for 3D Stokes equations
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- Alternating direction methods for three space variables
- An adaptive Rothe method for the wave equation
- An asymptotic preserving Maxwell solver resulting in the Darwin limit of electrodynamics
- Fast integral equation methods for Rothe's method applied to the isotropic heat equation
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- High Order Weighted Essentially Nonoscillatory Schemes for Convection Dominated Problems
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- High-order, Dispersionless “Fast-Hybrid” Wave Equation Solver. Part I: O(1) Sampling Cost via Incident-Field Windowing and Recentering
- Higher order A-stable schemes for the wave equation using a successive convolution approach
- Kernel based high order ``explicit unconditionally stable scheme for nonlinear degenerate advection-diffusion equations
- Method of lines transpose: an implicit solution to the wave equation
- Method of lines transpose: energy gradient flows using direct operator inversion for phase-field models
- Method of lines transpose: high order L-stable \(\mathcal O(N)\) schemes for parabolic equations using successive convolution
- On the Numerical Integration of $\frac{\partial ^2 u}{\partial x^2 } + \frac{\partial ^2 u}{\partial y^2 } = \frac{\partial u}{\partial t}$ by Implicit Methods
- Strong stability-preserving high-order time discretization methods
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Viscous transport in eroding porous media
Cited in
(6)- A rearrangement minimization problem corresponding to p-Laplacian equation
- On-line computation of convolutions
- A systematic design of a parallel program for Dirichlet convolution
- Parallel computations for Yau filters
- Parallel Cyclic Convolution Based on Recursive Formulations of Block Pseudocirculant Matrices
- Multigrid reduction in time for non-linear hyperbolic equations
This page was built for publication: Parallel algorithms for successive convolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221135)
