Search arXivSearch

arXiv · 2411.09964

Geometric Optics Approximation Sampling: A Far-Field Reflector-Induced Transport Framework

Abstract

We develop a far-field geometric optics approximation sampling (GOAS) framework for constructing direct samplers from target measures. The method exploits the connection between the far-field reflector problem and optimal transport with logarithmic cost, leading to a natural primal--dual transport structure. The associated dual reflector provides a reciprocal backward transport and, in the invertible smooth setting, the inverse of the forward reflector map. For numerical realization, we adopt a supporting hyperparaboloid construction based on a discrete approximation of the target measure. This construction is gradient-free with respect to the target density and naturally accommodates both density-based and sample-based target representations. The resulting piecewise reflector admits two sampling realizations: a primal--dual consistency resampling strategy that operates directly on the nonsmooth reflector, and a softmin-regularized realization yielding an explicit smooth transport map through the physical law of reflection. We establish the well-posedness and stability of the reflector-induced sampling measure and derive Wasserstein error estimates. Numerical experiments on non-Gaussian targets and Bayesian inverse problems demonstrate the accuracy, stability, Wasserstein error behavior, and applicability of the proposed framework, and compare it with MCMC and polynomial transport-map methods.

Explore related subjects

Keep this discovery

BibTeXRIS

Zejun Sun, Guang-Hui Zheng. 2026-09-03. Geometric Optics Approximation Sampling: A Far-Field Reflector-Induced Transport Framework. https://arxiv.org/abs/2411.09964

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

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA