arXiv (All)
open access
A GPU-efficient local ADER finite-difference method for compressible-flow DNS
Algorithm design tailored to graphics processing units (GPUs) can substantially improve the efficiency of computational fluid dynamics (CFD) simulations. Efforts to adapt CFD solvers to GPUs often focus on spatial discretization, while time advancement commonly relies on multistage Runge--Kutta (RK)
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fortin operators for DPG advection discretizations#799283
- Fortin operators for DPG advection discretizations#797860
- Orthogonal grid generation, non-reflecting boundary condition, and parallel computation for fluid flow#957727
- Efficient Domain Decomposition for the Helmholtz Equation on GPUs#299902
- A Massively Parallel Hybridizable Discontinuous Galerkin Solver for Direct Numerical Simulation of Compressible Flows on GPUs#781148
Record · ID 1457406
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive