Research

Paper

TESTING March 03, 2026

Floating-point consistent cross-verification methodology for reproducible and interoperable DDA solvers with fair benchmarking

Authors

Clément Argentin, Patrick C. Chaumet, Michel Gross, Maxim A. Yurkin

Abstract

The discrete dipole approximation (DDA) is a widely used and versatile numerical method for solving electromagnetic scattering by arbitrarily shaped objects. Despite its popularity, quantitative comparisons between independent implementations remain challenging due to differences in linear-system conventions, solver settings, and default numerical parameters. In this work, we introduce a unified software-assisted methodology for cross-verification and benchmarking of three major open-source DDA solvers: DDSCAT, ADDA, and IFDDA. We demonstrate how machine-precision agreement can be achieved across implementations by aligning all free parameters and provide practical equivalence tables enabling reproducible and interoperable simulations. Using this methodology, we perform systematic CPU and GPU performance comparisons covering OpenMP, MPI, and CUDA/OpenCL parallelization. Beyond benchmarking, our approach serves as a practical guide for configuring consistent DDA simulations and for understanding how precision, solver choice, and hardware architecture affect runtime, scalability, and accuracy in computational light-scattering studies. The software package also supports regression testing and bitwise reproducibility verification for future code releases.

Metadata

arXiv ID: 2603.02871
Provider: ARXIV
Primary Category: physics.comp-ph
Published: 2026-03-03
Fetched: 2026-03-04 03:41

Related papers

Raw Data (Debug)
{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.02871v1</id>\n    <title>Floating-point consistent cross-verification methodology for reproducible and interoperable DDA solvers with fair benchmarking</title>\n    <updated>2026-03-03T11:24:53Z</updated>\n    <link href='https://arxiv.org/abs/2603.02871v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.02871v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>The discrete dipole approximation (DDA) is a widely used and versatile numerical method for solving electromagnetic scattering by arbitrarily shaped objects. Despite its popularity, quantitative comparisons between independent implementations remain challenging due to differences in linear-system conventions, solver settings, and default numerical parameters. In this work, we introduce a unified software-assisted methodology for cross-verification and benchmarking of three major open-source DDA solvers: DDSCAT, ADDA, and IFDDA. We demonstrate how machine-precision agreement can be achieved across implementations by aligning all free parameters and provide practical equivalence tables enabling reproducible and interoperable simulations. Using this methodology, we perform systematic CPU and GPU performance comparisons covering OpenMP, MPI, and CUDA/OpenCL parallelization. Beyond benchmarking, our approach serves as a practical guide for configuring consistent DDA simulations and for understanding how precision, solver choice, and hardware architecture affect runtime, scalability, and accuracy in computational light-scattering studies. The software package also supports regression testing and bitwise reproducibility verification for future code releases.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='physics.comp-ph'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='physics.optics'/>\n    <published>2026-03-03T11:24:53Z</published>\n    <arxiv:primary_category term='physics.comp-ph'/>\n    <author>\n      <name>Clément Argentin</name>\n    </author>\n    <author>\n      <name>Patrick C. Chaumet</name>\n    </author>\n    <author>\n      <name>Michel Gross</name>\n    </author>\n    <author>\n      <name>Maxim A. Yurkin</name>\n    </author>\n  </entry>"
}