DOCSLIB.ORG

P0 Raviart-Thomas Finite Element Implementation Of

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
P0 Raviart-Thomas Finite Element Implementation Of 1 Jurnal Matematika Integratif. p-ISSN:1412-6184, e-ISSN:2549-903 2 Vol. xx, No. xx (20xx), pp. xx{xx. doi:10.24198/jmi.vxx.ny.xxxx.y-yy 3 A mixed RT0 − P0 Raviart-Thomas finite element implementation of 4 Darcy Equation in GNU Octave 1 1;y 5 Agah D. Garnadi , C. Bahriawati 1 6 Jurusan Matematika, Fakultas MIPA, Institut Pertanian Bogor, Indonesia, e-mail: 7 [email protected] 8 Abstrak In this paper we shall describe mixed formulations -differential and variational- of Darcys flow equation, an important model of elliptic problem. We describe * 9 Galerkin method with finite dimensional spaces; * Local matrices and assembling; * Raviart-Thomas RT0 − P0 elements; * Edge basis and local matrices for RT0 − P0 FEM; * Model problem with corresponding local matrices, right hand side and treatment of boundary conditions. A simple demo written in GNU Octave is given. Kata kunci: Persamaan Darcy, Aliran di bahan berpori, Flux, Kekekalan Local, 10 Metode Elemen Hingga Campuran Abstract In this paper we shall describe mixed formulations -differential and variational- of Darcys flow equation, an important model of elliptic problem. We describe * 11 Galerkin method with finite dimensional spaces; * Local matrices and assembling; * Raviart-Thomas RT0 − P0 elements; * Edge basis and local matrices for RT0 − P0 FEM; * Model problem with corresponding local matrices, right hand side and treatment of boundary conditions. A simple demo written in GNU Octave is given. Keywords: Darcy flow, Flow in porous media, Flux, Local conservation, Mixed finite 12 element methods 13 Contents 14 1 Introduction 1 15 2 Problem formulation 1 16 3 Galerkin method -Mixed FEM 2 17 4 Local matrices and assembling 3 18 5 Lowest order Raviart-Thomas finite elements 3 19 6 Local properties and local edge basis for RT(0) elements 4 20 7 Local matrices 5 21 8 Model problem 7 22 9 Assembling 9 23 1. Introduction 24 This report describes basis of RT1 code, which can be characterized as a code for test- 25 ing solvers and preconditioners for FEM systems arising from lowest order Raviart-Thomas 26 discretization of Darcy flow problems, see also [2] [1] 2000 Mathematics Subject Classification: 65N15; 65M30 Received: dd-03-2020, accepted: dd-mm-yyyy. 1 2Garnadi & Bahriawati, JMI Vol x No y Okt/Apr 2020, pp. xx-yy,doi:10.24198/jmi.vxx.ny.xxxx.y-yy 27 The code is characterized by simplicity and possibility of easy modifications, 28 • directly solving model problems on square domains (generalization possible), 29 • stochastic generation of heterogeneity, 30 • fast system assembling using vectorization and sparse reconstruction, 31 • possible testing of Krylov type solvers with both (block) matrix and matrix free (vari- 32 able) preconditioners. 33 This report describes the finite element system generation, experiments are involved in 34 papers, e.g. [3]. 35 2. Problem formulation 36 Let us consider Darcy flow elliptic problem in the form −div(k(−g + grad p) = f in Ω p =p ^ on ΓD (−k grad p) · n =u ^ on ΓN 37 where g 6= 0 if we consider elevation changes. It can be also written in a two field form 1 n 38 with two basic variables p :Ω ! R and u :Ω ! R ; k−1u + grad p = g in Ω div(u) = f 39 p =p ^ on ΓD (−k grad p) · n =u ^ on ΓN 40 The variational formulation uses test functions v and q to get R k−1u · vdx + R rp · vdx = R g · vdx RΩ Ω RΩ Ω div(u)q = Ω fqdx 41 Transformation of one mixed term then provides R R P @p P R R @vk rp · v = vkdx = f pvk · nk − p dxg Ω RΩ k @xk R k @Ω Ω @xk = @Ω p(v · n) − Ω pdiv(v)dx 42 Then the variational formulation gets the form R k−1u · v − R div(v) · p = R g · vdx − R p^(v · n) − R p(v · n) 8v RΩ Ω RΩ ΓD ΓN Ω div(u)q = Ω fq 8q 43 {or in abstract form: find (u; p) 2 UN × P m(u; v) + b(v; p) = G(v) 8v 2 U0 b(u; q) = F (v) 8q 2 P 44 where n U = fv 2 L2(Ω) : div(v) 2 L2(Ω)g ! H(div) U0 = fv 2 U : v · n = 0 on ΓN g UN = fv 2 U : v · n =u ^ on ΓN g P = fq 2 L2(Ω)g R 45 Note that pressure BC enters G(v) = ::: − p^(v · n) whereas velocity BC are included Γ0 46 in UN : Darcy - Raviart-Thomas Element 3 47 3. Galerkin method -Mixed FEM 48 We start with introducing FEM spaces Uh ⊂ U; UNh ⊂ UN ;U0h ⊂ U0 and Ph ⊂ P: 49 Then the Galerkin method is to find (uh; ph) ⊂ UhN × Ph m(uh; vh) + b(vh; ph) = G(vh) 8vh 2 U0h b(uh; qh) = F (qh) 8ph 2 Ph 50 After a choice of bases Uh = linfΦi; i 2 Ig;Ph = linfΨj : j 2 Jg UNh = uN + u; u 2 U0h U0h = linfΦi : i 2 I0g X uN 2 linfΦi : i 2 InI0g; uN = (^u · n)(xi)Φi 51 the discrete mixed problem can be written as -find (uh; ph) 2 UhN × Ph; uh = uN + P P 52 α Φ ; p = β Ψ i2I0 i i h j2J j j P α m(Φ ; Φ ) + P β b(Φ ; Ψ ) = G(Φ ) − m(u ; Φ ) 8k 2 I i2I0 i i k j2J j k j k N k 0 P α b(Φ ; Ψ ) = F (Ψ ) − b(u ; Ψ ) 8l 2 J i2I0 i i l l N l 53 Rewriting to matrix form provides T n1 Bα + B β = G; α 2 R ; n1 = #I0 n2 Bα = F; β 2 R ; n2 = #J n1×n1 n2×n1 T n1×n2 T 54 where M 2 R ;Mij = m(Φj; Φi);B 2 R ;Bij = b(Φj; Ψi);B 2 R ;Bij = 55 b(Φi; Ψj) = Bji;G = (Gi);Gi = G(Φi);F = (Fk);Fk = F (Ψk): 56 4. Lowest order Raviart-Thomas finite elements 2 57 Let Ω 2 R be a 2D polygonal domain, Th be its triangulation, Eh be set of edges of all 58 elements T 2 Th see the situation in the following Figure 1. 59 Then, we can define 2 T T RT0(T ) = fv : T ! R ; v(x) = ξ[x1 x2] + [η1 η2] ; ξ; η1; η2 2 Rg 60 2 Uh = fv :Ω 2 R ; vjT 2 RT0(T ) 8T 2 Th; v · nE is continuous over E 2 Ehg 1 Ph = fq :Ω 2 R ; qjT is constant 8T 2 Thg: 61 Continuity of ν · nE guarantees Uh 2 U; Ph 2 P is obvious. Note that 8E 2 Eh we define 62 nE (unit normal vector), independently of relation to triangles and consequently in possibly 63 inner or outer direction, see Figure 2. 64 6 Local properties and local edge basis for RT(0) elements 65 Lemma 4.1. Let T 2 Th; v 2 RT0(T ): Then 8E 2 Eh [ @T : v · njE = const. ∗ 66 Proof. Let E 2 Eh [ @T; nE be normal to E (can be either outer or inner to T ), x 2 E be 67 arbitrary point at E: Then ∗ ∗ ∗ x 2 E ) (x − x ) · nE = 0; nE = (n1; n2) ) x1n1 + x2n2 = x1n1 + x2n2 = const: ) 68 ∗ ∗ v(x) · n = ξx1n1 + ξx2n2 + η1n1 + η2n2 = ξ(x1n1 + x2n2) + η1n1 + η2n2 = const : 69 4Garnadi & Bahriawati, JMI Vol x No y Okt/Apr 2020, pp. xx-yy,doi:10.24198/jmi.vxx.ny.xxxx.y-yy (i) (j) Gambar 1. fx g set of centres of Ei 2 Eh; fy g barycentres of Tj 2 Th Gambar 2. Prescribed normal nE: Possible definition of nE;E 2 Eh: Gambar 3. Triangle T 2 Th: Darcy - Raviart-Thomas Element 5 70 Lemma 4.2. (Expression for local basis functions.) Let E Φ (x) = σ i (x − P ); σ = n n(i); i i 2jT j i i Ei (i) 71 where nEi are global prescribed normals and n are outer normals for T 2 Th; see Figure 72 3. Then 73 (i)Φ j(x) · nEi = δij; 74 (ii)Φ i 2 RT0(T ); 75 (iii)Φ 1; Φ2; Φ3 create a basis of RT0(T ); Ei 76 (iv) divΦi = σi jT j : 77 Proof. (i) If i 6= j; then Pi 2 Ej and (x − Pi) · nEj = 0 for x 2 Ej: If i = j then for 78 x 2 Ei the value (x − Pi) · nEi appears in the projection of (x − Pi) to the height of 1 79 T passing through Pi and therefore j(x − Pi) · nEi j = hi: Moreover, 2 hijEij = jT j and (i) 80 hi = 2jT j=jEij; (x − Pi) · n ≥ 0 -both vectors have outward direction w.r.t. T: Finally 2jT j (x − Pi) · nEi = σi jEij 81 (ii) obvious 3 82 P (iii) u 2 RT0(T ); w = u − 1(u · nEi )Φi: Obviously w · nEi = 08Ei: Therefore 8Pj : 83 w(Pj) · nEi = 0 and because 8Ei : Pj 2 Ei; it holds w(Pj) = 08j = 1; 2; 3: As w is 84 linear polynomial, w = 0: Proof of uniqueness: 3 X w = αiΦi = 0 ) wnEj = αjΦjnEj = αj = 08j: 1 85 (iv) obvious 86 87 5. Local matrices and assembling 88 Assume that Φi and Ψi are constructed as finite element basis functions above some 89 triangulation Th; i:e:T 2 Th ΦijT 2 fΦ1; :::; Φρ; 0 = Φ0g 90 ΨjjT 2 fΨ1; :::Ψs; 0 = Ψ0g: 91 Then R −1 m(Φi; Φk) = Ω k ΦiΦkdx = P R k−1Φ Φ dx T 2Th T i k = P R k−1Φ Φ dx T 2Th T loc(i) loc(k) R b(Φi; Ψj) = Ω(divΦi)Ψjdx = P R (divΦ )Ψ dx T 2Th T loc(i) loc(j) 92 where lock(i) = lock(i; T ) is a transformation from global index to local index of basis 93 function on T: It can be also zero.
Load more

Recommended publications
  • Arxiv:1911.09220V2 [Cs.MS] 13 Jul 2020
    MFEM: A MODULAR FINITE ELEMENT METHODS LIBRARY ROBERT ANDERSON, JULIAN ANDREJ, ANDREW BARKER, JAMIE BRAMWELL, JEAN- SYLVAIN CAMIER, JAKUB CERVENY, VESELIN DOBREV, YOHANN DUDOUIT, AARON FISHER, TZANIO KOLEV, WILL PAZNER, MARK STOWELL, VLADIMIR TOMOV Lawrence Livermore National Laboratory, Livermore, USA IDO AKKERMAN Delft University of Technology, Netherlands JOHANN DAHM IBM Research { Almaden, Almaden, USA DAVID MEDINA Occalytics, LLC, Houston, USA STEFANO ZAMPINI King Abdullah University of Science and Technology, Thuwal, Saudi Arabia Abstract. MFEM is an open-source, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of dis- cretization approaches and emphasis on usability, portability, and high-performance computing efficiency. MFEM's goal is to provide application scientists with access to cutting-edge algorithms for high-order finite element mesh- ing, discretizations and linear solvers, while enabling researchers to quickly and easily develop and test new algorithms in very general, fully unstructured, high-order, parallel and GPU-accelerated settings. In this paper we describe the underlying algorithms and finite element abstractions provided by MFEM, discuss the software implementation, and illustrate various applications of the library. arXiv:1911.09220v2 [cs.MS] 13 Jul 2020 1. Introduction The Finite Element Method (FEM) is a powerful discretization technique that uses general unstructured grids to approximate the solutions of many partial differential equations (PDEs). It has been exhaustively studied, both theoretically and in practice, in the past several decades [1, 2, 3, 4, 5, 6, 7, 8]. MFEM is an open-source, lightweight, modular and scalable software library for finite elements, featuring arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and high-performance computing (HPC) efficiency [9].
    [Show full text]
  • MFEM: a Modular Finite Element Methods Library
    MFEM: A Modular Finite Element Methods Library Robert Anderson1, Andrew Barker1, Jamie Bramwell1, Jakub Cerveny2, Johann Dahm3, Veselin Dobrev1,YohannDudouit1, Aaron Fisher1,TzanioKolev1,MarkStowell1,and Vladimir Tomov1 1Lawrence Livermore National Laboratory 2University of West Bohemia 3IBM Research July 2, 2018 Abstract MFEM is a free, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and high-performance computing efficiency. Its mission is to provide application scientists with access to cutting-edge algorithms for high-order finite element meshing, discretizations and linear solvers. MFEM also enables researchers to quickly and easily develop and test new algorithms in very general, fully unstructured, high-order, parallel settings. In this paper we describe the underlying algorithms and finite element abstractions provided by MFEM, discuss the software implementation, and illustrate various applications of the library. Contents 1 Introduction 3 2 Overview of the Finite Element Method 4 3Meshes 9 3.1 Conforming Meshes . 10 3.2 Non-Conforming Meshes . 11 3.3 NURBS Meshes . 12 3.4 Parallel Meshes . 12 3.5 Supported Input and Output Formats . 13 1 4 Finite Element Spaces 13 4.1 FiniteElements....................................... 14 4.2 DiscretedeRhamComplex ................................ 16 4.3 High-OrderSpaces ..................................... 17 4.4 Visualization . 18 5 Finite Element Operators 18 5.1 DiscretizationMethods................................... 18 5.2 FiniteElementLinearSystems . 19 5.3 Operator Decomposition . 23 5.4 High-Order Partial Assembly . 25 6 High-Performance Computing 27 6.1 Parallel Meshes, Spaces, and Operators . 27 6.2 Scalable Linear Solvers .
    [Show full text]
  • FELICITY: a MATLAB/C++ TOOLBOX for DEVELOPING FINITE ELEMENT METHODS and SIMULATION MODELING\Ast
    SIAM J. SCI.COMPUT. \bigcircc 2018 Society for Industrial and Applied Mathematics Vol. 40, No. 2, pp. C234{C257 FELICITY: A MATLAB/C++ TOOLBOX FOR DEVELOPING FINITE ELEMENT METHODS AND SIMULATION MODELING\ast SHAWN W. WALKERy Abstract. This paper describes a MATLAB/C++ finite element toolbox, called FELICITY, for simulating various types of systems of partial differential equations (e.g., coupled elliptic/parabolic problems) using the finite element method. It uses MATLAB in an object-oriented way for high-level manipulation of data structures in finite element codes, while utilizing a domain-specific language (DSL) and code generation to automate low-level tasks such as matrix assembly (via the MATLAB mex interface). We describe the fundamental functionality of the toolbox's MATLAB interface, such as using higher order Lagrange (simplicial) meshes, defining finite element spaces, allocating degrees- of-freedom, assembling discrete bilinear and linear forms, and interpolation over meshes. Moreover, we describe in-depth how automatic code generation is implemented in FELICITY. Two example problems and their implementation are provided to demonstrate the ability of FELICITY to solve coupled problems with interacting subdomains of different co-dimension. Future improvements are also discussed. Key words. finite elements, coupled systems, geometric flows, code generation, MATLAB, open source software AMS subject \bfc \bfl \bfa \bfs \bfifi\bfc\bfa\bft\bfo\bfn. 68N30, 65N30, 65M60, 68N19, 68N20 DOI. 10.1137/17M1128745 1. Introduction. The development of numerical methods to solve partial dif- ferential equations (PDEs) continues to advance to address new domain areas and problems of increasing complexity. With this, the number of software packages has increased to address the needs for researching new methods and simulating large prob- lems.
    [Show full text]
  • Mofem: an Open Source, Parallel Finite Element Library
    MoFEM: An open source, parallel finite element library Kaczmarczyk, Ł., Ullah, Z., Lewandowski, K., Meng, X., Zhou, X-Y., Athanasiadis, I., Nguyen, H., Chalons- Mouriesse, C-A., Richardson, E. J., Miur, E., Shvarts, A. G., Wakeni, M., & Pearce, C. J. (2020). MoFEM: An open source, parallel finite element library. The Journal of Open Source Software, 5(45). https://doi.org/doi.org/10.21105/joss.01441 Published in: The Journal of Open Source Software Document Version: Publisher's PDF, also known as Version of record Queen's University Belfast - Research Portal: Link to publication record in Queen's University Belfast Research Portal Publisher rights © 2020 The Authors. This is an open access article published under a Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium, provided the author and source are cited. General rights Copyright for the publications made accessible via the Queen's University Belfast Research Portal is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The Research Portal is Queen's institutional repository that provides access to Queen's research output. Every effort has been made to ensure that content in the Research Portal does not infringe any person's rights, or applicable UK laws. If you discover content in the Research Portal that you believe breaches copyright or violates any law, please contact [email protected]. Download date:06.
    [Show full text]
  • Overview of Research in the Scidac Center for Simulation of Fusion Relevant RF Actuators P
    Overview of Research in the SciDAC Center for Simulation of Fusion Relevant RF Actuators P. T. Bonoli and D. L. Green on behalf of the RF-SciDAC Team 60th Annual Meeting of the APS Division of Plasma Physics November 5–9, 2018 Portland, Oregon Poster BP11.00071 RF-SciDAC : Center for Simulation of Fusion Relevant RF Actuators http://rfscidac4.org Abstract An overview is given of research which has the goal of developing a predictive simulation capability of the self-consistent interaction of RF power with the scrape-off layer (SOL), including the effects of plasma sheaths, ponderomotive forces near an antenna, and turbulence and transport. This will make it possible to answer critical questions related to how RF power modifies properties of the SOL, and how, in turn, the SOL affects the propagation and absorption of RF waves. Targeted problems include the impact of high power RF systems on plasma facing materials, including high-Z impurity sputtering and transport induced by large RF-induced sheath potentials, localized thermal loads, and antenna damage. In order to address the high geometric fidelity required to describe the 3D magnetic field and 3D solid geometry of the RF launching structures and the surrounding vacuum vessel the open-source scalable Modular Finite Element Framework (MFEM) is being utilized. The Parallel Unstructured Mesh Infrastructure (PUMI) is also being used in order to move to global solution domains, which are presently precluded by existing meshing approaches. *Work supported by US DoE contract numbers DE-SC0018090, DE-SC0018319, DE- SC0018275, FWP 3ERAT952, FWP 2017-LLNL-SCW1619, and Work Proposal 3203.
    [Show full text]
  • Improved Support for Parallel Adaptive Simulation in CEED WBS 2.2.6.06, Milestone CEED-MS29
    ECP Milestone Report Improved Support for Parallel Adaptive Simulation in CEED WBS 2.2.6.06, Milestone CEED-MS29 Mark Shephard Valeria Barra Jed Brown Jean-Sylvain Camier Veselin Dobrev Yohan Dudouit Paul Fischer Tzanio Kolev David Medina Misun Min Cameron Smith Morteza H. Siboni Jeremy Thompson Tim Warburton July 12, 2019 DOCUMENT AVAILABILITY Reports produced after January 1, 1996, are generally available free via US Department of Energy (DOE) SciTech Connect. Website http://www.osti.gov/scitech/ Reports produced before January 1, 1996, may be purchased by members of the public from the following source: National Technical Information Service 5285 Port Royal Road Springfield, VA 22161 Telephone 703-605-6000 (1-800-553-6847) TDD 703-487-4639 Fax 703-605-6900 E-mail [email protected] Website http://www.ntis.gov/help/ordermethods.aspx Reports are available to DOE employees, DOE contractors, Energy Technology Data Exchange representatives, and International Nuclear Information System representatives from the following source: Office of Scientific and Technical Information PO Box 62 Oak Ridge, TN 37831 Telephone 865-576-8401 Fax 865-576-5728 E-mail [email protected] Website http://www.osti.gov/contact.html This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights.
    [Show full text]
  • Femengine: Finite Element Method C++ Code Based on Functional And
    2019 Ivannikov Ispras Open Conference (ISPRAS) FEMEngine: finite element method C++ code based on functional and template metaprogramming Alexey Gurin∗, Alexey Baykin∗, Timofey Polyansky‡, Anton Krivtsov§¶ ∗Laboratory of Digital and Intelligent Hydrocarbon Production Systems Lavrentyev’s Institute of Hydrodynamics of the SB RAS, Novosibirsk, Russia Email: [email protected] ‡Department of Physics Novosibirsk State University, Novosibirsk, Russia §Higher School of Theoretical Mechanics Peter the Great St. Petersburg Polytechnic University (SPbPU), St. Petersburg, Russia ¶Laboratory ”Discrete models in mechanics” Institute for Problems in Mechanical Engineering, St. Petersburg, Russia acheived by the metaprogramming technique. The FEniCS Abstract—The paper discusses the problems of a finite element method programming. Modern C++ functional programming and Form Compiler, written in Python as a part of the FEniCS template metaprogramming approach to finite element analysis Project, generates and compile an efficient C++ code for a is presented. This approach simplifies the implementation of matrix assembly on the fly. This form of metaprogramming is an effective assembly of the stiffness matrix for a problem universal, but very difficult to implement and maintain. defined by a weak form. This method is tested by a solution During the last decade, the C++ language has been of the Poisson equation on an unstructured 3D tetrahedral mesh using FEM C++ library FEMEngine developed by authors. The greatly improved. Three new standards are introduced: C++11, function which calculates the matrix is generated by higher order C++14, C++17. The ability to program in a functional functions during the compilation stage. The performance of the paradigm has been added and the template metaprogramming computation is analyzed by studying of a disassembled code and technique has been simplified.
    [Show full text]
  • Mathfest 2018
    Abstracts of Papers Presented at MathFest 2018 Denver, CO August 1 – 4, 2018 Published and Distributed by The Mathematical Association of America Contents Invited Addresses 1 Earle Raymond Hedrick Lecture Series by Gigliola Staffilani . 1 Nonlinear Dispersive Equations and the Beautiful Mathematics That Comes with Them Lecture 1: Thursday, August 2, 11:00–11:50 AM, Plaza Ballroom A, B, & C, Plaza Building Lecture 2: Friday, August 3, 10:30–11:20 AM, Plaza Ballroom A, B, & C, Plaza Building Lecture 3: Saturday, August 4, 10:00–10:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 AMS-MAA Joint Invited Address . 1 Gravity’s Action on Light: A Mathematical Journey by Arlie Petters Thursday, August 2, 10:00–10:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 MAA Invited Address . 1 Inclusion-exclusion in Mathematics: Who Stays in, Who Falls out, Why It Happens, and What We Should Do About It by Eugenia Cheng Friday, August 3, 11:30–12:20 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 Snow Business: Scientific Computing in the Movies and Beyond by Joseph Teran Saturday, August 4, 11:00–11:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 Mathematical Medicine: Modeling Disease and Treatment by Lisette de Pillis Thursday, August 2, 9:00–9:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 2 MAA James R.C. Leitzel Lecture . 2 The Relationship between Culture and the Learning of Mathematics by Talitha Washington Saturday, August 4, 9:00–9:50 AM, Plaza Ballroom A, B, & C, Plaza Building .
    [Show full text]
  • Libceed User Manual Release 0.9.0
    libCEED User Manual Release 0.9.0 Ahmad Abdelfattah Valeria Barra Natalie Beams Jed Brown Jean-Sylvain Camier Veselin Dobrev Yohann Dudouit Leila Ghaffari Tzanio Kolev David Medina Will Pazner Thilina Ratnayaka Jeremy L. Thompson Stan Tomov Oct 01, 2021 Contents 1 Introduction 4 2 Getting Started 6 2.1 Building ................................................. 6 2.2 Additional Language Interfaces .................................... 7 2.3 Testing .................................................. 7 2.4 Backends ................................................. 8 2.5 Examples ................................................. 9 2.6 Benchmarks ............................................... 11 2.7 Install ................................................... 11 2.7.1 pkg-config ............................................ 12 2.8 Contact .................................................. 12 2.9 How to Cite ............................................... 12 2.10 Copyright ................................................ 13 3 Interface Concepts 13 3.1 Theoretical Framework ......................................... 13 3.2 Finite Element Operator Decomposition ............................... 14 3.2.1 Terminology and Notation ................................... 15 3.2.2 Partial Assembly ........................................ 19 3.2.3 Parallel Decomposition .................................... 20 1 3.3 API Description ............................................. 20 3.4 Gallery of QFunctions ......................................... 26 3.5 Interface
    [Show full text]
  • The Diet Experience Eddy Caron
    Contribution to the management of large scale platforms: the Diet experience Eddy Caron To cite this version: Eddy Caron. Contribution to the management of large scale platforms: the Diet experience. Net- working and Internet Architecture [cs.NI]. Ecole normale supérieure de lyon - ENS LYON, 2010. tel-00629060 HAL Id: tel-00629060 https://tel.archives-ouvertes.fr/tel-00629060 Submitted on 5 Oct 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. HABILITATION A DIRIGER DES RECHERCHES présentée par Eddy Caron pour obtenir l’habilitation à diriger des recherches de l’École Normale Supérieure de Lyon spécialité : Informatique Contribution to the management of large scale platforms: the Diet experience Date de soutenance: 6 octobre 2010 Composition du Jury : Rapporteurs : Dick H. J. Epema (Technische Universiteit Delft) : Thierry Priol (INRIA. IRISA. Rennes) : Pierre Sens (INRIA. LIP6. Paris) Examinateurs : Vincent Breton (CNRS. LPC. Clermont Ferrand) : Franck Cappello (INRIA. Urbana Champaign University) : Olivier Richard (IMAG. Grenoble) Directeur : Frédéric Desprez (INRIA. ENS-Lyon) Habilitation préparée au sein du Laboratoire de l’Informatique du Parallélisme (LIP) À Cléa et Teo. Remerciements Je commencerai ces remerciements par un reproche à tout ceux qui avant moi se sont retrouvés devant cette tâche.
    [Show full text]
  • An Isogeometric Analysis Approach for Coupled Multi-Field Problems at Large Strain Lei Zhang
    An isogeometric analysis approach for coupled multi-field problems at large strain Lei Zhang To cite this version: Lei Zhang. An isogeometric analysis approach for coupled multi-field problems at large strain. Solid mechanics [physics.class-ph]. Ecole Centrale Marseille, 2016. English. NNT : 2016ECDM0012. tel- 01525035 HAL Id: tel-01525035 https://tel.archives-ouvertes.fr/tel-01525035 Submitted on 19 May 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. ECOLE CENTRALE MARSEILLE THÈSE Pour obtenir le grade de DOCTEUR DE L’ECOLE CENTRALE MARSEILLE Par LEI ZHANG le 5 décembre 2016 SUR UNE APPROCHE ISOGEOMETRIQUE POUR PROBLEMES MULTI-CHAMPS COUPLES EN GRANDES TRANSFORMATIONS JURY Rapporteur: Thomas Elguedj, INSA de Lyon Rapporteur: Jean-Claude Léon, ENSE3 - Grenoble-INP Examinateur: Salim Bouabdallah, Altair Engineering Examinateur: Marc Médale, Polytech’ Marseille Directeur de thèse: Dominique Eyheramendy, Centrale Marseille II Acknowledgements This dissertation has been written from 2013 to 2016 during my time as Phd student in the equip of material and structure of LMA (Laboratoire de Mécanique et d’Acoustique), Marseille, France. I would like to thank sincerely Prof. Dominique Eyheramendy for giving me the opportunity to work with him, and for his helpful and patient guidance as my doctoral supervisor.
    [Show full text]
  • The Dune Framework: Basic Concepts and Recent Developments
    The Dune Framework: Basic Concepts and Recent Developments Peter Bastiana, Markus Blattb, Andreas Dednerc, Nils-Arne Dreierd, Christian Engwerd, Ren´eFritzed, Carsten Gr¨asere, Christoph Gr¨uninger, Dominic Kempfa, Robert Kl¨ofkornf, Mario Ohlbergerd, Oliver Sanderg aHeidelberg University bDr. Blatt HPC-Simulation-Software & Services cUniversity of Warwick dApplied Mathematics: Institute of Analysis and Numerics, University of M¨unster eFreie Universit¨atBerlin fNORCE Norwegian Research Centre AS gTechnische Universit¨atDresden Abstract This paper presents the basic concepts and the module structure of the Dis- tributed and Unified Numerics Environment and reflects on recent developments and general changes that happened since the release of the first Dune version in 2007 and the main papers describing that state [1, 2]. This discussion is accompanied with a description of various advanced features, such as coupling of domains and cut cells, grid modifications such as adaptation and moving domains, high order discretizations and node level performance, non-smooth multigrid methods, and multiscale methods. A brief discussion on current and future development directions of the framework concludes the paper. 1. Introduction The Distributed and Unified Numerics Environment Dune1 [1, 2] is a free and open source software framework for the grid-based numerical solution of partial differential equations (PDEs) that has been developed for more than 15 years as a collaborative effort of several universities and research institutes. arXiv:1909.13672v3 [cs.MS] 22 Jun 2020 In its name, the term \distributed" refers to distributed development as well as distributed computing. The enormous importance of numerical methods for PDEs in applications has lead to the development of a large number of general (i.e.
    [Show full text]