Related papers: Note on discontinuous trace approximation in the p…
The matching distance is a computationally tractable topological measure to compare multi-filtered simplicial complexes. We design efficient algorithms for approximating the matching distance of two bi-filtered complexes to any desired…
We study the closeness of an experimental unitary bosonic network with only partially indistinguishable bosons in an arbitrary mixed input state, in particular an experimental realization of the Boson Sampling, to the ideal bosonic network,…
In this paper, we propose a new efficient method for a sparse Gaussian graphical model with hidden clustering structures by extending a dual spectral projected gradient (DSPG) method proposed by Nakagaki et al.~(2020). We establish the…
We consider an \eps-approximation by n-term partial sums of the Karhunen-Lo\`eve expansion to d-parametric random fields of tensor product-type in the average case setting. We investigate the behavior, as d tends to infinity, of the…
We prove best approximation error estimates for discontinuous piecewise polynomial approximation in fractional Sobolev spaces on non-Lipschitz meshes of non-Lipschitz domains. In particular, the boundary of the domain, and the boundaries of…
In this paper we are concerned with numerical methods for the one-sided event location in discontinuous differential problems, whose event function is nonlinear (in particular, of polynomial type). The original problem is transformed into…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
We develop a convergence theory of space-time discretizations for the linear, 2nd-order wave equation in polygonal domains $\Omega\subset\mathbb{R}^2$, possibly occupied by piecewise homogeneous media with different propagation speeds.…
We prove a Poisson process approximation result for stabilizing functionals of a determinantal point process. Our results use concrete couplings of determinantal processes with different Palm measures and exploit their association…
Poisson approximation using Stein's method has been extensively studied in the literature. The main focus has been on bounding the total variation distance. This paper is a first attempt on moderate deviations in Poisson approximation for…
We study a nonlocal Poisson problem with discontinuous source term and analyze how the regularity of the integral kernel determines the discontinuity structure of the corresponding solution. Under general assumptions on compactly supported…
We prove the convergence of a particle method for the approximation of diffusive gradient flows in one dimension. This method relies on the discretisation of the energy via non-overlapping balls centred at the particles and preserves the…
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for…
We study the local persistence probability during non-stationary time evolutions in disordered contact processes with long-range interactions by a combination of the strong-disorder renormalization group (SDRG) method, a phenomenological…
In this article we introduce a class of discontinuous almost automorphic functions which appears naturally in the study of almost automorphic solutions of differential equations with piecewise constant argument. Their fundamental properties…
We solve a problem, stated in [CGP10], showing that Sticky Datalog, defined in the cited paper as an element of the Datalog\pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe…
We propose a discontinuous Galerkin(DG) method to approximate the elliptic interface problem on unfitted mesh using a new approximation space. The approximation space is constructed by patch reconstruction with one degree of freedom per…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
Multivariate Poisson approximation of the length spectrum of random surfaces is studied by means of the Chen-Stein method. This approach delivers simple and explicit error bounds in Poisson limit theorems. They are used to prove that…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…