相关论文: Convergence of the discrete dipole approximation. …

We propose a method of studying the continuous percolation of aligned objects as a limit of a corresponding discrete model. We show that the convergence of a discrete model to its continuous limit is controlled by a power-law dependency…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

We present a proof algorithm associated with the dipole splitting algorithm (DSA). The proof algorithm (PRA) is a straightforward algorithm to prove that the summation of all the subtraction terms created by the DSA vanishes. The execution…

We study the propagation, observation and control properties of the 1-d wave equation on a bounded interval discretized in space using the quadratic classical finite element approximation. A careful Fourier analysis of the discrete wave…

Embedding-based representations in Euclidean space $\mathbb{R}^d$ are a cornerstone of modern machine learning, where a major goal is to use the \emph{smallest dimension} that faithfully captures data relations. In this work, we prove sharp…

As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…

Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for…

We consider the numerical approximation of the radiative transfer equation using discontinuous angular and continuous spatial approximations for the even parts of the solution. The even-parity equations are solved using a diffusion…

The task of approximating a function of d variables from its evaluations at a given number of points is ubiquitous in numerical analysis and engineering applications. When d is large, this task is challenged by the so-called curse of…

The diffraction of stochastic point sets, both Bernoulli and Markov, and of random tilings with crystallographic symmetries is investigated in rigorous terms. In particular, we derive the diffraction spectrum of 1D random tilings, of…

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

Massive and massless Dirac equations with Lorentz-covariant cubic nonlinearities are considered in spatial dimension $d=2,3$. Global well-posedness of the Cauchy problem for small initial data in scale-invariant Sobolev spaces and…

Multiple-scattering approximations to Faddeev calculations of the K^- d scattering length are reviewed and compared with published Kbar-N-N <--> pi-Y-N fully reactive Faddeev calculations. A new multiple-scattering approximation which goes…

We introduce a minor variant of the approximate D-optimal design of experiments with a more general information matrix that takes into account the representation of the design space S. The main motivation (and result) is that if S in R^d is…

Internal DLA (IDLA) is an internal aggregation model in which particles perform random walks from the origin, in turn, and stop upon reaching an unoccupied site. Levine and Peres showed that, when particles start instead from fixed…

Quadratic discriminant analysis (QDA) is a widely used statistical tool to classify observations from different multivariate Normal populations. The generalized quadratic discriminant analysis (GQDA) classification rule/classifier, which…

Measuring the quasar distance through joint analysis of spectroastrometry (SA) and reverberation mapping (RM) observations is a new method for driving the development of cosmology. In this paper, we carry out detailed simulation and…

Linear discriminant analysis improves class separability but struggles with non-linearly separable data. To overcome this, we introduce Deep Discriminant Analysis (DDA), which directly optimizes the Fisher criterion utilizing deep networks.…

We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…

Theoretical estimates for the cutoff errors in the Ewald summation method for dipolar systems are derived. Absolute errors in the total energy, forces and torques, both for the real and reciprocal space parts, are considered. The…