Finite Volume Methods

Total Page:16

File Type:pdf, Size:1020Kb

Finite Volume Methods FINITE VOLUME METHODS LONG CHEN The finite volume method (FVM) is a discretization technique for partial differential equations, especially those that arise from physical conservation laws. FVM uses a volume integral formulation of the problem with a finite partitioning set of volumes to discretize the equations. FVM is in common use for discretizing computational fluid dynamics equa- tions. Here we consider elliptic equations. 1. GENERAL FORM OF FINITE VOLUME METHODS We consider finite volume methods for solving diffusion type elliptic equation (1) − r · (Kru) = f in Ω; with suitable Dirichlet or Neumann boundary conditions. Here Ω ⊂ Rd is a polyhedral domain (d ≥ 2), the diffusion coefficient K(x) is a d × d symmetric matrix function that is uniformly positive definite on Ω with components in L1(Ω), and f 2 L2(Ω). We have discussed finite element methods based on the discretization of the weak formulation and finite difference methods based on the classic formulation. We shall now present finite volume methods based on the following balance equation Z Z (2) − (Kru) · n ds = fdx; 8 b ⊂ Ω; @b b where n denotes the unit outwards normal vector of @b. We first recall how the equation (1) is derived. When the equilibrium is reached, numerous physical models are based on conservation and constitutive laws. The balance equation for the conservation law: Z Z (3) q · n dS = f dx; for any domain b ⊂ Ω; @b b where q denoting the flux density and n the unit outward normal field of @b. The constitutive equation: (4) q = −Kru: If u denotes the: chemical concentration, temperature, electrostatic potential, or pressure, then equation (4) is: Fick’s law of diffusion, Fourier’s law of heat conduction, Ohm’s law of electrical conduction, or Darcy’s law of flow in the porous medium, respectively. Suppose u and q are smooth enough. In view of Gauss theorem, (3) can be written as Z Z (5) r · q dx = f dx; 8 b ⊂ Ω: b b Since b is arbitrary, letting b ! fxg, it implies (6) r · q(x) = f(x) 8 x 2 Ω: Substituting q = −K(x)ru into (6), we then obtain the classic formulation (1). 1 2 LONG CHEN Finite volume methods are discretizations of the balance equation (2) so that the con- servation holds in the discrete level. The discretization consists of three approximations: (1) approximate the function u by uh in a N-dimensional space V; (2) approximate “arbitrary domain b ⊂ Ω” by a finite subset B = fbi; i = 1 : Mg; (3) approximate boundary flux (Kru) · n on @bi by a discrete one (Krhuh) · n. We then end with a method: to find uh 2 V such that: Z Z (7) − (Krhuh) · n dS = f dx; 8 bi ⊂ Ω; i = 1 : M: @bi bi We call any method in the form (7) finite volume methods (FVMs). Since finite volume methods discretize the balance equation (2) directly, an obvious virtue of finite volume methods is the conservation property comparing with finite element methods based on the weak formulation. This property can be fundamental for the simula- tion of many physical models, e.g., in oil recovery simulations and in computational fluid dynamics in general. On the other hand, the function space and the control volume can be constructed based on general unstructured triangulations for complex geometry domains. The boundary con- dition can be easily built into the function space or the variational form. Thus FVM is more flexible than standard finite difference methods which mainly defined on the struc- tured grids of simple domains. 2. CELL-CENTERED FINITE VOLUME METHODS Let T be a triangular or Cartesian grid of Ω. We choose the finite dimensional space 2 V = fv 2 L (Ω) : vjτ is constant for all τ 2 T g. Then dim V = NT , the number of elements of T . We also choose B = T . See Figure2(a). To complete the discretization, we need to assign the boundary flux of each element. This can be done in a finite difference fashion. For example, for an interior side e (an edge in 2-D and a face in 3-D) shared by two elements τ1 and τ2, we can define uhjτ2 − uhjτ1 (8) rhuh · ne := ; cτ2 − cτ1 where the normal vector ne is the outward unit normal vector of e in τ1, i.e. pointing from τ1 to τ2 and cτi 2 τi; i = 1; 2 are points in each element such that the line segment connecting cτ2 and cτ1 is orthogonal to the side e. By the symmetry, for rectangles or cubes cτ is the mass center of τ. For simplex, cτ should be the circumcenters which imposes restriction on the triangulation. When the mesh is a uniform rectangular grid, it is reduced to the cell centered finite difference method; see Section 4 of Chapter: Finite Difference Methods. The error analysis can be carried out in the finite difference fashion by considering the truncation error and stability of the resulting system. Theory and computation along this approach is summarized in the book [8]. Another approach to discretize the boundary flux is through mixed finite element meth- ods. The gradient operator is understood as r : L2 ! H−1. Optimal error estimate can be easily obtained by using that of mixed finite element methods [13]. Since the control volume is the element (also called cell) of the mesh and the unknown is associated to each element/cell, it is often called cell-centered finite volume methods and the difference scheme (8) is also known as cell centered finite difference methods. FINITE VOLUME METHODS: FOUNDATIONFINITE VOLUME AND METHODS: ANALYSIS FOUNDATION AND7 ANALYSIS 7 2. Finite volume (FV) methods2. Finite for nonlinear volume (FV)conservation methods laws for nonlinear conservation laws In the finite volume method,In the the computational finite volume method, domain, theΩ computationald, is first tessellated domain, Ω into aRd, is first tessellated into a R ⊂ collection of non overlappingcollection control volumes of non overlapping that completely control⊂ cover volumes the domain. that completely Notationally, cover the domain. Notationally, let denote a tessellation oflet the domaindenoteΩ awith tessellation control of volumes the domainT Ω suchwith thatcontrolT volumesT = ΩT. such that T T = Ω. T T ∈ T ∪ ∈T ∈ T ∪ ∈T Let h denote a length scaleLet associatedhT denote with a length each control scale associated volume T , with e.g. h each controldiam(T). volume For T , e.g. hT diam(T). For T T ≡ ≡ two distinct control volumestwoT and distinctT in control, the volumes intersectionTi and is eitherTj in an, orientedthe intersection edge (2-D) is either an oriented edge (2-D) i j T T or face (3-D) e with orientedor normal face (3-D)ν oreij elsewith a setoriented of measure normal atν mostij or elsed 2. a set In each of measure control at most d 2. In each control ij ij − volume, an integral conservationvolume, law anstatementintegral is conservation then imposed. law statement− is then imposed. Definition 2.1 (Integral conservationDefinition 2.1 law) (IntegralAn integral conservation conservation law) lawAn asserts integral that conservation the law asserts that the rate of change of the total amountrate of of change a substance of the with total density amountu ofin a a substance fixed control with volume densityTuisin a fixed control volume T is equal to the total flux of theequal substance to the through total flux the of boundary the substance∂T through the boundary ∂T d d u dx + f(u) dν =0 . u dx + f(u) dν =0(15). (15) dt · dt T ∂T · !T !∂T ! ! This integral conservation lawThis statement integral conservationis readily obtained law statement upon spatial is readily integration obtained of theupon spatial integration of the divergence equation (1a) indivergence the region equationT and application (1a) in the of region the divergenceT and application theorem. of The the divergence theorem. The choice of control volume tessellationchoice ofFINITE is control flexible VOLUME volume in the METHODSfinitetessellation volume is method. flexible in For the example, finite volume Fig. method. 3 For example, Fig. storage location storage location control volume control volume (a) Control volumes of the cell-centered FVM (b) Control volumes of the vertex-centered FVM a. Cell-centered b.a. Vertex-centered Cell-centered b. Vertex-centered FIGUREFigure1. Meshes 1. Control and volume control variantsFigure volumes used 1. in Control the of finite twovolume volume FVMs. variants method: The used inunknowns the finite volume method: (a) cell-centered and (b) vertex-centered(a) cell-centered control and volume (b) vertex-centered tessellation. control volume tessellation. are associated to black nodes. 1 depicts a 2-D triangle complex1 depicts and a two 2-D typical triangle control complex volume and tessellations two typical control (among volume many tessellations (among many others) used in the3. finite VERTEX volumeothers)-CENTERED method. used in In the the FINITEfinitecell-centered volume VOLUME method.finite volume METHODS In the methodcell-centered shownfinite in volume method shown in Fig. 1a, the triangles themselvesFig. serve1a, the as triangles control volumes themselves with serve solution as control unknowns volumes (degrees with ofsolution unknowns (degrees of Wefreedom) now stored discuss onanother a per trianglefreedom) popular basis. stored choice In the onvertex-centered ofa perV triangleand B. basis.finite To simplifyvolume In the vertex-centered method the notation, shownfinite in we volume con- method shown in siderFig. two 1b, dimensional control volumes triangular areFig. formed 1b, grids as control a geometric and volumes homogenous dual are to formed the Dirichlet triangle as a geometric complex boundary dual and tosolution condition. the triangle We complex and solution referunknowns to [15] stored for the on a general per triangulationunknowns treatment stored vertex in on basis.high a per dimensional triangulation vertex simplicial basis.
Recommended publications
  • A Parallel Preconditioner for a FETI-DP Method for the Crouzeix-Raviart finite Element
    A parallel preconditioner for a FETI-DP method for the Crouzeix-Raviart finite element Leszek Marcinkowski∗1 Talal Rahman2 1 Introduction In this paper, we present a Neumann-Dirichlet type parallel preconditioner for a FETI-DP method for the nonconforming Crouzeix-Raviart (CR) finite element dis- cretization of a model second order elliptic problem. The proposed method is almost optimal, in fact, the condition number of the preconditioned problem grows poly- logarithmically with respect to the mesh parameters of the local triangulations. In many scientific applications, where partial differential equations are used to model, the Crouzeix-Raviart (CR) finite element has been one of the most com- monly used nonconforming finite element for the numerical solution. This includes applications like the Poisson equation (cf. [11, 23]), the Darcy-Stokes problem (cf. [8]), the elasticity problem (cf. [3]). We also would like to add that there is a close relationship between mixed finite elements and the nonconforming finite element for the second order elliptic problem; cf. [1, 2]. The CR element has also been used in the framework of finite volume element method; cf. [9]. There exists quite a number of works focusing on iterative methods for the CR finite element for second order problems; cf. [4, 5, 10, 13, 16, 18, 19, 20, 21, 22] and references therein. The purpose of this paper is to propose a parallel algorithm based on a Neumann-Dirichlet preconditioner for a FETI-DP formulation of the CR finite element method for the second order elliptic problem. To our knowledge, this is apparently the first work on such preconditioner for the FETI-DP method for the Crouzeix-Raviart (CR) finite element.
    [Show full text]
  • Coupling of the Finite Volume Element Method and the Boundary Element Method – an a Priori Convergence Result
    COUPLING OF THE FINITE VOLUME ELEMENT METHOD AND THE BOUNDARY ELEMENT METHOD – AN A PRIORI CONVERGENCE RESULT CHRISTOPH ERATH∗ Abstract. The coupling of the finite volume element method and the boundary element method is an interesting approach to simulate a coupled system of a diffusion convection reaction process in an interior domain and a diffusion process in the corresponding unbounded exterior domain. This discrete system maintains naturally local conservation and a possible weighted upwind scheme guarantees the stability of the discrete system also for convection dominated problems. We show existence and uniqueness of the continuous system with appropriate transmission conditions on the coupling boundary, provide a convergence and an a priori analysis in an energy (semi-) norm, and an existence and an uniqueness result for the discrete system. All results are also valid for the upwind version. Numerical experiments show that our coupling is an efficient method for the numerical treatment of transmission problems, which can be also convection dominated. Key words. finite volume element method, boundary element method, coupling, existence and uniqueness, convergence, a priori estimate 1. Introduction. The transport of a concentration in a fluid or the heat propa- gation in an interior domain often follows a diffusion convection reaction process. The influence of such a system to the corresponding unbounded exterior domain can be described by a homogeneous diffusion process. Such a coupled system is usually solved by a numerical scheme and therefore, a method which ensures local conservation and stability with respect to the convection term is preferable. In the literature one can find various discretization schemes to solve similar prob- lems.
    [Show full text]
  • Hp-Finite Element Methods for Hyperbolic Problems
    ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ Eidgen¨ossische Ecole polytechnique f´ed´erale de Zurich ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ Technische Hochschule Politecnico federale di Zurigo ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ ¢¢¢¢¢¢¢¢¢¢¢ Z¨urich Swiss Federal Institute of Technology Zurich hp-Finite Element Methods for Hyperbolic Problems E. S¨uli†, P. Houston† and C. Schwab ∗ Research Report No. 99-14 July 1999 Seminar f¨urAngewandte Mathematik Eidgen¨ossische Technische Hochschule CH-8092 Z¨urich Switzerland †Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, United Kingdom ∗E. S¨uliand P. Houston acknowledge the financial support of the EPSRC (Grant GR/K76221) hp-Finite Element Methods for Hyperbolic Problems E. S¨uli†, P. Houston† and C. Schwab ∗ Seminar f¨urAngewandte Mathematik Eidgen¨ossische Technische Hochschule CH-8092 Z¨urich Switzerland Research Report No. 99-14 July 1999 Abstract This paper is devoted to the a priori and a posteriori error analysis of the hp-version of the discontinuous Galerkin finite element method for partial differential equations of hyperbolic and nearly-hyperbolic character. We consider second-order partial dif- ferential equations with nonnegative characteristic form, a large class of equations which includes convection-dominated diffusion problems, degenerate elliptic equa- tions and second-order problems of mixed elliptic-hyperbolic-parabolic type. An a priori error bound is derived for the method in the so-called DG-norm which is optimal in terms of the mesh size h; the error bound is either 1 degree or 1/2 de- gree below optimal in terms of the polynomial degree p, depending on whether the problem is convection-dominated, or diffusion-dominated, respectively. In the case of a first-order hyperbolic equation the error bound is hp-optimal in the DG-norm.
    [Show full text]
  • On the Use of Discrete Fourier Transform for Solving Biperiodic Boundary Value Problem of Biharmonic Equation in the Unit Rectangle
    On the Use of Discrete Fourier Transform for Solving Biperiodic Boundary Value Problem of Biharmonic Equation in the Unit Rectangle Agah D. Garnadi 31 December 2017 Department of Mathematics, Faculty of Mathematics and Natural Sciences, Bogor Agricultural University Jl. Meranti, Kampus IPB Darmaga, Bogor, 16680 Indonesia Abstract This note is addressed to solving biperiodic boundary value prob- lem of biharmonic equation in the unit rectangle. First, we describe the necessary tools, which is discrete Fourier transform for one di- mensional periodic sequence, and then extended the results to 2- dimensional biperiodic sequence. Next, we use the discrete Fourier transform 2-dimensional biperiodic sequence to solve discretization of the biperiodic boundary value problem of Biharmonic Equation. MSC: 15A09; 35K35; 41A15; 41A29; 94A12. Key words: Biharmonic equation, biperiodic boundary value problem, discrete Fourier transform, Partial differential equations, Interpola- tion. 1 Introduction This note is an extension of a work by Henrici [2] on fast solver for Poisson equation to biperiodic boundary value problem of biharmonic equation. This 1 note is organized as follows, in the first part we address the tools needed to solve the problem, i.e. introducing discrete Fourier transform (DFT) follows Henrici's work [2]. The second part, we apply the tools already described in the first part to solve discretization of biperiodic boundary value problem of biharmonic equation in the unit rectangle. The need to solve discretization of biharmonic equation is motivated by its occurence in some applications such as elasticity and fluid flows [1, 4], and recently in image inpainting [3]. Note that the work of Henrici [2] on fast solver for biperiodic Poisson equation can be seen as solving harmonic inpainting.
    [Show full text]
  • TERMINOLOGY UNIT- I Finite Element Method (FEM)
    TERMINOLOGY UNIT- I The Finite Element Method (FEM) is a numerical technique to find Finite Element approximate solutions of partial differential equations. It was originated from Method (FEM) the need of solving complex elasticity and structural analysis problems in Civil, Mechanical and Aerospace engineering. Any continuum/domain can be divided into a number of pieces with very Finite small dimensions. These small pieces of finite dimension are called Finite Elements Elements. Field The field variables, displacements (strains) & stresses or stress resultants must Conditions satisfy the governing condition which can be mathematically expressed. A set of independent functions satisfying the boundary conditions is chosen Functional and a linear combination of a finite number of them is taken to approximately Approximation specify the field variable at any point. A structure can have infinite number of displacements. Approximation with a Degrees reasonable level of accuracy can be achieved by assuming a limited number of of Freedom displacements. This finite number of displacements is the number of degrees of freedom of the structure. The formulation for structural analysis is generally based on the three Numerical fundamental relations: equilibrium, constitutive and compatibility. There are Methods two major approaches to the analysis: Analytical and Numerical. Analytical approach which leads to closed-form solutions is effective in case of simple geometry, boundary conditions, loadings and material properties. Analytical However, in reality, such simple cases may not arise. As a result, various approach numerical methods are evolved for solving such problems which are complex in nature. For numerical approach, the solutions will be approximate when any of these Numerical relations are only approximately satisfied.
    [Show full text]
  • A Face-Centred Finite Volume Method for Second-Order Elliptic Problems
    A face-centred finite volume method for second-order elliptic problems Ruben Sevilla Zienkiewicz Centre for Computational Engineering, College of Engineering, Swansea University, Wales, UK Matteo Giacomini, and Antonio Huerta Laboratori de C`alculNum`eric(LaC`aN), ETS de Ingenieros de Caminos, Canales y Puertos, Universitat Polit`ecnicade Catalunya, Barcelona, Spain December 19, 2017 Abstract This work proposes a novel finite volume paradigm, the face-centred finite volume (FCFV) method. Contrary to the popular vertex (VCFV) and cell (CCFV) centred finite volume methods, the novel FCFV defines the solution on the mesh faces (edges in 2D) to construct locally-conservative numerical schemes. The idea of the FCFV method stems from a hybridisable discontinuous Galerkin (HDG) formulation with constant degree of approximation, thus inheriting the convergence properties of the classical HDG. The resulting FCFV features a global problem in terms of a piecewise constant function defined on the faces of the mesh. The solution and its gradient in each element are then recovered by solving a set of independent element-by-element problems. The mathematical formulation of FCFV for Poisson and Stokes equation is derived and numerical evidence of optimal convergence in 2D and 3D is provided. Numerical examples are presented to illustrate the accuracy, efficiency and robustness of the proposed methodology. The results show that, contrary to other FV methods, arXiv:1712.06173v1 [math.NA] 17 Dec 2017 the accuracy of the FCFV method is not sensitive to mesh distortion and stretching. In addition, the FCFV method shows its better performance, accuracy and robustness using simplicial elements, facilitating its application to problems involving complex geometries in 3D.
    [Show full text]
  • Lecture 7: the Complex Fourier Transform and the Discrete Fourier Transform (DFT)
    Lecture 7: The Complex Fourier Transform and the Discrete Fourier Transform (DFT) c Christopher S. Bretherton Winter 2014 7.1 Fourier analysis and filtering Many data analysis problems involve characterizing data sampled on a regular grid of points, e. g. a time series sampled at some rate, a 2D image made of regularly spaced pixels, or a 3D velocity field from a numerical simulation of fluid turbulence on a regular grid. Often, such problems involve characterizing, detecting, separating or ma- nipulating variability on different scales, e. g. finding a weak systematic signal amidst noise in a time series, edge sharpening in an image, or quantifying the energy of motion across the different sizes of turbulent eddies. Fourier analysis using the Discrete Fourier Transform (DFT) is a fun- damental tool for such problems. It transforms the gridded data into a linear combination of oscillations of different wavelengths. This partitions it into scales which can be separately analyzed and manipulated. The computational utility of Fourier methods rests on the Fast Fourier Transform (FFT) algorithm, developed in the 1960s by Cooley and Tukey, which allows efficient calculation of discrete Fourier coefficients of a periodic function sampled on a regular grid of 2p points (or 2p3q5r with slightly reduced efficiency). 7.2 Example of the FFT Using Matlab, take the FFT of the HW1 wave height time series (length 24 × 60=25325) and plot the result (Fig. 1): load hw1 dat; zhat = fft(z); plot(abs(zhat),’x’) A few elements (the second and last, and to a lesser extent the third and the second from last) have magnitudes that stand above the noise.
    [Show full text]
  • Discretization of Integro-Differential Equations
    Discretization of Integro-Differential Equations Modeling Dynamic Fractional Order Viscoelasticity K. Adolfsson1, M. Enelund1,S.Larsson2,andM.Racheva3 1 Dept. of Appl. Mech., Chalmers Univ. of Technology, SE–412 96 G¨oteborg, Sweden 2 Dept. of Mathematics, Chalmers Univ. of Technology, SE–412 96 G¨oteborg, Sweden 3 Dept. of Mathematics, Technical University of Gabrovo, 5300 Gabrovo, Bulgaria Abstract. We study a dynamic model for viscoelastic materials based on a constitutive equation of fractional order. This results in an integro- differential equation with a weakly singular convolution kernel. We dis- cretize in the spatial variable by a standard Galerkin finite element method. We prove stability and regularity estimates which show how the convolution term introduces dissipation into the equation of motion. These are then used to prove a priori error estimates. A numerical ex- periment is included. 1 Introduction Fractional order operators (integrals and derivatives) have proved to be very suit- able for modeling memory effects of various materials and systems of technical interest. In particular, they are very useful when modeling viscoelastic materials, see, e.g., [3]. Numerical methods for quasistatic viscoelasticity problems have been studied, e.g., in [2] and [8]. The drawback of the fractional order viscoelastic models is that the whole strain history must be saved and included in each time step. The most commonly used algorithms for this integration are based on the Lubich convolution quadrature [5] for fractional order operators. In [1, 2], we develop an efficient numerical algorithm based on sparse numerical quadrature earlier studied in [6]. While our earlier work focused on discretization in time for the quasistatic case, we now study space discretization for the fully dynamic equations of mo- tion, which take the form of an integro-differential equation with a weakly singu- lar convolution kernel.
    [Show full text]
  • There Is Only One Fourier Transform Jens V
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 25 December 2017 doi:10.20944/preprints201712.0173.v1 There is only one Fourier Transform Jens V. Fischer * Microwaves and Radar Institute, German Aerospace Center (DLR), Germany Abstract Four Fourier transforms are usually defined, the Integral Fourier transform, the Discrete-Time Fourier transform (DTFT), the Discrete Fourier transform (DFT) and the Integral Fourier transform for periodic functions. However, starting from their definitions, we show that all four Fourier transforms can be reduced to actually only one Fourier transform, the Fourier transform in the distributional sense. Keywords Integral Fourier Transform, Discrete-Time Fourier Transform (DTFT), Discrete Fourier Transform (DFT), Integral Fourier Transform for periodic functions, Fourier series, Poisson Summation Formula, periodization trick, interpolation trick Introduction Two Important Operations The fact that “there is only one Fourier transform” actually There are two operations which are being strongly related to needs no proof. It is commonly known and often discussed in four different variants of the Fourier transform, i.e., the literature, for example in [1-2]. discretization and periodization. For any real-valued T > 0 and δ(t) being the Dirac impulse, let However frequently asked questions are: (1) What is the difference between calculating the Fourier series and the (1) Fourier transform of a continuous function? (2) What is the difference between Discrete-Time Fourier Transform (DTFT) be the function that results from a discretization of f(t) and let and Discrete Fourier Transform (DFT)? (3) When do we need which Fourier transform? and many others. The default answer (2) today to all these questions is to invite the reader to have a look at the so-called Fourier-Poisson cube, e.g.
    [Show full text]
  • Data Mining Algorithms
    Data Management and Exploration © for the original version: Prof. Dr. Thomas Seidl Jiawei Han and Micheline Kamber http://www.cs.sfu.ca/~han/dmbook Data Mining Algorithms Lecture Course with Tutorials Wintersemester 2003/04 Chapter 4: Data Preprocessing Chapter 3: Data Preprocessing Why preprocess the data? Data cleaning Data integration and transformation Data reduction Discretization and concept hierarchy generation Summary WS 2003/04 Data Mining Algorithms 4 – 2 Why Data Preprocessing? Data in the real world is dirty incomplete: lacking attribute values, lacking certain attributes of interest, or containing only aggregate data noisy: containing errors or outliers inconsistent: containing discrepancies in codes or names No quality data, no quality mining results! Quality decisions must be based on quality data Data warehouse needs consistent integration of quality data WS 2003/04 Data Mining Algorithms 4 – 3 Multi-Dimensional Measure of Data Quality A well-accepted multidimensional view: Accuracy (range of tolerance) Completeness (fraction of missing values) Consistency (plausibility, presence of contradictions) Timeliness (data is available in time; data is up-to-date) Believability (user’s trust in the data; reliability) Value added (data brings some benefit) Interpretability (there is some explanation for the data) Accessibility (data is actually available) Broad categories: intrinsic, contextual, representational, and accessibility. WS 2003/04 Data Mining Algorithms 4 – 4 Major Tasks in Data Preprocessing
    [Show full text]
  • Verification and Validation in Computational Fluid Dynamics1
    SAND2002 - 0529 Unlimited Release Printed March 2002 Verification and Validation in Computational Fluid Dynamics1 William L. Oberkampf Validation and Uncertainty Estimation Department Timothy G. Trucano Optimization and Uncertainty Estimation Department Sandia National Laboratories P. O. Box 5800 Albuquerque, New Mexico 87185 Abstract Verification and validation (V&V) are the primary means to assess accuracy and reliability in computational simulations. This paper presents an extensive review of the literature in V&V in computational fluid dynamics (CFD), discusses methods and procedures for assessing V&V, and develops a number of extensions to existing ideas. The review of the development of V&V terminology and methodology points out the contributions from members of the operations research, statistics, and CFD communities. Fundamental issues in V&V are addressed, such as code verification versus solution verification, model validation versus solution validation, the distinction between error and uncertainty, conceptual sources of error and uncertainty, and the relationship between validation and prediction. The fundamental strategy of verification is the identification and quantification of errors in the computational model and its solution. In verification activities, the accuracy of a computational solution is primarily measured relative to two types of highly accurate solutions: analytical solutions and highly accurate numerical solutions. Methods for determining the accuracy of numerical solutions are presented and the importance of software testing during verification activities is emphasized. The fundamental strategy of 1Accepted for publication in the review journal Progress in Aerospace Sciences. 3 validation is to assess how accurately the computational results compare with the experimental data, with quantified error and uncertainty estimates for both.
    [Show full text]
  • A Three-Dimensional Electrostatic Particle-In-Cell Methodology on Unstructured Delaunay–Voronoi Grids
    Journal of Computational Physics 228 (2009) 3742–3761 Contents lists available at ScienceDirect Journal of Computational Physics journal homepage: www.elsevier.com/locate/jcp A three-dimensional electrostatic particle-in-cell methodology on unstructured Delaunay–Voronoi grids Nikolaos A. Gatsonis *, Anton Spirkin Mechanical Engineering Department, Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609, USA article info abstract Article history: The mathematical formulation and computational implementation of a three-dimensional Received 20 March 2008 particle-in-cell methodology on unstructured Delaunay–Voronoi tetrahedral grids is pre- Received in revised form 30 January 2009 sented. The method allows simulation of plasmas in complex domains and incorporates Accepted 3 February 2009 the duality of the Delaunay–Voronoi in all aspects of the particle-in-cell cycle. Charge Available online 12 February 2009 assignment and field interpolation weighting schemes of zero- and first-order are formu- lated based on the theory of long-range constraints. Electric potential and fields are derived from a finite-volume formulation of Gauss’ law using the Voronoi–Delaunay dual. Bound- Keywords: ary conditions and the algorithms for injection, particle loading, particle motion, and par- Three-dimensional particle-in-cell (PIC) Unstructured PIC ticle tracking are implemented for unstructured Delaunay grids. Error and sensitivity Delaunay–Voronoi analysis examines the effects of particles/cell, grid scaling, and timestep on the numerical heating, the slowing-down time, and the deflection times. The problem of current collec- tion by cylindrical Langmuir probes in collisionless plasmas is used for validation. Numer- ical results compare favorably with previous numerical and analytical solutions for a wide range of probe radius to Debye length ratios, probe potentials, and electron to ion temper- ature ratios.
    [Show full text]