Related papers: Fast Least-Squares Pad\'e approximation of problem…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We solve a Pad\'e-type problem of approximating three specific functions simultaneously by $q$-analogues of polylogarithms, respectively by powers of the logarithm. This problem is intimately related to recent results of the authors and…
We establish that a generalized H\"{o}lder continuous function on an $(m-2)$-Ahlfors regular compact set in $\mathbb{R}^m$ can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms…
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees,…
We prove convergence rates of linear sampling recovery of functions in abstract Bochner spaces satisfying weighted summability of their generalized polynomial chaos expansion coefficients. The underlying algorithm is a function-valued…
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum…
In this paper, we study a fractional-order variant of the asymptotical regularization method, called {\it Fractional Asymptotical Regularization (FAR)}, for solving linear ill-posed operator equations in a Hilbert space setting. We assign…
We propose a deep learning approach to the obstacle problem inspired by the first-order system least-squares (FOSLS) framework. This method reformulates the problem as a convex minimization task; by simultaneously approximating the…
Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
We study the problem of predicting highly localized low-lying eigenfunctions $(-\Delta +V) \phi = \lambda \phi$ in bounded domains $\Omega \subset \mathbb{R}^d$ for rapidly varying potentials $V$. Filoche & Mayboroda introduced the function…
The a posteriori error estimator using the least-squares functional can be used for adaptive mesh refinement and error control even if the numerical approximations are not obtained from the corresponding least-squares method. This suggests…
As one of the asymptotic formulas for the zeta-function, Hardy and Littlewood gave asymptotic formulas called the approximate functional equation. In 2003, R. Garunk\v{s}tis, A. Laurin\v{c}ikas, and J. Steuding (in [1]) proved the…
The main difficulty in solving the Helmholtz equation within polygons is due to non-analytic vertices. By using a method nearly identical to that used by Fox, Henrici, and Moler in their 1967 paper; it is demonstrated that such eigenvalue…
We present a non-conforming least squares method for approximating solutions of second order elliptic problems with discontinuous coefficients. The method is based on a general Saddle Point Least Squares (SPLS) method introduced in previous…
Many physical systems can be adequately modelled using a second order approximation. The problem of plant identification reduces to the problem of estimating the position of a single pair of complex conjugate poles. One approach to the…