Displaying 141 – 160 of 757

Showing per page

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

Stefano Berrone (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper we derive a posteriori 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...

Small-stencil 3D schemes for diffusive flows in porous media

Robert Eymard, Cindy Guichard, Raphaèle Herbin (2012)

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

In this paper, we study some discretization schemes for diffusive flows in heterogeneous anisotropic porous media. We first introduce the notion of gradient scheme, and show that several existing schemes fall into this framework. Then, we construct two new gradient schemes which have the advantage of a small stencil. Numerical results obtained for real reservoir meshes show the efficiency of the new schemes, compared to existing ones.

Small-stencil 3D schemes for diffusive flows in porous media

Robert Eymard, Cindy Guichard, Raphaèle Herbin (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper, we study some discretization schemes for diffusive flows in heterogeneous anisotropic porous media. We first introduce the notion of gradient scheme, and show that several existing schemes fall into this framework. Then, we construct two new gradient schemes which have the advantage of a small stencil. Numerical results obtained for real reservoir meshes show the efficiency of the new schemes, compared to existing ones.

Smooth approximation of data with applications to interpolating and smoothing

Segeth, Karel (2013)

Programs and Algorithms of Numerical Mathematics

In the paper, we are concerned with some computational aspects of smooth approximation of data. This approach to approximation employs a (possibly infinite) linear combinations of smooth functions with coefficients obtained as the solution of a variational problem, where constraints represent the conditions of interpolating or smoothing. Some 1D numerical examples are presented.

Smooth approximation spaces based on a periodic system

Segeth, Karel (2015)

Programs and Algorithms of Numerical Mathematics

A way of data approximation called smooth was introduced by Talmi and Gilat in 1977. Such an approach employs a (possibly infinite) linear combination of smooth basis functions with coefficients obtained as the unique solution of a minimization problem. While the minimization guarantees the smoothness of the approximant and its derivatives, the constraints represent the interpolating or smoothing conditions at nodes. In the contribution, a special attention is paid to the periodic basis system exp ( - k x ) ....

Smooth contour line construction with spline interpolation.

Pere Brunet Crosa, Lluis Pérez Vidal (1984)

Qüestiió

Contour maps are frequently used to represent three-dimensional surfaces from geographical applications or experimental results. In this paper, two new algorithms for the generation and display of such contours are presented. The first of them uses local spline interpolation to obtain contour maps from data points in a rectangular mesh, whereas the other interpolates a set of irregular points through recursive subdivision of triangles. In both algorithms, precision of the contours can be adjusted...

Currently displaying 141 – 160 of 757