A posteriori L2 error estimation on anisotropic tetrahedral finite element meshes

A new a posteriori L₂ norm error estimator is proposed for thePoisson equation. The error estimator can be applied to anisotropictetrahedral or triangular finite element meshes. The estimatoris rigorously analysed for Dirichlet and Neumann boundary conditions. The lower error bound relies on specifically designed anisotropicbubble functions and the corresponding inverse inequalities.The upper error bound utilizes non-standard anisotropic interpolationestimates. Its proof requires H² regularity of the Poisson problem,and its quality depends on how good the anisotropic mesh resolvesthe anisotropy of the problem. This is measured by a so-called‘matching function’. A numerical example supports the anisotropic error analysis.     

A qualocation method for a unidimensional single phase semilinear Stefan problem

Based on straightening the free boundary, a qualocation methodis proposed and analysed for a single phase unidimensional Stefanproblem. This method may be considered as a discrete versionof the H¹-Galerkin method in which the discretization is achievedby approximating the integrals by a composite Gauss quadraturerule. Optimal error estimates are derived in L(W^j,), j = 0,1,and L (H^j), j = 0,1,2, norms for a semidiscrete scheme withoutany quasi-uniformity assumption on the finite element mesh.     

An a posteriori error estimator for the Lame equation based on equilibrated fluxes

Katharina Witowski ^{We derive a new a posteriori error estimator for the Lamésystem based on H(div)-conforming elements and equilibratedfluxes. It is shown that the estimator gives rise to an upperbound where the constant is one up to higher-order terms. Thelower bound is also established using Argyris elements. Thereliability and efficiency of the proposed estimator are confirmedby some numerical tests.}     

Optimal Regularity and Fredholm Properties of Abstract Parabolic Operators in Lp Spaces on the Real Line

We study the operator Lu(t):= u'(t) – A(t) u(t) on L^p(R; X) for sectorial operators A(t), with t R, on a Banachspace X that are asymptotically hyperbolic, satisfy the Acquistapace–Terreniconditions, and have the property of maximal L^p-regularity.We establish optimal regularity on the time interval R showingthat L is closed on its minimal domain. We further give conditionsfor ensuring that L is a semi-Fredholm operator. The Fredholmproperty is shown to persist under A(t)-bounded perturbations,provided they are compact or have small A(t)-bounds. We applyour results to parabolic systems and to generalized Ornstein–Uhlenbeckoperators. 2000 Mathematics Subject Classification 35K20, 35K90,47A53.     

The largest prime factor of X3+2

The largest prime factor of X³+2 was investigated in 1978 byHooley, who gave a conditional proo that it is infinitely oftenat least as large as X¹+, with a certain positive constant .It is trivial to obtain such a result with =0. One may thinkof Hooley's result as an approximation to the conjecture thatX³+2 is infinitely often prime. The condition required by Hooley,his R^* conjecture, gives a non-trivial bound for short Ramanujan–Kloostermansums. The present paper gives an unconditional proof that thelargest prime factor of X³+2 is infinitely often at least aslarge as X¹⁺, though with a much smaller constant than thatobtained by Hooley. In order to do this we prove a non-trivialbound for short Ramanujan–Kloosterman sums with smoothmodulus. It is also necessary to modify the Chebychev method,as used by Hooley, so as to ensure that the sums that occurdo indeed have a sufficiently smooth modulus. 2000 MathematicsSubject Classification: 11N32.     

Uniform l1 behaviour for time discretization of a Volterra equation with completely monotonic kernel: I. stability

This paper is the first of two papers on the time discretizationof the equation u_t + ^t ₀ ß (t — s) Au (s) ds= 0, t > 0, u (0) = u₀, where A is a self-adjoint denselydefined linear operator on a Hilbert space H with a completeeigensystem {_m, _m}_{m = 1}, and ß (t) is completely monotonicand locally integrable, but not constant. The equation is discretizedin time using first-order differences in combination with order-oneconvolution quadrature. The stability properties of the timediscretization are derived in the l¹_t (0, ; H) norm.     

The reliability of local error estimators for convection-diffusion equations

We assess the reliability of a simple a posteriori error estimatorfor steady-state convection–diffusion equations in caseswhere convection dominates. Our estimator is computed by solvinga local Poisson problem with Neumann boundary conditions. Itgives global upper and local lower bounds on the error measuredin the H¹ semi-norm. However, the error may be overestimatedlocally within boundary layers if these are not resolved bythe mesh, that is, when the local mesh Péclet numberis significantly greater than unity. We discuss the implicationsof this overestimation in a practical context where the estimatoris used as a local error indicator within a self-adaptive meshrefinement process. Received 18 June 1999. Accepted 7 March 2000.     

Hopf C*-Algebras

In this paper we define and study Hopf C^*-algebras. Roughlyspeaking, a Hopf C^*-algebra is a C^*-algebra A with a comultiplication: A M(A A) such that the maps a b (a)(1 b) and a (a 1)(b)have their range in A A and are injective after being extendedto a larger natural domain, the Haagerup tensor product A _hA. In a purely algebraic setting, these conditions on are closelyrelated to the existence of a counit and antipode. In this topologicalcontext, things turn out to be much more subtle, but neverthelessone can show the existence of a suitable counit and antipodeunder these conditions. The basic example is the C^*-algebra C₀(G) of continuous complexfunctions tending to zero at infinity on a locally compact groupwhere the comultiplication is obtained by dualizing the groupmultiplication. But also the reduced group C^*-algebra of a locally compact group with thewell-known comultiplication falls in this category. In factall locally compact quantum groups in the sense of Kustermansand the first author (such as the compact and discrete ones)as well as most of the known examples are included. This theory differs from other similar approaches in that thereis no Haar measure assumed. 2000 Mathematics Subject Classification: 46L65, 46L07, 46L89.     

Fourier Multipliers for Lp on Chebli-Trimeche Hypergroups

In this paper we consider Fourier multipliers for L^p (p>1)on Chébli-Trimèche hypergroups and establish aversion of Hörmander's multiplier theorem. As applicationswe give some results concerning the Riesz potentials and oscillatingmultipliers. 1991 Mathematics Subject Classification: 43A62,43A15, 43A32.     

An adaptive boundary element method for the exterior Stokes problem in three dimensions

^** Email: vjervin{at}clemson.edu^*** Email: norbert.heuer{at}brunel.ac.uk We present an adaptive refinement strategy for the h-versionof the boundary element method with weakly singular operatorson surfaces. The model problem deals with the exterior Stokesproblem, and thus considers vector functions. Our error indicatorsare computed by local projections onto 1D subspaces definedby mesh refinement. These indicators measure the error separatelyfor the vector components and allow for component-independentadaption. Assuming a saturation condition, the indicators giverise to an efficient and reliable error estimator. Also we describehow to deal with meshes containing quadrilaterals which arenot shape regular. The theoretical results are underlined bynumerical experiments. To justify the saturation assumption,in the Appendix we prove optimal lower a priori error estimatesfor edge singularities on uniform and graded meshes.     

Error estimates for the approximate solutions of a nonlinear hyperbolic equation given by finite volume schemes

This paper is devoted to the study of an error estimate of thefinite volume, approximation to the solution u L(R_N x R) ofthe equation u_t + div(Vf(u)) = 0, where v is a vector functiondepending on time and space. A 'h' error estimate for an initialvalue in BV(R^N) is shown for a large variety of finite volumemonotonous flux schemes, with an explicit or implicit time discretization.For this purpose, the error estimate is given for the generalsetting of approximate entropy solutions, where the error isexpressed in terms of measures in R^N and R^N x R. The study ofthe implicit schemes involves the study of the existence anduniqueness of the approximate solution. The cases where an 'h'error estimate can be achieved are also discussed.     

A hierarchical basis preconditioner for the biharmonic equation on the sphere

^** Email: jan.maes{at}cs.kuleuven.be In this paper, we propose a natural way to extend a bivariatePowell–Sabin (PS) B-spline basis on a planar polygonaldomain to a PS B-spline basis defined on a subset of the unitsphere in [graphic: see PDF] . The spherical basis inherits many properties of the bivariatebasis such as local support, the partition of unity propertyand stability. This allows us to construct a C¹ continuous hierarchicalbasis on the sphere that is suitable for preconditioning fourth-orderelliptic problems on the sphere. We show that the stiffnessmatrix relative to this hierarchical basis has a logarithmicallygrowing condition number, which is a suboptimal result comparedto standard multigrid methods. Nevertheless, this is a hugeimprovement over solving the discretized system without preconditioning,and its extreme simplicity contributes to its attractiveness.Furthermore, we briefly describe a way to stabilize the hierarchicalbasis with the aid of the lifting scheme. This yields a waveletbasis on the sphere for which we find a uniformly well-conditionedand (quasi-) sparse stiffness matrix.     

Optimum Runge-Kutta-Fehlberg Methods for Second-order Differential Equations

^* Presently at Deparment of Mathematics, Indian Institute of Technology, Madras, India. The optimum Runge-Kutta method of a particular order is theone whose truncation error is minimum. In this paper, we havederived optimum Runge-Kutta mehtods of 0(h^m+4), 0(h^m+5) and0(h^m+6) for m = 0(1)8, which can be directly used for solvingthe second order differential equation yⁿ = f(x, y, y'). Thesemethods are based on a transformation similar to that of Fehlbergand require two, three and four evaluations of f(x, y, y') respectively,for each step. The numercial solutions of one example obtainedwith these methods are given. It has been assumed that f(x,y, y')is sufficiently differentiable in the entire region ofintegration.     

Error estimates for a finite-difference approximation of a mean field model of superconducting vortices in one-dimension

Error estimates for a semi-implicit finite-difference approximationof a mean field model of superconducting vortices are obtained.The L(L¹) error between the approximate and the exact superconductingvortex density of the model is of order h^1/3.     

Multiplicative Error Analysis of Matrix Transformation Algorithms

The author's recently introduced relative error measure forvectors is applied to the error analysis of algorithms whichproceed by successive transformation of a matrix. Instead ofmodelling the roundoff errors at each stage by A: = T(A)+E onemodels them by A: =e^E T(A) where E is a small linear transformation.This can simplify analyses considerably. Applications to theparallel Jacobi method for eigenvalues, and to Gaussian elimination,are given.     

The Accuracy of Error Estimates for Systems of Linear Algebraic Equations

Satisfactory error estimates are obtained from iterative refinementof the solution using M^–l, an approximation to the inverseof A and involving ||I–M^–1A||.     

A Fast Method for the Solution of Fredholm Integral Equations

Methods described to date for the solution of linear Fredholmintegral equations have a computing time requirement of O(N³),where N is the number of expansion functions or discretizationpoints used. We describe here a Tchebychev expansion method,based on the FFT, which reduces this time to O(N² ln N), andreport some comparative timings obtained with it. We give alsoboth a priori and a posteriori error estimates which are cheapto compute, and which appear more reliable than those used previously.     

Compact High-Order Finite Differences for Interface Problems in One Dimension

This paper is concerned with the construction and analysis ofcompact finite difference approximations to the model linearsource problem –(pu')' + qu = f where the functions p,q, and f can have jump discontinuities at a finite number ofpoints. Explicit formulae that give O(h²) O(h³) and O(h⁴) accuracyare derived, and a procedure for computing three-point schemesof any prescribed order of accuracy is presented. A rigoroustruncation and discretization error analysis is offered. Numericalresults are also given.