Displaying 61 – 80 of 274

Showing per page

An implicit scheme to solve a system of ODEs arising from the space discretization of nonlinear diffusion equations

Éric Boillat (2001)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

In this article, we consider the initial value problem which is obtained after a space discretization (with space step h ) of the equations governing the solidification process of a multicomponent alloy. We propose a numerical scheme to solve numerically this initial value problem. We prove an error estimate which is not affected by the step size h chosen in the space discretization. Consequently, our scheme provides global convergence without any stability condition between h and the time step size...

An implicit scheme to solve a system of ODEs arising from the space discretization of nonlinear diffusion equations

Éric Boillat (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this article, we consider the initial value problem which is obtained after a space discretization (with space step h) of the equations governing the solidification process of a multicomponent alloy. We propose a numerical scheme to solve numerically this initial value problem. We prove an error estimate which is not affected by the step size h chosen in the space discretization. Consequently, our scheme provides global convergence without any stability condition between h and the time...

An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem

Jean-Baptiste Yunès (2008)

RAIRO - Theoretical Informatics and Applications

Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.

An introduction to hierarchical matrices

Wolfgang Hackbusch, Lars Grasedyck, Steffen Börm (2002)

Mathematica Bohemica

We give a short introduction to a method for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods or as the inverses of partial differential operators. The result of the approximation will be the so-called hierarchical matrices (or short -matrices). These matrices form a subset of the set of all matrices and have a data-sparse representation. The essential operations for these matrices (matrix-vector and matrix-matrix...

Analysis of the discontinuous Galerkin finite element method applied to a scalar nonlinear convection-diffusion equation

Hozman, Jiří, Dolejší, Vít (2008)

Programs and Algorithms of Numerical Mathematics

We deal with a scalar nonstationary convection-diffusion equation with nonlinear convective as well as diffusive terms which represents a model problem for the solution of the system of the compressible Navier-Stokes equations describing a motion of viscous compressible fluids. We present a discretization of this model equation by the discontinuous Galerkin finite element method. Moreover, under some assumptions on the nonlinear terms, domain partitions and the regularity of the exact solution,...

Analysis of two-level domain decomposition preconditioners based on aggregation

Marzio Sala (2004)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a set of assumptions...

Analysis of two-level domain decomposition preconditioners based on aggregation

Marzio Sala (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a...

Application of a Higher Order Discontinuous Galerkin

A. V. Wolkov, Ch. Hirsch, N. B. Petrovskaya (2011)

Mathematical Modelling of Natural Phenomena

We discuss the issues of implementation of a higher order discontinuous Galerkin (DG) scheme for aerodynamics computations. In recent years a DG method has intensively been studied at Central Aerohydrodynamic Institute (TsAGI) where a computational code has been designed for numerical solution of the 3-D Euler and Navier-Stokes equations. Our discussion is mainly based on the results of the DG study conducted in TsAGI in collaboration with the NUMECA...

Automatic differentiation platform : design

Christèle Faure (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

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....

Automatic Differentiation Platform: Design

Christèle Faure (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

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....

Currently displaying 61 – 80 of 274