Displaying 141 – 160 of 262

Showing per page

Finite volume schemes for a nonlinear hyperbolic equation. Convergence towards the entropy solution and error estimate

Claire Chainais-Hillairet (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper, we study some finite volume schemes for the nonlinear hyperbolic equation u t ( x , t ) + div F ( x , t , u ( x , t ) ) = 0 with the initial condition u 0 L ( N ) . Passing to the limit in these schemes, we prove the existence of an entropy solution u L i n f t y ( N × + ) . Proving also uniqueness, we obtain the convergence of the finite volume approximation to the entropy solution in L l o c p ( N × + ) , 1 ≤ p ≤ +∞. Furthermore, if u 0 L BV l o c ( N ) , we show that u BV l o c ( N × + ) , which leads to an “ h 1 4 ” error estimate between the approximate and the entropy solutions (where h defines the size of the...

Fully adaptive multiresolution schemes for strongly degenerate parabolic equations in one space dimension

Raimund Bürger, Ricardo Ruiz, Kai Schneider, Mauricio Sepúlveda (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

We present a fully adaptive multiresolution scheme for spatially one-dimensional quasilinear strongly degenerate parabolic equations with zero-flux and periodic boundary conditions. The numerical scheme is based on a finite volume discretization using the Engquist-Osher numerical flux and explicit time stepping. An adaptive multiresolution scheme based on cell averages is then used to speed up the CPU time and the memory requirements of the underlying finite volume scheme, whose first-order...

Fully discrete error estimation by the method of lines for a nonlinear parabolic problem

Tomáš Vejchodský (2003)

Applications of Mathematics

A posteriori error estimates for a nonlinear parabolic problem are introduced. A fully discrete scheme is studied. The space discretization is based on a concept of hierarchical finite element basis functions. The time discretization is done using singly implicit Runge-Kutta method (SIRK). The convergence of the effectivity index is proven.

Fully-discrete finite element approximations for a fourth-order linear stochastic parabolic equation with additive space-time white noise

Georgios T. Kossioris, Georgios E. Zouraris (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We consider an initial and Dirichlet boundary value problem for a fourth-order linear stochastic parabolic equation, in one space dimension, forced by an additive space-time white noise. Discretizing the space-time white noise a modelling error is introduced and a regularized fourth-order linear stochastic parabolic problem is obtained. Fully-discrete approximations to the solution of the regularized problem are constructed by using, for discretization in space, a Galerkin finite element method...

Galerkin approximation with proper orthogonal decomposition : new error estimates and illustrative examples

Dominique Chapelle, Asven Gariah, Jacques Sainte-Marie (2012)

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

We propose a numerical analysis of proper orthogonal decomposition (POD) model reductions in which a priori error estimates are expressed in terms of the projection errors that are controlled in the construction of POD bases. These error estimates are derived for generic parabolic evolution PDEs, including with non-linear Lipschitz right-hand sides, and for wave-like equations. A specific projection continuity norm appears in the estimates and – whereas a general uniform continuity bound seems out...

Galerkin approximation with proper orthogonal decomposition : new error estimates and illustrative examples

Dominique Chapelle, Asven Gariah, Jacques Sainte-Marie (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

We propose a numerical analysis of proper orthogonal decomposition (POD) model reductions in which a priori error estimates are expressed in terms of the projection errors that are controlled in the construction of POD bases. These error estimates are derived for generic parabolic evolution PDEs, including with non-linear Lipschitz right-hand sides, and for wave-like equations. A specific projection continuity norm appears in the estimates and – whereas a general uniform continuity bound seems out...

Galerkin approximation with proper orthogonal decomposition : new error estimates and illustrative examples

Dominique Chapelle, Asven Gariah, Jacques Sainte-Marie (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

We propose a numerical analysis of proper orthogonal decomposition (POD) model reductions in which a priori error estimates are expressed in terms of the projection errors that are controlled in the construction of POD bases. These error estimates are derived for generic parabolic evolution PDEs, including with non-linear Lipschitz right-hand sides, and for wave-like equations. A specific projection continuity norm appears in the estimates and – whereas a general uniform continuity bound seems out...

Galerkin approximations for the linear parabolic equation with the third boundary condition

István Faragó, Sergey Korotov, Pekka Neittaanmäki (2003)

Applications of Mathematics

We solve a linear parabolic equation in d , d 1 , with the third nonhomogeneous boundary condition using the finite element method for discretization in space, and the θ -method for discretization in time. The convergence of both, the semidiscrete approximations and the fully discretized ones, is analysed. The proofs are based on a generalization of the idea of the elliptic projection. The rate of convergence is derived also for variable time step-sizes.

Galerkin time-stepping methods for nonlinear parabolic equations

Georgios Akrivis, Charalambos Makridakis (2004)

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

We consider discontinuous as well as continuous Galerkin methods for the time discretization of a class of nonlinear parabolic equations. We show existence and local uniqueness and derive optimal order optimal regularity a priori error estimates. We establish the results in an abstract Hilbert space setting and apply them to a quasilinear parabolic equation.

Galerkin time-stepping methods for nonlinear parabolic equations

Georgios Akrivis, Charalambos Makridakis (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We consider discontinuous as well as continuous Galerkin methods for the time discretization of a class of nonlinear parabolic equations. We show existence and local uniqueness and derive optimal order optimal regularity a priori error estimates. We establish the results in an abstract Hilbert space setting and apply them to a quasilinear parabolic equation.

Gradient-free and gradient-based methods for shape optimization of water turbine blade

Bastl, Bohumír, Brandner, Marek, Egermaier, Jiří, Horníková, Hana, Michálková, Kristýna, Turnerová, Eva (2019)

Programs and Algorithms of Numerical Mathematics

The purpose of our work is to develop an automatic shape optimization tool for runner wheel blades in reaction water turbines, especially in Kaplan turbines. The fluid flow is simulated using an in-house incompressible turbulent flow solver based on recently introduced isogeometric analysis (see e.g. J. A. Cotrell et al.: Isogeometric Analysis: Toward Integration of CAD and FEA, Wiley, 2009). The proposed automatic shape optimization approach is based on a so-called hybrid optimization which combines...

Grid adjustment based on a posteriori error estimators

Karel Segeth (1993)

Applications of Mathematics

The adjustment of one-dimensional space grid for a parabolic partial differential equation solved by the finite element method of lines is considered in the paper. In particular, the approach based on a posteriori error indicators and error estimators is studied. A statement on the rate of convergence of the approximation of error by estimator to the error in the case of a system of parabolic equations is presented.

Harmonic averages, exact difference schemes and local Green’s functions in variable coefficient PDE problems

Owe Axelsson, János Karátson (2013)

Open Mathematics

A brief survey is given to show that harmonic averages enter in a natural way in the numerical solution of various variable coefficient problems, such as in elliptic and transport equations, also of singular perturbation types. Local Green’s functions used as test functions in the Petrov-Galerkin finite element method combined with harmonic averages can be very efficient and are related to exact difference schemes.

High degree precision decomposition method for the evolution problem with an operator under a split form

Zurab Gegechkori, Jemal Rogava, Mikheil Tsiklauri (2002)

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

In the present work the symmetrized sequential-parallel decomposition method of the third degree precision for the solution of Cauchy abstract problem with an operator under a split form, is presented. The third degree precision is reached by introducing a complex coefficient with the positive real part. For the considered schema the explicit a priori estimation is obtained.

High degree precision decomposition method for the evolution problem with an operator under a split form

Zurab Gegechkori, Jemal Rogava, Mikheil Tsiklauri (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In the present work the symmetrized sequential-parallel decomposition method of the third degree precision for the solution of Cauchy abstract problem with an operator under a split form, is presented. The third degree precision is reached by introducing a complex coefficient with the positive real part. For the considered schema the explicit a priori estimation is obtained.

Hybrid parallelization of an adaptive finite element code

Axel Voigt, Thomas Witkowski (2010)

Kybernetika

We present a hybrid OpenMP/MPI parallelization of the finite element method that is suitable to make use of modern high performance computers. These are usually built from a large bulk of multi-core systems connected by a fast network. Our parallelization method is based firstly on domain decomposition to divide the large problem into small chunks. Each of them is then solved on a multi-core system using parallel assembling, solution and error estimation. To make domain decomposition for both, the...

Currently displaying 141 – 160 of 262