In this paper we propose and analyze a localized orthogonal decomposition (LOD) methodfor solving semi-linear elliptic problems with heterogeneous and highly variablecoefficient functions. This Galerkin-type method is based on a generalized finite elementbasis that spans a low dimensional multiscale space. The basis is assembled by performinglocalized linear fine-scale computations on small patches that have a diameter of orderH | log (H)| where H is the coarse mesh size. Without any assumptions onthe type of the oscillations in the coefficients, we give a rigorous proof for a linearconvergence of the H1-error with respect to the coarse meshsize even for rough coefficients. To solve the corresponding system of algebraicequations, we propose an algorithm that is based on a damped Newton scheme in themultiscale space.

We study the approximation of harmonic functions by means of harmonic polynomials intwo-dimensional, bounded, star-shaped domains. Assuming that the functions possessanalytic extensions to a δ-neighbourhood of the domain, we proveexponential convergence of the approximation error with respect to the degree of theapproximating harmonic polynomial. All the constants appearing in the bounds are explicitand depend only on the shape-regularity of the domain and on δ. We applythe obtained estimates to show exponential convergence with rate O(exp(-b√N)), N being the number of degrees offreedom and b > 0, of a hp-dGFEM discretisation ofthe Laplace equation based on piecewise harmonic polynomials. This result is animprovement over the classical rate O(exp(-b 3√N)), and is due to the use of harmonic polynomialspaces, as opposed to complete polynomial spaces.

We deal with an inverse scattering problem whose aim is to determine the thicknessvariation of a dielectric thin coating located on a conducting structure of unknown shape.The inverse scattering problem is solved through the application of the GeneralizedImpedance Boundary Conditions (GIBCs) which contain the thickness, curvature as well asmaterial properties of the coating and they have been obtained in the previous work [B.Aslanyürek, H. Haddar and H.Şahintürk, Wave Motion 48 (2011)681–700] up to the third order with respect to the thickness. After proving uniquenessresults for the inverse problem, the required total field as well as its higher orderderivatives appearing in the GIBCs are obtained by the analytical continuation of themeasured data to the coating surface through the single layer potential representation.The resulting system of non-linear differential equations for the unknown coatingthickness is solved iteratively via the Newton−Raphson method after expanding thethickness function in a series of exponentials. Through the simulations it has been shownthat the approach is effective under the validity conditions of the GIBCs.

In this paper, we are interested in modelling the flow of the coolant (water) in anuclear reactor core. To this end, we use a monodimensional low Mach number modelsupplemented with the stiffened gas law. We take into account potential phase transitionsby a single equation of state which describes both pure and mixture phases. In someparticular cases, we give analytical steady and/or unsteady solutions which providequalitative information about the flow. In the second part of the paper, we introduce twovariants of a numerical scheme based on the method of characteristics to simulate thismodel. We study and verify numerically the properties of these schemes. We finally presentnumerical simulations of a loss of flow accident (LOFA) induced by a coolant pump tripevent.

This paper is devoted to the definition, analysis and implementation of semi-Lagrangian methods as they result from particle methods combined with remeshing. We give a complete consistency analysis of these methods, based on the regularity and momentum properties of the remeshing kernels, and a stability analysis of a large class of second and fourth order methods. This analysis is supplemented by numerical illustrations. We also describe a general approach to implement these methods in the context of hybrid computing and investigate their performance on GPU processors as a function of their order of accuracy.

Inspired by the growing use of non linear discretization techniques for the lineardiffusion equation in industrial codes, we construct and analyze various explicit nonlinear finite volume schemes for the heat equation in dimension one. These schemes areinspired by the Le Potier’s trick [C. R. Acad. Sci. Paris, Ser. I348 (2010) 691–695]. They preserve the maximum principle and admita finite volume formulation. We provide a original functional setting for the analysis ofconvergence of such methods. In particular we show that the fourth discrete derivative isbounded in quadratic norm. Finally we construct, analyze and test a new explicit nonlinear maximum preserving scheme with third order convergence: it is optimal on numericaltests.

We consider an initial-boundary value problem for a generalized 2D time-dependentSchrödinger equation (with variable coefficients) on a semi-infinite strip. For theCrank–Nicolson-type finite-difference scheme with approximate or discrete transparentboundary conditions (TBCs), the Strang-type splitting with respect to the potential isapplied. For the resulting method, the unconditional uniform in time L2-stability isproved. Due to the splitting, an effective direct algorithm using FFT is developed now toimplement the method with the discrete TBC for general potential. Numerical results on thetunnel effect for rectangular barriers are included together with the detailed practicalerror analysis confirming nice properties of the method.

This paper analyzes the random fluctuations obtained by a heterogeneous multi-scalefirst-order finite element method applied to solve elliptic equations with a randompotential. Several multi-scale numerical algorithms have been shown to correctly capturethe homogenized limit of solutions of elliptic equations with coefficients modeled asstationary and ergodic random fields. Because theoretical results are available in thecontinuum setting for such equations, we consider here the case of a second-order ellipticequations with random potential in two dimensions of space. We show that the randomfluctuations of such solutions are correctly estimated by the heterogeneous multi-scalealgorithm when appropriate fine-scale problems are solved on subsets that cover the wholecomputational domain. However, when the fine-scale problems are solved over patches thatdo not cover the entire domain, the random fluctuations may or may not be estimatedaccurately. In the case of random potentials with short-range interactions, the varianceof the random fluctuations is amplified as the inverse of the fraction of the mediumcovered by the patches. In the case of random potentials with long-range interactions,however, such an amplification does not occur and random fluctuations are correctlycaptured independent of the (macroscopic) size of the patches. These results areconsistent with those obtained in [9] for moregeneral equations in the one-dimensional setting and provide indications on the loss inaccuracy that results from using coarser, and hence computationally less intensive,algorithms.

In this article, we prove convergence of the weakly penalized adaptive discontinuousGalerkin methods. Unlike other works, we derive the contraction property for variousdiscontinuous Galerkin methods only assuming the stabilizing parameters are large enoughto stabilize the method. A central idea in the analysis is to construct an auxiliarysolution from the discontinuous Galerkin solution by a simple post processing. Based onthe auxiliary solution, we define the adaptive algorithm which guides to the convergenceof adaptive discontinuous Galerkin methods.

For a stationary Markov process the detailed balance condition is equivalent to thetime-reversibility of the process. For stochastic differential equations (SDE’s), the timediscretization of numerical schemes usually destroys the time-reversibility property.Despite an extensive literature on the numerical analysis for SDE’s, their stabilityproperties, strong and/or weak error estimates, large deviations and infinite-timeestimates, no quantitative results are known on the lack of reversibility of discrete-timeapproximation processes. In this paper we provide such quantitative estimates by using theconcept of entropy production rate, inspired by ideas from non-equilibrium statisticalmechanics. The entropy production rate for a stochastic process is defined as the relativeentropy (per unit time) of the path measure of the process with respect to the pathmeasure of the time-reversed process. By construction the entropy production rate isnonnegative and it vanishes if and only if the process is reversible. Crucially, from anumerical point of view, the entropy production rate is an a posterioriquantity, hence it can be computed in the course of a simulation as the ergodicaverage of a certain functional of the process (the so-called Gallavotti−Cohen (GC) action functional). We computethe entropy production for various numerical schemes such as explicit Euler−Maruyama and explicit Milstein’s forreversible SDEs with additive or multiplicative noise. In addition we analyze the entropyproduction for the BBK integrator for the Langevin equation. The order (in thetime-discretization step Δt) of the entropy production rate provides a tool toclassify numerical schemes in terms of their (discretization-induced) irreversibility. Ourresults show that the type of the noise critically affects the behavior of the entropyproduction rate. As a striking example of our results we show that the Euler scheme formultiplicative noise is not an adequate scheme from a reversibilitypoint of view since its entropy production rate does not decrease withΔt.

We consider an uncoupled, modular regularization algorithm for approximation of theNavier-Stokes equations. The method is: Step 1.1: Advance the NSEone time step, Step 1.1: Regularize to obtain the approximation atthe new time level. Previous analysis of this approach has been for specific time steppingmethods in Step 1.1 and simple stabilizations in Step 1.1. In this report we extend the mathematical support for uncoupled,modular stabilization to (i) the more complex and better performing BDF2 timediscretization in Step 1.1, and (ii) more general (linear ornonlinear) regularization operators in Step 1.1. We give a completestability analysis, derive conditions on the Step 1.1regularization operator for which the combination has good stabilization effects,characterize the numerical dissipation induced by Step 1.1, provean asymptotic error estimate incorporating the numerical error of the method used in Step1.1 and the regularizations consistency error in Step 1.1 and provide numerical tests.

Long time simulations of transport equations raise computational challenges since theyrequire both a large domain of calculation and sufficient accuracy. It is thereforeadvantageous, in terms of computational costs, to use a time varying adaptive mesh, withsmall cells in the region of interest and coarser cells where the solution is smooth.Biological models involving cell dynamics fall for instance within this framework and areoften non conservative to account for cell division. In that case the thresholdcontrolling the spatial adaptivity may have to be time-dependent in order to keep up withthe progression of the solution. In this article we tackle the difficulties arising whenapplying a Multiresolution method to a transport equation with discontinuous fluxesmodeling localized mitosis. The analysis of the numerical method is performed on asimplified model and numerical scheme. An original threshold strategy is proposed andvalidated thanks to extensive numerical tests. It is then applied to a biological model inboth cases of distributed and localized mitosis.

This paper deals with the numerical study of a nonlinear, strongly anisotropic heatequation. The use of standard schemes in this situation leads to poor results, due to thehigh anisotropy. An Asymptotic-Preserving method is introduced in this paper, which issecond-order accurate in both, temporal and spacial variables. The discretization in timeis done using an L-stable Runge−Kutta scheme. The convergence of the method is shown to beindependent of the anisotropy parameter , andthis for fixed coarse Cartesian grids and for variable anisotropy directions. The contextof this work are magnetically confined fusion plasmas.

In this paper we propose a time discretization of a system of two parabolic equationsdescribing diffusion-driven atom rearrangement in crystalline matter. The equationsexpress the balances of microforces and microenergy; the two phase fields are the orderparameter and the chemical potential. The initial and boundary-value problem for theevolutionary system is known to be well posed. Convergence of the discrete scheme to thesolution of the continuous problem is proved by a careful development of uniformestimates, by weak compactness and a suitable treatment of nonlinearities. Moreover, forthe difference of discrete and continuous solutions we prove an error estimate of orderone with respect to the time step.

Galerkin reduced-order models for the semi-discrete wave equation, that preserve thesecond-order structure, are studied. Error bounds for the full state variables are derivedin the continuous setting (when the whole trajectory is known) and in the discrete settingwhen the Newmark average-acceleration scheme is used on the second-order semi-discreteequation. When the approximating subspace is constructed using the proper orthogonaldecomposition, the error estimates are proportional to the sums of the neglected singularvalues. Numerical experiments illustrate the theoretical results.

This work is concerned with the asymptotic analysis of a time-splitting scheme for theSchrödinger equation with a random potential having weak amplitude, fast oscillations intime and space, and long-range correlations. Such a problem arises for instance in thesimulation of waves propagating in random media in the paraxial approximation. Thehigh-frequency limit of the Schrödinger equation leads to different regimes depending onthe distance of propagation, the oscillation pattern of the initial condition, and thestatistical properties of the random medium. We show that the splitting scheme capturesthese regimes in a statistical sense for a time stepsize independent of the frequency.

In this paper, we present and study a mixed variational method in order to approximate,with the finite element method, a Stokes problem with Tresca friction boundary conditions.These non-linear boundary conditions arise in the modeling of mold filling process bypolymer melt, which can slip on a solid wall. The mixed formulation is based on adualization of the non-differentiable term which define the slip conditions. Existence anduniqueness of both continuous and discrete solutions of these problems is guaranteed bymeans of continuous and discrete inf-sup conditions that are proved. Velocity and pressureare approximated by P1 bubble-P1 finite element and piecewise linearelements are used to discretize the Lagrange multiplier associated to the shear stress onthe friction boundary. Optimal a priori error estimates are derived usingclassical tools of finite element analysis and two uncoupled discrete inf-sup conditionsfor the pressure and the Lagrange multiplier associated to the fluid shear stress.

For scalar conservation laws in one space dimension with a flux function discontinuous inspace, there exist infinitely many classes of solutions which are L1 contractive.Each class is characterized by a connection (A,B) which determines the interface entropy. Forsolutions corresponding to a connection (A,B), there exists convergent numerical schemesbased on Godunov or Engquist−Osher schemes. The natural question is how to obtain schemes,corresponding to computationally less expensive monotone schemes like Lax−Friedrichs etc., usedwidely in applications. In this paper we completely answer this question for more general(A,B)stable monotone schemes using a novel construction of interface flux function. Then fromthe singular mapping technique of Temple and chain estimate of Adimurthi and Gowda, weprove the convergence of the schemes.

We present a parallel preconditioning method for the iterative solution of thetime-harmonic elastic wave equation which makes use of higher-order spectral elements toreduce pollution error. In particular, the method leverages perfectly matched layerboundary conditions to efficiently approximate the Schur complement matrices of a blockLDLTfactorization. Both sequential and parallel versions of the algorithm are discussed andresults for large-scale problems from exploration geophysics are presented.

We construct an approximate Riemann solver for the isentropic Baer−Nunziato two-phaseflow model, that is able to cope with arbitrarily small values of the statistical phasefractions. The solver relies on a relaxation approximation of the model for which theRiemann problem is exactly solved for subsonic relative speeds. In an original manner, theRiemann solutions to the linearly degenerate relaxation system are allowed to dissipatethe total energy in the vanishing phase regimes, thereby enforcing the robustness andstability of the method in the limits of small phase fractions. The scheme is proved tosatisfy a discrete entropy inequality and to preserve positive values of the statisticalfractions and densities. The numerical simulations show a much higher precision and a morereduced computational cost (for comparable accuracy) than standard numerical schemes usedin the nuclear industry. Finally, two test-cases assess the good behavior of the schemewhen approximating vanishing phase solutions.