Rasterization-based discontinuous integration on the GPU

Abstract

In this paper, we propose a method based on rasterization in computer graphics for the integration of discontinuous functions accurately and efficiently on the GPU. The proposed method takes advantage of the massively parallel architecture of GPUs via a modified graphics pipeline, where discontinuities are encoded through geometric primitives and processed in the rasterization stage, and multisample anti-aliasing (MSAA) is used to improve integration accuracy across subdomain interfaces. We present both hardware- and software-based pipelines and compare their performance in terms of accuracy as well as computational effort on modern GPU hardware with adaptive quadrature on the CPU. For the tested hardware, at approximately comparable median relative error, the hardware pipeline is up to around 100x faster than adaptive quadrature, while the single- and double-precision software pipelines achieve up to 840x and 1200x speedups compared to their adaptive quadrature counterparts. We use the finite cell method as model problem, where cutcells represent discontinuous integrands at the interface of the physical and fictitious domains and demonstrate the performance of the proposed method using numerical benchmarks. The end-to-end finite cell solution runtime is reduced by a factor of $8.3$ to $9.5$ in the single-precision pipeline and by a factor of $62$ to $72$ in the double-precision pipeline at the prescribed integration settings. Therefore, results indicate that the rasterization-based integration method is a promising alternative for the accurate and efficient integration of discontinuous functions in demanding applications on the GPU.

Discrete hypocoercive estimates for discontinuous Galerkin methods: application to the Vlasov-Poisson-Fokker-Planck system
Yi Cai, Alain Blaustein, Tao Xiong +1
HAL5 Nov 2026PreprintLicence Ouverte 2.0Full textNumerical analysis & scientific computingHAL
The discontinuous Galerkin method for solving the two-dimensional transport equation with distributed-order memory kernel on triangular meshes
Leilei Wei, Yanping Chen, Fangfang Qin +2
Applied Numerical Mathematics17 May 2026Peer-reviewedLicence not stated9 citedGeneral mathematicsOpenAlex
Heat equation with singular drift which has bounded solution discontinuous at an interior point
N. V. Krylov
arXiv9 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEs ProbabilityarXiv
Kolmogorov--Arnold stability for discontinuous functions
Sviatoslav V. Dzhenzher
arXiv7 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
Hybridizable Discontinuous Galerkin methods for the Keller-Segel model
Silvia Bertoluzza, Gabriella Bretti, Micol Pennacchio +1
arXiv28 Oct 2026PreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv

Cite

BibTeX RIS

BibTeX

@misc{saberi2026rasterizationbased,
  title = {{Rasterization-based discontinuous integration on the GPU}},
  author = {Manuel Saberi and Muqtasid Tashfin and Andreas Vogel},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.05186},
  eprint = {2611.05186},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.05186},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Rasterization-based discontinuous integration on the GPU
AU  - Manuel Saberi
AU  - Muqtasid Tashfin
AU  - Andreas Vogel
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2611.05186
UR  - https://arxiv.org/abs/2611.05186
AB  - In this paper, we propose a method based on rasterization in computer graphics for the integration of discontinuous functions accurately and efficiently on the GPU. The proposed method takes advantage of the massively parallel architecture of GPUs via a modified graphics pipeline, where discontinuities are encoded through geometric primitives and processed in the rasterization stage, and multisample anti-aliasing (MSAA) is used to improve integration accuracy across subdomain interfaces. We present both hardware- and software-based pipelines and compare their performance in terms of accuracy as well as computational effort on modern GPU hardware with adaptive quadrature on the CPU. For the tested hardware, at approximately comparable median relative error, the hardware pipeline is up to around 100x faster than adaptive quadrature, while the single- and double-precision software pipelines achieve up to 840x and 1200x speedups compared to their adaptive quadrature counterparts. We use the finite cell method as model problem, where cutcells represent discontinuous integrands at the interface of the physical and fictitious domains and demonstrate the performance of the proposed method using numerical benchmarks. The end-to-end finite cell solution runtime is reduced by a factor of $8.3$ to $9.5$ in the single-precision pipeline and by a factor of $62$ to $72$ in the double-precision pipeline at the prescribed integration settings. Therefore, results indicate that the rasterization-based integration method is a promising alternative for the accurate and efficient integration of discontinuous functions in demanding applications on the GPU.
ER  -

Abstract

Related

Cite