We are concerned with a finite element approximation for time-harmonic wave propagation governed by the Helmholtz equation. The usually oscillatory behavior of solutions, along with numerical dispersion, render standard finite element methods grossly inefficient already in medium-frequency regimes. As an alternative, methods that incorporate information about the solution in the form of plane waves have been proposed. We focus on a class of Trefftz-type discontinuous Galerkin methods that employs trial and test spaces spanned by local plane waves. In this paper we give a priori convergence estimates for the h-version of these plane wave discontinuous Galerkin methods in two dimensions. To that end, we develop new inverse and approximation estimates for plane waves and use these in the context of duality techniques. Asymptotic optimality of the method in a mesh dependent norm can be established. However, the estimates require a minimal resolution of the mesh beyond what it takes to resolve the wavelength. We give numerical evidence that this requirement cannot be dispensed with. It reflects the presence of numerical dispersion.

We show that while Runge-Kutta methods cannot preserve polynomial invariants in general, they can preserve polynomials that are the energy invariant of canonical Hamiltonian systems.

A new Schwarz method for nonlinear systems is presented, constituting the multiplicative variant of a straightforward additive scheme. Local convergence can be guaranteed under suitable assumptions.The scheme is applied to nonlinear acoustic-structure interaction problems. Numerical examples validate the theoretical results. Further improvements are discussed by means of introducing overlapping subdomains and employing an inexact strategy for the local solvers.


In a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations, the construction of lower bounds for the coercivity and inf-supstability constants is essential. In [Huynh et al., C. R. Acad.Sci. Paris Ser. I Math.345 (2007) 473–478], the authors presented an efficientmethod, compatible with an off-line/on-line strategy, where the on-line computation is reduced tominimizing a linear functional under a few linear constraints. These constraints depend on nested sets of parameters obtained iteratively using a greedy algorithm. We improve here this method so that it becomes more efficient and robust due to two related properties: (i) the lower bound isobtained by a monotonic process with respect to the size of the nested sets; (ii) less eigen-problems need to be solved. This improved evaluation of the inf-sup constant is then used to consider a reduced basis approximation of a parameter dependent electromagnetic cavity problem both for the greedy construction of the elements of the basis and the subsequent validation of the reduced basis approximation. The problem we consider has resonance features for some choices of the parameters that are well captured by the methodology.


This paper studies a family of finite volume schemes for the hyperbolic scalar conservation law $u_t +\nabla_g \cdotf(x,u)=0$ on a closed Riemannian manifold M.For an initial value in BV(M) we will show that these schemes converge with a $h^{\frac{1}{4}} $ convergence rate towards the entropy solution. When M is 1-dimensional the schemes are TVD and we will show that this improves the convergence rate to $h^{\frac{1}{2}}.$

We present a new semi-discrete central scheme for one-dimensional shallow water flows along channels with non-uniform rectangular cross sections and bottom topography. The scheme preserves the positivity of the water height, and it is preserves steady-states of rest (i.e., it is well-balanced). Along with a detailed description of the scheme, numerous numerical examples are presented for unsteady and steady flows. Comparison with exact solutions illustrate the accuracy and robustness of the numerical algorithm.

This paper is devoted to the numerical solution of stationarylaminar Bingham fluids by path-following methods. By using duality theory, asystem that characterizes the solution of the original problem is derived.Since this system is ill-posed, a family of regularized problems is obtainedand the convergence of the regularized solutions to the original one is proved.For the update of the regularization parameter, a path-following method isinvestigated. Based on the differentiability properties of the path, a model ofthe value functional and a correspondent algorithm are constructed. For thesolution of the systems obtained in each path-following iteration a semismoothNewton method is proposed. Numerical experiments are performed in order toinvestigate the behavior and efficiency of the method, and a comparison with apenalty-Newton-Uzawa-conjugate gradient method, proposed in [Dean et al., J. Non-Newtonian Fluid Mech.142 (2007) 36–62], iscarried out.

We examine a heterogeneous alternating-direction method for the approximate solution of the FENE Fokker–Planck equation from polymer fluid dynamics and we use this method to solve a coupled (macro-micro) Navier–Stokes–Fokker–Planck system for dilute polymeric fluids. In this context the Fokker–Planck equation is posed on a high-dimensional domain and is therefore challenging from a computational point of view. The heterogeneous alternating-direction scheme combines a spectral Galerkin method for the Fokker–Planck equation in configuration space with a finite element method in physical space to obtain a scheme for the high-dimensional Fokker–Planck equation. Alternating-direction methods have been considered previously in the literature for this problem (e.g. in the work of Lozinski, Chauvière and collaborators [J. Non-Newtonian Fluid Mech.122 (2004) 201–214; Comput. Fluids33 (2004) 687–696; CRM Proc. Lect. Notes41 (2007) 73–89; Ph.D. Thesis (2003); J. Computat. Phys.189 (2003) 607–625]), but this approach has not previously been subject to rigorous numerical analysis. The numerical methods we develop are fully-practical, and we present a range of numerical results demonstrating their accuracy and efficiency. We also examine an advantageous superconvergence property related to the polymeric extra-stress tensor. The heterogeneous alternating-direction method is well suited to implementation on a parallel computer, and we exploit this fact to make large-scale computations feasible.

In this paper, we studythe linear Schrödinger equation over the d-dimensional torus,with small values of the perturbing potential.We consider numerical approximations of the associated solutions obtainedby a symplectic splitting method (to discretize the time variable) in combination with the Fast Fourier Transform algorithm (to discretize the space variable).In this fully discrete setting, we prove that the regularity of the initialdatum is preserved over long times, i.e. times that are exponentially longwith the time discretization parameter. We here refer to Gevrey regularity, and our estimatesturn out to be uniform in the space discretization parameter.This paper extends [G. Dujardin and E. Faou, Numer. Math.97 (2004) 493–535], where a similar result has been obtained inthe semi-discrete situation, i.e. when the mere time variable is discretized and spaceis kept a continuous variable.

In this work, we use the methods of nonequilibrium statistical mechanics in order to derive an equation which models some mechanisms of opinion formation. After proving the main mathematical properties of the model, we provide some numerical results.

We analyze Euler-Galerkin approximations (conforming finite elements inspace and implicit Euler in time) to coupled PDE systems in which one dependentvariable, say u, is governed by an elliptic equation and the other,say p, by a parabolic-like equation. The underlying application is theporoelasticity system within the quasi-static assumption. Differentpolynomial orders are used for the u- and p-components toobtain optimally convergent a priori bounds for allthe terms in the error energy norm.Then, a residual-type a posteriori error analysis is performed. Upon extending theideas of Verfürth for the heat equation [Calcolo40 (2003)195–212],an optimally convergent bound is derived for the dominant term in theerror energy norm and an equivalence result between residual anderror is proven. The error bound can be classically split intotime error, space error and data oscillation terms. Moreover, upon extending the elliptic reconstruction techniqueintroduced by Makridakis and Nochetto [SIAM J. Numer. Anal.41 (2003) 1585–1594],an optimally convergent bound is derived for the remaining terms in theerror energy norm. Numerical results are presented toillustrate the theoretical analysis.

In this paper, we study a postprocessing procedure for improvingaccuracy of the finite volume element approximations of semilinearparabolic problems. The procedure amounts to solve a source problemon a coarser grid and then solve a linear elliptic problem on afiner grid after the time evolution is finished. We derive errorestimates in the L 2 and H 1 norms for the standard finitevolume element scheme and an improved error estimate in the H 1 norm. Numerical results demonstrate the accuracy and efficiency ofthe procedure.

While making informed decisions regardinginvestments in customer retention and acquisition becomes apressing managerial issue, formal models and analysis, which mayprovide insight into this topic, are still scarce. In this studywe examine two dynamic models for optimal acquisition andretention models of a monopoly, the total cost and the cost percustomer models.These models are analytically analyzed using classical, direct,methods and asymptotic expansions (for the total cost model).In order to numerically simulated the models, an innovativenumerical method was developed for solving ODE systems withinitial/final value problems.


Our studies are motivated by a desire to model long-time simulations of possible scenarios for a waste disposal. Numerical methods aredeveloped for solving the arising systems of convection-diffusion-dispersion-reactionequations, and the received results of several discretizationmethods are presented. We concentrate on linear reaction systems, which can be solved analytically.In the numerical methods, we use large time-steps to achievelong simulation times of about 10 000 years.We propose higher-order discretization methods, which allow us to use large time-steps without losing accuracy.By decoupling of a multi-physical and multi-dimensional equation,simpler physical and one-dimensional equations are obtained and can be discretized with higher-order methods. The results can then be coupled with an operator-splitting method.We discuss benchmark problems given in the literature and real-life applications.We simulate a radioactive waste disposals with underlying flowing groundwater.The transport and reaction simulations for the decay chains are presentedin 2d realistic domains, and we discuss the received results.Finally, we present our conclusions and ideas for further works.

In this article, we analyze the stability of various numerical schemes for differential models of viscoelastic fluids. More precisely, we consider the prototypical Oldroyd-B model, for which a free energy dissipation holds, and we show under which assumptions such a dissipation is also satisfied for the numerical scheme. Among the numerical schemes we analyze, we consider some discretizations based on the log-formulation of the Oldroyd-B system proposed by Fattal and Kupferman in [J. Non-Newtonian Fluid Mech.123 (2004) 281–285], for which solutions in some benchmark problems have been obtained beyond the limiting Weissenberg numbers for the standard scheme (see [Hulsen et al.J. Non-Newtonian Fluid Mech. 127 (2005) 27–39]). Our analysis gives some tracks to understand these numerical observations.

The plane wave stability properties of the conservative schemes of Besse [SIAM J. Numer. Anal.42 (2004) 934–952] and Fei et al. [Appl. Math. Comput.71 (1995) 165–177] for the cubic Schrödinger equation are analysed. Although the two methods possess many of the same conservation properties, we show that their stability behaviour is very different.An energy preserving generalisation of the Fei method with improved stability is presented.

We consider a variational formulation of the three-dimensional Navier–Stokes equations with mixed boundary conditions and prove that the variational problem admits a solution provided that the domain satisfies a suitable regularity assumption. Next, we propose a finite element discretization relying on the Galerkin method and establish a priori and a posteriori error estimates.

We study a one-dimensional model for two-phase flows in heterogeneous media, in which the capillary pressure functions can be discontinuous with respect to space. We first give a model, leading to a system of degenerated nonlinear parabolic equations spatially coupled by nonlinear transmission conditions. We approximate the solution of our problem thanks to a monotonous finite volume scheme. The convergence of the underlying discrete solution to a weak solution when the discretization step tends to 0 is then proven. We also show, under assumptions on the initial data, a uniform estimate on the flux, which is then used during the uniqueness proof. A density argument allows us to relax the assumptions on the initial data and to extend the existence-uniqueness frame to a family of solution obtained as limit of approximations. A numerical example is then given to illustrate the behavior of the model.

This article deals with the numerical computation of the Cheeger constant and the approximation of the maximal Cheeger set of a given subset of ${\mathbb R}^d$ . This problem is motivated by landslide modelling as well as by the continuous maximal flow problem. Using the fact that the maximal Cheeger set can be approximated by solving a rather simple projection problem, we propose a numerical strategy to compute maximal Cheeger sets and Cheeger constants.

The integration to steady state of many initial value ODEs and PDEs using the forward Euler methodcan alternatively be considered as gradient descent for an associated minimization problem.Greedy algorithms such as steepest descent for determining the step size are asslow to reach steady state as is forward Euler integration with the best uniform step size.But other, much faster methods using bolder step size selection exist.Various alternatives are investigated from both theoretical and practical points of view.The steepest descent method is also known for the regularizing or smoothing effect that thefirst few steps have for certain inverse problems,amounting to a finite time regularization. We further investigate the retention of thisproperty using the faster gradient descent variants in the context of two applications.When the combination of regularization and accuracy demands more than a dozen or so steepestdescent steps, the alternatives offer an advantage, even though (indeed because)the absolute stability limit of forward Euler is carefully yet severely violated.