The Weierstrass mean

Theorem.Let the sequences {e _i ⁽ⁿ⁾ },i=1, 2, 3,n=0, 1, 2, ...be defined by where the e ⁽⁰⁾ s satisfy and where all square roots are taken positive. Then where the convergence is quadratic and monotone and where The discussions of convergence are entirely elementary. However, although the determination of the limits can be made in an elementary way, an acquaintance with elliptic objects is desirable for real understanding.     

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     

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.     

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

Comparison theorems forL-monosplines of minimal norm

Summary LetLM _N be the set of allL-monosplines withN free knots, prescribed by a pair (x;E) of pointsx = {x _i } ₁ ⁿ ,a <x ₁ < ... <x _n <b and an incidence matrixE = (e _ij ) _i=1 ⁿ , _r-1 ^j=0 with Denote byLM _N ^O the subset ofLM _N consisting of theL-monosplines withN simple knots (n=N). We prove that theL-monosplines of minimalL _p-norms inLM _N belong toLM _N ^O .The results are reformulated as comparison theorems for quadrature formulae.     

Continued fractions associated with the Newton-Padé table

Summary We discuss first the block structure of the Newton-Padé table (or, rational interpolation table) corresponding to the double sequence of rational interpolants for the data{(z _k, h(z_k)} _k =0. (The (m, n)-entry of this table is the rational function of type (m,n) solving the linearized rational interpolation problem on the firstm+n+1 data.) We then construct continued fractions that are associated with either a diagonal or two adjacent diagonals of this Newton-Padé table in such a way that the convergents of the continued fractions are equal to the distinct entries on this diagonal or this pair of diagonals, respectively. The resulting continued fractions are generalizations of Thiele fractions and of Magnus'sP-fractions. A discussion of an some new results on related algorithms of Werner and Graves-Morris and Hopkins are also given.Dedicated to the memory of Helmut Werner (1931–1985)     

Numerical methods for reaction-diffusion problems with non-differentiable kinetics

Summary We consider a class of steady-state semilinear reaction-diffusion problems with non-differentiable kinetics. The analytical properties of these problems have received considerable attention in the literature. We take a first step in analyzing their numerical approximation. We present a finite element method and establish error bounds which are optimal for some of the problems. In addition, we also discuss a finite difference approach. Numerical experiments for one- and two-dimensional problems are reported.Dedicated to Ivo Babuka on his sixtieth birthdayResearch partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF under Grant Number AFOSR 85-0322     

On theR-order of coupled sequences arising in single-step type methods

Summary As shown in preceding papers of the authors, the verification of anR-convergence order for sequences coupled by a system (1.1) of basic inequalities can be reduced to the positive solvability of system (3.3) of linear inequalities. Further, the bestR-order implied by (1.1) is equal to the minimal spectral radius of certain matrices composed from the exponents occuring in (1.1). Now, these results are proven in a unified and essentially simpler way. Moreover, they are somewhat extended in order to facilitate applications to concrete methods.