Tracking poles and representing Hankel operators directly from data

Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL ² fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL ² which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF     

Product formulas and convolution structure for Fourier-Bessel series

One of the most far-reaching qualities of an orthogonal system is the presence of an explicit product formula. It can be utilized to establish a convolution structure and hence is essential for the harmonic analysis of the corresponding orthogonal expansion. As yet a convolution structure for Fourier-Bessel series is unknown, maybe in view of the unpractical nature of the corresponding expanding functions called Fourier-Bessel functions. It is shown in this paper that for the half-integral values of the parameter ,n=0, 1, 2,, the Fourier-Bessel functions possess a product formula, the kernel of which splits up into two different parts. While the first part is still the well-known kernel of Sonine's product formula of Bessel functions, the second part is new and reflects the boundary constraints of the Fourier-Bessel differential equation. It is given, essentially, as a finite sum over triple products of Bessel polynomials. The representation is explicit up to coefficients which are calculated here for the first two nontrivial cases and . As a consequence, a positive convolution structure is established for . The method of proof is based on solving a hyperbolic initial boundary value problem.Communicated by Tom H. Koornwinder.     

Sphere orders

Ann-sphere order is a finite partially ordered set representable by containment ofn-spheres in Euclidean (n+1)-space. We present a sequence {P _i } of ordered sets such that eachP _i is ann-sphere order only forni; one consequence is that we are able to determine the dimension of a Euclidean space-time manifold from the finite suborders of its causality order.Research supported by ONR grant N00014 85-K-0769.     

Algorithms for non-linear huber estimation

The Huber criterion for data fitting is a combination of thel ₁ and thel ₂ criteria which is robust in the sense that the influence of wild data points can be reduced. We present a trust region and a Marquardt algorithm for Huber estimation in the case where the functions used in the fit are non-linear. It is demonstrated that the algorithms converge under the usual conditions.     

A fast ‘Monte-Carlo cross-validation’ procedure for large least squares problems with noisy data

Summary We propose a fast Monte-Carlo algorithm for calculating reliable estimates of the trace of the influence matrixA involved in regularization of linear equations or data smoothing problems, where is the regularization or smoothing parameter. This general algorithm is simply as follows: i) generaten pseudo-random valuesw ₁, ...,w _n , from the standard normal distribution (wheren is the number of data points) and letw=(w ₁, ...,w _n ) ^T , ii) compute the residual vectorw–A w, iii) take the normalized inner-product (w ^T (w–A w))/(w ^T w) as an approximation to (1/n)tr(I–A ). We show, both by theoretical bounds and by numerical simulations on some typical problems, that the expected relative precision of these estimates is very good whenn is large enough, and that they can be used in practice for the minimization with respect to of the well known Generalized Cross-Validation (GCV) function. This permits the use of the GCV method for choosing in any particular large-scale application, with only a similar amount of work as the standard residual method. Numerical applications of this procedure to optimal spline smoothing in one or two dimensions show its efficiency.     

Truncation error bounds for modified continued fractions with applications to special functions

Much recent work has been done to investigate convergence of modified continued fractions (MCF's), following the proof by Thron and Waadeland [35] in 1980 that a limit-periodic MCFK(a _n , 1;x ₁), with andnth approximant

Uniformly convergent difference schemes for singularly perturbed parabolic diffusion-convection problems without turning points

We consider first the initial-boundary value problem for the parabolic equation

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.     

Uniform fourth order difference scheme for a singular perturbation problem

Summary The numerical solution of a nonlinear singularly perturbed two-point boundary value problem is studied. The developed method is based on Hermitian approximation of the second derivative on special discretization mesh. Numerical examples which demonstrate the effectiveness of the method are presented.This research was partly supported by NSF and SIZ for Science of SAP Vojvodina through funds made available to the U.S.-Yugoslav Joint Board on Scientific and Technological Cooperation (grants JF 544, JF 799)     

A fourth order method for a singular two-point boundary value problem

Recently, Chawla et al. described a second order finite difference method for the class of singular two-point boundary value problems: