Search arXivSearch

arXiv · 2609.07083

A covariance-based reduced-order framework for solving acoustic scattering problems

Abstract

This paper presents a physics-aware reduced-order method (ROM) for the efficient computation of wave-scattering problems. Standard model order reduction techniques, typically treating scattering as generic parameterized systems, frequently overlook the underlying physical structure, limiting their effectiveness in practice. To address this limitation, we propose an algorithmic framework that utilizes the intrinsic low-rank structure of the induced contrast source density. By modeling the incident wave as a random variable governed by a specified prior probability measure, we formulate the contrast source as a spatial random field whose covariance function captures essential spatial correlation and physical interactions. The reduced-order basis is then constructed via the Karhunen-Loève (KL) expansion, effectively extracting the dominant features from the scattering process to resolve multiple scattering scenarios. A central algorithmic contribution is the efficient reconstruction of the covariance matrix for arbitrary scatterer geometries and specified incident wave priors. To circumvent the prohibitive computational cost of assembling high-fidelity covariance matrices, we introduce a non-intrusive, physics-informed graph neural network (GNN) surrogate to learn the complex mapping from scatterer geometry to the source correlation kernel, enabling a highly efficient offline-online computational paradigm suitable for large-scale scattering configurations. Extensive numerical experiments demonstrate that the proposed framework achieves robust computational acceleration over full-order models without sacrificing accuracy.

Explore related subjects

Keep this discovery

BibTeXRIS

Shiwei Sun, Hai Zhang, Jinrui Zhang. 2026-09-07. A covariance-based reduced-order framework for solving acoustic scattering problems. https://arxiv.org/abs/2609.07083

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT