Dune-Fem School DUNE-FEM School Adaptive solution of Poisson equation. Outline. Notes. Notes. Notes. Local Grid Adaptivitiy in DUNE-FEM
|
|
- Shonda Hensley
- 6 years ago
- Views:
Transcription
1 Dune-Fem School 2016 DUNE-FEM School 2016 Local Grid Adaptivitiy in DUNE-FEM laus-justus Heine, Robert Klöfkorn, Andreas Dedner, Martin Nolte, hristoph Gersbacher Institute for Applied Analysis and Numerical Simulation University of Stuttgart September 26-30, 2016 Stuttgart, Germany International Research Institute of Stavanger Adaptive solution of Poisson equation Figure: Adaptive P 1 Finite-Element solution of the Poisson Equation. DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 Outline 1 2 Adaptive Simulations Using DUNE-FEM 3 DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
2 Marking Entities for Refinement / oarsening For marking entities the Grid class provides two methods: bool mark ( int rc, const odim< 0 >::Entity &e ); int getmark ( const odim< 0 >::Entity &e ) const; The method mark sets the refinement count rc for an entity e. It returns true if the counter has been updated successfully. The method getmark returns the current refinement count for an entity. Interpretation of the refinement count: rc > 0 the entity shall be refined (at least) rc times. rc = 0 the entity need not be refined. rc < 0 the entity may be coarsened (at most) rc times. DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 R R grid.mark(1,entity); grid.mark(1,entity); DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 R R R grid.mark(1,entity); (for a grid with conform bisection) DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
3 R R R R grid.mark(1,entity); grid.mark(-1,entity); grid.mark(-1,entity); grid.mark(-1,entity); (for a grid with non-conform bisection) DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 R R R R Note: the result of a marking sequence depends on the grid implementation: quatering instead of bisection hanging nodes instead of conforming... DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 The Grid Modification ycle For grid modification three methods on the Grid have to be called: bool preadapt (); bool adapt (); void postadapt (); The grid modification in initiated by preadapt. It returns true if entities might vanish during the adaptation. The method adapt actually modifies the grid. It returns true, if new entities were created by the adaptation. The grid modification is finalized by calling postadapt. Warning: The method adapt will rebuild the index sets. DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
4 The Grid Modification ycle A basic adaptation cycle consists of the following steps: 1 mark (leaf) entities for refinement or coarsening, 2 call preadapt, 3 if entities might vanish, (hierarchally) restrict the data of (possibly) vanishing entities, 4 call adapt, 5 if new entities have been create, (hierarchically) prolong the data to newly generated entities, 6 call postadapt. DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 odim 0: Extended Entity Interface Entities of codimension 0 (elements) provide additional methods to traverse the grid hierarchy: class Entity { //... public: bool hasfather () const; Entity father () const; LocalGeometry geometryinfather () const; bool isleaf () const; HierarchicIterator hbegin ( int maxlevel ) const; HierarchicIterator hend ( int maxlevel ) const; //... }; DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 Adaptive Simulations Using DUNE-FEM Outline 1 2 Adaptive Simulations Using DUNE-FEM 3 DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
5 Adaptive Simulations Using DUNE-FEM AdaptationManager in DUNE-FEM Adaptation with prolongation and restriction of data is possible through the DUNE-GRID interface but quite involved. DUNE-FEM provides a singleton class typedef Dune::Fem::RestrictProlongDefault< DiscreteFunctionType > RestrictionProlongationType; typedef Dune::Fem::AdaptationManager< GridType, RestrictionProlongationType > AdaptationManagerType; restrictprolong_( solution_ ); adaptationmanager_( gridpart_.grid(), restrictprolong_ ); adaptationmanager_.adapt(); The call to the AdaptationManager will refine/coarsen the grid according to the marks set and will prolong and restrict the data using a provided operation. In addition, the dof storages for all instanciated discrete functions are set to the correct size. Furthermore, load balancing is carried out in parallel. DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 Outline 1 2 Adaptive Simulations Using DUNE-FEM 3 DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 A Posteriori Error Estimator For Poisson s problem we have implemented the following residual error estimator: u u h 2 H 1 (Ω) e G η 2 e. Local error estimator η e : ηe 2 = he f 2 + u h 2 L 2 (e) + h e [ u h ] n e 2 L 2 (i) i I e The jump is computed by [τ] := (τ inside τ outside ). The local mesh width h e can, e.g., be computed as h e = e 1 dim G. DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
6 Refinement Strategy For a given tolerance TOL we set, for example, TOL 2 e = TOL 2 / G. 1 Solve: ompute solution of problem 2 Estimate: e G compute η 2 e 3 Mark: Refine: if η 2 e > TOL 2 e oarsen: if θη 2 e < TOL 2 e, θ (0, 1) 4 Refine: refine mesh due to marking and restrict and prolong solution DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 Intersection Iterators For a given entity e E 0 the intersections i I e can be accessed via an iterator: IntersectionIteratorType ibegin( const typename odim<0>::entitytype &entity ) const; IntersectionIteratorType iend( const typename odim<0>::entitytype &entity ) const; intersection outside n inside Again, the usage of the intersection iterator mimicks the STL: const IntersectionIteratorType iend = gridpart.ibegin(entity); for(intersectioniteratortype iit = gridpart.iend(entity); iit!= iend; ++iit) { typedef typename IntersectionIteratorType::Intersection IntersecionType; const IntersectionType &intersecion = *iit; } DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 Intersection Interface Methods An intersection is either an inner or a boundary intersection: // returns true, if inside elemen has a neighbor bool neighbor() const; // returns true, if inside element is on boundary bool boundary() const; Inner intersections can return a pointer to the neighboring element: // return pointer to neighbor element, assert neighbor() is true! Entity outside() const; Geometric realizations: // return geometry of this intersection in global coordinates Geometry geometry() const; // return geometry in local coordinates of the inside element LocalGeometry geometryininside () const; // return geometry in local coordinates of the outside element LocalGeometry geometryinoutside () const; // assert neighbor() is true! DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
7 Intersection Interface Methods (ont.) The intersection provides outer normals to the inside element: // return outer normal in local coordinate x Globaloordinate outernormal (const Localoordinate& local) const; // as outernormal(), scaled with geometry().integrationelement(local) Globaloordinate integrationouternormal (const Localoordinate& local) const; // return unit outer normal in center Globaloordinate centerunitouternormal() const; DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20 TODO: 06-afem-1 TODO In estimator.hh implement the local error contribution for the jump of the gradient i I e [ u h ] n e 2 L 2 (i). TODO Test the different problems and adaptation strategies TODO Add appropriate model parameter to the estimator TODO Add the mass term and non-constant diffusion DUNE Group (IANS & IRIS) DUNE-FEM School 2016 September 26-30, / 20
Dune-Fem School Introduction to the D UNE Software Library. Why D UNE? Construction of higher order approximation Uh
Dune-Fem School 2016 Introduction to the D UNE Software Library Claus-Justus Heine, Robert Klöfkorn, Andreas Dedner, Martin Nolte, Christoph Gersbacher September 26-30, 2016 Stuttgart, Germany Institute
More informationDune-Fem School Introduction to the DUNE Software Library. Why DUNE? Construction of higher order approximation U h. Notes. Notes.
Dune-Fem School 2016 Introduction to the DUNE Software Library Claus-Justus Heine, Robert Klöfkorn, Andreas Dedner, Martin Nolte, Christoph Gersbacher Institute for Applied Analysis and Numerical Simulation
More informationPredictive Engineering and Computational Sciences. Data Structures and Methods for Unstructured Distributed Meshes. Roy H. Stogner
PECOS Predictive Engineering and Computational Sciences Data Structures and Methods for Unstructured Distributed Meshes Roy H. Stogner The University of Texas at Austin May 23, 2012 Roy H. Stogner Distributed
More informationDistributed Newest Vertex Bisection
Distributed Newest Vertex Bisection in Dune-ALUGrid Martin Alkämper and Robert Klöfkorn Dune User Meeting 2015 Algorithm Some Analysis Experiments Problem In Dune-ALUGrid (among others) we provide an adaptive,
More informationThe DUNE Grid Interface An Introduction
The DUNE Grid Interface An Introduction Christian Engwer Applied Mathematics, WWU Münster Orleans-Ring 10, 48149 Münster March 7, 2017 Part I Dune Course: Design Principles [...] a modular toolbox for
More informationTowards a Unified Framework for Scientific Computing
Towards a Unified Framework for Scientific Computing Peter Bastian 1, Marc Droske 3, Christian Engwer 1, Robert Klöfkorn 2, Thimo Neubauer 1, Mario Ohlberger 2, Martin Rumpf 3 1 Interdisziplinäres Zentrum
More informationDune: Crete Introduction to the DUNE Software Library. Heraklion, January 16, Andreas Dedner,
Introduction to the DUNE Software Library Andreas Dedner, Heraklion, January 16, 2013 Department of Mathematics University of Warwick www.warwick.ac.uk/go/dune Intoduction to DUNE? Example Problem: Find
More informationAdaptive-Mesh-Refinement Pattern
Adaptive-Mesh-Refinement Pattern I. Problem Data-parallelism is exposed on a geometric mesh structure (either irregular or regular), where each point iteratively communicates with nearby neighboring points
More informationAn efficient implementation of an adaptive and parallel grid in DUNE
An efficient implementation of an adaptive and parallel grid in DUNE Adrian Burri, Andreas Dedner, Robert Klöfkorn 1, Mario Ohlberger 2 Abteilung für Angewandte Mathematik, Universität Freiburg, Hermann-Herder-Str.
More informationf xx + f yy = F (x, y)
Application of the 2D finite element method to Laplace (Poisson) equation; f xx + f yy = F (x, y) M. R. Hadizadeh Computer Club, Department of Physics and Astronomy, Ohio University 4 Nov. 2013 Domain
More informationThe Distributed and Unified Numerics Environment (DUNE) Grid Interface HOWTO
The Distributed and Unified Numerics Environment (DUNE) Grid Interface HOWTO Peter Bastian Markus Blatt Andreas Dedner Christian Engwer Robert Klöfkorn Mario Ohlberger Oliver Sander November 2, 2009 Abteilung
More informationAdaptive numerical methods
METRO MEtallurgical TRaining On-line Adaptive numerical methods Arkadiusz Nagórka CzUT Education and Culture Introduction Common steps of finite element computations consists of preprocessing - definition
More informationJoint Advanced Student School 2007 Martin Dummer
Sierpiński-Curves Joint Advanced Student School 2007 Martin Dummer Statement of the Problem What is the best way to store a triangle mesh efficiently in memory? The following points are desired : Easy
More informationSOFTWARE CONCEPTS AND ALGORITHMS FOR AN EFFICIENT AND SCALABLE PARALLEL FINITE ELEMENT METHOD
Fakultät Mathematik und Naturwissenschaften, Institut für Wissenschaftliches Rechnen SOFTWARE CONCEPTS AND ALGORITHMS FOR AN EFFICIENT AND SCALABLE PARALLEL FINITE ELEMENT METHOD Der Fakultät Mathematik
More information2 T. x + 2 T. , T( x, y = 0) = T 1
LAB 2: Conduction with Finite Difference Method Objective: The objective of this laboratory is to introduce the basic steps needed to numerically solve a steady state two-dimensional conduction problem
More informationEfficient Multigrid based solvers for Isogeometric Analysis
Efficient Multigrid based solvers for Isogeometric Analysis R. Tielen, M. Möller and C. Vuik Delft Institute of Applied Mathematics (DIAM) Numerical Analysis / 22 Isogeometric Analysis (IgA) Extension
More informationPROGRAMMING OF MULTIGRID METHODS
PROGRAMMING OF MULTIGRID METHODS LONG CHEN In this note, we explain the implementation detail of multigrid methods. We will use the approach by space decomposition and subspace correction method; see Chapter:
More informationAccelerating Double Precision FEM Simulations with GPUs
Accelerating Double Precision FEM Simulations with GPUs Dominik Göddeke 1 3 Robert Strzodka 2 Stefan Turek 1 dominik.goeddeke@math.uni-dortmund.de 1 Mathematics III: Applied Mathematics and Numerics, University
More informationH5FED HDF5 Based Finite Element Data Storage
H5FED HDF5 Based Finite Element Data Storage Novel, Open Source, Unrestricted Usability Benedikt Oswald (GFA, PSI) and Achim Gsell (AIT, PSI) s From: B. Oswald, P. Leidenberger. Electromagnetic fields
More informationDGtal: Digital Geometry Tools and Algorithms Library
DGtal: Digital Geometry Tools and Algorithms Library 1D Geometry Tristan Roussillon Objectives Tools that help in analysing any one-dimensional discrete structures in a generic framework. Examples in digital
More informationEfficiency of adaptive mesh algorithms
Efficiency of adaptive mesh algorithms 23.11.2012 Jörn Behrens KlimaCampus, Universität Hamburg http://www.katrina.noaa.gov/satellite/images/katrina-08-28-2005-1545z.jpg Model for adaptive efficiency 10
More informationCode sketch. A finite element code for linear elliptic problems can be sketched as follows:
Code sketch A finite element code for linear elliptic problems can be sketched as follows: 1. Input data Ω,f,... 2. Build a mesh M of the domain Ω 3. Define the discrete space S 4. Assemble marix M and
More informationExploring unstructured Poisson solvers for FDS
Exploring unstructured Poisson solvers for FDS Dr. Susanne Kilian hhpberlin - Ingenieure für Brandschutz 10245 Berlin - Germany Agenda 1 Discretization of Poisson- Löser 2 Solvers for 3 Numerical Tests
More informationDune: Crete Introduction to the DUNE Software Library. Heraklion, January 16, Andreas Dedner,
Introduction to the DUNE Software Library Andreas Dedner, Heraklion, January 16, 2013 Department of Mathematics University of Warwick www.warwick.ac.uk/go/dune Outline Introduction to DUNE-FEM (Part 2)
More informationLecture 2 Unstructured Mesh Generation
Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a
More informationCHARMS: A Simple Framework for Adaptive Simulation SIGGRAPH Presented by Jose Guerra
CHARMS: A Simple Framework for Adaptive Simulation SIGGRAPH 2002 Eitan Grinspun Caltech Petr Krysl UCSD Peter Schröder Caltech Presented by Jose Guerra 1 Outline Background Motivation (Element vs. Basis
More informationPARALLEL DECOMPOSITION OF 100-MILLION DOF MESHES INTO HIERARCHICAL SUBDOMAINS
Technical Report of ADVENTURE Project ADV-99-1 (1999) PARALLEL DECOMPOSITION OF 100-MILLION DOF MESHES INTO HIERARCHICAL SUBDOMAINS Hiroyuki TAKUBO and Shinobu YOSHIMURA School of Engineering University
More informationDistributed Newest Vertex Bisection
Distributed Newest Vertex Bisection Martin Alkämper a, Robert Klöfkorn b a Institut für Angewandte Analysis und Numerische Simulation, Fachbereich Mathematik, Universität Stuttgart, Pfaffenwaldring 57,
More informationAdaptive boundary element methods in industrial applications
Adaptive boundary element methods in industrial applications Günther Of, Olaf Steinbach, Wolfgang Wendland Adaptive Fast Boundary Element Methods in Industrial Applications, Hirschegg, September 30th,
More informationCOMPUTER AIDED ENGINEERING. Part-1
COMPUTER AIDED ENGINEERING Course no. 7962 Finite Element Modelling and Simulation Finite Element Modelling and Simulation Part-1 Modeling & Simulation System A system exists and operates in time and space.
More informationFinite Element Implementation
Chapter 8 Finite Element Implementation 8.1 Elements Elements andconditions are the main extension points of Kratos. New formulations can be introduced into Kratos by implementing a new Element and its
More informationFinite element algorithm with adaptive quadtree-octree mesh refinement
ANZIAM J. 46 (E) ppc15 C28, 2005 C15 Finite element algorithm with adaptive quadtree-octree mesh refinement G. P. Nikishkov (Received 18 October 2004; revised 24 January 2005) Abstract Certain difficulties
More informationResearch Article Parallel Adaptive Mesh Refinement Combined with Additive Multigrid for the Efficient Solution of the Poisson Equation
International Scholarly Research Network ISRN Applied Mathematics Volume 2012, Article ID 246491, 24 pages doi:10.5402/2012/246491 Research Article Parallel Adaptive Mesh Refinement Combined with Additive
More informationA Hash Data Structure for Adaptive PDE Solvers Based on Discontinuous Galerkin Discretizations
A Hash Data Structure for Adaptive PDE Solvers Based on Discontinuous Galerkin Discretizations Kolja Brix, Ralf Massjung, and Alexander Voß Bericht Nr. 302 Juli 2009 Key words: Discontinuous Galerkin method,
More informationModule 3 Mesh Generation
Module 3 Mesh Generation 1 Lecture 3.1 Introduction 2 Mesh Generation Strategy Mesh generation is an important pre-processing step in CFD of turbomachinery, quite analogous to the development of solid
More informationIntroduction to Multigrid and its Parallelization
Introduction to Multigrid and its Parallelization! Thomas D. Economon Lecture 14a May 28, 2014 Announcements 2 HW 1 & 2 have been returned. Any questions? Final projects are due June 11, 5 pm. If you are
More informationRobustness improvement of polyhedral mesh method for airbag deployment simulations. TU Delft
Robustness improvement of polyhedral mesh method for airbag deployment simulations. TU Delft Santiago Alagon Carrillo, Numerical Analysis Daily Supervisor: Prof. dr. ir. C. Vuik, Company Supervisor: Ir.
More informationPARALLEL MULTILEVEL TETRAHEDRAL GRID REFINEMENT
PARALLEL MULTILEVEL TETRAHEDRAL GRID REFINEMENT SVEN GROSS AND ARNOLD REUSKEN Abstract. In this paper we analyze a parallel version of a multilevel red/green local refinement algorithm for tetrahedral
More informationHFSS Ansys ANSYS, Inc. All rights reserved. 1 ANSYS, Inc. Proprietary
HFSS 12.0 Ansys 2009 ANSYS, Inc. All rights reserved. 1 ANSYS, Inc. Proprietary Comparison of HFSS 11 and HFSS 12 for JSF Antenna Model UHF blade antenna on Joint Strike Fighter Inherent improvements in
More informationHigher Order Adaptive and Parallel Simulations Including Dynamic Load Balancing with the Software Package DUNE
Higher Order Adaptive and Parallel Simulations Including Dynamic Load Balancing with the Software Package DUNE Andreas Dedner 1, Robert Klöfkorn 2, and Dietmar Kröner 3 1 Abteilung für Angewandte Mathematik,
More informationDendro: Parallel algorithms for multigrid and AMR methods on 2:1 balanced octrees
Dendro: Parallel algorithms for multigrid and AMR methods on 2:1 balanced octrees Rahul S. Sampath, Santi S. Adavani, Hari Sundar, Ilya Lashuk, and George Biros University of Pennsylvania Abstract In this
More informationOutline. follows the structure of the report
Outline follows the structure of the report Introduction Mesh-based Modeling of Cuts Finite Element Simulation for Virtual Cutting Numerical Solvers Meshfree Methods Summary & Application Study Discussion
More informationOn Multi-Mesh H-Adaptive Methods
Journal of Scientific Computing, Vol. 24, No. 3, September 25 ( 25) DOI: 1.17/s1915-4-4793-5 On Multi-Mesh H-Adaptive Methods Ruo Li 1 Received January 29, 24; accepted (in revised form) March 3, 24 Solutions
More informationNon-recursive traversal routines:
Non-recursive traversal routines: The implementation of the non-recursive traversal routines uses a stack to save the tree path from a macro element to the current one. The data structure typedef struct
More informationAndy Haines, Applications Engineer - Principal Siemens PLM Software
Efficient Modification of Mesh-Centric Finite Element Models with Femap Simcenter User Connection Tuesday, May 09, 2017/2:30 PM-3:15 PM Andy Haines, Applications Engineer - Principal Brought to you by:
More informationTrees. Carlos Moreno uwaterloo.ca EIT https://ece.uwaterloo.ca/~cmoreno/ece250
Carlos Moreno cmoreno @ uwaterloo.ca EIT-4103 https://ece.uwaterloo.ca/~cmoreno/ece250 Today's class: We'll discuss one possible implementation for trees (the general type of trees) We'll look at tree
More informationContents. I The Basic Framework for Stationary Problems 1
page v Preface xiii I The Basic Framework for Stationary Problems 1 1 Some model PDEs 3 1.1 Laplace s equation; elliptic BVPs... 3 1.1.1 Physical experiments modeled by Laplace s equation... 5 1.2 Other
More informationParallel FEM Computation and Multilevel Graph Partitioning Xing Cai
Parallel FEM Computation and Multilevel Graph Partitioning Xing Cai Simula Research Laboratory Overview Parallel FEM computation how? Graph partitioning why? The multilevel approach to GP A numerical example
More informationMeshes. Mesh elements
Meshes polygonal soup polygons specified one-by-one with no explicit information on shared vertices polygonal nonmanifold connectivity information is provided (which vertices are shared) no restrictions
More informationEffective adaptation of hexahedral mesh using local refinement and error estimation
Key Engineering Materials Vols. 243-244 (2003) pp. 27-32 online at http://www.scientific.net (2003) Trans Tech Publications, Switzerland Online Citation available & since 2003/07/15 Copyright (to be inserted
More informationNetgen/NGSolve Tutorial Part 3 - Programming with Netgen/NGSolve
Netgen/NGSolve Tutorial Part 3 - Programming with Netgen/NGSolve Christoph Lehrenfeld March 24, 2015 Contents 1 Introduction 1 2 Some NGSolve basic s 2 3 my_little_ngsolve 6 4 Numerical procedures 12 5
More informationNetgen/NGSolve Tutorial Part 3 - Programming with Netgen/NGSolve
Netgen/NGSolve Tutorial Part 3 - Programming with Netgen/NGSolve March 24, 2015 Outline Introduction Some NGSolve basic s my_little_ngsolve Numerical procedures Files and Tasks Overview Aim of tutorial
More informationParallelizing Adaptive Triangular Grids with Refinement Trees and Space Filling Curves
Parallelizing Adaptive Triangular Grids with Refinement Trees and Space Filling Curves Daniel Butnaru butnaru@in.tum.de Advisor: Michael Bader bader@in.tum.de JASS 08 Computational Science and Engineering
More informationMemory Efficient Adaptive Mesh Generation and Implementation of Multigrid Algorithms Using Sierpinski Curves
Memory Efficient Adaptive Mesh Generation and Implementation of Multigrid Algorithms Using Sierpinski Curves Michael Bader TU München Stefanie Schraufstetter TU München Jörn Behrens AWI Bremerhaven Abstract
More informationTowards a complete FEM-based simulation toolkit on GPUs: Geometric Multigrid solvers
Towards a complete FEM-based simulation toolkit on GPUs: Geometric Multigrid solvers Markus Geveler, Dirk Ribbrock, Dominik Göddeke, Peter Zajac, Stefan Turek Institut für Angewandte Mathematik TU Dortmund,
More informationADAPTIVE FINITE ELEMENT
Finite Element Methods In Linear Structural Mechanics Univ. Prof. Dr. Techn. G. MESCHKE SHORT PRESENTATION IN ADAPTIVE FINITE ELEMENT Abdullah ALSAHLY By Shorash MIRO Computational Engineering Ruhr Universität
More information1.2 Numerical Solutions of Flow Problems
1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian
More informationEfficient Finite Element Geometric Multigrid Solvers for Unstructured Grids on GPUs
Efficient Finite Element Geometric Multigrid Solvers for Unstructured Grids on GPUs Markus Geveler, Dirk Ribbrock, Dominik Göddeke, Peter Zajac, Stefan Turek Institut für Angewandte Mathematik TU Dortmund,
More informationSolids as point set. Solid models. Solid representation schemes (cont d) Solid representation schemes. Solid representation schemes (cont d)
Solid models Solid models developed to address limitations of wireframe modeling. Attempt was to create systems which create only complete representations. Modelers would support direct creation of 3D
More informationAdaptive Isogeometric Analysis by Local h-refinement with T-splines
Adaptive Isogeometric Analysis by Local h-refinement with T-splines Michael Dörfel 1, Bert Jüttler 2, Bernd Simeon 1 1 TU Munich, Germany 2 JKU Linz, Austria SIMAI, Minisymposium M13 Outline Preliminaries:
More informationEfficient Imaging Algorithms on Many-Core Platforms
Efficient Imaging Algorithms on Many-Core Platforms H. Köstler Dagstuhl, 22.11.2011 Contents Imaging Applications HDR Compression performance of PDE-based models Image Denoising performance of patch-based
More informationGeneric Components for Petascale Adaptive Unstructured Mesh Based Simulations
Engineering with Computers manuscript No. (will be inserted by the editor) Generic Components for Petascale Adaptive Unstructured Mesh Based Simulations Ting Xie Seegyoung Seol Mark S. Shephard Received:
More informationModeling Unsteady Compressible Flow
Tutorial 4. Modeling Unsteady Compressible Flow Introduction In this tutorial, FLUENT s density-based implicit solver is used to predict the timedependent flow through a two-dimensional nozzle. As an initial
More informationContents. F10: Parallel Sparse Matrix Computations. Parallel algorithms for sparse systems Ax = b. Discretized domain a metal sheet
Contents 2 F10: Parallel Sparse Matrix Computations Figures mainly from Kumar et. al. Introduction to Parallel Computing, 1st ed Chap. 11 Bo Kågström et al (RG, EE, MR) 2011-05-10 Sparse matrices and storage
More informationA MATLAB PACKAGE OF ADAPTIVE FINITE ELEMENT METHODS CONTENTS
AFEM@MATLAB: A MATLAB PACKAGE OF ADAPTIVE FINITE ELEMENT METHODS LONG CHEN AND CHEN-SONG ZHANG CONTENTS 1. Introduction 2 1.1. Main features 2 1.2. Importance of AFEM@matlab 2 2. Examples 3 2.1. Crack
More informationAccelerating Double Precision FEM Simulations with GPUs
In Proceedings of ASIM 2005-18th Symposium on Simulation Technique, Sept. 2005. Accelerating Double Precision FEM Simulations with GPUs Dominik Göddeke dominik.goeddeke@math.uni-dortmund.de Universität
More informationElastic Stability of a Plate
WORKSHOP PROBLEM 7 Elastic Stability of a Plate Objectives Produce a Nastran input file. Submit the file for analysis in MSC/NASTRAN. Find the first five natural modes of the plate. MSC/NASTRAN 101 Exercise
More informationPlanar union of rectangles with sides parallel to the coordinate axis
6 th International Conference on Applied Informatics Eger, Hungary, January 27 31, 2004. Planar union of rectangles with sides parallel to the coordinate axis Daniel Schmid, Hanspeter Bopp Department of
More informationAssignment 1: grid. Due November 20, 11:59 PM Introduction
CS106L Fall 2008 Handout #19 November 5, 2008 Assignment 1: grid Due November 20, 11:59 PM Introduction The STL container classes encompass a wide selection of associative and sequence containers. However,
More informationMesh refinement in FE-micromagnetics for multi-domain Nd 2 Fe 14 B particles
Version 3.0 98-09-11 Mesh refinement in FE-micromagnetics for multi-domain Nd 2 Fe 14 B particles W. Scholz, T. Schrefl, J. Fidler Institute of Applied and Technical Physics, Vienna University of Technology,
More informationParallel solution of Turek & Hron s FSI benchmark problem with spatial adaptivity for the fluid and solid meshes
Chapter 1 Parallel solution of Turek & Hron s FSI benchmark problem with spatial adaptivity for the fluid and solid meshes This document provides an overview of how to change the serial driver code for
More informationp=2 p=3 p=4 hierarchy. p hierarchy full h p hierarchy
h p MULTIRESOLUTION VISUALIZATION OF ADAPTIVE FINITE ELEMENT SIMULATIONS BERNARD HAASDONK, MARIO OHLBERGER, MARTIN RUMPF, ALFRED SCHMIDT, AND KUNIBERT G. SIEBERT Abstract. We propose an appropriate and
More informationResilient geometric finite-element multigrid algorithms using minimised checkpointing
Resilient geometric finite-element multigrid algorithms using minimised checkpointing Dominik Göddeke, Mirco Altenbernd, Dirk Ribbrock Institut für Angewandte Mathematik (LS3) Fakultät für Mathematik TU
More informationControl Volume Finite Difference On Adaptive Meshes
Control Volume Finite Difference On Adaptive Meshes Sanjay Kumar Khattri, Gunnar E. Fladmark, Helge K. Dahle Department of Mathematics, University Bergen, Norway. sanjay@mi.uib.no Summary. In this work
More informationDemo problem: Solution of a "free-boundary" Poisson problem in an "elastic" domain revisited -- this time with AlgebraicElements
Chapter 1 Demo problem: Solution of a "free-boundary" Poisson problem in an "elastic" domain revisited -- this time with AlgebraicElements Detailed documentation to be written. Here s a plot of the result
More informationParallel High-Order Geometric Multigrid Methods on Adaptive Meshes for Highly Heterogeneous Nonlinear Stokes Flow Simulations of Earth s Mantle
ICES Student Forum The University of Texas at Austin, USA November 4, 204 Parallel High-Order Geometric Multigrid Methods on Adaptive Meshes for Highly Heterogeneous Nonlinear Stokes Flow Simulations of
More information= β + u + n β u n = q 1,
ADAPTIVE MESH REFINEMENT AND SUPERCONVERGENCE FOR TWO DIMENSIONAL INTERFACE PROBLEMS HUAYI WEI, LONG CHEN, YUNQING HUANG, AND BIN ZHENG Abstract. Adaptive mesh refinement and the Börgers algorithm are
More informationParallel Adaptive Tsunami Modelling with Triangular Discontinuous Galerkin Schemes
Parallel Adaptive Tsunami Modelling with Triangular Discontinuous Galerkin Schemes Stefan Vater 1 Kaveh Rahnema 2 Jörn Behrens 1 Michael Bader 2 1 Universität Hamburg 2014 PDES Workshop 2 TU München Partial
More informationTutorial 1. Introduction to Using FLUENT: Fluid Flow and Heat Transfer in a Mixing Elbow
Tutorial 1. Introduction to Using FLUENT: Fluid Flow and Heat Transfer in a Mixing Elbow Introduction This tutorial illustrates the setup and solution of the two-dimensional turbulent fluid flow and heat
More informationA PARALLEL GEOMETRIC MULTIGRID METHOD FOR FINITE ELEMENTS ON OCTREE MESHES
A PARALLEL GEOMETRIC MULTIGRID METHOD FOR FINITE ELEMENTS ON OCTREE MESHES RAHUL S. SAMPATH AND GEORGE BIROS Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic
More informationGenerative Part Structural Analysis Fundamentals
CATIA V5 Training Foils Generative Part Structural Analysis Fundamentals Version 5 Release 19 September 2008 EDU_CAT_EN_GPF_FI_V5R19 About this course Objectives of the course Upon completion of this course
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationFast Dynamic Load Balancing for Extreme Scale Systems
Fast Dynamic Load Balancing for Extreme Scale Systems Cameron W. Smith, Gerrett Diamond, M.S. Shephard Computation Research Center (SCOREC) Rensselaer Polytechnic Institute Outline: n Some comments on
More informationTop Math Summer School on Adaptive Finite Elements: Analysis and Implementation Organized by: Kunibert G. Siebert
Top Math Summer School on Adaptive Finite Elements: Analysis and Implementation Organized by: Kunibert G. Siebert Instituto de Matemática Aplicada del Litoral Universidad Nacional del Litoral Santa Fe
More informationGeometric Modeling Based on Polygonal Meshes: OpenMesh
Geometric Modeling Based on Polygonal Meshes: OpenMesh Prof. Dr. Mario Botsch Computer Graphics & Geometry Processing 2 OpenMesh 1.1.0 Developed at RWTH Aachen C++ library for polygonal / triangle meshes
More informationAUTOMATED ADAPTIVE ERROR CONTROL IN FINITE ELEMENT METHODS USING THE ERROR REPRESENTATION AS ERROR INDICATOR
AUTOMATED ADAPTIVE ERROR CONTROL IN FINITE ELEMENT METHODS USING THE ERROR REPRESENTATION AS ERROR INDICATOR JOHAN JANSSON, JOHAN HOFFMAN, CEM DEGIRMENCI, JEANNETTE SPÜHLER Abstract. In this paper we present
More informationRecent developments for the multigrid scheme of the DLR TAU-Code
www.dlr.de Chart 1 > 21st NIA CFD Seminar > Axel Schwöppe Recent development s for the multigrid scheme of the DLR TAU-Code > Apr 11, 2013 Recent developments for the multigrid scheme of the DLR TAU-Code
More informationA generic grid interface for parallel and adaptive scientific computing. Part II: implementation and tests in DUNE
A generic grid interface for parallel and adaptive scientific computing. Part II: implementation and tests in DUNE P. Bastian 1 M. Blatt 1 A. Dedner 2 C. Engwer 1 R. Klöfkorn 2 R. Kornhuber 4 M. Ohlberger
More informationExample problem: Unsteady flow in a 2D channel, driven by an applied traction
Chapter 1 Example problem: Unsteady flow in a 2D channel, driven by an applied traction In this example we consider a variation of the unsteady 2D channel flow problem considered elsewhere. In the previous
More informationSolve Estimate Mark Refine. (1.2)
EFFICIENCY BASED ADAPTIVE LOCAL REFINEMENT FOR FIRST-ORDER SYSTEM LEAST-SQUARES FORMULATIONS J. H. ADLER, T. A. MANTEUFFEL, S. F. MCCORMICK, J. W. NOLTING, J. W. RUGE, AND L. TANG Abstract. In this paper,
More informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationFLUENT Secondary flow in a teacup Author: John M. Cimbala, Penn State University Latest revision: 26 January 2016
FLUENT Secondary flow in a teacup Author: John M. Cimbala, Penn State University Latest revision: 26 January 2016 Note: These instructions are based on an older version of FLUENT, and some of the instructions
More informationPorePy: A Python Simulation Tool for Fractured and Deformable Porous Media. Eirik Keilegavlen, Alessio Fumagalli, Runar Berge, Ivar Stefansson
PorePy: A Python Simulation Tool for Fractured and Deformable Porous Media Eirik Keilegavlen, Alessio Fumagalli, Runar Berge, Ivar Stefansson Summary Meshing and discretization of dynamics in fractured
More informationCHAPTER 8 FINITE ELEMENT ANALYSIS
If you have any questions about this tutorial, feel free to contact Wenjin Tao (w.tao@mst.edu). CHAPTER 8 FINITE ELEMENT ANALYSIS Finite Element Analysis (FEA) is a practical application of the Finite
More informationEFFICIENT MATRIX-FREE IMPLEMENTATION OF DISCONTINUOUS GALERKIN METHODS FOR COMPRESSIBLE FLOW PROBLEMS
Proceedings of ALGORITMY 2012 pp. 11 21 EFFICIENT MATRIX-FREE IMPLEMENTATION OF DISCONTINUOUS GALERKIN METHODS FOR COMPRESSIBLE FLOW PROBLEMS ROBERT KLÖFKORN Abstract. We discuss the matrix-free implementation
More informationHigh Performance Computing: Tools and Applications
High Performance Computing: Tools and Applications Edmond Chow School of Computational Science and Engineering Georgia Institute of Technology Lecture 15 Numerically solve a 2D boundary value problem Example:
More informationJune 5, Institute of Structural Analysis Graz University of Technology Lessingstr. 25/II, 8010 Graz, Austria
Higher-order meshing of implicit geometries part I: Integration and interpolation in cut elements arxiv:706.00578v [cs.na] 2 Jun 207 T.P. Fries, S. Omerović, D. Schöllhammer, J. Steidl June 5, 207 Institute
More informationStructured Grid Generation for Turbo Machinery Applications using Topology Templates
Structured Grid Generation for Turbo Machinery Applications using Topology Templates January 13th 2011 Martin Spel martin.spel@rtech.fr page 1 Agenda: R.Tech activities Grid Generation Techniques Structured
More informationUsing GIS for hierarchial refinement of MODFLOW models
HydroGÏS 96: Application of Geographic Information Systems in Hydrology and Water Resources Management (Proceedings of the Vienna Conference, April 1996). IAHS Publ. no. 235, 1996. 535 Using GIS for hierarchial
More informationDesign Intent of Geometric Models
School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Massey University 22nd September 2004; Version 1.0 Design Intent
More information