75 research outputs found

    Upwinding in finite element systems of differential forms

    Get PDF
    We provide a notion of finite element system, that enables the construction spaces of differential forms, which can be used for the numerical solution of variationally posed partial difeerential equations. Within this framework, we introduce a form of upwinding, with the aim of stabilizing methods for the purposes of computational uid dynamics, in the vanishing viscosity regime. Published as the Smale Prize Lecture in: Foundations of computational mathematics, Budapest 2011, London Mathematical Society Lecture Note Series, 403, Cambridge University Press, 2013

    Mimetic discretizations of the incompressible Navier–Stokes equations for polyhedral meshes

    Get PDF

    Numerical results for mimetic discretization of Reissner-Mindlin plate problems

    Full text link
    A low-order mimetic finite difference (MFD) method for Reissner-Mindlin plate problems is considered. Together with the source problem, the free vibration and the buckling problems are investigated. Full details about the scheme implementation are provided, and the numerical results on several different types of meshes are reported

    Mimetic discretizations of the incompressible Navier–Stokes equations for polyhedral meshes

    Get PDF

    A Mixed Hybrid Finite Volume Scheme for Incompressible Navier-Stokes

    Get PDF
    Mixed Virtual Elements (MVE) is an innovative class of discretization schemes allowing solution of PDEs on virtually any mesh; such schemes stem from the idea of building discrete operators mimicking certain key properties of their continuous counterparts. In our previous work [27] we implemented our own 1st-order MVE scheme for convection-diffusion. In the present work, a) we extend such scheme to formally 2nd-order accuracy, b) we deal with the subsequent stability issues, c) we derive a full formally 2nd-order MVE scheme for incompressible steady-state Navier-Stokes, d) we provide a first suggestion for a MVE N-S solution algorithm. Numerical results are reported for benchmark test cases

    Alternative Solution Algorithms for Primal and Adjoint Incompressible Navier-Stokes

    Get PDF
    Regardless of the specific discretisation framework, the discrete incompressible Navier-Stokes equations present themselves in the form of a non-linear, saddle-point Oseentype system. Traditional CFD codes typically solve the system via the well-known SIMPLE-like algorithms, which are essentially block preconditioners based on Schur complement theory. Due to their “segregated” nature, which reduces to iteratively solving a sequence of linear systems smaller than the full Oseen and better conditioned, traditional SIMPLE-like algorithms have long been considered as the only viable strategy. However, recent progress in computational power and linear solver capabilities has led researchers to develop, for Oseen-type systems (and discrete Navier-Stokes in particular), a number of alternative preconditioners and solution schemes, found to be more efficient than SIMPLE-like strategies but previously deemed practically unfeasible in industrial contexts. The improved efficiency of novel preconditioners entails a) faster, more stable convergence and b) the possibility of driving residuals below more strict tolerances, which is sometimes difficult with SIMPLE due to stagnating behaviour. The second aspect in particular is extremely relevant in the context of adjoint-based optimisation, as evidence suggests that an adjoint system may be affected by convergence issues when the primal flow solution is not well converged. In this work, we present some solution schemes (both traditional and novel) implemented for the Mixed Hybrid Finite Volumes Navier-Stokes solver we introduced in our previous work. Performance, in terms of robustness and convergence properties, is assessed on a series of benchmark test cases. We also turn our attention to the discrete adjoint Navier-Stokes problem itself, which in essence requires solving a linear system similar to the original Oseen and therefore may benefit from the same preconditioning techniques. We show how the primal algorithms are adapted to the adjoint system, and we run a series of adjoint test cases to compare performance of various solution scheme
    • …
    corecore