L 2-approximation by the translates of a function and related attenuation factors

Summary Let be thek-dimensional subspace spanned by the translates (·–2j/k),j=0, 1, ...,k–1, of a continuous, piecewise smooth, complexvalued, 2-periodic function . For a given functionfL ²(–, ), its least squares approximantS _kf from can be expressed in terms of an orthonormal basis. Iff is continuous,S _kf can be computed via its discrete analogue by fast Fourier transform. The discrete least squares approximant is used to approximate Fourier coefficients, and this complements the works of Gautschi on attenuation factors. Examples of include the space of trigonometric polynomials where is the de la Valleé Poussin kernel, algebraic polynomial splines where is the periodic B-spline, and trigonometric polynomial splines where is the trigonometric B-spline.     

Riesz bounds of Wilson bases generated byB-splines

In this paper, we are concerned with biorthogonal Wilson bases having B-splines as well as powers of sinc functions as window functions. We prove properties of B-splines and exponential Euler splines and use these properties to estimate the Riesz bounds of the Wilson bases.     

Fourier Series with Linear Splines on an Interval

We construct orthonormal bases of linear splines on a finite interval [a, b] and then we study the Fourier series associated to these orthonormal bases. For continuous functions defined on [a, b], we prove that the associated Fourier series converges pointwisely on (a, b) and also uniformly on [a, b], if it convergences pointwisely at a and b.     

On near-best discrete quasi-interpolation on a four-directional mesh

Spline quasi-interpolants are practical and effective approximation operators. In this paper, we construct QIs with optimal approximation orders and small infinity norms called near-best discrete quasi-interpolants which are based on Ω-splines, i.e. B-splines with octagonal supports on the uniform four-directional mesh of the plane. These quasi-interpolants are exact on some space of polynomials and they minimize an upper bound of their infinity norms depending on a finite number of free parameters. We show that this problem has always a solution, in general nonunique. Concrete examples of such quasi-interpolants are given in the last section.     

On constructing new expansions of functions using linear operators

Let T,U be two linear operators mapped onto the function f such that U(T(f))=f, but T(U(f))≠f. In this paper, we first obtain the expansion of functions T(U(f)) and U(T(f)) in a general case. Then, we introduce four special examples of the derived expansions. First example is a combination of the Fourier trigonometric expansion with the Taylor expansion and the second example is a mixed combination of orthogonal polynomial expansions with respect to the defined linear operators T and U. In the third example, we apply the basic expansion U(T(f))=f(x) to explicitly compute some inverse integral transforms, particularly the inverse Laplace transform. And in the last example, a mixed combination of Taylor expansions is presented. A separate section is also allocated to discuss the convergence of the basic expansions T(U(f)) and U(T(f)).     

Computational aspects of multivariate polynomial interpolation: Indexing the coefficients

An algorithm is derived for generating the information needed to pass efficiently between multi-indices of neighboring degrees, of use in the construction and evaluation of interpolating polynomials and in the construction of good bases for polynomial ideals. This revised version was published online in June 2006 with corrections to the Cover Date.     

The C r-fundamental splines of Clough–Tocher and Powell–Sabin types for Lagrange interpolation on a three direction mesh

Let Δ⁽¹⁾ be the uniform three direction mesh of the plane whose vertices are integer points of .Let (respectively of degree d=3r (respectively d=3r+1 ) for r odd (respectively even) on the triangulation , and of degree d=2r (respectively d=2r+1) for r odd (respectively even) on the triangulation . Using linear combinations of translates of these splines we obtain Lagrange interpolants whose corresponding order of approximation is optimal. This revised version was published online in June 2006 with corrections to the Cover Date.     

Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases

Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider the effect of the choice of polynomial basis on the pseudospectrum and on the conditioning of the spectrum of regular matrix polynomials. In particular, we consider the direct use of the Lagrange basis on distinct interpolation nodes, and give a geometric characterization of “good” nodes. We also give some tools for computation of roots at infinity via a new, natural, reversal. The principal achievement of the paper is to connect pseudospectra to the well-established theory of Lebesgue functions and Lebesgue constants, by separating the influence of the scalar basis from the natural scale of the matrix polynomial, which allows many results from interpolation theory to be applied. This work was partially funded by the Natural Sciences and Engineering Research Council of Canada, and by the MITACS Network of Centres of Excellence.     

Multivariate Frobenius–Padé approximants: Properties and algorithms

The aim of this paper is to construct rational approximants for multivariate functions given by their expansion in an orthogonal polynomial system. This will be done by generalizing the concept of multivariate Padé approximation. After defining the multivariate Frobenius–Padé approximants, we will be interested in the two following problems: the first one is to develop recursive algorithms for the computation of the value of a sequence of approximants at a given point. The second one is to compute the coefficients of the numerator and denominator of the approximants by solving a linear system. For some particular cases we will obtain a displacement rank structure for the matrix of the system we have to solve. The case of a Tchebyshev expansion is considered in more detail.     

Rational interpolation through the optimal attachment of poles to the interpolating polynomial

After recalling some pitfalls of polynomial interpolation (in particular, slopes limited by Markov's inequality) and rational interpolation (e.g., unattainable points, poles in the interpolation interval, erratic behavior of the error for small numbers of nodes), we suggest an alternative for the case when the function to be interpolated is known everywhere, not just at the nodes. The method consists in replacing the interpolating polynomial with a rational interpolant whose poles are all prescribed, written in its barycentric form as in [4], and optimizing the placement of the poles in such a way as to minimize a chosen norm of the error. This revised version was published online in June 2006 with corrections to the Cover Date.     

Almost Hermitian trigonometric interpolation on three equidistant nodes

Summary We find necessary and sufficient conditions for the regularity (or unique solvability) of a trigonometric interpolation problem on three equidistant nodes in [0, 2) where the data are almost Hermitian. We shall show that in many cases the conditions only depend upon the number of even and odd derivatives prescribed in the problem. In general such a simplification seems to be difficult.Dedicated to the memory of Alexander M. Ostrowski on occasion of the 100th anniversary of his birth     

Using the refinement equation for the construction of pre-wavelets

A variety of methods have been proposed for the construction of wavelets. Among others, notable contributions have been made by Battle, Daubechies, Lemarié, Mallat, Meyer, and Stromberg. This effort has led to the attractive mathematical setting of multiresolution analysis as the most appropriate framework for wavelet construction. The full power of multiresolution analysis led Daubechies to the construction ofcompactly supported orthonormal wavelets with arbitrarily high smoothness. On the other hand, at first sight, it seems some of the other proposed methods are tied to special constructions using cardinal spline functions of Schoenberg. Specifically, we mention that Battle raises some doubt that his block spin method can produce only the Lemarié Ondelettes. A major point of this paper is to extend the idea of Battle to the generality of multiresolution analysis setup and address the easier job of constructingpre-wavelets from multiresolution.Research partially supported by DARPA and NSF Grant INT-87-12424     

On a fast and accurate method for computing Fourier transforms

In this paper, a variable order method for the fast and accurate computation of the Fourier transform is presented. The increase in accuracy is achieved by applying corrections to the trapezoidal sum approximations obtained by the FFT method. It is shown that the additional computational work involved is of orderK(2m+2), wherem is a small integer andKn. Analytical expressions for the associated error is also given.     

Nonlinear multiscale decompositions: The approach of A. Harten

Datadependent interpolatory techniques can be used in the reconstruction step of a multiresolution scheme designed à la Harten. In this paper we carefully analyze the class of Essentially NonOscillatory (ENO) interpolatory techniques described in [11] and their potential to improve the compression capabilities of multiresolution schemes. When dealing with nonlinear multiresolution schemes the issue of stability also needs to be carefully considered.     

A new formal approach to the rational interpolation problem

Summary An elegant and fast recursive algorithm is developed to solve the rational interpolation problem in a complementary way compared to existing methods. We allow confluent interpolation points, poles, and infinity as one of the interpolation points. Not only one specific solution is given but a nice parametrization of all solutions. We also give a linear algebra interpretation of the problem showing that our algorithm can also be used to handle a specific class of structured matrices.     

A look-ahead algorithm for the solution of general Hankel systems

Summary The solution of systems of linear equations with Hankel coefficient matrices can be computed with onlyO(n ²) arithmetic operations, as compared toO(n ³) operations for the general cases. However, the classical Hankel solvers require the nonsingularity of all leading principal submatrices of the Hankel matrix. The known extensions of these algorithms to general Hankel systems can handle only exactly singular submatrices, but not ill-conditioned ones, and hence they are numerically unstable. In this paper, a stable procedure for solving general nonsingular Hankel systems is presented, using a look-ahead technique to skip over singular or ill-conditioned submatrices. The proposed approach is based on a look-ahead variant of the nonsymmetric Lanczos process that was recently developed by Freund, Gutknecht, and Nachtigal. We first derive a somewhat more general formulation of this look-ahead Lanczos algorithm in terms of formally orthogonal polynomials, which then yields the look-ahead Hankel solver as a special case. We prove some general properties of the resulting look-ahead algorithm for formally orthogonal polynomials. These results are then utilized in the implementation of the Hankel solver. We report some numerical experiments for Hankel systems with ill-conditioned submatrices.The research of the first author was supported by DARPA via Cooperative Agreement NCC 2-387 between NASA and the Universities Space Research Association (USRA).The research of the second author was supported in part by NSF grant DRC-8412314 and Cooperative Agreement NCC 2-387 between NASA and the Universities Space Research Association (USRA).     

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.     

Construction of spherical spline quasi-interpolants based on blossoming

A general theory of quasi-interpolants based on quadratic spherical Powell-Sabin splines on spherical triangulations of a sphere-like surface S is developed by using polar forms. As application, various families of discrete and differential quasi-interpolants reproducing quadratic spherical Bézier-Bernstein polynomials or the whole space of the spherical Powell-Sabin quadratic splines of class C¹ are presented.     

Perturbation bounds for polynomials

Using two different elementary approaches we derive a global and a local perturbation theorem on polynomial zeros that significantly improve the results of Ostrowski (Acta Math 72:99–257, 1940), Elsner et al. (Linear Algebra Appl 142:195–209, 1990). A comparison of different perturbation bounds shows that our results are better in many cases than the similar local result of Beauzamy (Can Math Bull 42(1):3–12, 1999). Using the matrix theoretical approach we also improve the backward stability result of Edelman and Murakami (Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, SIAM, Philapdelphia, 1994; Math Comput 64:210–763, 1995).