Error estimates for stochastic differential games: the adverse stopping case

^** Email: frederic.bonnans{at}inria.fr^*** Email: stefania.maroso{at}inria.fr^**** Email: zidani{at}ensta.fr We obtain error bounds for monotone approximation schemes ofa particular Isaacs equation. This is an extension of the theoryfor estimating errors for the Hamilton–Jacobi–Bellmanequation. To obtain the upper error bound, we consider the ‘Krylovregularization’ of the Isaacs equation to build an approximatesub-solution of the scheme. To get the lower error bound, weextend the method of Barles & Jakobsen (2005, SIAM J. Numer.Anal.) which consists in introducing a switching system whosesolutions are local super-solutions of the Isaacs equation.     

Finite element approximation of the Neumann eigenvalue problem in domains with multiple cracks

^** Email: belhach{at}poncelet.univ-metz.fr^*** Email: bucur{at}math.univ-metz.fr^**** Email: jmse{at}math.univ-metz.fr We study the Neumann–Laplacian eigenvalue problem in domainswith multiple cracks. We derive a mixed variational formulationwhich holds on the whole geometric domain (including the cracks)and implements efficient finite-element discretizations forthe computation of eigenvalues. Optimal error estimates aregiven and several numerical examples are presented, confirmingthe efficiency of the method. As applications, we numericallyinvestigate the behaviour of the low eigenvalues in domainswith a large number of cracks.     

The Helmholtz equation in a locally perturbed half-plane with passive boundary

^** Email: mduran{at}ing.puc.cl^*** Email: ignacio.muga{at}ucv.cl^**** Email: nedelec{at}cmapx.polytechnique.fr In this article, we study the existence and uniqueness of outgoingsolutions for the Helmholtz equation in locally perturbed half-planeswith passive boundary. We establish an explicit outgoing radiationcondition which is somewhat different from the usual Sommerfeld'sone due to the appearance of surface waves. We work with thehelp of Fourier analysis and a half-plane Green's function framework.This is an extended and detailed version of the previous articleDurán et al. (2005, The Helmholtz equation with impedancein a half-plane. C. R. Acad. Sci. Paris, Ser. I, 340, 483–488).     

Supraconvergence of a finite difference scheme for solutions in Hs(0, L)

^** Email: silvia{at}mat.uc.pt^*** Email: ferreira{at}mat.uc.pt^**** Email: grigo{at}math.tu-berlin.de In this paper we study the convergence of a centred finite differencescheme on a non-uniform mesh for a 1D elliptic problem subjectto general boundary conditions. On a non-uniform mesh, the schemeis, in general, only first-order consistent. Nevertheless, weprove for s (1/2, 2] order O(h^s)-convergence of solution andgradient if the exact solution is in the Sobolev space H^1+s(0,L), i.e. the so-called supraconvergence of the method. It isshown that the scheme is equivalent to a fully discrete linearfinite-element method and the obtained convergence order isthen a superconvergence result for the gradient. Numerical examplesillustrate the performance of the method and support the convergenceresult.     

Improving the accuracy of the mini-element approximation to Navier-Stokes equations

^** Email: blanca{at}imati.cnr.it^*** Email: frutos{at}mac.cie.uva.es^**** Corresponding author. Email: julia.novo{at}uam.es A technique to improve the accuracy of the mini-element approximationto incompressible the Navier–Stokes equations is introduced.Once the mini-element approximation has been computed at a fixedtime, the linear part of this approximation is postprocessedby solving a discrete Stokes problem. The bubble functions neededto stabilize the approximation to the Navier–Stokes equationsare not used at the postprocessing step. This postprocessingprocedure allows us to increase by one unit (up to a logarithmicterm) the H¹ norm rate of convergence of the velocity and correspondinglythe L² norm of the pressure. An error analysis of the algorithmis performed.     

A mortar spectral element method for 3D Maxwell's equations

^** Email: Tahar.Boulmezaoud{at}univ-pau.fr^*** Email: Mohammed.Elrhabi{at}math.jussieu.fr In this paper we propose a mortar spectral element method forsolving Maxwell's equations in 3D bounded cavities. The methodis based on a non-conforming decomposition of the domain intothe union of non-overlapping parallelepipeds. After provingan error estimate, we present some 3D computational resultswhich confirm the performance of the method.     

Finite time stability of differential inclusions

^** Email: emmanuel.moulay{at}ec-lille.fr^*** Email: wilfrid.perruquetti{at}ec-lille.fr In this paper, the problem of finite time stability is investigatedfor differential inclusion. Two sufficient conditions for finitetime stability, using a smooth Lyapunov function and a non-smoothone, are established. Then, the same idea is used to give twonecessary conditions. Examples are developed using the conceptof Krasovskii solutions for differential equation with discontinuousright-hand sides.     

The cyclic Barzilai--Borwein method for unconstrained optimization

^** Email: dyh{at}lsec.cc.ac.cn^*** Email: hager{at}math.ufl.edu^**** Email: klaus.schittkowski{at}uni-bayreuth.de^***** Email: hzhang{at}math.ufl.edu In the cyclic Barzilai–Borwein (CBB) method, the sameBarzilai–Borwein (BB) stepsize is reused for m consecutiveiterations. It is proved that CBB is locally linearly convergentat a local minimizer with positive definite Hessian. Numericalevidence indicates that when m > n/2 3, where n is the problemdimension, CBB is locally superlinearly convergent. In the specialcase m = 3 and n = 2, it is proved that the convergence rateis no better than linear, in general. An implementation of theCBB method, called adaptive cyclic Barzilai–Borwein (ACBB),combines a non-monotone line search and an adaptive choice forthe cycle length m. In numerical experiments using the CUTErtest problem library, ACBB performs better than the existingBB gradient algorithm, while it is competitive with the well-knownPRP+ conjugate gradient algorithm.     

A priori and a posteriori analysis of non-conforming finite elements with face penalty for advection-diffusion equations

^** Corresponding author. Email: l.elalaoui{at}imperial.ac.uk^*** Email: ern{at}cermics.enpc.fr^**** Email: erik.burman{at}epfl.ch We analyse a non-conforming finite-element method to approximateadvection–diffusion–reaction equations. The methodis stabilized by penalizing the jumps of the solution and thoseof its advective derivative across mesh interfaces. The a priorierror analysis leads to (quasi-)optimal estimates in the meshsize (sub-optimal by order in the L²-norm and optimal in thebroken graph norm for quasi-uniform meshes) keeping the Pécletnumber fixed. Then, we investigate a residual a posteriori errorestimator for the method. The estimator is semi-robust in thesense that it yields lower and upper bounds of the error whichdiffer by a factor equal at most to the square root of the Pécletnumber. Finally, to illustrate the theory we present numericalresults including adaptively generated meshes.     

On a Monte Carlo method for neutron transport criticality computations

^** Email: maire{at}univ-tln.fr^*** Email: denis.talay{at}sophia.inria.fr We give a stochastic representation of the principal eigenvalueof some homogeneous neutron transport operators. Our constructionis based upon the Feynman–Kac formula for integral transportequations, and uses probabilistic techniques only. We developa Monte Carlo method for criticality computations. We numericallytest this method on various homogeneous and inhomogeneous problems,and compare our results with those obtained by standard methods.     

A finite-volume scheme for dynamic reliability models

^** Email: christiane.cocozza{at}univ-mlv.fr^*** Email: robert.eymard{at}univ-mlv.fr^**** Email: sophie.mercier{at}univ-mlv.fr In a model arising in the dynamic reliability study of a system,the probability of the state of the system is completely describedby the Chapman–Kolmogorov equations, which are scalarlinear hyperbolic partial differential equations coupled bytheir right-hand side, the solution of which are probabilitymeasures. We propose in this paper a finite-volume scheme toapproximate these measures. We show, thanks to the proof ofthe tightness of the approximate solution, that the conservationof the probability mass leads to a compactness property. Theconvergence of the scheme is then obtained in the space of continuousfunctions with respect to the time variable, valued in the setof probability measures on [graphic: see PDF] . We finally show on a numerical example the accuracy and efficiencyof the approximation method.     

An a posteriori error indicator for discontinuous Galerkin discretizations of H(curl)-elliptic partial differential equations

^** Email: paul.houston{at}nottingham.ac.uk^*** Corresponding author. Email: ilaria.perugia{at}unipv.it^**** Email: schoetzau{at}math.ubc.ca We introduce a residual-based a posteriori error indicator fordiscontinuous Galerkin discretizations of H(curl; )-ellipticboundary value problems that arise in eddy current models. Weshow that the indicator is both reliable and efficient withrespect to the approximation error measured in terms of a naturalenergy norm. We validate the performance of the indicator withinan adaptive mesh refinement procedure and show its asymptoticexactness for a range of test problems.     

Reduced-basis output bound methods for parabolic problems

^** Email: rovas{at}uiuc.edu^*** Email: luc_machiels{at}mckinsey.com^**** Corresponding author. Email: maday{at}ann.jussieu.fr In this paper, we extend reduced-basis output bound methodsdeveloped earlier for elliptic problems, to problems describedby ‘parameterized parabolic’ partial differentialequations. The essential new ingredient and the novelty of thispaper consist in the presence of time in the formulation andsolution of the problem. First, without assuming a time discretization,a reduced-basis procedure is presented to ‘efficiently’compute accurate approximations to the solution of the parabolicproblem and ‘relevant’ outputs of interest. In addition,we develop an error estimation procedure to ‘a posteriorivalidate’ the accuracy of our output predictions. Second,using the discontinuous Galerkin method for the temporal discretization,the reduced-basis method and the output bound procedure areanalysed for the semi-discrete case. In both cases the reduced-basisis constructed by taking ‘snapshots’ of the solutionboth in time and in the parameters: in that sense the methodis close to Proper Orthogonal Decomposition (POD).     

The Z-transform and linear multistep stability

^** Email: mapjjc{at}maths.bath.ac.uk^*** Corresponding author. Email: ath{at}maths.bath.ac.uk^**** Email: hl{at}maths.bath.ac.uk This paper makes systematic use of control-theoretic methodssuch as the -transform, small-gain theorems and frequency-domainstability criteria in the analysis of the stability behaviourof linear multistep methods. Some of the results in Nevanlinna'swork are recovered and a number of new boundedness and asymptoticproperties of solutions of numerical schemes are obtained. Inparticular, we give a careful and detailed analysis of the nonlinearstability properties of strictly zero-stable methods.     

Solving the continuous space p-centre problem: planning application issues

^** Email: wei.97{at}osu.edu^*** Email: murray.308{at}osu.edu^**** Email: xiao.37{at}osu.edu The Voronoi diagram heuristic has been proposed for solvingthe p-centre problem in continuous space. However, importantassumptions underlie this heuristic and may be problematic forpractical applications. These simplifying assumptions includeuniformly distributed demand, representing a region as a rectangle;analysis of a simple Voronoi polygon in solving associated one-centreproblems and no restrictions on potential facility locations.In this paper, we explore the complexity of solving the continuousspace p-centre problem in location planning. Considering theissue of solution space feasibility, we present a spatiallyrestricted version of this problem and propose methods for solvingit heuristically. Theoretical and empirical results are provided.     

On computing eigenvalues of second-order linear pencils

^** Email: mhannaby{at}yahoo.com^*** Email: zahraa26{at}yahoo.com In this paper, we use sinc techniques to compute the eigenvaluesof a second-order operator pencil of the form Q – P approximately.Here Q and P are self-adjoint differential operators of thesecond and first order, respectively. Also the eigenparameterappears in the boundary conditions linearly.     

Null Riemannian cubics in tension in SO(3)

^** Email: lyle{at}maths.uwa.edu.au^*** Email: popiet01{at}maths.uwa.edu.au Riemannian cubics in tension in the rotation group SO(3) arevariational curves with applications to interpolation problemsin computer graphics and rigid-body trajectory planning. Theyare related by a linking equation to Lie quadratics in tension(LQT) in the Lie algebra so(3). This paper provides a qualitativeanalysis of the null case of LQT in so(3).     

On the solvability for the mixed-type Lyapunov equation

^** Email: xsf{at}math.pku.edu.cn^*** Email: mscheng{at}math.pku.edu.cn In this paper, the linear matrix equation X = AXB^* + BXA^* +Q is considered, which is called the mixed-type Lyapunov equation.Some necessary and sufficient conditions for the existence ofa unique solution are presented. Since a Hermitian positivesemidefinite solution is important from the application pointof view, some sufficient conditions for the existence of a Hermitianpositive semidefinite solution are derived.     

An LMI-based approach for robust stabilization of time delay systems containing saturating actuators

Email: elhaous_fati{at}yahoo.fr Corresponding author. Email: elh_tissir{at}yahoo.fr Received on September 8, 2005; Accepted on July 24, 2006 This paper deals with the problem of robust stabilization foruncertain systems with input saturation and time delay in thestate. The parameter uncertainties are time-varying and unknownbut are norm bounded. Sufficient conditions obtained via a linearmatrix inequality formulation are stated to guarantee the localstabilization. The method of synthesis consists in determiningsimultaneously a state feedback control law and an associateddomain of safe admissible states for which the stability ofthe closed-loop system is guaranteed when control saturationseffectively occur. Numerical examples are used to demonstratethe effectiveness of the proposed design technique.     

Alternate strip-based substructuring algorithms for elliptic PDEs in two dimensions

^** Email: angela.mihai{at}strath.ac.uk^*** Email: alan.craig{at}durham.ac.uk The alternate strip-based substructuring algorithms are efficientpreconditioning techniques for the discrete systems which arisefrom the finite-element approximation of symmetric ellipticboundary-value problems in 2D Euclidean spaces. The new approachis based on alternate decomposition of the given domain intoa finite number of strips. Each strip is a union of non-overlappingsubdomains and the global interface between subdomains is partitionedas a union of edges between strips and edges between subdomainsthat belong to the same strip. Both scalability and efficiencyare achieved by alternating the direction of the strips. Thisapproach generates algorithms in two stages and allows the useof a two-grid V cycle. Numerical estimates illustrate the behaviourof the new domain decomposition techniques.