Related papers: On the quadrature exactness in hyperinterpolation

The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…

We investigate the asymptotic behavior of Halpern-type iterations applied to quasi-nonexpansive operators arising in best approximation problems over the intersection of finitely many closed convex sets in $\mathbb{R}^n$. Assuming a local…

In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tight relaxations, they have the strong disadvantage that they…

We construct approximate Fekete point sets for kernel-based interpolation by maximising the determinant of a kernel Gram matrix obtained via truncation of an orthonormal expansion of the kernel. Uniform error estimates are proved for kernel…

Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions. We propose a class of strongly convergent algorithms for…

Conserving approximations are applied to the attractive Holstein and Hubbard models (on an infinite-dimensional hypercubic lattice). All effects of nonconstant density of states and vertex corrections are taken into account in the…

In this paper we revisit some quadrature methods for highly oscillatory integrals of the form $\int_{-1}^1f(x)e^{{\rm i}\omega x}dx, \omega>0$. Exponentially Fitted (EF) rules depend on frequency dependent nodes which start off at the…

It is shown in this note that approximating the number of independent sets in a $k$-uniform linear hypergraph with maximum degree at most $\Delta$ is NP-hard if $\Delta\geq 5\cdot 2^{k-1}+1$. This confirms that for the relevant sampling and…

We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…

For any two-dimensional nearest neighbor shift of finite type X and any integer n > 0, one can define the horizontal strip shift H_n(X) to be the set of configurations on Z x {1,...,n} which do not contain any forbidden transitions for X.…

Fully symmetric positive interior (f-SPI) quadrature rules are key building blocks for high-order discretizations of partial differential equations, yet high-degree rules with few nodes remain scarce on reference elements commonly used in…

In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…

We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…

We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner…

This paper contains a survey of results obtained by the authors mostly during the past few years and published by 2021. In particular, we present the best of known estimates of numerical characteristics related to the research theme.…

We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal Newton algorithm with multi-stage convex relaxation based on the…

Approximate solutions of Urysohn integral equations using projection methods involve integrals which need to be evaluated using a numerical quadrature formula. It gives rise to the discrete versions of the projection methods. For $r \geq…

This work is devoted to the study of integration with respect to binomial measures. We develop interpolatory quadrature rules and study their properties. Local error estimates for these rules are derived in a general framework.

In this paper we propose and analyse composite Filon-Clenshaw-Curtis quadrature rules for integrals of the form $I_{k}^{[a,b]}(f,g) := \int_a^b f(x) \exp(\mathrm{i}kg(x)) \rd x $, where $k \geq 0$, $f$ may have integrable singularities and…

Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-$ \mathsf{E} $ operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However,…