Stability of a spline collocation method for strongly elliptic multidimensional singular integral equations

Summary We consider a spline collocation method for strongly elliptic zero order pseudodifferential equationsp _gw Au=f on a cube =(0, 1) ^m . Utilizing multilinear spline functions which are zero at the boundary we collocate at the meshpoints inside . For classical strongly elliptic translation invariant pseudodifferential operators, we verify the stability of the considered collocation method inL ²(). Afterwards, form2 and a right hand sidefH ⁸(),s>m/2, we prove an asymptotic convergence estimate.The author has been supported by a grant of Deutsche Forschungsgemeinschaft under grant number Ko 634/32-1     

Fully discrete Galerkin approximations of parabolic boundary-value problems with nonsmooth boundary data

Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL _p[O,T;L ₂()] norms for boundary conditions inL _p[O,T;L ₂()], 1p.     

Numerical application of Euler's series transformation and its generalizations

Summary A nonlinear generalizationÊ _z of Euler's series transformation is compared with the (linear) Euler-Knopp transformationE _z and a twoparametric methodE . It is shown how to applyE orE _, to compute the valuef(z_o) of a functionf from the power series at 0 iff is holomorphic in a half plane or in the cut plane. BothE andE _, are superior toÊ _z . A compact recursive algorithm is given for computingE andE _,.     

Stability radius of polynomials occurring in the numerical solution of initial value problems

This paper deals with polynomial approximations(x) to the exponential function exp(x) related to numerical procedures for solving initial value problems. Motivated by stability requirements, we present a numerical study of the largest diskD()={z C: |z+|} that is contained in the stability regionS()={z C: |(z)|1}. The radius of this largest disk is denoted byr(), the stability radius. On the basis of our numerical study, several conjectures are made concerningr _m,p=sup {r(): _m,p}. Here _{m, p} (1pm; p, m integers) is the class of all polynomials(x) with real coefficients and degree m for which(x)=exp(x)+O(x ^p+1) (forx 0).     

Nonlinear stability and convergence of finite-difference methods for the “good” Boussinesq equation

Summary The good Boussinesq equationu _tt =–u _xxxx +u _xx +(u ²) _xx has recently been found to possess an interesting soliton-interaction mechanism. In this paper we study the nonlinear stability and the convergence of some simple finite-difference schemes for the numerical solution of problems involving the good Boussinesq equation. Numerical experimentas are also reported.     

Stability of the method of lines

Summary It is well known that a necessary condition for the Lax-stability of the method of lines is that the eigenvalues of the spatial discretization operator, scaled by the time stepk, lie within a distanceO(k) of the stability region of the time integration formula ask0. In this paper we show that a necessary and sufficient condition for stability, except for an algebraic factor, is that the -pseudo-eigenvalues of the same operator lie within a distanceO()+O(k) of the stability region ask, 0. Our results generalize those of an earlier paper by considering: (a) Runge-Kutta and other one-step formulas, (b) implicit as well as explicit linear multistep formulas, (c) weighted norms, (d) algebraic stability, (e) finite and infinite time intervals, and (f) stability regions with cusps.In summary, the theory presented in this paper amounts to a transplantation of the Kreiss matrix theorem from the unit disk (for simple power iterations) to an arbitrary stability region (for method of lines calculations).Work supported by an NSF Presidential Young Investigator Award to L.N. Trefethen     

The dependence of critical parameter bounds on the monotonicity of a Newton sequence

Summary A new method is proposed for the inclusion of the critical parameter ^* of some convex operator equationu=Tu (appearing e.g. in thermal explosion theory). It is based on the fact that for a fixed Newton's method starting with a suitable subsolution is not monotonically if and only if >^*. Several numerical examples arising from nonlinear boundary value problems illustrate the efficiency of the method.     

Comparison of four algorithms accelerating the convergence of a subset of logarithmic fixed point sequences

The behaviour of four algorithms accelerating the convergence of a subset of LOG is compared (LOG is the set of logarithmic sequences). This subset, denoted LOGF ₁ , is that of fixed point sequences whose associated error sequence,e _n =S _n –S, verifiese _n+1 =e _n + ₂ e _n ² + ₃ e _n ³ +... , where _{3 2} ² , ₂ < 0. The algorithms are modifications of the -algorithm and of Aitken's ² adapted to LOGF ₁ , the iterated ₂-algorithm, or Lubkin's transform, and the -algorithm of Brezinski. All of them accelerate the convergence of sequences in LOGF ₁ , but precise results are given on their relative convergence speed. This comparison is illustrated by numerical examples.     

A spectral Galerkin approximation of the Orr-Sommerfeld eigenvalue problem in a semi-infinite domain

Summary The convergence of a Galerkin approximation of the Orr-Sommerfeld eigenvalue problem, which is defined in a semi-infinite domain, is studied theoretically. In case the system of trial functions is based on a composite of Jacobi polynomials and an exponential transform of the semi-infinite domain, the error of the Galerkin approximation is estimated in terms of the transformation parametera and the numberN of trial functions. Finite or infinite-order convergence of the spectral Galerkin method is obtained depending on how the transformation parameter is chosen. If the transformation parameter is fixed, then convergence is of finite order only. However, ifa is varied proportional to 1/N with an exponent 0<<1, then the approximate eigenvalue converges faster than any finite power of 1/N asN. Some numerical examles are given.     

On the acceleration of limit periodic continued fractions

Summary A continued fraction (c.f.)K(a _n /1) is called limit periodic if . Fora anda(–,–1/4],a0, Thron-Waadeland (1980) examined a modification of a limit periodic c.f. for accelerating the convergence. This acceleration remains modest if thea _n converge only logarithmically. Thus it is proposed to apply an Euler summability method to the series equivalent to the c.f. Properties of the equivalent function are derived. These properties are used for choosing appropriate parameters for the summability method such that a considerable acceleration can be expected even if thea _n converge logarithmically.Dedicated to Prof. F.L. Bauer on the occasion of his 60th birthday     

A θ-stable approximations of abstract Cauchy problems

Summary We study the approximation of linear parabolic Cauchy problems by means of Galerkin methods in space andA -stable multistep schemes of arbitrary order in time. The error is evaluated in the norm ofL _t ² (H _x ¹ ) L _t (L _x ² ).     

Rates of convergence and optimal spectral bandwidth for long range dependence

Summary For a realization of lengthn from a covariance stationary discrete time process with spectral density which behaves like ^1–2H as 0+ for 1/2<H<1 (apart from a slowly varying factor which may be of unknown form), we consider a discrete average of the periodogram across the frequencies 2j/n,j=1,..., m, wherem andm/n0 asn. We study the rate of convergence of an analogue of the mean squared error of smooth spectral density estimates, and deduce an optimal choice ofm.     

Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method

Summary A gradient technique previously developed for computing the eigenvalues and eigenvectors of the general eigenproblemAx=Bx is generalized to the eigentuple-eigenvector problem . Among the applications of the latter are (1) the determination of complex (,x) forAx=Bx using only real arithmetic, (2) a 2-parameter Sturm-Liouville equation and (3) -matrices. The use of complex arithmetic in the gradient method is also discussed. Computational results are presented.This research was partially supported by NSF Grants MPS74-13332 and MCS76-09172     

An asymptotic finite element method for improvement of solutions of boundary layer problems

Summary A scheme that uses singular perturbation theory to improve the performance of existing finite element methods is presented. The proposed scheme improves the error bounds of the standard Galerkin finite element scheme by a factor of O(ⁿ⁺¹) (where is the small parameter andn is the order of the asymptotic approximation). Numerical results for linear second order O.D.E.'s are given and are compared with several other schemes.     

On a family of topologies on the spaceL p

We study a family of topologies {_s}_{0 on the space lp, 0s} is the protective topology on l_p generated by the family of multipliers m_y:l_pl_s, m_y(x)=x · y, where y ranges over the space l_p and 1/p + 1/q=1/s. Here l_s is taken with its standard topology generated by the norm for s 1 or a pseudonorm if 0s}_{0sp is strictly increasing and that all the topologies s}, 0s are not locally convex when 0Matematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 35, 1992, pp. 194–198.     

On a numerical approach to Stefan-like problems

Summary This paper is devoted to the numerical analysis of a bidimensional two-phase Stefan problem. We approximate the enthalpy formulation byC ⁰ piecewise linear finite elements in space combined with a semi-implicit scheme in time. Under some restrictions related to the finite element mesh and to the timestep, we prove positivity, stability and convergence results. Various numerial tests are presented and discussed in order to show the accuracy of our scheme.This work is supported by the Fonds National Suisse pour la Recherche Scientifique.     

Quadratic spline interpolation on uniform meshes

The interpolation problem at uniform mesh points of a quadratic splines(x _i)=f _i,i=0, 1,...,N ands(x ₀)=f₀ is considered. It is known that s–f=O(h ³) and s–f=O(h ²), whereh is the step size, and that these orders cannot be improved. Contrary to recently published results we prove that superconvergence cannot occur for any particular point independent off other than mesh points wheres=f by assumption. Best error bounds for some compound formulae approximatingf _i andf _i ⁽³⁾ are also derived.     

Schur rings and cyclic association schemes of class three

LetG be a group of finite order andD ₀ = {e},D ₁,...,D _d be a partition ofG. Suppose{d ^–1|d D _i } =D _{i, i {0, 1,..., d}}, for eachi {0, 1,..., d}; and for alli, j where . Then the subalgebra spanned by is called a Schur ring overG. It is known that such a partitionD ₀,D ₁,...,D _d can be used to construct an association scheme of classd. In this paper, we obtain a complete classification for the case whenG is cyclic andd = 3. The result corresponds to a complete classification of cyclic association schemes of class three.     

Zur Interpolation und Integration differenzierbarer periodischer Funktionen

Summary Letx ₀<x ₁<...<x _n–1<x ₀+2 be nodes having multiplicitiesv ₀,...,v _n–1, 1v _k r (0k<n). We approximate the evaluation functional ,x fixed, and the integral respectively by linear functionals of the form and determine optimal weights for the Favard classesW _r C ₂. In the even case of optimal interpolation these weights are unique except forr=1,x(x _k +x _k–1)/2 mod 2. Moreover we get periodic polynomial splinesw _{k, j} (0k<n, 0j<v _k ) of orderr such that are the optimal weights. Certain optimal quadrature formulas are shown to be of interpolatory type with respect to these splines. For the odd case of optimal interpolation we merely have obtained a partial solution.

Bojanov hat in [4, 5] ähnliche Resultate wie wir erzielt. Um Wiederholungen zu vermeiden, werden Resultate, deren Beweise man bereits in [4, 5] findet, nur zitiert     

Monotonicity and boundedness in implicit Runge-Kutta methods

Summary This paper concerns the analysis of implicit Runge-Kutta methods for approximating the solutions to stiff initial value problems. The analysis includes the case of (nonlinear) systems of differential equations that are essentially more general than the classical test equationU=U (with a complex constant). The properties of monotonicity and boundedness of a method refer to specific moderate rates of growth of the approximations during the numerical calculations. This paper provides necessary conditions for these properties by using the important concept of algebraic stability (introduced by Burrage, Butcher and by Crouzeix). These properties will also be related to the concept of contractivity (B-stability) and to a weakened version of contractivity.