Cardinal hermite interpolation with box splines II

Summary In the present work we extent the results in [RS] on CHIP, i.e. Cardinal Hermite Interpolation by the span of translates of directional derivatives of a box spline. These directional derivatives are that ones which define the type of the Hermite Interpolation. We admit here several (linearly independent) directions with multiplicities instead of one direction as in [RS]. Under the same assumptions on the smoothness of the box spline and its defining matrixT we can prove as in [RS]: CHIP has a system of fundamental solutions which are inL L ² together with its directional derivatives mentioned above. Moreover, for data sequences inl ^p ( ^d ), 1p2, there is a spline function inL ^p, 1/p+1/p=1, which solves CHIP.Research supported in part by NSERC Canada under Grant # A7687. This research was completed while this author was supported by a grant from the Deutscher Akademischer Austauschdienst     

A General framework for local interpolation

Summary We present a general framework for the construction of local interpolation methods with a given approximation order. Some applications to multivariate spline spaces are presented.Supported by the National Science Foundation, Contract Nos. DMS-8602337 and DMS-8701190Sponsored by Defense Advanced Research Projects Agency (DARPA), under contract No. MDA 972-88-C-0047 for DARPA Initiative in Concurrent Engineering (DICE)     

Equiconvergence of some complex interpolatory polynomials

Summary Walsh showed the close relation between the Lagrange interpolant in then ^th roots of unity and the corresponding Taylor expansion for functions belonging to a certain class of analytic functions. Recent extensions of this phenomena to Hermite interpolation and other linear processes of interpolation have been surveyed in [3, 5]. Following a recent idea of L. Yuanren [7], we show how new relations between other linear operators can be derived which exhibit Walsh equiconvergence.Dedicated to R. S. Varga on the occasion of his sixtieth birthdayThese authors were supported by NSERC A3094     

Admissible slopes for monotone and convex interpolation

Summary In many applications, interpolation of experimental data exhibiting some geometric property such as nonnegativity, monotonicity or convexity is unacceptable unless the interpolant reflects these characteristics. This paper identifies admissible slopes at data points of variousC ¹ interpolants which ensure a desirable shape. We discuss this question, in turn for the following function classes commonly used for shape preserving interpolations: monotone polynomials,C ¹ monotone piecewise polynomials, convex polynomials, parametric cubic curves and rational functions.     

Bivariate Hermite-Birkhoff interpolation and Vandermonde determinants

The concepts of Vandermonde determinant and confluent Vandermonde determinant are extended to the multidimensional setting by relating them to multivariate interpolation problems. With an approach different from that of other recent papers on this subject, the values of these determinants are computed, recovering and extending the results of those papers.Partially supported by Research Grant PS900121 DGICYT.     

A modified fast Fourier transform for polynomial evaluation and the jenkins-Traub algorithm

Summary We present an algorithm to evaluate a polynomial at uniformly spaced points on a circle in the complex plane. As an application of this algorithm, a procedure is developed which gives a starting point for the Jenkins-Traub algorithm [5, 6] to compute the zeros of a polynomial.This work was supported by National Science Foundation grants DMS-8401758 and DMS-8520926 and Air Force Office of Scientific Research grant AFOSR-ISSA-860091     

A simple rational spline and its application to monotonic interpolation to monotonic data

Summary We shall consider a class of simple rational splines and their application to monotonic interpolation to monotonic data. Our method is situated between interpolation with the usual cubic splines and with monotone quadratic splines. A selection of numerical results is presented in Figs. 4–11.     

Compactly supported fundamental functions for spline interpolation

Summary In this paper various ways of constructing locally supported fundamental splines leading to highly accurate local interpolation schemes are proposed and analyzed.This work was partially supported by NATO grant     

A method for computing the tension parameters in convexity-preserving spline-in-tension interpolation

Summary This paper is concerned with the problem of convexity-preservng (orc-preserving) interpolation by using Exponential Splines in Tension (or EST's). For this purpose the notion of ac-preserving interpolant, which is usually employed in spline-in-tension interpolation, is refined and the existence ofc-preserving EST's is established for the so-calledc-admissible data sets. The problem of constructing ac-preserving and visually pleasing EST is then treated by combining a generalized Newton-Raphson method, due to Ben-Israel, with a step-length technique which serves the need for visual pleasantness. The numerical performance of the so formed iterative scheme is discussed for several examples.     

The general recurrence relation for divided differences and the general Newton-interpolation-algorithm with applications to trigonometric interpolation

Summary In this note an ultimate generalization of Newton's classical interpolation formula is given. More precisely, we will establish the most general linear form of a Newton-like interpolation formula and a general recurrence relation for divided differences which are applicable whenever a function is to be interpolated by means of linear combinations of functions forming a ebyev-system such that at least one of its subsystems is again a ebyev-system. The theory is applied to trigonometric interpolation yielding a new algorithm which computes the interpolating trigonometric polynomial of smallest degree for any distribution of the knots by recurrence. A numerical example is given.     

Rosenbrock methods for Differential Algebraic Equations

Summary This paper deals with the numerical solution of Differential/Algebraic Equations (DAE) of index one. It begins with the development of a general theory on the Taylor expansion for the exact solutions of these problems, which extends the well-known theory of Butcher for first order ordinary differential equations to DAE's of index one. As an application, we obtain Butcher-type results for Rosenbrock methods applied to DAE's of index one, we characterize numerical methods as applications of certain sets of trees. We derive convergent embedded methods of order 4(3) which require 4 or 5 evaluations of the functions, 1 evaluation of the Jacobian and 1 LU factorization per step.     

On Lagrange and Hermite interpolation in R k

Summary A method for the construction of a set of data of interpolation in several variables is given. The resulting data, which are either function values or directional derivatives values, give rise to a space of polynomials, in such a way that unisolvence is guaranteed. The interpolating polynomial is calculated using a procedure which generalizes the Newton divided differences formula for a single variable.     

On a generalization of the Richardson extrapolation process

Summary A convergence result for a generalized Richardson extrapolation process is improved upon considerably and additional results of interest are proved. An application of practical importance is also given. Finally, some known results concerning the convergence of Levin's T-transformation are reconsidered in light of the results of the present work.     

On transformations of graded matrices,with applications to stiff ODE's

Summary Estimates concerning the spectrum of a graded matrix and other information useful for a reliable and efficient handling of certain complications in the numerical treatment of some stiff ODE's, can be inexpensively obtained from the factorized Jacobian. The validity of the estimates is studied by considering them as the first step in a block LR algorithm, which may be of interest in its own right. Its convergence properties are examined.Dedicated to Professor Lothar Collatz on the occasion of his 75th birthday     

Une construction »homogène» d'approximants de padé à deux variables complexes

Resumé En nous plaçant sur chacune des droites de passant par l'origine, nous utilisons l'interpolation rationnelle d'une seule variable complexe, holomorphe en 0, pour engendrer un certain type d'approximants de Padé dans (x, y).Par cette même démarche, nous essayons de transposer les formules intégrales d'erreur connues pour une seule variable au cadre de deux variables.

---

A homogeneous process for padé approximants in two complex variables

Summary By considering the restriction of a function of two complex variables at each straight line passing through the origin and its Padé approximants, we get rational approximants to this function. Integral forms of the error are also used to get convergence results.

     

Algorithms for computing shape preserving spline approximations to data

Summary We treat the problem of approximating data that are sampled with error from a function known to be convex and increasing. The approximating function is a polynomial spline with knots at the data points. This paper presents results (analogous to those in [7] and [9]) that describe some approximation properties of polynomial splines and algorithms for determining the existence of a shape-preserving approximant for given data.Formerly of the Graduate Program in Operations Research, NC State University. Author nowResearch supported in part by NASA Grant NAG1-103     

On richardson extrapolation for finite difference methods on regular grids

Summary Difference solutions of partial differential equations can in certain cases be expanded by even powers of a discretization parameterh. If we haven solutions corresponding to different mesh widthsh ₁,...,h _n we can improve the accuracy by Richardson extrapolation and get a solution of order 2n, yet only on the intersection of all grids used, i.e. normally on the coarsest grid. To interpolate this high order solution with the same accuracy in points not belonging to all grids, we need 2n points in an interval of length (2n–1)h ₁.This drawback can be avoided by combining such an interpolation with the extrapolation byh. In this case the approximation depends only on grid points in an interval of length 3/2h ₁. The length of this interval is independent of the desired order.By combining this approach with the method of Kreiss, boundary conditions on curved boundaries can be discretized with a high order even on coarse grids.This paper is based on a lecture held at the 5th Sanmarinian University Session of the International Academy of Sciences San Marino, at San Marino, 1988-08-27-1988-09-05     

Barycentric formulae for cardinal (SINC-)interpolants

Summary We present a barycentric representation of cardinal interpolants, as well as a weighted barycentric formula for their efficient evaluation. We also propose a rational cardinal function which in some cases agrees with the corresponding cardinal interpolant and, in other cases, is even more accurate.In numerical examples, we compare the relative accuracy of those various interpolants with one another and with a rational interpolant proposed in former work.Dedicated to the memory of Peter HenriciThis work was done at the University of California at San Diego, La Jolla     

A reliable modification of the cross rule for rational Hermite interpolation

Claessens' cross rule [8] enables simple computation of the values of the rational interpolation table if the table is normal, i.e. if the denominators in the cross rule are non-zero. In the exceptional case of a vanishing denominator a singular block is detected having certain structural properties so that some values are known without further computations. Nevertheless there remain entries which cannot be determined using only the cross rule.In this note we introduce a simple recursive algorithm for computation of the values of neighbours of the singular block. This allows to compute entries in the rational interpolation table along antidiagonals even in the presence of singular blocks. Moreover, in the case of non-square singular blocks, we discuss a facility to monitor the stability.Dedicated to Professor G. Mühlbach on the occasion of his 50th birthday