Full rank interpolatory subdivision schemes: Kronecker, filters and multiresolution

In this extension of earlier work, we point out several ways how a multiresolution analysis can be derived from a finitely supported interpolatory matrix mask which has a positive definite symbol on the unit circle except at −1. A major tool in this investigation will be subdivision schemes that are obtained by using convolution or correlation operations based on replacing the usual matrix multiplications by Kronecker products.     

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.     

The approximation order of four-point interpolatory curve subdivision

In this paper we derive an approximation property of four-point interpolatory curve subdivision, based on local cubic polynomial fitting. We show that when the scheme is used to generate a limit curve that interpolates given irregularly spaced points, sampled from a curve in any space dimension with a bounded fourth derivative, and the chosen parameterization is chordal, the accuracy is fourth order as the mesh size goes to zero. In contrast, uniform and centripetal parameterizations yield only second order.     

Smoothed hat functions in subdivision

Following the general idea of smoothing through convolution, we discuss schemes for smoothing hat functions on the three-directional and the four-directional mesh. The smoothing masks–which in the four-directional case are matrix masks–have the same support as the refinement mask for the hat functions. Several smoothing schemes are presented, and in some cases the smoothness properties of the smoothed functions are analysed. In particular, the results for the four-directional case follow new and original lines of research.     

Curve and surface construction using Hermite subdivision schemes

In this paper we present a very efficient Hermite subdivision scheme, based on rational functions, and outline its potential applications, with special emphasis on the construction of cubic-like B-splines — well suited for the design of constrained curves and surfaces.     

Approximation by boolean sums of positive linear operators III: Estimates for some numerical approximation schemes

In the present note we intröduce and investigate certain sequences of discrete positive linear operators and Boolean sum modifications of them. The mappings considered are obtained by discretizing a class of transformed convolution-type operators using Gaussian quadrature of appropriate order. For our operators and their modifications we prove pointwise Jackson-type theorems involving the first and second order moduli of smoothness, thus providing new and elegant proofs of earlier results by Timan, Telyakowskii, Gopengauz and DeVore. Due to their discrete structure, optimal order of approximation and ease of computation, the operators appear to be useful for numerical approximation. In an intermediate step we solve an old problem in Approximation Theory; its importance was only recently emphasized in a paper of Butzer.     

A generalized Taylor factorization for Hermite subdivision schemes

In a recent paper, we investigated factorization properties of Hermite subdivision schemes by means of the so-called Taylor factorization. This decomposition is based on a spectral condition which is satisfied for example by all interpolatory Hermite schemes. Nevertheless, there exist examples of Hermite schemes, especially some based on cardinal splines, which fail the spectral condition. For these schemes (and others) we provide the concept of a generalized Taylor factorization and show how it can be used to obtain convergence criteria for the Hermite scheme by means of factorization and contractivity.     

Modifications of higher-order convergence for solving nonlinear equations

In [Liang Fang, Guoping He, Some modifications of Newton’s method with higher-order convergence for solving nonlinear equations, J. Comput. Appl. Math. 228 (2009) 296-303], the authors pointed out that the iteration constructed in [Y.M. Ham, C.B. Chun and S.G. Lee, Some higher-order modifications of Newton’s method for solving nonlinear equations, J. Comput. Appl. Math. 222 (2008) 477-486] failed when p=2. They gave some counterexamples and obtained a modified result. However, they did not show the essential reason which leads to the incorrect result. In this paper, we shall show that reason and present more general results than the above-mentioned papers.     

Analysis of two Chebyshev-like third order methods free from second derivatives for solving systems of nonlinear equations

In this paper, two Chebyshev-like third order methods free from second derivatives are considered and analyzed for systems of nonlinear equations. The methods can be obtained by having different approximations to the second derivatives present in the Chebyshev method. We study the local and third order convergence of the methods using the point of attraction theory. The computational aspects of the methods are also studied using some numerical experiments including an application to the Chandrasekhar integral equations in Radiative Transfer.     

On the comparison of error bounds for finite difference schemes

Summary In 1968 Sendov and Korovkin independently introduced the -modulus as a new measure for the smoothness of functions which already has found various applications in approximation theory and numerical analysis. Here it is employed to derive sharp error bounds for the approximate solution of linear two-point boundary value problems for ordinary differential equations. These indeed improve corresponding estimates in terms of ordinary (L -) moduli of continuity. Finally, the effect is also discussed in the light of a quantitative resonance theorem.     

Approximation order from stability for nonlinear subdivision schemes

This paper proves approximation order properties of various nonlinear subdivision schemes. Building on some recent results on the stability of nonlinear multiscale transformations, we are able to give very short and concise proofs. In particular we point out an interesting connection between stability properties and approximation order for nonlinear subdivision schemes.     

Constructing higher-order methods for obtaining the multiple roots of nonlinear equations

This paper concentrates on iterative methods for obtaining the multiple roots of nonlinear equations. Using the computer algebra system Mathematica, we construct an iterative scheme and discuss the conditions to obtain fourth-order methods from it. All the presented fourth-order methods require one-function and two-derivative evaluation per iteration, and are optimal higher-order iterative methods for obtaining multiple roots. We present some special methods from the iterative scheme, including some known already. Numerical examples are also given to show their performance.     

From approximating subdivision schemes for exponential splines to high-performance interpolating algorithms

In this work we construct three novel families of approximating subdivision schemes that generate piecewise exponential polynomials and we show how to convert these into interpolating schemes of great interest in curve design for their ability to reproduce important analytical shapes and to provide highly smooth limit curves with a controllable tension.     

Convergence of subdivision schemes in L p spaces

Abstract. In this paper it is proved that Lp solutions of a refinement equation exist if and only ifthe corresponding subdivision scheme with suitable initial function converges in Lp without anyassumption on the stability of the solutions of the refinement equation. A characterization forconvergence of subdivision scheme is also given in terms of the refinement mask. Thus a com-plete answer to the relation between the existence of Lp solutions of the refinement equation andthe convergence of the corresponding subdivision schemes is given.     

Some modifications of Newton’s method with higher-order convergence for solving nonlinear equations

In [YoonMee Ham etal., Some higher-order modifications of Newton’s method for solving nonlinear equations, J. Comput. Appl. Math., 222 (2008) 477–486], some higher-order modifications of Newton’s method for solving nonlinear equations are constructed. But if p=2$p=2$, then their main theorem did not hold. In this paper, we first give an example to show that YoonMee Ham etal.’s methods are not always correct in the case p=2$p=2$. Then, we present the condition that H(x,y)$H(x,y)$ should satisfy such that the order of convergence increases three or four or five units. Per iteration they only need two additional function evaluations to increase the order. Based on this and multi-step Newton’s scheme, we give further modifications of the method to obtain higher-order convergent iterative methods. Finally, several examples are given to demonstrate the efficiency and performance of our modified methods and compare them with some other methods.     

Second-order characteristic schemes in time and age for a nonlinear age-structured population model

In this paper, we analyze two new second-order characteristic schemes in time and age for an age-structured population model with nonlinear diffusion and reaction. By using the characteristic difference to approximate the transport term and the average along the characteristics to treat the nonlinear spatial diffusion and reaction terms, an implicit second-order characteristic scheme is proposed. To compute the nonlinear approximation system, an explicit second-order characteristic scheme in time and age is further proposed by using the extrapolation technique. The global existence and uniqueness of the solution of the nonlinear approximation scheme are established by using the theory of variation methods, Schauder’s fixed point theorem, and the technique of prior estimates. The optimal error estimates of second order in time and age are strictly proved for both the implicit and the explicit characteristic schemes. Numerical examples are given to illustrate the performance of the methods.     

Nonlinear Methods of Approximation

Abstract. Our main interest in this paper is nonlinear approximation. The basic idea behind nonlinear approximation is that the elements used in the approximation do not come from a fixed linear space but are allowed to depend on the function being approximated. While the scope of this paper is mostly theoretical, we should note that this form of approximation appears in many numerical applications such as adaptive PDE solvers, compression of images and signals, statistical classification, and so on. The standard problem in this regard is the problem of m -term approximation where one fixes a basis and looks to approximate a target function by a linear combination of m terms of the basis. When the basis is a wavelet basis or a basis of other waveforms, then this type of approximation is the starting point for compression algorithms. We are interested in the quantitative aspects of this type of approximation. Namely, we want to understand the properties (usually smoothness) of the function which govern its rate of approximation in some given norm (or metric). We are also interested in stable algorithms for finding good or near best approximations using m terms. Some of our earlier work has introduced and analyzed such algorithms. More recently, there has emerged another more complicated form of nonlinear approximation which we call highly nonlinear approximation. It takes many forms but has the basic ingredient that a basis is replaced by a larger system of functions that is usually redundant. Some types of approximation that fall into this general category are mathematical frames, adaptive pursuit (or greedy algorithms), and adaptive basis selection. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. With this motivation, our recent work and the current activity focuses on nonlinear approximation both in the classical form of m -term approximation (where several important problems remain unsolved) and in the form of highly nonlinear approximation where a theory is only now emerging.     

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.     

On vector subdivision

In this paper we give a complete characterization of the convergence of stationary vector subdivision schemes and the regularity of the associated limit function. These results extend and complete our earlier work on vector subdivision and its use in the construction of multiwavelets. Received March 19, 1997; in final form November 13, 1997     

Whitney theorem of interpolatory type for k-monotone functions

One of the main results of this paper is the following Whitney theorem of interpolatory type for k-monotone functions (i.e., functions f such that divided differences f[x ₀,…, x _k ] are nonnegative for all choices of (k + 1) distinct points x ₀,…, x _k .