Finite volumes and nonlinear diffusion equations
In this paper we deal with a problem of segmentation (including missing boundary completion) and subjective contour creation. For the corresponding models we apply the semi-implicit finite volume numerical schemes leading to methods which are robust, efficient and stable without any restriction to a time step. The finite volume discretization enables to use the spatial adaptivity and thus improve significantly the computational time. The computational results related to image segmentation with partly...
In this article, we analyze the stability of various numerical schemes for differential models of viscoelastic fluids. More precisely, we consider the prototypical Oldroyd-B model, for which a free energy dissipation holds, and we show under which assumptions such a dissipation is also satisfied for the numerical scheme. Among the numerical schemes we analyze, we consider some discretizations based on the log-formulation of the Oldroyd-B system proposed by Fattal and Kupferman in [J. Non-Newtonian...
This paper aims at the development of numerical schemes for nonlinear reaction diffusion problems with a convection that blows up in a finite time. A full discretization of this problem that preserves the blow - up property is presented as well as a numerical simulation. Efficiency of the method is derived via a numerical comparison with a classical scheme based on the Runge Kutta scheme.
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...
We solve a linear parabolic equation in , 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.
We study a family of non linear schemes for the numerical solution of linear advection on arbitrary grids in several space dimension. A proof of weak convergence of the family of schemes is given, based on a new Longitudinal Variation Diminishing (LVD) estimate. This estimate is a multidimensional equivalent to the well-known TVD estimate in one dimension. The proof uses a corollary of the Perron-Frobenius theorem applied to a generalized Harten formalism.
We study a family of non linear schemes for the numerical solution of linear advection on arbitrary grids in several space dimension. A proof of weak convergence of the family of schemes is given, based on a new Longitudinal Variation Diminishing (LVD) estimate. This estimate is a multidimensional equivalent to the well-known TVD estimate in one dimension. The proof uses a corollary of the Perron-Frobenius theorem applied to a generalized Harten formalism.
This paper is concerned with the numerical approximation of Cauchy problems for one-dimensional nonconservative hyperbolic systems. The theory developed by Dal Maso et al. [J. Math. Pures Appl.74 (1995) 483–548] is used in order to define the weak solutions of the system: an interpretation of the nonconservative products as Borel measures is given, based on the choice of a family of paths drawn in the phase space. Even if the family of paths can be chosen arbitrarily, it is natural to require this...
Hermite polynomial interpolation is investigated. Some approximation results are obtained. As an example, the Burgers equation on the whole line is considered. The stability and the convergence of proposed Hermite pseudospectral scheme are proved strictly. Numerical results are presented.
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.
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.
We analyze the regularity of random entropy solutions to scalar hyperbolic conservation laws with random initial data. We prove regularity theorems for statistics of random entropy solutions like expectation, variance, space-time correlation functions and polynomial moments such as gPC coefficients. We show how regularity of such moments (statistical and polynomial chaos) of random entropy solutions depends on the regularity of the distribution law of the random shock location of the initial data....
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...