相关论文: About some properties of simple trigonometric spli…

Fractal interpolation functions (FIFs) developed through iterated function systems (IFSs) prove more versatile than classical interpolants. However, the applications of FIFs in the domain of `shape preserving interpolation' are not fully…

Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…

Explicit pointwise error bounds for the interpolation of a smooth function by piecewise exponential splines of order four are given. Estimates known for cubic splines are extended to a natural class of piecewise exponential splines which…

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…

We study the fixed point property and the Craig interpolation property for sublogics of the interpretability logic $\mathbf{IL}$. We provide a complete description of these sublogics concerning the uniqueness of fixed points, the fixed…

This survey paper describes the role of splines in geometry and topology, emphasizing both similarities and differences from the classical treatment of splines. The exposition is non-technical and contains many examples, with references to…

This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…

We present structural properties of two-dimensional polymers as far as they can be described by percolation theory. The percolation threshold, critical exponents and fractal dimensions of clusters are determined by computer simulation and…

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence…

Several inequalities for the isoperimetric ratio for plane curves are derived. In particular, we obtain interpolation inequalities between the deviation of curvature and the isoperimetric ratio. As applications, we study the large-time…

We study the convergence of the Laurent polynomials of Lagrange interpolation on the unit circle for continuous functions satisfying a condition about their modulus of continuity. The novelty of the result is that now the nodal systems are…

This article is a discussion of some characteristic properties in connection with global models, particularly for the application of prediction, such as the approximation property, the interpolation property and the transmission property.

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…

Splint is a decomposition of root system into union of root systems. Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching…

Steiner symmetrization is well known for its rounding and general convergence properties. We identify a whole family of symmetrizations sharing analogue behaviors: In fact we prove that all these symmetrizations share the same converging…

Blending schemes based on circles provide smooth `fair' interpolations between series of points. Here we demonstrate a simple, robust set of algorithms for performing circle blends for a range of cases. An arbitrary level of G-continuity…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

We study the generalization error of functions that interpolate prescribed data points and are selected by minimizing a weighted norm. Under natural and general conditions, we prove that both the interpolants and their generalization errors…

While interpolatory bases such as the Lagrange basis form the cornerstone of classical finite element methods, they have been replaced in the more general finite element setting of isogeometric analysis in favor of other desirable…

Bitangential interpolation problems in the class of matrix valued functions in the generalized Schur class are considered in both the open unit disc and the open right half plane, including problems in which the solutions is not assumed to…