Search

We present in this paper a proof of well-posedness and convergence for the parallel Schwarz Waveform Relaxation Algorithm adapted to an N-dimensional semilinear heat equation. Since the equation we study is an evolution one, each subproblem at each step has its own local existence time, we then determine a common existence time for every problem in any subdomain at any step. We also introduce a new technique: Exponential Decay Error Estimates, to prove the convergence of the Schwarz Methods, with multisubdomains, and then apply it to our problem. [ABSTRACT FROM AUTHOR]

In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback term to the observations. We consider the case of 1-dimensional transport equations, either viscous or inviscid, linear or not (Burgers’ equation). Our aim is to prove some theoretical results on the convergence, and convergence properties, of this algorithm. We show that for non viscous equations (both linear transport and Burgers), the convergence of the algorithm holds under observability conditions. Convergence can also be proven for viscous linear transport equations under some strong hypothesis, but not for viscous Burgers’ equation. Moreover, the convergence rate is always exponential in time. We also notice that the forward and backward system of equations is well posed when no nudging term is considered. [ABSTRACT FROM PUBLISHER]

In this paper we study different algorithms for backward stochastic differential equations (BSDE in short) basing on random walk framework for 1-dimensional Brownian motion. Implicit and explicit schemes for both BSDE and reflected BSDE are introduced. Then we prove the convergence of different algorithms and present simulation results for different types of BSDEs. [ABSTRACT FROM AUTHOR]

The paper studies the convergence behavior of Monte Carlo schemes for semiconductors. A detailed analysis of the systematic error with respect to numerical parameters is performed. Different sources of systematic error are pointed out and illustrated in a spatially one-dimensional test case. The error with respect to the number of simulation particles occurs during the calculation of the internal electric field. The time step error, which is related to the splitting of transport and electric field calculations, vanishes sufficiently fast. The error due to the approximation of the trajectories of particles depends on the ODE solver used in the algorithm. It is negligible compared to the other sources of time step error, when a second order Runge-Kutta solver is used. The error related to the approximate scattering mechanism is the most significant source of error with respect to the time step. [ABSTRACT FROM AUTHOR]

This paper discusses analytical and numerical issues related to elliptic equations with random coefficients which are generally nonlinear functions of white noise. Singularity issues are avoided by using the Itô-Skorohod calculus to interpret the interactions between the coefficients and the solution. The solution is constructed by means of the Wiener Chaos (Cameron-Martin) expansions. The existence and uniqueness of the solutions are established under rather weak assumptions, the main of which requires only that the expectation of the highest order (differential) operator is a non-degenerate elliptic operator. The deterministic coefficients of the Wiener Chaos expansion of the solution solve a lower-triangular system of linear elliptic equations (the propagator). This structure of the propagator insures linear complexity of the related numerical algorithms. Using the lower triangular structure and linearity of the propagator, the rate of convergence is derived for a spectral/hpfinite element approximation. The results of related numerical experiments are presented. [ABSTRACT FROM AUTHOR]