DOCSLIB.ORG

6.2 Riemannian Manifold Interface

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Tampereen teknillinen yliopisto. Julkaisu 1209 Tampere University of Technology. Publication 1209 Matti Pellikka Finite Element Method for Electromagnetics on Riemannian Manifolds Topology and Differential Geometry Toolkit Thesis for the degree of Doctor of Science in Technology to be presented with due permission for public examination and criticism in Rakennustalo Building, Auditorium RG202, at Tampere University of Technology, on the 2nd of May 2014, at 12 noon. Tampereen teknillinen yliopisto - Tampere University of Technology Tampere 2014 ISBN 978-952-15-3279-5 (printed) ISBN 978-952-15-3285-6 (PDF) ISSN 1459-2045 Abstract This thesis applies new branches of mathematics in computational electromagnetics soft- ware. Namely, we consider the application of algebraic topology and differential geometry in finite element modeling. We conclude that from this approach, one can draw benefits to practical electromagnetic modeling. For example, more efficient numerical formulations, field-circuit coupling, and metric and coordinate free modeling techniques. We present efficient methods for homology and cohomology computation of finite element meshes together with their software implementation. The presented homology and cohomology solver is a part of finite element mesh generator Gmsh. Therefore, its use can be easily incorporated into finite element modeling workflow. We demonstrate the use of homology and cohomology computation results in static and quasistatic electromagnetic field problems. We describe finite element formulations which can be used in lumped parameter extraction from field problems and which can be naturally coupled to electronic circuit problems. Importantly, cohomology computa- tion enables the use of magnetic scalar potential in eddy current problems without any topological restrictions, leading to more efficient and robust field computations. Lastly, we present a finite element programming environment, where the language of differential geometry has the main role. We interpret the finite element model as a Rie- mannian manifold, and the fields of interest as differential forms. Using the environment, one can give the computational instructions in metric and coordinate free manner, as the used metric and coordinate system are provided separately. Then, the environment trans- lates the instructions to the actual floating-point operations, which ultimately depend on the used metric and coordinate system. The programming environment implementation builds on top of the Gmsh API. That is, we implement tools from differential geometry which utilize an existing finite element framework. The main contribution of this thesis is the development of these tools to the point where they can be readily expoited in computationally demanding engineering problems. Also, this thesis offers a unified exposition of the needed mathematical concepts and their relation to the electromagnetic field problem formulations. Preface I have made this thesis in the inspirational environment of the electromagnetics research group in the Tampere University of Technology. The thesis topic builds on top of the long-term basic research conducted in our research group, to bring some of its results closer to engineering practice. I have done this work under the supervision of Professor Lauri Kettunen, whose en- thusiasm, sincerity, and farsightedness reflects in the atmosphere of the whole research group, creating a close-knit research community. In addition to Lauri Kettunen, I have been privileged to be guided by two other members of our research group, whose ad- vice and perspective complement each other: University Lecturer Saku Suuriniemi and Senior Research Fellow Timo Tarhasaari. Much of my progress is also due to Professor Christophe Geuzaine from the University of Liège, the main developer of the finite el- ement library Gmsh. In addition to his encouragement, he enabled and supported the implementation of the methods of this thesis to Gmsh. I would also like to than Lasse Söderlund and Maija-Liisa Paasonen for taking care of administrative tasks, as well as Juha Tampio, Antti Stenvall, Valtteri Lahtinen, Erkki Härö, Arto Poutala, and Olli Pekkola for giving feedback to some of the software imple- mentations I have done for this thesis. Other people I’d like to thank for more or less casual interaction during my thesis work include Jukka-Pekka Uusitalo, Teemu Rovio, Pasi Raumonen, Janne Keränen, Tuukka Nieminen, Arttu Rasku, Aki Korpela, Risto Mikkonen, Stefan Kurz, and other present and past personnel of our research group who are responsible for its friendly atmosphere. Lastly, I thank my dear wife Kiti for taking care of the fundamentals on the home front, as well as my son Eevertti for demanding my undivided attention on regular basis; and my daughter Muusa for inspiring me while finalizing this thesis. 1 Contents List of symbols 5 1 Introduction 10 1.1 Background, motivation, and usefulness of the research .......... 12 1.1.1 Homology and cohomology computation .............. 12 1.1.2 Differential geometry and Riemannian manifolds .......... 13 1.2 Survey of recent research ........................... 14 1.3 Original contributions ............................ 14 1.3.1 Development of reduction techniques for homology and cohomology computation .............................. 15 1.3.2 Implementation of homology and cohomology solver ........ 15 1.3.3 Cohomology based formulations of the electromagnetic boundary value problems ............................ 15 1.3.4 Implementation of Riemannian manifold programming interface . 16 1.4 Organization ................................. 16 2 Mathematical concepts 17 2.1 Algebraic structures ............................. 18 2.1.1 Abelian group ............................. 18 2.1.2 Homological algebra ......................... 21 2.1.3 Vector space .............................. 25 2.1.4 Exterior algebra ............................ 27 2.2 Manifold and its cell decomposition ..................... 29 2.2.1 Real coordinate space ......................... 30 2.2.2 Euclidean space ............................ 30 2.2.3 Manifolds ............................... 31 2.2.4 Cell complex of a manifold ...................... 34 2.2.5 Finite elements ............................ 37 2.3 Homology and cohomology of a manifold .................. 38 2.3.1 Chain complexes of a manifold .................... 38 2.3.2 Cochain complexes of a manifold .................. 40 2.3.3 Homology and cohomology of a manifold .............. 40 2.4 Differential forms ............................... 43 2.4.1 The basic construction ........................ 43 2.4.2 Integration .............................. 45 2.4.3 de Rham cohomology ......................... 46 2 2.4.4 Harmonic differential forms ..................... 47 2.4.5 Whitney forms ............................ 48 3 Homology and cohomology computation of finite element meshes 51 3.1 Construction of chain complexes from a finite element mesh ....... 52 3.1.1 Data structures and construction of the cell complex ....... 52 3.1.2 Construction of chain complexes ................... 53 3.2 Reduction of chain complexes ........................ 54 3.2.1 Reduction algorithms ......................... 54 3.2.2 Reduction pair ............................ 55 3.2.3 Homology reduction algorithms ................... 57 3.2.4 Cohomology reduction algorithms .................. 61 3.3 Computation of homology and cohomology ................. 62 3.3.1 Smith normal form .......................... 64 3.3.2 Kernel-image problem ........................ 64 3.3.3 Quotient problem ........................... 65 3.3.4 The homology and cohomology computation algorithm ...... 67 3.4 The homology and cohomology solver in Gmsh ............... 67 3.4.1 Homology computation routine ................... 68 3.4.2 Cohomology computation routine .................. 68 3.5 Post-processing of homology and cohomology ................ 69 3.5.1 Basis element representative selection ................ 70 3.5.2 Basis selection ............................. 70 3.5.3 Computation of harmonic representatives .............. 73 3.6 Examples ................................... 74 3.6.1 Example: Solid cube ......................... 74 3.6.2 Example: Closed surfaces ...................... 75 3.6.3 Example: Torus knots ........................ 76 4 Application of cohomology in the finite element method for electromag- netics 79 4.1 Electromagnetic modeling .......................... 80 4.2 Static problems ................................ 81 4.2.1 Electrokinetic problem ........................ 81 4.2.2 Cohomology basis functions ..................... 83 4.2.3 Electric field -conforming formulation ................ 85 4.2.4 Current density -conforming formulation .............. 86 4.2.5 Electrostatic problem ......................... 88 4.2.6 Magnetostatic problem ........................ 89 4.3 Circuit coupled eddy current problem .................... 90 4.3.1 Eddy current problem ........................ 90 4.3.2 Faraday’s law conforming formulation ................ 91 4.3.3 Ampere’s law conforming formulation ................ 92 4.4 Examples ................................... 93 4.4.1 Induced EMF in squirrel cage rotor ................. 93 4.4.2 Mutual inductance magnetostatic problem ............. 94 3 4.4.3 Induction heating eddy current problem .............. 97 5 Finite element imitation of the Riemannian manifold 103 5.1 Motivation ................................... 103 5.2 Imitation of the manifold ........................... 104 5.2.1 Differentials
Recommended publications
  • Real Composition Algebras by Steven Clanton

    Real Composition Algebras by Steven Clanton

    Real Composition Algebras by Steven Clanton A Thesis Submitted to the Faculty of The Wilkes Honors College in Partial Fulfillment of the Requirements for the Degree of Bachelor of Arts in Liberal Arts and Sciences with a Concentration in Mathematics Wilkes Honors College of Florida Atlantic University Jupiter, FL May 2009 Real Composition Algebras by Steven Clanton This thesis was prepared under the direction of the candidates thesis advisor, Dr. Ryan Karr, and has been approved by the members of his supervisory committee. It was sub- mitted to the faculty of The Honors College and was accepted in partial fulfillment of the requirements for the degree of Bachelor of Arts in Liberal Arts and Sciences. SUPERVISORY COMMITTEE: Dr. Ryan Karr Dr. Eugene Belogay Dean, Wilkes Honors College Date ii Abstract Author: Steve Clanton Title: Real Composition Algebras Institution: Wilkes Honors College of Florida Atlantic University Thesis Advisor: Dr. Ryan Karr Degree: Bachelor of Arts in Liberal Arts and Sciences Concentration: Mathematics Year: 2009 According to Koecher and Remmert [Ebb91, p. 267], Gauss introduced the \com- position of quadratic forms" to study the representability of natural numbers in binary (rank 2) quadratic forms. In particular, Gauss proved that any positive defi- nite binary quadratic form can be linearly transformed into the two-squares formula 2 2 2 2 2 2 w1 + w2 = (u1 + u2)(v1 + v2). This shows not only the existence of an algebra for every form but also an isomorphism to the complex numbers for each. Hurwitz gen- eralized the \theory of composition" to arbitrary dimensions and showed that exactly four such systems exist: the real numbers, the complex numbers, the quaternions, and octonions [CS03, p.
  • Module 2 : Fundamentals of Vector Spaces Section 2 : Vector Spaces

    Module 2 : Fundamentals of Vector Spaces Section 2 : Vector Spaces

    Module 2 : Fundamentals of Vector Spaces Section 2 : Vector Spaces 2. Vector Spaces The concept of a vector space will now be formally introduced. This requires the concept of closure and field. Definition 1 (Closure) A set is said to be closed under an operation when any two elements of the set subject to the operation yields a third element belonging to the same set. Example 2 The set of integers is closed under addition, multiplication and subtraction. However, this set is not closed under division. Example 3 The set of real numbers ( ) and the set of complex numbers (C) are closed under addition, subtraction, multiplication and division. Definition 4 (Field) A field is a set of elements closed under addition, subtraction, multiplication and division. Example 5 The set of real numbers ( ) and the set of complex numbers ( ) are scalar fields. However, the set of integers is not a field. A vector space is a set of elements, which is closed under addition and scalar multiplication. Thus, associated with every vector space is a set of scalars (also called as scalar field or coefficient field) used to define scalar multiplication on the space. In functional analysis, the scalars will be always taken to be the set of real numbers ( ) or complex numbers ( ). Definition 6 (Vector Space): A vector space is a set of elements called vectors and scalar field together with two operations. The first operation is called addition which associates with any two vectors a vector , the sum of and . The second operation is called scalar multiplication, which associates with any vector and any scalar a vector (a scalar multiple of by Thus, when is a linear vector space, given any vectors and any scalars the element .
  • Euclidean Space - Wikipedia, the Free Encyclopedia Page 1 of 5

    Euclidean Space - Wikipedia, the Free Encyclopedia Page 1 of 5

    Euclidean space - Wikipedia, the free encyclopedia Page 1 of 5 Euclidean space From Wikipedia, the free encyclopedia In mathematics, Euclidean space is the Euclidean plane and three-dimensional space of Euclidean geometry, as well as the generalizations of these notions to higher dimensions. The term “Euclidean” distinguishes these spaces from the curved spaces of non-Euclidean geometry and Einstein's general theory of relativity, and is named for the Greek mathematician Euclid of Alexandria. Classical Greek geometry defined the Euclidean plane and Euclidean three-dimensional space using certain postulates, while the other properties of these spaces were deduced as theorems. In modern mathematics, it is more common to define Euclidean space using Cartesian coordinates and the ideas of analytic geometry. This approach brings the tools of algebra and calculus to bear on questions of geometry, and Every point in three-dimensional has the advantage that it generalizes easily to Euclidean Euclidean space is determined by three spaces of more than three dimensions. coordinates. From the modern viewpoint, there is essentially only one Euclidean space of each dimension. In dimension one this is the real line; in dimension two it is the Cartesian plane; and in higher dimensions it is the real coordinate space with three or more real number coordinates. Thus a point in Euclidean space is a tuple of real numbers, and distances are defined using the Euclidean distance formula. Mathematicians often denote the n-dimensional Euclidean space by , or sometimes if they wish to emphasize its Euclidean nature. Euclidean spaces have finite dimension. Contents 1 Intuitive overview 2 Real coordinate space 3 Euclidean structure 4 Topology of Euclidean space 5 Generalizations 6 See also 7 References Intuitive overview One way to think of the Euclidean plane is as a set of points satisfying certain relationships, expressible in terms of distance and angle.
  • Math 20480 – Example Set 03A Determinant of a Square Matrices

    Math 20480 – Example Set 03A Determinant of a Square Matrices

    Math 20480 { Example Set 03A Determinant of A Square Matrices. Case: 2 × 2 Matrices. a b The determinant of A = is c d a b det(A) = jAj = = c d For matrices with size larger than 2, we need to use cofactor expansion to obtain its value. Case: 3 × 3 Matrices. 0 1 a11 a12 a13 a11 a12 a13 The determinant of A = @a21 a22 a23A is det(A) = jAj = a21 a22 a23 a31 a32 a33 a31 a32 a33 (Cofactor expansion along the 1st row) = a11 − a12 + a13 (Cofactor expansion along the 2nd row) = (Cofactor expansion along the 1st column) = (Cofactor expansion along the 2nd column) = Example 1: 1 1 2 ? 1 −2 −1 = 1 −1 1 1 Case: 4 × 4 Matrices. a11 a12 a13 a14 a21 a22 a23 a24 a31 a32 a33 a34 a41 a42 a43 a44 (Cofactor expansion along the 1st row) = (Cofactor expansion along the 2nd column) = Example 2: 1 −2 −1 3 −1 2 0 −1 ? = 0 1 −2 2 3 −1 2 −3 2 Theorem 1: Let A be a square n × n matrix. Then the A has an inverse if and only if det(A) 6= 0. We call a matrix A with inverse a matrix. Theorem 2: Let A be a square n × n matrix and ~b be any n × 1 matrix. Then the equation A~x = ~b has a solution for ~x if and only if . Proof: Remark: If A is non-singular then the only solution of A~x = 0 is ~x = . 3 3. Without solving explicitly, determine if the following systems of equations have a unique solution.
  • Automatic Variational Inference in Stan

    Automatic Variational Inference in Stan

    Automatic Variational Inference in Stan Alp Kucukelbir Data Science Institute Department of Computer Science Columbia University [email protected] Rajesh Ranganath Department of Computer Science Princeton University [email protected] Andrew Gelman Data Science Institute Depts. of Political Science, Statistics Columbia University [email protected] David M. Blei Data Science Institute Depts. of Computer Science, Statistics Columbia University [email protected] June 15, 2015 Abstract Variational inference is a scalable technique for approximate Bayesian inference. Deriving variational inference algorithms requires tedious model-specific calculations; this makes it difficult to automate. We propose an automatic variational inference al- gorithm, automatic differentiation variational inference (advi). The user only provides a Bayesian model and a dataset; nothing else. We make no conjugacy assumptions and arXiv:1506.03431v2 [stat.ML] 12 Jun 2015 support a broad class of models. The algorithm automatically determines an appropri- ate variational family and optimizes the variational objective. We implement advi in Stan (code available now), a probabilistic programming framework. We compare advi to mcmc sampling across hierarchical generalized linear models, nonconjugate matrix factorization, and a mixture model. We train the mixture model on a quarter million images. With advi we can use variational inference on any model we write in Stan. 1 Introduction Bayesian inference is a powerful framework for analyzing data. We design
  • Copyrighted Material

    Copyrighted Material

    JWST582-IND JWST582-Ray Printer: Yet to Come September 7, 2015 10:27 Trim: 254mm × 178mm Index Adjoint Map and Left and Right Translations, 839–842, 845, 850–854, 857–858, 126 861–862, 880, 885, 906, 913–914, Admissible Virtual Space, 91, 125, 524, 925, 934, 950–953 560–561, 564, 722, 788, 790, 793 Scaling, 37, 137, 161, 164, 166, 249 affine combinations, 166 Translation, 33–34, 42–43, 75, 77, 92, 127, Affine Space, 33–34, 41, 43, 136–137, 139, 136–137, 155, 164, 166–167, 280, 155, 248, 280, 352–353, 355–356 334, 355–356, 373, 397, 421, 533, Affine Transformation 565, 793 Identity, 21–22, 39, 47, 60–61, 63–64, Algorithm For Newton Method of Iteration, 67–68, 70, 81, 90, 98–100, 104–106, 441 116, 125–126, 137, 255, 259, 268, Algorithm: Numerical Iteration, 445 331, 347, 362–363, 367, 372, 375, Allowable Parametric Representation, 37, 377, 380, 398, 538, 550, 559, 562, 140, 249 564–565, 568, 575–576, 581, 599, An Important Lemma, 89, 605, 839 609, 616, 622, 628, 648, 655, 663, Angle between Vectors, 259 668, 670, 730, 733, 788, 790, Angular Momentum, 523–524, 537–538, 543, 792–793, 797–798, 805–806, 547–549, 553–554, 556, 558, 575, 585, 811, 825, 834, 852, 862, 871–872, 591–592, 594, 608, 622, 640, 647–648, 916 722, 748, 750, 755–756, 759–760, 762, Rotation, 1, 6, 9–15, 17, 22, 27, 33, 36, 39, 769–770, 776, 778, 780–783, 787, 805, 44, 64, 74, 90–94, 97–101, 104–108, 815, 822, 828, 842 110, 112, 114–116, 118–121, Angular Velocity Tensor, 125, 127, 526, 542, 123–127, 131, 137, 165–166, 325, 550, 565, 571, 723, 794, 800 334, 336–337, 353, 356,
  • Redimensioning of Euclidean Spaces Arxiv:1307.7010V1 [Math.CA] 26 Jul

    Redimensioning of Euclidean Spaces Arxiv:1307.7010V1 [Math.CA] 26 Jul

    Redimensioning of Euclidean Spaces Piyush Ahuja∗ Subiman Kunduy Abstract A vector space over a field F is a set V together with two binary operations, called vector n addition and scalar multiplication. It is standard practice to think of a Euclidean space R as an n-dimensional real coordinate space i.e. the space of all n-tuples of real numbers (Rn), with vector operations defined using real addition and multiplication coordinate-wise. A natural question which arises is if it is possible to redefine vector operations on the space in such a way that it acquires some other dimension, say k (over the same field i.e., R). In this paper, we answer the question in the affirmative, for all k 2 N. We achieve the required dimension k by `dragging' the structure of a standard k-dimensional Euclidean space (R ) on the n-tuple of real numbers (Rn). At the heart of the argument is Cantor's counterintuitive result that n R is numerically equivalent to R for all n 2 N, which can be proved through an elegant construction. Finally, we generalize the result to all finite dimensional vector spaces. Keywords. Vector Space, Euclidean Space, Numerical Equivalence, Dimension, Isomorphism 1 Introduction arXiv:1307.7010v1 [math.CA] 26 Jul 2013 An engineer, a physicist, and a mathematician are discussing how to visualise four dimensions: Engineer: I never really get it. Physicist: Oh it's really easy, just imagine three dimensional space over a time - that adds your fourth dimension. n Mathematician: No, it's way easier than that; just imagine R , then set n = 4.
  • Mathematics Curriculum

    Mathematics Curriculum

    New York State Common Core Mathematics Curriculum Table of Contents1 Vectors and Matrices PRECALCULUS AND ADVANCED TOPICS • MODULE 2 Module Overview ................................................................................................................................................. X Topic A: Networks and Matrices (N‐VM.6, N‐VM.7, N‐VM.8) ............................................................................. X Lesson 1: Introduction to Networks ........................................................................................................ X Lesson 2: Networks and Matrix Arithmetic ............................................................................................. X Lesson 3: Matrix Arithmetic in its Own Right .......................................................................................... X Topic B: Linear Transformations of Planes and Space (N‐VM.7, N‐VM.8, N‐VM.9, N‐VM.10, N‐VM.11, N‐VM.12) ............................................................................................................................................................... X Lesson 4: Linear Transformations Review ............................................................................................... X Lesson 5: Coordinates of Points in Space ................................................................................................ X Lesson 6: Linear Transformations as Matrices ........................................................................................ X Lesson 7: Linear Transformations
  • MATH 206 Linear Algebra I

    MATH 206 Linear Algebra I

    MATH 206 Linear Algebra I 1. Catalog Description MATH 206 Linear Algebra I 4 units Prerequisite: MATH 143. Systems of linear equations. Matrix algebra, including inverses and determinants. Vectors, vector spaces, bases and linear transformations in real coordinate space of n dimensions. Eigenvalues, eigenvectors and diagonalization. Applications of linear algebra. Introduction to inner products and orthogonality. 4 lectures. 2. Required Background or Experience Math 143 or consent of instructor. 3. Learning Objectives The student should be able to: a. Understand the concept of matrices and their role in linear algebra and applied mathematics. b. Have a complete understanding of linear systems Ax = b, and the role of rank, subspace, linear independence, etc. in the analysis of these systems. c. Understand eigenvalues and eigenvectors of matrices and their computation. d. Know the concept of determinant and its properties. e. Understand the concepts of vector space and linear maps when the vector space is Rn. f. Understand important definitions in linear algebra and the ability to do very elementary proofs. 4. Text and References To be chosen by instructor. Suggested texts include: • Lay, David C., Linear Algebra and its Applications • Bretscher, Otto, Linear Algebra with Applications 5. Minimum Student Materials Paper, pencils, and notebook. 2019/20 6. Minimum University Facilities Classroom with ample chalkboard space for class use. Use of a computer lab is optional. 7. Content and Method a. Systems of linear equations b. Matrix and vector operations c. Properties of Rn (linear combinations, bases, spanning set, dimensions, dimension equation) d. Coordinate systems and change of basis e. Determinants f. Eigenvalues and eigenvectors g.
  • Ethan D. Bloch

    Ethan D. Bloch

    ETHAN D. BLOCH Professor of Mathematics Bard College ! !Address: !Phone, Email, Website: Department of Mathematics 845-758-7266 Bard College [email protected] 30 Campus Road http://math.bard.edu/bloch/ Annandale-on-Hudson, NY 12504-5000 ! !Education: • 1983 Ph.D. (mathematics) Cornell University, Ithaca, NY • 1981 M.S. (mathematics) Cornell University, Ithaca, NY • 1978 B.A. (mathematics) Reed College, Portland, OR ! !Academic Positions: Bard College: • 2003 - 2007 Chair, Division of Science, Mathematics, & Computing • 2001 - Professor of Mathematics • 1993 - 1995 Associate Dean for Academic Services • 1991 - 2000 Associate Professor of Mathematics ! • 1986 - 1991 Assistant Professor of Mathematics Hebrew University of Jerusalem: ! • 2007 - 2008 Visiting Professor of Mathematics University of Utah: ! • 1983 - 1986 Instructor of Mathematics Cornell University: • 1978 - 1982 Teaching Assistant ! !Grants and Awards: • Asher Edelman Released-Time Fellow, Bard College, Fall 1988, Spring 1990, Fall 1992. • National Science Foundation Grant DMS-8503388, 7/85 - 12/87. • Hutchinson Fellowship, Cornell University, 1982 - 1983. ! !Memberships: American Mathematical Society, Phi Beta Kappa ! !Citizenship: !U.S.A. !1 ! Publications: ! Books: 1. A First Course in Geometric Topology and Differential Geometry, Birkhäuser, Boston, 1996. 2. Proofs and Fundamentals: A First Course in Abstract Mathematics, Birkhäuser, Boston, 2000. 3. Proofs and Fundamentals: A First Course in Abstract Mathematics, 2nd edition, Springer, New York, 2010. 4. The Real Numbers and Real Analysis, Springer, New York, 2011. ! Papers:! 1. (with R. Connelly and D. W. Henderson) The space of simplexwise linear homeomorphisms of a convex 2-disk, Topology 23 (1984), 161-175. 2. Simplexwise linear near-embeddings of a 2-disk into R2, Trans. Amer. Math. Soc.
  • Reference-Manual-2 19.Pdf

    Reference-Manual-2 19.Pdf

    Stan Reference Manual Version 2.19 Stan Development Team Contents Overview 7 Language 9 1. Character Encoding 10 1.1 Content Characters 10 1.2 Comment Characters 10 2. Includes 11 2.1 Recursive Includes 12 2.2 Include Paths 12 3. Comments 13 3.1 Line-Based Comments 13 3.2 Bracketed Comments 13 4. Whitespace 14 4.1 Whitespace Characters 14 4.2 Whitespace Neutrality 14 4.3 Whitespace Location 14 5. Data Types and Declarations 15 5.1 Overview of Data Types 15 5.2 Primitive Numerical Data Types 17 5.3 Univariate Data Types and Variable Declarations 18 5.4 Vector and Matrix Data Types 22 5.5 Array Data Types 29 5.6 Variable Types vs.Constraints and Sizes 34 5.7 Compound Variable Declaration and Definition 35 6. Expressions 37 6.1 Numeric Literals 37 6.2 Variables 38 2 CONTENTS 3 6.3 Vector, Matrix, and Array Expressions 40 6.4 Parentheses for Grouping 43 6.5 Arithmetic and Matrix Operations on Expressions 43 6.6 Conditional Operator 46 6.7 Indexing 48 6.8 Multiple Indexing and Range Indexing 49 6.9 Function Application 50 6.10 Type Inference 53 6.11 Higher-Order Functions 55 6.12 Chain Rule and Derivatives 57 7. Statements 59 7.1 Statement Block Contexts 59 7.2 Assignment Statement 59 7.3 Increment Log Density 62 7.4 Sampling Statements 64 7.5 For Loops 71 7.6 Foreach Loops 73 7.7 Conditional Statements 74 7.8 While Statements 74 7.9 Statement Blocks and Local Variable Declarations 75 7.10 Break and Continue Statements 77 7.11 Print Statements 79 7.12 Reject Statements 81 8.
  • Automatic Variational Inference in Stan

    Automatic Variational Inference in Stan

    Automatic Variational Inference in Stan Alp Kucukelbir Rajesh Ranganath Columbia University Princeton University [email protected] [email protected] Andrew Gelman David M. Blei Columbia University Columbia University [email protected] [email protected] Abstract Variational inference is a scalable technique for approximate Bayesian inference. Deriving variational inference algorithms requires tedious model-specific calcula- tions; this makes it difficult for non-experts to use. We propose an automatic varia- tional inference algorithm, automatic differentiation variational inference (advi); we implement it in Stan (code available), a probabilistic programming system. In advi the user provides a Bayesian model and a dataset, nothing else. We make no conjugacy assumptions and support a broad class of models. The algorithm automatically determines an appropriate variational family and optimizes the vari- ational objective. We compare advi to mcmc sampling across hierarchical gen- eralized linear models, nonconjugate matrix factorization, and a mixture model. We train the mixture model on a quarter million images. With advi we can use variational inference on any model we write in Stan. 1 Introduction Bayesian inference is a powerful framework for analyzing data. We design a model for data using latent variables; we then analyze data by calculating the posterior density of the latent variables. For machine learning models, calculating the posterior is often difficult; we resort to approximation. Variational inference (vi) approximates the posterior with a simpler distribution [1, 2]. We search over a family of simple distributions and find the member closest to the posterior. This turns ap- proximate inference into optimization. vi has had a tremendous impact on machine learning; it is typically faster than Markov chain Monte Carlo (mcmc) sampling (as we show here too) and has recently scaled up to massive data [3].