Related papers: Recursive, parameter-free, explicitly defined inte…
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…
We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…
This is the second lecture note on the error analysis of interpolation on simplicial elements without the shape regularity assumption (the previous one is arXiv:1908.03894). In this manuscript, we explain the error analysis of Lagrange…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…
In this article, we study bivariate polynomial interpolation on the node points of degenerate Lissajous figures. These node points form Chebyshev lattices of rank $1$ and are generalizations of the well-known Padua points. We show that…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
This paper makes two main contributions. First, we present a pedagogical review of the derivation of the three-term recurrence relation for Legendre polynomials, without relying on the classical Legendre differential equation, Rodrigues'…
We construct renormalised models of regularity structures by using a recursive formulation for the structure group and for the renormalisation group. This construction covers all the examples of singular SPDEs which have been treated so far…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
Recursive algorithms for computing the Frobenius norm of a real array are proposed, based on hypot, a hypotenuse function. Comparing their relative accuracy bounds with those of the BLAS routine DNRM2 it is shown that the proposed…
Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
A method for the analytical evaluation of layer potentials arising in the collocation boundary element method for the Laplace and Helmholtz equation is developed for piecewise flat boundary elements with polynomial shape functions. The…
A recursion operator is an integro-differential operator which maps a generalized symmetry of a nonlinear PDE to a new symmetry. Therefore, the existence of a recursion operator guarantees that the PDE has infinitely many higher-order…
We obtain, for a subclass of structure functions characterizing a first class Hamiltonian system, recursive relations from which the general form of the local symmetry transformations can be constructed in terms of the independent gauge…
Given a function f defined on a bidimensional bounded domain and a positive integer N, we study the properties of the triangulation that minimizes the distance between f and its interpolation on the associated finite element space, over all…
The classical Gelfand-Tsetlin formulas provide a basis in terms of tableaux and an explicit action of the generators of $\mathfrak{gl} (n)$ for every irreducible finite-dimensional $\mathfrak{gl} (n)$-module. These formulas can be used to…
A high-order quadrature scheme is constructed for the evaluation of Laplace single and double layer potentials and their normal derivatives on smooth surfaces in three dimensions. The construction begins with a harmonic approximation of the…
An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…