Related papers: Recent progress on univariate and multivariate pol…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
In this paper I uncover and explain---using contour integrals and residues---a connection between cubic splines and a popular compact finite difference formula. The connection is that on a uniform mesh the simplest Pad\'e scheme for…
The Euclidean Algorithm is the often forgotten key to rational approximation techniques, including Taylor, Lagrange, Hermite, osculating, cubic spline, Chebyshev, Pade and other interpolation schemes. A unified view of these various…
The cyclic group labeled family of quasi-projection operators is used for investigation of decomposition of functions with respect to the cyclic group of order n . Series of new identities thus arising are demonstrated and new perspectives…
In this paper, the asymptotic formulas for Eulerian numbers, refined Eulerian numbers and the coefficients of descent polynomials are obtained directly from the spline interpretations of these numbers. Having related these numbers directly…
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…
Attaining a quantum speedup in solving practically useful optimization problems has been one of the holy grails in the field of quantum computing. While prior approaches have demonstrated speedups for certain structured problem classes,…
This paper demonstrates that the space of piecewise smooth functions can be well approximated by the space of functions defined by a set of simple (non-linear) operations on smooth uniform splines. The examples include bivariate functions…
Recently, Jordan et al. (Nature, 2025) introduced a novel quantum-algorithmic technique called Decoded Quantum Interferometry (DQI) for solving specific combinatorial optimization problems associated with classical codes. They presented a…
The paper is devoted to problem of spline approximation. A new method of nodes location for curves and surfaces computer construction by means of B-splines and results of simulink-modeling is presented. The advantages of this paper is that…
We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
Matrix quasi exactly solvable operators are considered and new conditions are determined to test whether a matrix differential operator possesses one or several finite dimensional invariant vector spaces. New examples of $2\times 2$-matrix…
The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…
We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…
In this paper, Hermite interpolation by parametric spline surfaces on triangulations is considered. The splines interpolate points, the corresponding tangent planes and normal curvature forms at domain vertices and approximate tangent…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
We establish several fundamental properties of analysis-suitable T-splines which are important for design and analysis. First, we characterize T-spline spaces and prove that the space of smooth bicubic polynomials, defined over the extended…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
Given a system of triangles in the plane $\mathbb{R}^2$ along with given data of function and gradient values at the vertices, we describe the general pattern of local linear methods invoving only four smooth standard shape functions which…