Research Problems in Finite Element Theory: Analysis, Geometry, and Application


 Milton Goodwin
 1 years ago
 Views:
Transcription
1 Research Problems in Finite Element Theory: Analysis, Geometry, and Application Andrew Gillette Department of Mathematics University of Arizona Research Tutorial Group Presentation Slides and more info at: agillette/ Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
2 What s relevant in molecular modeling? (bottom image: David Goodsell) Andrew Gillette  U. Arizona Finite Element () Research Problems RTG Talk  Jan / 36
3 What s relevant in neuronal modeling? (right image: Chandrajit Bajaj) Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
4 What s relevant in diffusion modeling? Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
5 Mathematics used in biological models t Ω A x = b Analysis PDEs Geometry Topology Combinatorics Linear algebra Numerical analysis Mathematics helps answer distinguish relevant and irrelevant features of a model: Does the PDE have a unique solution, bounded in some norm? Does the domain discretization affect the quality of the approximate solution? Is the solution method optimally efficient? (e.g. Why isn t my code working?) Focus of my research in these areas: the Finite Element Method Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
6 Table of Contents 1 Introduction to the Finite Element Method 2 Tensor product finite element methods 3 The minimal approximation question 4 Serendipity finite element methods 5 RTG Project Ideas Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
7 Outline 1 Introduction to the Finite Element Method 2 Tensor product finite element methods 3 The minimal approximation question 4 Serendipity finite element methods 5 RTG Project Ideas Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
8 The Finite Element Method: 1D The finite element method is a way to numerically approximate the solution to PDEs. (Example worked out on board) Ex: The 1D Laplace equation: find u(x) U (dim U = ) s.t. u (x) = f (x) on [a, b] u(a) = 0, u(b) = 0 Weak form: find u(x) U (dim U = ) s.t. b u (x)v (x) dx = b a a Discrete form: find u h (x) U h (dim U h < ) s.t. b u h(x)v h(x) dx = b a a f (x)v(x) dx, v V (dim V = ) f (x)v h (x) dx, v h V h (dim V h < ) Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
9 The Finite Element Method: 1D (Example worked out on board) Suppose u h (x) can be written as linear combination of V h elements: u h (x) = v i V h u i v i (x) The discrete form becomes: find coefficients u i R such that i b a u i v i (x)v j (x) dx = Written as a linear system: b a f (x)v j (x) dx, v h V h (dim V h < ) [ A ] ji [ u ] i = [ f ] j, v j V h With some functional analysis we can prove: C > 0, independent of h, s.t. u u h H 1 (Ω) }{{} error between cnts and discrete solution C h u H 2 (Ω) }{{} bound in terms of 2nd order osc. of u, u H 2 (Ω) }{{} holds for any u with bounded 2nd derivs.. where h = maximum width of elements use in discretization. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
10 Outline 1 Introduction to the Finite Element Method 2 Tensor product finite element methods 3 The minimal approximation question 4 Serendipity finite element methods 5 RTG Project Ideas Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
11 Tensor product finite element methods Generalizing the 1st order, 1D method Goal: Efficient, accurate approximation of the solution to a PDE over Ω R n for arbitrary dimension n and arbitrary rate of convergence r. Standard O(h r ) tensor product finite element method in R n : Mesh Ω by ndimensional 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 Implementation requires a clear characterization of the isomorphisms: { x r y s 0 r, s 3 } { ψi (x)ψ j (y) 1 i, j 4 } monomials basis functions domain points Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
12 Cubic Hermite Geometric Decomposition (1D, r =3) {1, x, x 2, x 3 } {ψ 1, ψ 2, ψ 3, ψ 4 } approxim. geometry monomials basis functions domain points Cubic Hermite Basis on [0, 1] Approximation: x r = ψ 1 ψ 2 ψ 3 := ψ 4 1 3x 2 + 2x 3 x 2x 2 + x 3 x 2 x 3 3x 2 2x ε r,i ψ i, for r = 0, 1, 2, 3, where [ε r,i ] = i=1 Geometry: If a(x) is a cubic polynomial then: a(x) = a(0) }{{} value ψ 1 + a (0) ψ 2 a (1) }{{}}{{} derivative derivative ψ 3 + a(1) }{{} value Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36 ψ 4
13 Tensor Product Polynomials We can use our 1D Hermite functions to make 2D Hermite functions: = ψ 1 (x) ψ 1 (y) = ψ 11 (x, y) = ψ 1 (x) ψ 2 (y) = ψ 12 (x, y) Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
14 Cubic Hermite Geometric Decomposition (2D, r =3) { x r y s 0 r, s 3 } { ψi (x)ψ j (y) 1 i, j 4 } monomials basis functions domain points Approximation: x r y s = 4 4 ε r,i ε s,j ψ ij, for 0 r, s 3, ε r,i as in 1D. i=1 j=1 Geometry: ψ 11 ψ 21 ψ 22 a(x, y) = a (0,0) ψ 11 + xa (0,0) ψ 21 + ya (0,0) ψ 12 + x ya (0,0) ψ 22 + }{{}}{{}}{{}}{{} value 1st deriv. 1st deriv. 2nd deriv. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
15 Cubic Hermite Geometric Decomposition (3D, r =3) { x r y s z t 0 r, s, t 3 } ψ i(x)ψ j (y)ψ k (z) 1 i, j, k monomials basis functions domain points Approximation: x r y s z t = ε r,i ε s,j ε t,k ψ ijk, for 0 r, s, t 3, ε r,i as in 1D. i=1 j=1 k=1 Geometry: Contours of level sets of the basis functions: ψ 111 ψ 112 ψ 212 ψ 222 Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
16 Tensor Product FEM Summary O(h) O(h 2 ) O(h 3 ) O(h r ) { x r y s } { x r y s } { x r y s } { x r y s } r, s 1 r, s 2 r, s 3 r, s r (r + 1) 2 { x r y s z t } { x r y s z t } { x r y s z t } { x r y s z t } r, s, t 1 r, s, t 2 r, s, t 3 r, s, t r (r + 1) 3 a lot! Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
17 Outline 1 Introduction to the Finite Element Method 2 Tensor product finite element methods 3 The minimal approximation question 4 Serendipity finite element methods 5 RTG Project Ideas Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
18 How many functions are minimally needed? 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 The proof of the above estimate relies on two properties of finite elements: Continuity: Adjacent elements agree on order r polynomials their shared face?? Approximation: Basis functions on each element span all degree r monomials {1, x, y, x 2, y 2, xy} }{{} required for O(h 2 ) approximation?? {1, x, y, x 2, y 2, xy, x 2 y, xy 2, x 2 y 2 } }{{} standard polynomials in O(h 2 ) tensor product method Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
19 Next time... Characterization of the minimal approximation question for any order Intriguing mathematical difficulties and recent serendipitous solutions Benefits of serendipity solutions to biological modeling Open research problems for an RTG study Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
20 Outline 1 Introduction to the Finite Element Method 2 Tensor product finite element methods 3 The minimal approximation question 4 Serendipity finite element methods 5 RTG Project Ideas Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
21 Serendipity Elements O(h 2 ) O(h 3 ) O(h 4 ) O(h 5 ) O(h 6 ) For r 4 on squares: O(h r ) tensor product method : r 2 + 2r + 1 dots O(h r 1 ) serendipity method: (r 2 + 3r + 6) dots 2 u u h H 1 (Ω) C h r u H }{{} r+1 (Ω), u H r+1 (Ω). }{{} approximation error optimal error bound Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
22 Serendipity Elements O(h 2 ) O(h 3 ) O(h 4 ) O(h 5 ) O(h 6 ) Why r + 1 dots per edge? Ensures continuity between adjacent elements. Why interior dots only for r 4? Consider, e.g. p(x, y) := (1 + x)(1 x)(1 y)(1 + y) Observe p is a degree 4 polynomial but p 0 on ([ 1, 1] 2 ). How can we recover tensor productlike structure without a tensor product structure? Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
23 Mathematical Challenges More Precisely O(h 2 ) O(h 3 ) O(h 4 ) O(h 5 ) O(h 6 ) Goal: Construct basis functions for serendipity elements satisfying the following: Symmetry: Accommodate interior degrees of freedom that grow according to triangular numbers on squareshaped elements. Tensor product structure: Write as linear combinations of standard tensor product functions. Hierarchical: Generalize to methods on ncubes for any n 2, allowing restrictions to lowerdimensional faces. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
24 Which monomials do we need? O(h 3 ) serendipity element: { total degree at most cubic (req. for O(h 3 ) approximation) }} { { 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 } }{{} at most cubic in each variable (used in O(h 3 ) tensor product methods) We need an intermediate set of 12 monomials! The superlinear degree of a polynomial ignores linearlyappearing variables. Example: sldeg(xy 3 ) = 3, even though deg(xy 3 ) = 4 ( n ) Definition: sldeg(x e 1 1 x e 2 2 x n en ) := e i # {e i : e i = 1} {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 } }{{} superlinear degree at most 3 (dim=12) ARNOLD, AWANOU The serendipity family of finite elements, Found. Comp. Math, Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36 i=1
25 Superlinear polynomials form a lower set Given a monomial x α := x α 1 1 x α d d, associate the multiindex of d nonnegative 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 z α R d for all α L. For any sufficiently smooth dvariate real function f, there is a unique polynomial p span{x α : α L} that interpolates f at the points z α, with partial derivative interpolation for repeated z α values. DYN AND FLOATER Multivariate polynomial interpolation on lower sets, J. Approx. Th., to appear. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
26 Partitioning and reordering the multiindices By a judicious choice of the interpolation points z α = (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 colorcoded 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 z α reordered. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
27 Symmetrizing the multiindices By collecting the reordered interpolation points z α = (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 z α 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 Finite Element ( ) Research Problems RTG Talk  Jan / 36
28 2D symmetric serendipity elements Symmetry: Accommodate interior degrees of freedom that grow according to triangular numbers on squareshaped elements. O(h 2 ) O(h 3 ) O(h 4 ) O(h 5 ) O(h 6 ) O(h 7 ) Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
29 Tensor product structure The DynFloater interpolation scheme is expressed in terms of tensor product interpolation over maximal blocks in the set using an inclusionexclusion formula 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 Finite Element ( ) Research Problems RTG Talk  Jan / 36
30 Tensor product structure Thus, using our symmetric approach, each maximal block in the lower set becomes a standard tensorproduct 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 Finite Element ( ) Research Problems RTG Talk  Jan / 36
31 Linear combination of tensor products Tensor product structure: Write basis functions as linear combinations of standard tensor product functions = Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
32 3D elements Hierarchical: Generalize to methods on ncubes for any n 2, allowing restrictions to lowerdimensional faces. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
33 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 Finite Element ( ) Research Problems RTG Talk  Jan / 36
34 Brief aside: historical quiz What video game is shown on the right? Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
35 Outline 1 Introduction to the Finite Element Method 2 Tensor product finite element methods 3 The minimal approximation question 4 Serendipity finite element methods 5 RTG Project Ideas Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
36 RTG Project ideas me if you d like a copy of the slides with the project ideas. Andrew Gillette  U. Arizona Finite Element ( ) Research Problems RTG Talk  Jan / 36
Serendipity Basis Functions for Any Degree in Any Dimension
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/
More informationPolytopal Finite Element Methods: Theory and Application
Polytopal Finite Element Methods: Theory and Application Andrew Gillette Department of Mathematics University of Arizona Andrew Gillette  U. Arizona Polytopal () Element Methods CIMAT  Jan 2016 1 / 23
More informationPeriodic Table of the Finite Elements
7%12I[WZSPYQIRYQFIV November 03, 2014 Periodic Table of the Finite Elements By Douglas Arnold, Anders Logg The finite element method is one of the most powerful and widely applicable techniques for the
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin email: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider twopoint
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationModule1. x 1000. y 800.
Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,
More informationFinite Element Formulation for Plates  Handout 3 
Finite Element Formulation for Plates  Handout 3  Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials
Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationCoefficient of Potential and Capacitance
Coefficient of Potential and Capacitance Lecture 12: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay We know that inside a conductor there is no electric field and that
More informationAn Additive NeumannNeumann Method for Mortar Finite Element for 4th Order Problems
An Additive eumanneumann Method for Mortar Finite Element for 4th Order Problems Leszek Marcinkowski Department of Mathematics, University of Warsaw, Banacha 2, 02097 Warszawa, Poland, Leszek.Marcinkowski@mimuw.edu.pl
More informationPolynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
More informationMatrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo
Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for
More informationOn the representability of the biuniform matroid
On the representability of the biuniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every biuniform matroid is representable over all sufficiently large
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationAppendix A. Appendix. A.1 Algebra. Fields and Rings
Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science  Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: WireFrame Representation Object is represented as as a set of points
More informationFINITE DIFFERENCE METHODS
FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to
More informationSect 6.7  Solving Equations Using the Zero Product Rule
Sect 6.7  Solving Equations Using the Zero Product Rule 116 Concept #1: Definition of a Quadratic Equation A quadratic equation is an equation that can be written in the form ax 2 + bx + c = 0 (referred
More informationBasics of Polynomial Theory
3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where
More informationPOWER SETS AND RELATIONS
POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEYINTERSCIENCE A John Wiley & Sons, Inc.,
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationApplication. Outline. 31 Polynomial Functions 32 Finding Rational Zeros of. Polynomial. 33 Approximating Real Zeros of.
Polynomial and Rational Functions Outline 31 Polynomial Functions 32 Finding Rational Zeros of Polynomials 33 Approximating Real Zeros of Polynomials 34 Rational Functions Chapter 3 Group Activity:
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationPartial Fractions. p(x) q(x)
Partial Fractions Introduction to Partial Fractions Given a rational function of the form p(x) q(x) where the degree of p(x) is less than the degree of q(x), the method of partial fractions seeks to break
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the yaxis We observe that
More informationAlgebra I. In this technological age, mathematics is more important than ever. When students
In this technological age, mathematics is more important than ever. When students leave school, they are more and more likely to use mathematics in their work and everyday lives operating computer equipment,
More informationexpression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.
A polynomial of degree n (in one variable, with real coefficients) is an expression of the form: a n x n + a n 1 x n 1 + a n 2 x n 2 + + a 2 x 2 + a 1 x + a 0 where a n, a n 1, a n 2, a 2, a 1, a 0 are
More informationa) Three faces? b) Two faces? c) One face? d) No faces? What if it s a 15x15x15 cube? How do you know, without counting?
Painted Cube (Task) Imagine a large 3x3x3 cube made out of unit cubes. The large cube falls into a bucket of paint, so that the faces of the large cube are painted blue. Now suppose you broke the cube
More informationIntroduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationThe degree of a polynomial function is equal to the highest exponent found on the independent variables.
DETAILED SOLUTIONS AND CONCEPTS  POLYNOMIAL FUNCTIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE NOTE
More informationTheta Functions. Lukas Lewark. Seminar on Modular Forms, 31. Januar 2007
Theta Functions Lukas Lewark Seminar on Modular Forms, 31. Januar 007 Abstract Theta functions are introduced, associated to lattices or quadratic forms. Their transformation property is proven and the
More informationHomework set 1: posted on website
Homework set 1: posted on website 1 Last time: Interpolation, fitting and smoothing Interpolated curve passes through all data points Fitted curve passes closest (by some criterion) to all data points
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationMATH 110 Spring 2015 Homework 6 Solutions
MATH 110 Spring 2015 Homework 6 Solutions Section 2.6 2.6.4 Let α denote the standard basis for V = R 3. Let α = {e 1, e 2, e 3 } denote the dual basis of α for V. We would first like to show that β =
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More informationMath 5311 Gateaux differentials and Frechet derivatives
Math 5311 Gateaux differentials and Frechet derivatives Kevin Long January 26, 2009 1 Differentiation in vector spaces Thus far, we ve developed the theory of minimization without reference to derivatives.
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationIntroduction to the Finite Element Method (FEM)
Introduction to the Finite Element Method (FEM) ecture First and Second Order One Dimensional Shape Functions Dr. J. Dean Discretisation Consider the temperature distribution along the onedimensional
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationLecture 18  Clifford Algebras and Spin groups
Lecture 18  Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationComputational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON
Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf
More informationFinite Elements for 2 D Problems
Finite Elements for 2 D Problems General Formula for the Stiffness Matrix Displacements (u, v) in a plane element are interpolated from nodal displacements (ui, vi) using shape functions Ni as follows,
More informationClass Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES  CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
More informationExamination paper for Solutions to Matematikk 4M and 4N
Department of Mathematical Sciences Examination paper for Solutions to Matematikk 4M and 4N Academic contact during examination: Trygve K. Karper Phone: 99 63 9 5 Examination date:. mai 04 Examination
More information(Refer Slide Time: 1:42)
Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture  10 Curves So today we are going to have a new topic. So far
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMath 4310 Handout  Quotient Vector Spaces
Math 4310 Handout  Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationA new viewpoint on geometry of a lightlike hypersurface in a semieuclidean space
A new viewpoint on geometry of a lightlike hypersurface in a semieuclidean space Aurel Bejancu, Angel Ferrández Pascual Lucas Saitama Math J 16 (1998), 31 38 (Partially supported by DGICYT grant PB970784
More informationsome algebra prelim solutions
some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationMATH1231 Algebra, 2015 Chapter 7: Linear maps
MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter
More informationMathematics 31 Precalculus and Limits
Mathematics 31 Precalculus and Limits Overview After completing this section, students will be epected to have acquired reliability and fluency in the algebraic skills of factoring, operations with radicals
More informationThe Basics of FEA Procedure
CHAPTER 2 The Basics of FEA Procedure 2.1 Introduction This chapter discusses the spring element, especially for the purpose of introducing various concepts involved in use of the FEA technique. A spring
More information1 Eigenvalues and Eigenvectors
Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x
More informationA gentle introduction to the Finite Element Method. Francisco Javier Sayas
A gentle introduction to the Finite Element Method Francisco Javier Sayas 2008 An introduction If you haven t been hiding under a stone during your studies of engineering, mathematics or physics, it is
More informationLESSON 6.2 POLYNOMIAL OPERATIONS I
LESSON 6.2 POLYNOMIAL OPERATIONS I Overview In business, people use algebra everyday to find unknown quantities. For example, a manufacturer may use algebra to determine a product s selling price in order
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all ndimensional column
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2  Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers  {1,2,3,4,...}
More informationFunctions and Equations
Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c
More informationMATH 90 CHAPTER 6 Name:.
MATH 90 CHAPTER 6 Name:. 6.1 GCF and Factoring by Groups Need To Know Definitions How to factor by GCF How to factor by groups The Greatest Common Factor Factoring means to write a number as product. a
More informationLogo Symmetry Learning Task. Unit 5
Logo Symmetry Learning Task Unit 5 Course Mathematics I: Algebra, Geometry, Statistics Overview The Logo Symmetry Learning Task explores graph symmetry and odd and even functions. Students are asked to
More informationDiagonal, Symmetric and Triangular Matrices
Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by
More informationIntroduction to General and Generalized Linear Models
Introduction to General and Generalized Linear Models General Linear Models  part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK2800 Kgs. Lyngby
More informationMathematical Background
Appendix A Mathematical Background A.1 Joint, Marginal and Conditional Probability Let the n (discrete or continuous) random variables y 1,..., y n have a joint joint probability probability p(y 1,...,
More informationSelective Degree Elevation for MultiSided Bézier Patches
EUROGRAPHICS 2015 / O. SorkineHornung and M. Wimmer (Guest Editors) Volume 34 (2015), Number 2 Selective Degree Elevation for MultiSided Bézier Patches J. Smith 1 and S. Schaefer 1 1 Texas A&M University
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More information1.3 Polynomials and Factoring
1.3 Polynomials and Factoring Polynomials Constant: a number, such as 5 or 27 Variable: a letter or symbol that represents a value. Term: a constant, variable, or the product or a constant and variable.
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationUniform Multicommodity Flow through the Complete Graph with Random Edgecapacities
Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete
More informationA Domain Embedding/Boundary Control Method to Solve Elliptic Problems in Arbitrary Domains
A Domain Embedding/Boundary Control Method to Solve Elliptic Problems in Arbitrary Domains L. Badea 1 P. Daripa 2 Abstract This paper briefly describes some essential theory of a numerical method based
More informationIn this lesson you will learn to find zeros of polynomial functions that are not factorable.
2.6. Rational zeros of polynomial functions. In this lesson you will learn to find zeros of polynomial functions that are not factorable. REVIEW OF PREREQUISITE CONCEPTS: A polynomial of n th degree has
More informationMicroeconomic Theory: Basic Math Concepts
Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationError estimates for nearly degenerate finite elements
Error estimates for nearly degenerate finite elements Pierre Jamet In RAIRO: Analyse Numérique, Vol 10, No 3, March 1976, p. 43 61 Abstract We study a property which is satisfied by most commonly used
More informationUnit 3: Algebra. Date Topic Page (s) Algebra Terminology 2. Variables and Algebra Tiles 3 5. Like Terms 6 8. Adding/Subtracting Polynomials 9 12
Unit 3: Algebra Date Topic Page (s) Algebra Terminology Variables and Algebra Tiles 3 5 Like Terms 6 8 Adding/Subtracting Polynomials 9 1 Expanding Polynomials 13 15 Introduction to Equations 16 17 One
More informationON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
More informationGrade 9 Mathematics Unit 3: Shape and Space Sub Unit #1: Surface Area. Determine the area of various shapes Circumference
1 P a g e Grade 9 Mathematics Unit 3: Shape and Space Sub Unit #1: Surface Area Lesson Topic I Can 1 Area, Perimeter, and Determine the area of various shapes Circumference Determine the perimeter of various
More informationVERTICES OF GIVEN DEGREE IN SERIESPARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIESPARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of seriesparallel labelled
More information( ) FACTORING. x In this polynomial the only variable in common to all is x.
FACTORING Factoring is similar to breaking up a number into its multiples. For example, 10=5*. The multiples are 5 and. In a polynomial it is the same way, however, the procedure is somewhat more complicated
More information