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     

Finding numerical solution of linear partial differential equations of first order with real coefficients

Applying Bittner's operational calculus we present a method to give approximate solutions of linear partial differential equations of first order

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.     

The evaluation of Cauchy principal value integrals involving unknown poles

A method is described for the evaluation of a Cauchy principal value integral of the formf ₀ ^p f(t)dt, wheref is analytic in the interval [0,p] except at a simple pole at an unknown point in (0,p), with an unknown residue. The method is based on the trapezoidal rule.     

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.     

Asymptotic expansions andL ∞-error estimates for mixed finite element methods for second order elliptic problems

Summary Asymptotic expansions for mixed finite element approximations of the second order elliptic problem are derived and Richardson extrapolation can be applied to increase the accuracy of the approximations. A new procedure, which is called the error corrected method, is presented as a further application of the asymptotic error expansion for the first order BDM approximation of the scalar field. The key point in deriving the asymptotic expansions for the error is an establishment ofL ¹-error estimates for mixed finite element approximations for the regularized Green's functions. As another application of theL ¹-error estimates for the regularized Green's functions, we shall present maximum norm error estimates for mixed finite element methods for second order elliptic problems.     

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.     

Spectral methods with sparse matrices

Summary Spectral methods employ global polynomials for approximation. Hence they give very accurate approximations for smooth solutions. Unfortunately, for Dirichlet problems the matrices involved are dense and have condition numbers growing asO(N ⁴) for polynomials of degree N in each variable. We propose a new spectral method for the Helmholtz equation with a symmetric and sparse matrix whose condition number grows only asO(N ²). Certain algebraic spectral multigrid methods can be efficiently used for solving the resulting system. Numerical results are presented which show that we have probably found the most effective solver for spectral systems.     

On the asymptotic stability ofθ-methods for delay differential equations

Stability regions of -methods for the linear delay differential test equations

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