Results demonstrate that sliced FFT provides a scalable multi-GPU approach for fast computation of 3D peridynamic diffusion and introduces a human-audited configuration agent for efficient cross-level configuration.
Abstract
Large-scale 3D peridynamic transient diffusion simulations are constrained by the computational cost and memory requirements of nonlocal interactions. We propose a fast and scalable multi-GPU sliced FFT algorithm based on the recently developed asymptotically compatible finite difference (ACFD) scheme. By exploiting the discrete operator's structure and finite interaction range, the algorithm combines FFT acceleration with local inter-GPU communication. It preserves the ACFD scheme while avoiding the global data redistribution required by full 3D FFTs. We build a matrix-free GPU conjugate gradient (CG) solver, use multigrid preconditioning to reduce iteration counts, and introduce a human-audited configuration agent for efficient cross-level configuration. Strong-scaling tests show that sliced FFT-CG achieves 93.2% parallel efficiency on eight GPUs, compared with 28.2% for full FFT-CG on the same problem and hardware. The framework supports approximately 10.29 billion degrees of freedom on eight RTX 4090 GPUs with 24 GB of memory each. The insulated penny-shaped cutout benchmark demonstrates transient simulation with approximately 8.58 billion degrees of freedom. Three-dimensional star-shaped interface evolution further demonstrates convergence toward the local solution in a nonlinear phase-field problem. These results demonstrate that sliced FFT provides a scalable multi-GPU approach for fast computation of 3D peridynamic diffusion.
We introduce TokaGLINT, a GPU-accelerated implicit solver for electromagnetic field computations in full 3D tokamak simulations, aimed at efficient large-scale parallel GPU computing. Its central innovation lies in the co-design of hierarchical domain decomposition and a fast exact local solver, where hierarchical part...
Zi-Fan Yang, Hao-Yuan Zhang, Jia-Lin Li et al.· arXiv.org· 0 citations
Sharp-interface immersed boundary methods provide a versatile framework for simulating flows with complex moving boundaries, but their irregular data structures, dynamic sparsity, and discontinuous pressure operators present significant challenges for efficient multi-GPU implementation. This work presents a fully GPU-n...
Sushrut Kumar, J. Romero, M. Fatica et al.· 0 citations
A local arbitrary high-order derivatives (ADER) finite-difference method that couples a compact ten-point quadratic predictor to a conservative central corrector through operator matching recovers third-order convergence under fixed-CFL refinement and near-seventh-order spatial behavior when background spatial error do...
Hong Zhang, Xian Wang, Xin-Liang Li et al.· 0 citations
This paper presents Chana, a GPU-accelerated, block-structured adaptive-mesh code for general relativistic magnetohydrodynamics, multigroup M1 neutrino transport, and dynamical spacetime evolution using the Z4c formulation. Each physical module uses independently selected spatial discretizations and ghost-zone widths t...
Efficient and scalable numerical methods for time-dependent partial differential equations are of central importance. This study extends our previous examinations of OpenCL-based parallel implementation of three explicit finite difference schemes: the one-stage Constant Neighbor (CNe) method, its two-stage predictor–co...
Dániel Koics, E. Kovács, O. Hornyák· Computers· 0 citations
I present a matrix-free local multigrid method for $C^1$ tensor-product Hermite discretizations on adaptively refined Cartesian meshes, using the clamped biharmonic problem as the model problem. Extending a cell-wise primal-dual formulation to Hermite elements, I enforce continuity through a constraint operator that is...
M. Wichrowski· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.