Related papers: Generalized $C^1$ quadratic B-splines generated by…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
Agglomeration-based strategies are important both within adaptive refinement algorithms and to construct scalable multilevel algebraic solvers. In order to automatically perform agglomeration of polygonal grids, we propose the use of…
In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by…
Methods of constructing trigonometric fundamental splines with constant sign and sign-changing convergence factors are given. An example and graphics illustrating the concepts of convergence and interpolation grids are given. Some methods…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
The univariate spline quasi-interpolants (abbr. QIs) studied in this paper are approximation operators using B-spline expansions with coefficients which are linear combinations of discrete or weighted mean values of the function to be…
Several classes of classical cardinal B-splines can be obtained as solutions of operator equations of the form $Ly = 0$ where $L$ is a linear differential operator of integral order. (Cf., for instance,…
Let $R$ be a commutative ring with identity and $G$ a graph. Extending generalized splines are a further extension of generalized splines by allowing vertex labels of $G$ to lie in varying modules rather than in a fixed ring $R$.…
Periodic splines are a special kind of splines that are defined over a set of knots over a circle and are adequate for solving interpolation problems related to closed curves. This paper presents a method of implementing the objects…
Tile B-splines in $\mathbb{R}^d$ are defined as autoconvolutions of the indicators of tiles, which are special self-similar compact sets whose integer translates tile the space $\mathbb{R}^d$. These functions are not piecewise-polynomial,…
This paper focuses on developing a framework for constructing quasi-interpolation with the highest achievable approximation order from generalized Gaussian kernels with the help of kernel restriction trick and periodization technique. We…
Spline functions are smooth piecewise polynomials widely used for interpolation and smoothing, and nonnegative spline smoothing is also studied for nonnegative data. Previous research used sufficient conditions for the nonnegativity of…
Group convolutional neural networks (G-CNNs) can be used to improve classical CNNs by equipping them with the geometric structure of groups. Central in the success of G-CNNs is the lifting of feature maps to higher dimensional disentangled…
The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the…
Closed formulas in terms of double sums of Clebsch-Gordan coefficients are computed for the evaluation of bra-ket spherical harmonic overlap integrals of a wide class of trigonometric functions. These analytical expressions can find useful…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
We solve the following problem: given a polynomial of order $n$ and the corresponding $B\'ezier$ tensor product patches over an unstructured regular quadrilateral mesh of any valence, find a solution to the $G^{1}1$ or $C^{1}1$…
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommender systems, and many more fields. While there are…
We introduce intrinsic interpolatory bases for data structured on graphs and derive properties of those bases. Polyharmonic Lagrange functions are shown to satisfy exponential decay away from their centers. The decay depends on the density…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…