Related papers: Fast multi-dimensional scattered data approximatio…
We obtain wavenumber-robust error bounds for the deep neural network (DNN) emulation of the solution to the time-harmonic, sound-soft acoustic scattering problem in the exterior of a smooth, convex obstacle in two physical dimensions. The…
The paper is concerned with the three-dimensional electromagnetic scattering from a large open rectangular cavity that is embedded in a perfectly electrically conducting infinite ground plane. By introducing a transparent boundary…
The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…
We propose a patchwise local Fourier extension method for approximating smooth functions on general two dimensional domains with curved boundaries. The domain is embedded into a Cartesian background grid and decomposed into rectangular…
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain improved algorithms for the following problems: Approximate…
For problems of time-harmonic scattering by polygonal obstacles, embedding formulae provide a useful means of computing the far-field coefficient induced by any incident plane wave, given the far-field coefficient of a relatively small set…
This paper presents a theoretical discussion as well as novel solution algorithms for problems of scattering on smooth two-dimensional domains under Zaremba boundary conditions for which Dirichlet and Neumann conditions are specified on…
Gaussian processes (GPs) are crucial in machine learning for quantifying uncertainty in predictions. However, their associated covariance matrices, defined by kernel functions, are typically dense and large-scale, posing significant…
The large-scale three-dimensional inversion of surface gravity / tensor gravity data is a very challenging numerical and practical problem, which is a highly physical memory usage, time-consuming computation and high precision for…
Scattering for the mass-critical fractional Schr\"odinger equation with a cubic Hartree-type nonlinearity for initial data in a small ball in the scale-invariant space of three-dimensional radial and square-integrable initial data is…
The nonlocal problems have been used to model very different applied scientific phenomena, which involve the fractional Laplacian when one looks at the L\'{e}vy processes and stochastic interfaces. This paper deals with the nonlocal…
This work concerns the local convergence theory of Newton and quasi-Newton methods for convex-composite optimization: minimize f(x):=h(c(x)), where h is an infinite-valued proper convex function and c is C^2-smooth. We focus on the case…
Determinantal Point Processes (DPPs) are probabilistic models that arise in quantum physics and random matrix theory and have recently found numerous applications in computer science. DPPs define distributions over subsets of a given ground…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We obtain conditions for a trigonometric polynomial t of one variable to equal or be approximated by |p|^2 where p has frequencies in a Bohr set of integers obtained by projecting lattice points in the open planar region bounded by the…
The state-of-the-art methods for estimating high-dimensional covariance matrices all shrink the eigenvalues of the sample covariance matrix towards a data-insensitive shrinkage target. The underlying shrinkage transformation is either…
We present a novel computational scheme to solve acoustic wave transmission problems over composite scatterers, i.e. penetrable obstacles possessing junctions or triple points. Our continuous problem is cast as a multiple traces time-domain…
We develop and analyze stochastic inexact Gauss-Newton methods for nonlinear least-squares problems and for nonlinear systems ofequations. Random models are formed using suitable sampling strategies for the matrices involved in the…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…