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

Dual vectors and lower bounds for the nearest lattice point problem

We prove that given a point outside a given latticeL then there is a dual vector which gives a fairly good estimate for how far from the lattice the vector is. To be more precise, there is a set of translated hyperplanesH _i, such thatL _iH_i andd( _iH_i)(6n ²+1)^–1 d( ,L).Supported by an IBM fellowship.     

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     

A 0-stable linear multistep formulas of theα-type

The-type linear multistep formulas are a generalization of the Adams-type formulas. This paper is concerned with completely characterizing theA ₀-stability of thek-step, orderk -type formulas. Specifically, all such formulas of orders 4 or less are identified and it is shown that no-type formulas of order 5 or more exist. These theorems generalize some previous results.     

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.

     

Mixed finite element approximation of the vector potential

Summary We consider a mixed finite element approximation of the three dimensional vector potential, which plays an important rôle in the simulation of perfect fluids and in the calculation of rotational corrections to transonic potential flows. The central point of our approach is a saddlepoint formulation of the essential boundary conditions. In particular, this avoids the wellknown Babuka paradox when approximating smooth domains by polyhedrons. Using piecewise linear/piecewise constant elements for the vector potential/the boundary terms, we obtain optimal error estimates under minimal regularity assumptions for the solution of the continuous problem.