Serendipity Basis Functions for Any Degree in Any Dimension



Similar documents
EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines

Finite Elements for 2 D Problems

Mean Value Coordinates

Finite Element Formulation for Plates - Handout 3 -

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

How High a Degree is High Enough for High Order Finite Elements?

An Additive Neumann-Neumann Method for Mortar Finite Element for 4th Order Problems

The degree of a polynomial function is equal to the highest exponent found on the independent variables.

Introduction to the Finite Element Method (FEM)

Selective Degree Elevation for Multi-Sided Bézier Patches

The Basics of FEA Procedure

MCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials

Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS

Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON

Analysis-suitable T-splines of arbitrary degree: definition and properties

From Scattered Samples to Smooth Surfaces

Point Lattices in Computer Graphics and Visualization how signal processing may help computer graphics

Sect Solving Equations Using the Zero Product Rule

Lecture 18 - Clifford Algebras and Spin groups

POLYNOMIAL FUNCTIONS

Moving Least Squares Approximation

An Overview of the Finite Element Analysis

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

Module1. x y 800.

Mathematics, Basic Math and Algebra

On the representability of the bi-uniform matroid

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

6.4 Factoring Polynomials


MATH 095, College Prep Mathematics: Unit Coverage Pre-algebra topics (arithmetic skills) offered through BSE (Basic Skills Education)

Indiana State Core Curriculum Standards updated 2009 Algebra I

MATH 90 CHAPTER 6 Name:.

ISU Department of Mathematics. Graduate Examination Policies and Procedures

Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

FACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES. Nathan B. Grigg. Submitted to Brigham Young University in partial fulfillment

A Systematic Approach to Factoring

FINITE DIFFERENCE METHODS

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Basics of Polynomial Theory

ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

Factoring Polynomials and Solving Quadratic Equations

Error estimates for nearly degenerate finite elements

NSM100 Introduction to Algebra Chapter 5 Notes Factoring

Visualization of 2D Domains

Algebra Academic Content Standards Grade Eight and Grade Nine Ohio. Grade Eight. Number, Number Sense and Operations Standard

Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

Harrisonburg, VA 22807

2.5 ZEROS OF POLYNOMIAL FUNCTIONS. Copyright Cengage Learning. All rights reserved.

MATHEMATICAL METHODS OF STATISTICS

Name Intro to Algebra 2. Unit 1: Polynomials and Factoring

Higher Education Math Placement

1.3 Polynomials and Factoring

Introduction to General and Generalized Linear Models

Sequence of Mathematics Courses

Corollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality

Multigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation

Introduction to the Finite Element Method

Roots of Polynomials

Why do mathematicians make things so complicated?

Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Algebra 1 Course Title

A gentle introduction to the Finite Element Method. Francisco Javier Sayas

DIEF, Department of Engineering Enzo Ferrari University of Modena e Reggio Emilia Italy Online Trajectory Planning for robotic systems

Row Ideals and Fibers of Morphisms

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Back to Elements - Tetrahedra vs. Hexahedra

Homework 2 Solutions

Inner Product Spaces

Florida Math Correlation of the ALEKS course Florida Math 0028 to the Florida Mathematics Competencies - Upper

Prentice Hall Algebra Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009

Finite Element Method (ENGC 6321) Syllabus. Second Semester

Efficient Curve Fitting Techniques

Pre-Algebra Academic Content Standards Grade Eight Ohio. Number, Number Sense and Operations Standard. Number and Number Systems

Nonlinear Iterative Partial Least Squares Method

3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials

it is easy to see that α = a

BookTOC.txt. 1. Functions, Graphs, and Models. Algebra Toolbox. Sets. The Real Numbers. Inequalities and Intervals on the Real Number Line

Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

( ) FACTORING. x In this polynomial the only variable in common to all is x.

Orthogonal Diagonalization of Symmetric Matrices

Polynomial Degree and Finite Differences

SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE

If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

MATH 590: Meshfree Methods

Determinants can be used to solve a linear system of equations using Cramer s Rule.

CRLS Mathematics Department Algebra I Curriculum Map/Pacing Guide

c 2002 I.P. Ivrissimtzis, M.A. Sabin, N.A. Dodgson

COLLEGE ALGEBRA. Paul Dawkins

FRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG

Numerical Analysis An Introduction

4.3 Lagrange Approximation

Key Topics What will ALL students learn? What will the most able students learn?

Mathematics Georgia Performance Standards

Finite Element Formulation for Beams - Handout 2 -

Transcription:

Serendipity Basis Functions for Any Degree in Any Dimension Andrew Gillette Department of Mathematics University of Arizona joint work with Michael Floater (University of Oslo) http://math.arizona.edu/ agillette/ Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 1 / 22

Table of Contents 1 Introduction and Motivation 2 Approach 3 Results 4 Future Directions Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 2 / 22

What is a serendipity finite element method? Goal: Efficient, accurate approximation of the solution to a PDE over Ω R n. Standard O(h r ) tensor product finite element method in R n : Mesh Ω by n-dimensional cubes of side length h. Set up a linear system involving (r + 1) n degrees of freedom (DoFs) per cube. For unknown continuous solution u and computed discrete approximation u h : u u h H 1 (Ω) C h r u H } {{ } r+1 (Ω), u H r+1 (Ω). } {{ } approximation error optimal error bound A O(h r ) serendipity FEM converges at the same rate with fewer DoFs per element: O(h) O(h 2 ) O(h 3 ) O(h) O(h 2 ) O(h 3 ) tensor product elements serendipity elements Example: For O(h 3 ), n = 3, 50% fewer DoFs 50% smaller linear system Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 3 / 22

Motivations and Related Topics Serendipity elements are an essential tool in modern efforts to robustly implement and accelerate high order computational methods. Isogeometric analysis: Finding basis functions suitable for both domain description and PDE approximation avoids the expensive computational bottleneck of re-meshing. COTTRELL, HUGHES, BAZILEVS Isogeometric Analysis: Toward Integration of CAD and FEA, Wiley, 2009. Modern mathematics: Finite Element Exterior Calculus, Discrete Exterior Calculus, Virtual Element Methods... ARNOLD, AWANOU The serendipity family of finite elements, Found. Comp. Math, 2011. DA VEIGA, BREZZI, CANGIANI, MANZINI, RUSSO Basic Principles of Virtual Element Methods, M3AS, 2013. Flexible Domain Meshing: Serendipity type elements for Voronoi meshes provide computational benefits without need of tensor product structure. RAND, GILLETTE, BAJAJ Quadratic Serendipity Finite Elements on Polygons Using Generalized Barycentric Coordinates, Mathematics of Computation, in press. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 4 / 22

Mathematical challenges Basis functions must be constructed to implement serendipity elements. Current constructions lack key mathematical properties, limiting their broader usage Goal: Construct basis functions for serendipity elements satisfying the following: Symmetry: Accommodate interior degrees of freedom that grow according to triangular numbers on square-shaped elements. Tensor product structure: Write as linear combinations of standard tensor product functions. Hierarchical: Generalize to methods on n-cubes for any n 2, allowing restrictions to lower-dimensional faces. O(h 2 ) O(h 3 ) O(h 4 ) O(h 5 ) O(h 6 ) Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 5 / 22

Outline 1 Introduction and Motivation 2 Approach 3 Results 4 Future Directions Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 6 / 22

Overview of approach 1 Characterize and partition a set of multi-indices. 2 Reorder the set to respect serendipity degrees of freedom. 3 Symmetrize by collecting indices at face centers. O(h 5 ) 4 Apply a generic interpolation scheme for multi-indices. 1 2 3 Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 7 / 22

Two families of finite elements on cubical meshes Q r Λ k ([0, 1] n ) standard tensor product spaces early work: RAVIART, THOMAS 1976, NEDELEC 1980 more recently: ARNOLD, BOFFI, BONIZZONI arxiv:1212.6559, 2012 ( degree r in each variable) S r Λ k ([0, 1] n ) serendipity finite element spaces (superlinear degree r) early work: STRANG, FIX An analysis of the finite element method 1973 more recently: ARNOLD, AWANOU FoCM 11:3, 2011, and arxiv:1204.2595, 2012. The superlinear degree of a polynomial ignores linearly-appearing variables. Q 3 Λ 0 ([0,1] 2 ) (dim=16) { }} { n = 2 : { 1, x, y, x 2, y 2, xy, x 3, y 3, x 2 y, xy 2, x 3 y, xy 3, x 2 y 2, x 3 y 2, x 2 y 3, x 3 y 3 } } {{ } S 3 Λ 0 ([0,1] 2 ) (dim=12) Q 3 Λ 0 ([0,1] 3 ) (dim=64) { }} { n = 3 : { 1,..., xyz, x 3 y, x 3 z, y 3 z,..., x 3 yz, xy 3 z, xyz 3, x 3 y 2,..., x 3 y 3 z 3 } } {{ } S 3 Λ 0 ([0,1] 3 ) (dim=32) Q r Λ k and S r Λ k and have the same key mathematical properties needed for stability (degree, inclusion, trace, subcomplex, unisolvence, commuting projections) but for fixed k 0, r, n 2 the serendipity spaces have fewer degrees of freedom Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 8 / 22

Superlinear polynomials form a lower set Given a monomial x α := x α 1 1 x α d d, associate the multi-index of d non-negative integers α = (α 1, α 2,..., α d ) N d 0. Define the superlinear norm of α as α sprlin := so that the superlinear multi indices are S r = d α j, j=1 α j 2 { α N d 0 : α sprlin r Observe that S r has a partial ordering µ α means µ i α i. }. Thus S r is a lower set, meaning We can thus apply the following recent result. α S r, µ α = µ S r Theorem (Dyn and Floater, 2013) Fix a lower set L N d 0 and points y α R d for all α L. For any sufficiently smooth d-variate real function f, there is a unique polynomial p span{x α : α L} that interpolates f at the points y α, with partial derivative interpolation for repeated y α values. DYN AND FLOATER Multivariate polynomial interpolation on lower sets, J. Approx. Th., to appear. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 9 / 22

Partitioning and reordering the multi-indices By a judicious choice of the interpolation points y α = (x i, y j ), we recover the dimensionality associations of the degrees of freedom of serendipity elements. y 5 y 1 y 4 y 5 y 3 y 4 y 2 y 3 y 1 y 2 The order 5 serendipity element, with degrees of freedom color-coded by dimensionality. y 0 x 0 x 1 x 2 x 3 x 4 x 5 The lower set S 5, with equivalent color coding. y 0 x 0 x 2 x 3 x 4 x 5 x 1 The lower set S 5, with domain points y α reordered. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 10 / 22

Symmetrizing the multi-indices By collecting the re-ordered interpolation points y α = (x i, y j ), at midpoints of the associated face, we recover the dimensionality associations of the degrees of freedom of serendipity elements. y 1 y 1 y 5 y 4 y 3 y 2, y 3, y 4, y 5 y 2 y 0 x 0 x 2 x 3 x 4 x 5 x 1 The lower set S 5, with domain points y α reordered. y 0 x 0 x 2, x 3, x 4, x 5 x 1 A symmetric reordering, with multiplicity. The associated interpolant recovers values at dots, three partial derivatives at edge midpoints, and two partial derivatives at the face midpoint. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 11 / 22

Outline 1 Introduction and Motivation 2 Approach 3 Results 4 Future Directions Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 12 / 22

2D symmetric serendipity elements Symmetry: Accommodate interior degrees of freedom that grow according to triangular numbers on square-shaped elements. O(h 2 ) O(h 3 ) O(h 4 ) O(h 5 ) O(h 6 ) O(h 7 ) Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 13 / 22

Tensor product structure The Dyn-Floater interpolation scheme is expressed in terms of tensor product interpolation over maximal blocks in the set using an inclusion-exclusion formula. 1 +1 coefficient calculator +1 1 Put differently, the linear combination is the sum over all blocks within the lower set with coefficients determined as follows: Place the coefficient calculator at the extremal block corner. Add up all values appearing in the lower set. The coefficient for the block is the value of the sum. Hence: black dots +1; white dots -1; others 0. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 14 / 22

Tensor product structure Thus, using our symmetric approach, each maximal block in the lower set becomes a standard tensor-product interpolant. y 5 y 1 y 1 y 4 y 5 y 3 y 2 y 4 y 3 y 2, y 3, y 4, y 5 y 1 y 2 y 0 x 0 x 1 x 2 x 3 x 4 x 5 y 0 x 0 x 2 x 3 x 4 x 5 x 1 y 0 x 0 x 2, x 3, x 4, x 5 x 1 Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 15 / 22

Linear combination of tensor products Tensor product structure: Write basis functions as linear combinations of standard tensor product functions. + + + - - - = Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 16 / 22

3D elements Hierarchical: Generalize to methods on n-cubes for any n 2, allowing restrictions to lower-dimensional faces. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 17 / 22

3d coefficient computation Lower sets for superlinear polynomials in 3 variables: Decomposition into a linear combination of tensor product interpolants works the same as in 2D, using the 3D coefficient calculator at left. (Blue +1; Orange -1). FLOATER, GILLETTE Nodal basis functions for the serendipity family of finite elements, in preparation. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 18 / 22

Outline 1 Introduction and Motivation 2 Approach 3 Results 4 Future Directions Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 19 / 22

Future Directions Implement elements in finite element software packages. Analyze speed vs. accuracy trade-offs. n = 2 1 2 3 4 5 6 7 r 2n dim Q r 4 9 16 25 36 49 64 r 2 + 2r + 1 dim S r 4 8 12 17 23 30 38 n = 3 1 2 (r 2 + 3r + 6) dim Q r 8 27 64 125 216 343 512 r 3 + 3r 2 + 3r + 1 dim S r 8 20 32 50 74 105 144 And finally... 1 6 (r 3 + 6r 2 + 29r + 24) Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 20 / 22

Future Directions Play Qbert on lower sets of superlinear polynomials. Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 21 / 22

Acknowledgments Michael Floater, University of Oslo National Biomedical Computation Resource (UC San Diego) Thanks to the organizers of IGA 2014 for the opportunity to speak! Slides and pre-prints: http://math.arizona.edu/~agillette/ Andrew Gillette - U. Arizona Serendipity ( ) Functions for IGA IGA - Jan 2014 22 / 22