Convergence of mixed finite element approximations for the shallow arch problem

Summary The stability and convergence of mixed finite element methods are investigated, for an equilibrium problem for thin shallow elastic arches. The problem in its standard form contains two terms, corresponding to the contributions from the shear and axial strains, with a small parameter. Lagrange multipliers are introduced, to formulate the problem in an alternative mixed form. Questions of existence and uniqueness of solutions to the standard and mixed problems are addressed. It is shown that finite element approximations of the mixed problem are stable and convergent. Reduced integration formulations are equivalent to a mixed formulation which in general is distinct from the formulation shown to be stable and convergent, except when the order of polynomial interpolationt of the arch shape satisfies 1tmin (2,r) wherer is the order of polynomial approximation of the unknown variables.     

On the solution of singular linear systems of algebraic equations by semiiterative methods

Summary For a square matrixT ^n,n , where (I–T) is possibly singular, we investigate the solution of the linear fixed point problemx=T x+c by applying semiiterative methods (SIM's) to the basic iterationx ₀ ⁿ ,x _k T c _k–1+c(k1). Such problems arise if one splits the coefficient matrix of a linear systemA x=b of algebraic equations according toA=M–N (M nonsingular) which leads tox=M ^–1 N x+M ^–1 bT x+c. Even ifx=T x+c is consistent there are cases where the basic iteration fails to converge, namely ifT possesses eigenvalues 1 with ||1, or if =1 is an eigenvalue ofT with nonlinear elementary divisors. In these cases — and also ifx=T x+c is incompatible — we derive necessary and sufficient conditions implying that a SIM tends to a vector which can be described in terms of the Drazin inverse of (I–T). We further give conditions under which is a solution or a least squares solution of (I–T)x=c.Research supported in part by the Alexander von Humboldt-Stiftung     

The many limits of mixed means

The sequences introduced by Carlson (1971) are variants of the Gauss arithmetic geometric sequences (which have been elegantly discussed by D. A. Cox (1984, 1985)). Given (complex)a ₀,b ₀ we define

What do multistep methods approximate?

Summary Standard analysis of multistep methods for ODE's assumes the application of an initialization routine that generates the starting points. Here ak-step method is considered directly as a mappingR ^kn R ⁿ . It is shown to approximate a mapping which is expressible directly in terms of the flow of the vector field. Some useful properties of that mapping are shown and for strictly stable methods these are applied to the question of invariant circles near a hyperbolic periodic solution.     

Convolution quadrature and discretized operational calculus. I

Numerical methods are derived for problems in integral equations (Volterra, Wiener-Hopf equations) and numerical integration (singular integrands, multiple time-scale convolution). The basic tool of this theory is the numerical approximation of convolution integrals

Interpolatory properties of best rationalL 1-approximations

In this paper the distribution of the zeros of the error function for bestL ₁-approximation by rational functions fromR _n,m is considered. It is shown that the maximal distance between such zeros isO(1/(n–m)), ifn > m.Communicated by Edward B. Saff.     

A proof of Freud's conjecture for exponential weights

LetW (x) be a function nonnegative inR, positive on a set of positive measure, and such that all power moments ofW ²(x) are finite. Let {p _n (W ²;x)} ₀ denote the sequence of orthonormal polynomials with respect to the weightW ²(x), and let {A _n } ₁ and {B _n } ₁ denote the coefficients in the recurrence relation

A particle method for first-order symmetric systems

Summary We present and study a conservative particle method of approximation of linear hyperbolic and parabolic systems. This method is based on an extensive use of cut-off functions. We prove its convergence inL ² at the order as soon as the cut-off function belongs toW ^m+1.1.Dedicated to Professor Joachim Nitsche on the occasion of his 60th birthday     

On orthogonal linear ℓ1 approximation

Summary The problem is considered of orthogonal ₁ fitting of discrete data. Local best approximations are characterized and the question of the robustness of these solutions is considered. An algorithm for the problem is presented, along with numerical results of its application to some data sets.     

Das asymptotische Verhalten der Peanokerne einiger interpolatorischer Quadraturverfahren

Summary Interpolatory quadrature formulae consist in replacing by wherep _f denotes the interpolating polynomial off with respect to a certain knot setX. The remainder may in many cases be written as wherem=n resp. (n+1) forn even and odd, respectively. We determine the asymptotic behaviour of the Peano kernelP _X (t) forn for the quadrature formulae of Filippi, Polya and Clenshaw-Curtis.