1,720,982 research outputs found

    A mimetic finite difference method for the Stokes problem with selected edege bubbles

    No full text
    A new mimetic finite difference method for the Stokes problem is proposed and analyzed. The mimetic discretization methodology can be understood as a generalization of the finite element method to meshes with general polygons/polyhedrons. In this paper, the mimetic generalization of the unstable P1P0P_1-P_0 (and the “conditionally stable” Q1P0Q1-P0) finite element is shown to be fully stable when applied to a large range of polygonal meshes. Moreover, we show how to stabilize the remaining cases by adding a small number of bubble functions to selected mesh edges. A simple strategy for selecting such edges is proposed and verified with numerical experiments

    Convergence analysis of the high-order mimetic finite difference method

    No full text
    We prove second-order convergence of the conservative variable and its flux in the high-order MFD method. The convergence results are proved for unstructured polyhedral meshes and full tensor diffusion coefficients. For the case of non-constant coefficients, we also develop a new family of high-order MFD methods. Theoretical result are confirmed through numerical experiments

    Arbitrary-order nodal mimetic discretizations of elliptic problems on polygonal meshes

    No full text
    We develop and analyze a new family of mimetic methods on unstructured polygonal meshes for the diffusion problem in primal form. These methods are derived from the local consistency condition that is exact for polynomials of any degree m1m\geq1. The degrees of freedom are (a) solution values at the quadrature nodes of the Gauss–Lobatto formulas on each mesh edge, and (b) solution moments inside polygons. The convergence of the method is proven theoretically and an optimal error estimate is derived in a mesh-dependent norm that mimics the energy norm. Numerical experiments confirm the convergence rate that is expected from the theory

    Error analysis for a mimetic discretization of the steady Stokes problem on polyhedral meshes

    No full text
    We present the development, convergence analysis, and numerical tests of the mimetic finite difference method for the Stokes problem on two-dimensional polygonal and three-dimensional polyhedral meshes

    Convergence of Mimetic Finite Difference Methods for Diffusion Problems on Polyhedral Meshes

    No full text
    The stability and convergence properties of the mimetic finite difference method for diffusion-type problems on polyhedral meshes are analyzed. The optimal convergence rates for the scalar and vector variables in the mixed formulation of the problem are proved.

    Mimetic finite difference method for the stokes problem on polygonal meshes

    Full text link
    Various approaches to extend the finite element methods to non-traditional elements (pyramids, polyhedra, etc.) have been developed over the last decade. Building of basis functions for such elements is a challenging task and may require extensive geometry analysis. The mimetic finite difference (MFD) method has many similarities with low-order finite element methods. Both methods try to preserve fundamental properties of physical and mathematical models. The essential difference is that the MFD method uses only the surface representation of discrete unknowns to build stiffness and mass matrices. Since no extension inside the mesh element is required, practical implementation of the MFD method is simple for polygonal meshes that may include degenerate and non-convex elements. In this article, we develop a MFD method for the Stokes problem on arbitrary polygonal meshes. The method is constructed for tensor coefficients, which will allow to apply it to the linear elasticity problem. The numerical experiments show the second-order convergence for the velocity variable and the first-order for the pressure

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
    corecore