An error analysis for the calculation of semiintegrals and semiderivatives by the RL algorithm

The numerical approximation of the semiintegral and semiderivative of a function f by the RL algorithm of Oldham and Spanier [1] is examined. An error analysis is given for the case when f has a continuous second derivative. The performance of the algorithm when applied to experimental data is also discussed. Numerical examples are presented to illustrate the theory.     

Optimal homotopy analysis and control of error for implicitly defined fully nonlinear differential equations

Numerical Algorithms - Implicitly defined fully nonlinear differential equations can admit solutions which have only finitely many derivatives, making their solution via analytical or numerical...     

An error analysis for absolute and relative approximation

We consider the vectorial algorithm for finding best polynomial approximationsp P _n to a given functionf C[a, b], with respect to the norm · _s , defined byp – f _s =w ₁ (p – f)+w ₂ (p – f) A bound for the modulus of continuity of the best vectorial approximation operator is given, and using the floating point calculus of J. H. Wilkinson, a bound for the rounding error in the algorithm is derived. For givenf, these estimates provide an indication of the conditioning of the problem, an estimate of the obtainable accuracy, and a practical method for terminating the iteration.This paper was supported in part by the Canadian NCR A-8108, FCAC 74-09 and G.E.T.M.A.Part of this research was done during the first-named author's visit to theB! Chair of Applied Mathematics, University of Athens, Spring term, 1975.     

An error analysis for radial basis function interpolation

Summary. Radial basis function interpolation refers to a method of interpolation which writes the interpolant to some given data as a linear combination of the translates of a single function and a low degree polynomial. We develop an error analysis which works well when the Fourier transform of has a pole of order 2m at the origin and a zero at of order 2. In case 0m, we derive error estimates which fill in some gaps in the known theory; while in case m> we obtain previously unknown error estimates. In this latter case, we employ dilates of the function , where the dilation factor corresponds to the fill distance between the data points and the domain.Mathematics Subject Classification (1991): 41A05, 41A25, 65D05, 41A63Revised version received December 17, 2003     

On the regularity analysis of interpolatory Hermite subdivision schemes

It is well known that the critical Hölder regularity of a subdivision schemes can typically be expressed in terms of the joint-spectral radius (JSR) of two operators restricted to a common finite-dimensional invariant subspace. In this article, we investigate interpolatory Hermite subdivision schemes in dimension one and specifically those with optimal accuracy orders. The latter include as special cases the well-known Lagrange interpolatory subdivision schemes by Deslauriers and Dubuc. We first show how to express the critical Hölder regularity of such a scheme in terms of the joint-spectral radius of a matrix pair {F₀,F₁} given in a very explicit form. While the so-called finiteness conjecture for JSR is known to be not true in general, we conjecture that for such matrix pairs arising from Hermite interpolatory schemes of optimal accuracy orders a “strong finiteness conjecture” holds: ρ(F₀,F₁)=ρ(F₀)=ρ(F₁). We prove that this conjecture is a consequence of another conjectured property of Hermite interpolatory schemes which, in turn, is connected to a kind of positivity property of matrix polynomials. We also prove these conjectures in certain new cases using both time and frequency domain arguments; our study here strongly suggests the existence of a notion of “positive definiteness” for non-Hermitian matrices.     

An error analysis for a certain class of iterative methods

We provide local convergence results in affine form for in-exact Newton-like as well as quasi-Newton iterative methods in a Banach space setting. We use hypotheses on the second or on the first andmth Fréchet-derivative (m ≥ 2 an integer) of the operator involved. Our results allow a wider choice of starting points since our radius of convergence can be larger than the corresponding one given in earlier results using hypotheses on the first-Fréchet-derivative only. A numerical example is provided to illustrate this fact. Our results apply when the method is, for example, a difference Newton-like or update-Newton method. Furthermore, our results have direct applications to the solution of autonomous differential equations.     

An algebraic proof that pseudovarieties are defined by pseudoidentities

An algebraic proof is given which shows that any pseudovariety of finite algebras is determined by a set of pseudoidentities.Presented by Boris M. Schein.     

An extended class of orthogonal polynomials defined by a Sturm-Liouville problem

We present two infinite sequences of polynomial eigenfunctions of a Sturm-Liouville problem. As opposed to the classical orthogonal polynomial systems, these sequences start with a polynomial of degree one. We denote these polynomials as X₁-Jacobi and X₁-Laguerre and we prove that they are orthogonal with respect to a positive definite inner product defined over the compact interval [−1,1] or the half-line [0,∞), respectively, and they are a basis of the corresponding L² Hilbert spaces. Moreover, we prove a converse statement similar to Bochner's theorem for the classical orthogonal polynomial systems: if a self-adjoint second-order operator has a complete set of polynomial eigenfunctions , then it must be either the X₁-Jacobi or the X₁-Laguerre Sturm-Liouville problem. A Rodrigues-type formula can be derived for both of the X₁ polynomial sequences.     

Fourier analysis of 2-point hermite interpolatory subdivision schemes

Two subdivision schemes with Hermite data on ℤ are studied. These schemes use 2 or 7 parameters respectively depending on whether Hermite data involve only first derivatives or include second derivatives. For a large region in the parameter space, the schemes are convergent in the space of Schwartz distributions. The Fourier transform of any interpolating function can be computed through products of matrices of order 2 or 3. The Fourier transform is related to a specific system of functional equations whose analytic solution is unique except for a multiplicative constant. The main arguments for these results come from Paley-Wiener-Schwartz theorem on the characterization of the Fourier transforms of distributions with compact support and a theorem of Artzrouni about convergent products of matrices.     

Truncation error analysis by means of approximant systems and inclusion regions

Summary A general approach to truncation error analysis is described, in which bounds for the truncation error are determined by means of inclusion regions, and the notion of bestness is meaningfully formulated. A new mathematical structure (approximant system) is introduced and developed. It consists of a family of infinite processes having a natural structure for truncation error analysis. Applications of the methods are included for infinite series, Cesaro sums, approximate integration, an iterative method for solving equations, Padé approximants and continued fractions.Research supported in part by the National Science Foundation under Grant No. MPS 74-22111 and by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant No. AFOSR-70-1888. The United States Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon     

Convergence and smoothness analysis of subdivision rules in Riemannian and symmetric spaces

After a discussion on definability of invariant subdivision rules we discuss rules for sequential data living in Riemannian manifolds and in symmetric spaces, having in mind the space of positive definite matrices as a major example. We show that subdivision rules defined with intrinsic means in Cartan-Hadamard manifolds converge for all input data, which is a much stronger result than those usually available for manifold subdivision rules. We also show weaker convergence results which are true in general but apply only to dense enough input data. Finally we discuss C ¹ and C ² smoothness of limit curves.     

A nodal spline interpolant for the Gregory rule of even order

Summary The Gregory rule is a well-known example in numerical quadrature of a trapezoidal rule with endpoint corrections of a given order. In the literature, the methods of constructing the Gregory rule have, in contrast to Newton-Cotes quadrature,not been based on the integration of an interpolant. In this paper, after first characterizing an even-order Gregory interpolant by means of a generalized Lagrange interpolation operator, we proceed to explicitly construct such an interpolant by employing results from nodal spline interpolation, as established in recent work by the author and C.H. Rohwer. Nonoptimal order error estimates for the Gregory rule of even order are then easily obtained.     

An error propagation in the numerical literature

An important historical paper on the numerical solution of pde's has regularly, but incorrectly, been assigned to the year 1951. The origin of this error of reference is discussed.     

On the Lebesgue constant of Berrut’s rational interpolant at equidistant nodes

It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results suggest that the Lebesgue constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.