Related papers: Optimal Point Sets for Total Degree Polynomial Int…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
We introduce a learning-based algorithm to obtain a measurement matrix for compressive sensing related recovery problems. The focus lies on matrices with a constant modulus constraint which typically represent a network of analog phase…
In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…
This paper introduces an efficient algorithm for computing the best approximation of a given matrix onto the intersection of linear equalities, inequalities and the doubly nonnegative cone (the cone of all positive semidefinite matrices…
Only a few numerical methods can treat boundary value problems on polygonal and polyhedral meshes. The BEM-based Finite Element Method is one of the new discretization strategies, which make use of and benefits from the flexibility of these…
We study the convergence rate of a hierarchy of upper bounds for polynomial optimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], and a related hierarchy by De Klerk, Hess and Laurent [SIAM J. Optim. 27(1),…
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.…
In this paper the problem of construction of lattice optimal interpolation formulas in the space $\widetilde{L_2^{(m)}} (0,1)$ is considered. Using S.L. Sobolev's method explicit formulas for the coefficients of lattice optimal…
In this paper, we present a new numerical method for determining the numerical solution of interface problems to optimal accuracy with respect to the polynomial order of the Lagrangian finite element space on polytopial meshes. We introduce…
We present a systematic computational framework for generating positive quadrature rules in multiple dimensions on general geometries. A direct moment-matching formulation that enforces exact integration on polynomial subspaces yields…
Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…
In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid…
The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…
We study numerical integration of smooth functions defined over the $s$-dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
We present a comprehensive analysis of an algorithm for evaluating high-dimensional polynomials that are invariant under permutations and rotations. The key bottleneck is the contraction of a high-dimensional symmetric and sparse tensor…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
The stability properties of simple element choices for the mixed formulation of the Laplacian are investigated numerically. The element choices studied use vector Lagrange elements, i.e., the space of continuous piecewise polynomial vector…
Mesh refinement in pseudospectral (PS) optimal control is embarrassingly easy --- simply increase the order $N$ of the Lagrange interpolating polynomial and the mathematics of convergence automates the distribution of the grid points.…
The Lasserre hierarchy of semidefinite programming (SDP) relaxations is an effective scheme for finding computationally feasible SDP approximations of polynomial optimization over compact semi-algebraic sets. In this paper, we show that,…