Related papers: Approximation error of the Lagrange reconstructing…
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…
We present a detailed analysis of epsilon'/epsilon within the Standard Model, taking into account the strong enhancement through final-state interactions identified in refs. [1] and [2]. The relevant hadronic matrix elements are fixed at…
The energy stable flux reconstruction (ESFR) method provides an efficient and flexible framework to devise high-order linearly stable numerical schemes which can achieve high levels of accuracy on unstructured grids. While superconvergent…
In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…
The convergence rate is analyzed for the SpaSRA algorithm (Sparse Reconstruction by Separable Approximation) for minimizing a sum $f (\m{x}) + \psi (\m{x})$ where $f$ is smooth and $\psi$ is convex, but possibly nonsmooth. It is shown that…
The paper has two relatively distinct but connected goals; the first is to define the notion of Pad\'e\ approximation of Weyl-Stiltjes transforms on an arbitrary compact Riemann surface of higher genus. The data consists of a contour in the…
In this work we investigate the computation of dispersion relation (i.e., band functions) for three-dimensional photonic crystals, formulated as a parameterized Maxwell eigenvalue problem, using a novel hp-adaptive sampling algorithm. We…
A new alternative numerical procedure to the Szeg\H{o} quadrature formulas for the estimation of integrals with respect to a positive Borel measure $\mu$ supported on the unit circle is presented. As in many practical situations, we assume…
This paper is dealing with two $L^2$ hypocoercivity methods based on Fourier decomposition and mode-by-mode estimates, with applications to rates of convergence or decay in kinetic equations on the torus and on the whole Euclidean space.…
Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…
We propose a new fast algorithm for solving one of the standard approaches to ill-posed linear inverse problems (IPLIP), where a (possibly non-smooth) regularizer is minimized under the constraint that the solution explains the observations…
We study superconvergence property of the linear discontinuous Galerkin finite element method with the polynomial preserving recovery (PPR) and Richardson extrapolation for the two dimensional Helmholtz equation. The error estimate with…
In recent years, the proximal gradient method and its variants have been generalized to Riemannian manifolds for solving optimization problems with an additively separable structure, i.e., $f + h$, where $f$ is continuously differentiable,…
In this paper we consider a sub-diffusion problem where the fractional time derivative is approximated either by the L1 scheme or by Convolution Quadrature. We propose new interpretations of the numerical schemes which lead to a posteriori…
The \emph{Chow parameters} of a Boolean function $f: \{-1,1\}^n \to \{-1,1\}$ are its $n+1$ degree-0 and degree-1 Fourier coefficients. It has been known since 1961 (Chow, Tannenbaum) that the (exact values of the) Chow parameters of any…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…
Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…
We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…
We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…