Displaying similar documents to “Generalizations and error analysis of the iterative operator splitting method”

A SOR Acceleration of Self-Adjoint and m-Accretive Splitting Iterative Solver for 2-D Neutron Transport Equation

O. Awono, J. Tagoudjeu (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

We present an iterative method based on an infinite dimensional adaptation of the successive overrelaxation (SOR) algorithm for solving the 2-D neutron transport equation. In a wide range of application, the neutron transport operator admits a Self-Adjoint and m-Accretive Splitting (SAS). This splitting leads to an ADI-like iterative method which converges unconditionally and is equivalent to a fixed point problem where the operator is ...

Discretization methods with analytical characteristic methods for advection-diffusion-reaction equations and 2d applications

Jürgen Geiser (2009)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Our studies are motivated by a desire to model long-time simulations of possible scenarios for a waste disposal. Numerical methods are developed for solving the arising systems of convection-diffusion-dispersion-reaction equations, and the received results of several discretization methods are presented. We concentrate on linear reaction systems, which can be solved analytically. In the numerical methods, we use large time-steps to achieve long simulation times of about 10 000 years. We...

Skipping transition conditions in error estimates for finite element discretizations of parabolic equations

Stefano Berrone (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper we derive error estimates for the heat equation. The time discretization strategy is based on a -method and the mesh used for each time-slab is independent of the mesh used for the previous time-slab. The novelty of this paper is an upper bound for the error caused by the coarsening of the mesh used for computing the solution in the previous time-slab. The technique applied for deriving this upper bound is independent of the problem and can be generalized to other time...