A Type of interpolation between those of Lagrange and Hermite that uses nodal systems satisfying some separation properties

In this paper, we study a method of polynomial interpolation that lies in-between Lagrange and Hermite methods. The novelty is that we use very general nodal systems on the unit circle as well as on the bounded interval only characterized by a separation property. The way in which we interpolate consists in considering all the nodes for the prescribed values and only half for the derivatives. Firstly, we develop the theory on the unit circle, obtaining the main properties of the nodal polynomials and studying the convergence of the interpolation polynomials corresponding to continuous functions with some kind of modulus of continuity and with general conditions on the prescribed values for half of the derivatives. We complete this first part of the paper with the study of the convergence for smooth functions obtaining the rate of convergence, which is slightly slower than that when equidistributed nodal points are considered. The second part of the paper is devoted to solving a similar problem on the bounded interval by using nodal systems having good properties of separation, generalizing the Chebyshev–Lobatto system, and well related to the nodal systems on the unit circle studied before. We obtain an expression of the interpolation polynomials as well as results about their convergence in the case of continuous functions with a convenient modulus of continuity and, particularly, for differentiable functions. Finally, we present some numerical experiments related to the application of the method with the nodal systems dealt with.Universidade de VigoAgencia Estatal de Investigación | Ref. PID2020-116764RB-I0

(R2054) Convergence of Lagrange-Hermite Interpolation using Non-uniform Nodes on the Unit Circle

In this study, we investigated a Lagrange-Hermite interpolation problem by taking into account the collection of non-uniformly distributed nodes on the unit circle. These nodes are created by vertically projecting the unit circle’s boundary points on the real line and the Jacobi polynomial’s zeros onto the unit circle. The two main accomplishments of this article are the explicit representation of the interpolatory polynomial and the proof of the convergence theorem. The field of approximation theory entertains the results proved

Grid generation for the solution of partial differential equations

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given

Discrete Sturm–Liouville problems, Jacobi matrices and Lagrange interpolation series

AbstractThe close relationship between discrete Sturm–Liouville problems belonging to the so-called limit-circle case, the indeterminate Hamburger moment problem and the search of self-adjoint extensions of the associated semi-infinite Jacobi matrix is well known. In this paper, all these important topics are also related with associated sampling expansions involving analytic Lagrange-type interpolation series

Coaxing a planar curve to comply

AbstractA long-standing problem in computer graphics is to find a planar curve that is shaped the way you want it to be shaped. A selection of various methods for achieving this goal is presented. The focus is on mathematical conditions that we can use to control curves while still allowing the curves some freedom. We start with methods invented by Newton (1643–1727) and Lagrange (1736–1813) and proceed to recent methods that are the subject of current research. We illustrate almost all the methods discussed with diagrams. Three methods of control that are of special interest are interpolation methods, global minimization methods (such as least squares), and (Bézier) control points. We concentrate on the first of these, interpolation methods

Conservative and non-conservative methods based on hermite weighted essentially-non-oscillatory reconstruction for Vlasov equations

We introduce a WENO reconstruction based on Hermite interpolation both for semi-Lagrangian and finite difference methods. This WENO reconstruction technique allows to control spurious oscillations. We develop third and fifth order methods and apply them to non-conservative semi-Lagrangian schemes and conservative finite difference methods. Our numerical results will be compared to the usual semi-Lagrangian method with cubic spline reconstruction and the classical fifth order WENO finite difference scheme. These reconstructions are observed to be less dissipative than the usual weighted essentially non- oscillatory procedure. We apply these methods to transport equations in the context of plasma physics and the numerical simulation of turbulence phenomena