The convergence of a two-scale FEM for elliptic problems in divergence form with coefficients and geometries oscillating at length scale ε << 1 is analyzed. Full elliptic regularity independent of ε is shown when the solution is viewed as mapping from the slow into the fast scale. Two-scale FE spaces which are able to resolve the ε scale of the solution with work independent of ε and without analytical homogenization are introduced. Robust in ε error estimates for the two-scale FE spaces are proved. Numerical experiments confirm the theoretical analysis.

This paper addresses the recovery of piecewise smooth functions from their discrete data. Reconstruction methods using both pseudo-spectral coefficients and physical space interpolants have been discussed extensively in the literature, and it is clear that an a priori knowledge of the jump discontinuity location is essential for any reconstruction technique to yield spectrally accurate results with high resolution near the discontinuities. Hence detection of the jump discontinuities is critical for all methods. Here we formulate a new localized reconstruction method adapted from the method developed in Gottlieb and Tadmor (1985) and recently revisited in Tadmor and Tanner (in press). Our procedure incorporates the detection of edges into the reconstruction technique. The method is robust and highly accurate, yielding spectral accuracy up to a small neighborhood of the jump discontinuities. Results are shown in one and two dimensions.

Dorsey, Di Bartolo and Dolgert (Di Bartolo et al., 1996; 1997) have constructed asymptotic matched solutions at order two for the half-space Ginzburg-Landau model, in the weak-κ limit. These authors deduced a formal expansion for the superheating field in powers of $\kappa^{\frac{1}{2}}$ up to order four, extending the formula by De Gennes (De Gennes, 1966) and the two terms in Parr's formula (Parr, 1976). In this paper, we construct asymptotic matched solutions at all orders leading to a complete expansion in powers of $\kappa^{\frac{1}{2}}$ for the superheating field.

We propose a variational analysis for a Black and Scholes equation with stochastic volatility. This equation gives the price of a European option as a function of the time, of the price of the underlying asset and of the volatility when the volatility is a function of a mean reverting Orstein-Uhlenbeck process, possibly correlated with the underlying asset. The variational analysis involves weighted Sobolev spaces. It enables to prove qualitative properties of the solution, namely a maximum principle and additional regularity properties. Finally, we make numerical simulations of the solution, by finite element and finite difference methods.

Estimates for the combined effect of boundary approximation and numerical integration on the approximation of (simple) eigenvalues and eigenvectors of 4th order eigenvalue problems with variable/constant coefficients in convex domains with curved boundary by an isoparametric mixed finite element method, which, in the particular case of bending problems of aniso-/ortho-/isotropic plates with variable/constant thickness, gives a simultaneous approximation to bending moment tensor field $\Psi= (\psi_{ij})_{1 \le i,j \le 2}$ and displacement field `u', have been developed.

Programming is an area at the interface between scientific computing and applied mathematics which has been very active lately and so it was thought that M2AN should open its pages to it in a special issue. This is because many new tools have appeared ranging from templates in C++ to Java interface library and parallel computing tools. There has been a diffusion of computer sciences into numerical analysis and these new tools have made possible the implementation of very complex methods such as finite element methods of arbitrary degree. This issue is not an overview of the field. The papers have been selected on the basis of their programming creativity, the quality of the final product and their relevance to numerical methods. But we have discovered on the way that the programming community does not publish much outside conference proceedings. Furthermore it is often difficult to pinpoint the difficulties and solutions. One must avoid tedious lists of function or subroutine definitions, but one must also explain in details the new programming ideas such as data driven programs or generic programming, notions which are familiar to few people only. What is new here is that the papers have been screened by reviewers who are themselves programmers and also applied mathematicians. This successful experience leads to encourage submission of more papers of this kind in the future as well.

We present one- and two-dimensional central-upwind schemes for approximating solutions of the Saint-Venant system with source terms due to bottom topography. The Saint-Venant system has steady-state solutions in which nonzero flux gradients are exactly balanced by the source terms. It is a challenging problem to preserve this delicate balance with numerical schemes. Small perturbations of these states are also very difficult to compute. Our approach is based on extending semi-discrete central schemes for systems of hyperbolic conservation laws to balance laws. Special attention is paid to the discretization of the source term such as to preserve stationary steady-state solutions. We also prove that the second-order version of our schemes preserves the nonnegativity of the height of the water. This important feature allows one to compute solutions for problems that include dry areas.

We present in this article two components: these components can in fact serve various goals independently, though we consider them here as an ensemble. The first component is a technique for the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential features are (i) (provably) rapidly convergent global reduced–basis approximations — Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) a posteriori error estimation — relaxations of the error–residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs of interest; and (iii) off–line/on–line computational procedures — methods which decouple the generation and projection stages of the approximation process. This component is ideally suited — considering the operation count of the online stage — for the repeated and rapid evaluation required in the context of parameter estimation, design, optimization, and real–time control. The second component is a framework for distributed simulations. This framework comprises a library providing the necessary abstractions/concepts for distributed simulations and a small set of tools — namely SimTeXand SimLaB— allowing an easy manipulation of those simulations. While the library is the backbone of the framework and is therefore general, the various interfaces answer specific needs. We shall describe both components and present how they interact.

Using systematically a tricky idea of N.V. Krylov, we obtain general results on the rate of convergence of a certain class of monotone approximation schemes for stationary Hamilton-Jacobi-Bellman equations with variable coefficients. This result applies in particular to control schemes based on the dynamic programming principle and to finite difference schemes despite, here, we are not able to treat the most general case. General results have been obtained earlier by Krylov for finite difference schemes in the stationary case with constant coefficients and in the time-dependent case with variable coefficients by using control theory and probabilistic methods. In this paper we are able to handle variable coefficients by a purely analytical method. In our opinion this way is far simpler and, for the cases we can treat, it yields a better rate of convergence than Krylov obtains in the variable coefficients case.

Different effective boundary conditions or wall laws for unsteady incompressible Navier-Stokes equations over rough domains are derived in the laminar setting. First and second order unsteady wall laws are proposed using two scale asymptotic expansion techniques. The roughness elements are supposed to be periodic and the influence of the rough boundary is incorporated through constitutive constants. These constants are obtained by solving steady Stokes problems and so they are calculated only once. Numerical tests are presented to validate and compare the proposed boundary conditions.

Domain decomposition techniques provide a powerful tool for the numerical approximation of partial differential equations. We focus on mortar finite element methods on non-matching triangulations. In particular, we discuss and analyze dual Lagrange multiplier spaces for lowest order finite elements. These non standard Lagrange multiplier spaces yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces. As a consequence, standard efficient iterative solvers as multigrid methods or domain decomposition techniques can be easily adapted to the nonconforming situation. Here, we introduce new dual Lagrange multiplier spaces. We concentrate on the construction of locally supported and continuous dual basis functions. The optimality of the associated mortar method is shown. Numerical results illustrate the performance of our approach.

The stability of flat interfaces with respect to a spatial semidiscretization of a solidification model is analyzed. The considered model is the quasi-static approximation of the Stefan problem with dynamical Gibbs–Thomson law. The stability analysis bases on an argument developed by Mullins and Sekerka for the undiscretized case. The obtained stability properties differ from those with respect to the quasi-static model for certain parameter values and relatively coarse meshes. Moreover, consequences on discretization issues are discussed.

This work is concerned with the flow of a viscous plastic fluid. We choose a model of Bingham type taking into account inhomogeneous yield limit of the fluid, which is well-adapted in the description of landslides. After setting the general threedimensional problem, the blocking property is introduced. We then focus on necessary and sufficient conditions such that blocking of the fluid occurs. The anti-plane flow in twodimensional and onedimensional cases is considered. A variational formulation in terms of stresses is deduced. More fine properties dealing with local stagnant regions as well as local regions where the fluid behaves like a rigid body are obtained in dimension one.

In this work, we analyze hierarchic hp-finite element discretizations of the full, three-dimensional plate problem. Based on two-scale asymptotic expansion of the three-dimensional solution, we give specific mesh design principles for the hp-FEM which allow to resolve the three-dimensional boundary layer profiles at robust, exponential rate. We prove that, as the plate half-thickness ε tends to zero, the hp-discretization is consistent with the three-dimensional solution to any power of ε in the energy norm for the degree $p={\cal O}(\left|{\log \varepsilon}\right|)$ and with ${\cal O}({p^4})$ degrees of freedom.

We study the asymptotic behavior of a semi-discrete numerical approximation for a pair of heat equations ut = Δu, vt = Δv in Ω x (0,T); fully coupled by the boundary conditions $\frac{\partial u}{\partial\eta} = u^{p_{11}}v^{p_{12}}$, $\frac{\partial v}{\partial\eta} = u^{p_{21}}v^{p_{22}}$ on ∂Ω x (0,T), where Ω is a bounded smooth domain in ${\mathbb{R}}^d$. We focus in the existence or not of non-simultaneous blow-up for a semi-discrete approximation (U,V). We prove that if U blows up in finite time then V can fail to blow up if and only if p11 > 1 and p21 < 2(p11 - 1) , which is the same condition as the one for non-simultaneous blow-up in the continuous problem. Moreover, we find that if the continuous problem has non-simultaneous blow-up then the same is true for the discrete one. We also prove some results about the convergence of the scheme and the convergence of the blow-up times.

In this article, we show the convergence of a class of numerical schemes for certain maximal monotone evolution systems; a by-product of this results is the existence of solutions in cases which had not been previously treated. The order of these schemes is 1/2 in general and 1 when the only non Lipschitz continuous term is the subdifferential of the indicatrix of a closed convex set. In the case of Prandtl's rheological model, our estimates in maximum norm do not depend on spatial dimension.

The numerical solution of the flow of a liquid crystal governed by a particular instance of the Ericksen–Leslie equations is considered. Convergence results for this system rely crucially upon energy estimates which involve H2(Ω) norms of the director field. We show how a mixed method may be used to eliminate the need for Hermite finite elements and establish convergence of the method.

Development of user-friendly and flexible scientific programs is a key to their usage, extension and maintenance. This paper presents an OOP (Object-Oriented Programming) approach for design of finite element analysis programs. General organization of the developed software system, called FER/SubDomain, is given which includes the solver and the pre/post processors with a friendly GUI (Graphical User Interfaces). A case study with graphical representations illustrates some functionalities of the program.

Automatic differentiation (AD) has proven its interest in many fields of applied mathematics, but it is still not widely used. Furthermore, existing numerical methods have been developed under the hypotheses that computing program derivatives is not affordable for real size problems. Exact derivatives have therefore been avoided, or replaced by approximations computed by divided differences. The hypotheses is no longer true due to the maturity of AD added to the quick evolution of machine capacity. This encourages the development of new numerical methods that freely make use of program derivatives, and will require the definition and development of new AD strategies. AD tools must be extended to produce these new derivative programs, in such a modular way that the different sub-problems can be solved independently from one another. Flexibility assures the user to be able to generate whatever specific derivative program he needs, with at the same time the possibility to generate standard ones. This paper sketches a new model of modular, extensible and flexible AD tool that will increase tenfold the DA potential for applied mathematics. In this model, the AD tool consists of an AD kernel named KAD supported by a general program transformation platform.

This paper is devoted to the spectral analysis of a non elliptic operator A , deriving from the study of superconducting micro-strip lines. Once a sufficient condition for the self-adjointness of operator A has been derived, we determine its continuous spectrum. Then, we show that A is unbounded from below and that it has a sequence of negative eigenvalues tending to -∞. Using the Min-Max principle, a characterization of its positive eigenvalues is given. Thanks to this characterization, some conditions on the geometrical (large width) and physical (large dielectric permittivity in modulus) properties of the strip that ensure the existence of positive eigenvalues are derived. Finally, we analyze the asymptotic behavior of the eigenvalues of A as the dielectric permittivity of the strip goes to -∞.