Differential Algebra (DA) based Fast Multipole Method (FMM)
|
|
- Betty Hill
- 5 years ago
- Views:
Transcription
1 Differential Algebra (DA) based Fast Multipole Method (FMM) Department of Physics and Astronomy Michigan State University June 27, 2010
2 Space charge effect Space charge effect : the fields of the charged particles in a bunch on each other affect the motion of themselves. Pair-to-pair method, time consuming, O(N 2 ) Tree code, O(N log N). (The field of the electrons far away from the observer point, can be represented by the field of a multipole.) Fast multipole method, much faster, O(N). (Multipole expansion and local expansion, recursive progress.)
3 Space charge effect L M O(N log N) M O(N)
4 History of FMM 1 J.Barnes, and P.Hut. A Hierarchical O(N log N) Force-Calculation Algorithm. Nature Vol. 324, pp , Dec. 4, L.Greengard, and V.Rokhlin. A Fast Algorithm for Particle Simulations. J. Comput. Phys. 73, pp , J.Carrier, L.Greengard, and V.Rokhlin. A Fast Adaptive Multipole Algorithm for Particle Simulations. SIAM J. Sci. Stat. Comput. Vol. 9, No. 4, pp , July R.Beatson and L.Greengard. A Short Course on Fast Multipole Methods. Numerical Methematics and Scientific Computation, Wavelets, Multilevel Methods and Elliptic PDEs. Oxford University Press, pp. 1-37, B.Shanker and H.Huang. Accelerated Cartesian Expansions - A Fast Method for Computing of Potentials of the Form R ν for All Real v. J. Comput. Phys. 226, pp , 2007
5 Some concepts Cut box, near region, and far region. First Level Second Level Near region (neighbors) Far region
6 Some concepts Interaction list and how it works. Interaction list Interaction list Already calculated
7 Brief introduction of FMM The process of FMM can be described as follows. Select the level of boxes according to the accuracy needed. From the finest level to the coarest level, calculate the multipole expansion of the charges inside each box. For each box in each level, convert the multipole expansions of the boxes in its interaction list into its local expansion. From the coarest to the finest level, translate the local expansion of each box into its child boxes and add it to the local expansion of the child box In the finest level, in each box calculate the potential or field by the local expansion on each particle inside. The potentials or fields of the particles inside the box or in its near region are calculated directly.
8 Automatic Taylor expansion of a function f (x + δx) = f (x) + f (x)δx + 1 2! f (x)δx ! f (x)δx In Cosy, f (x+da(1)) = f (x)+f (x)da(1)+ 1 2! f (x)da(1) ! f (x)da(1) Composition of two maps G(x) = G(F) F(x), or G(x) = G(F(x)) In COSY, it can be done by the command POLVAL L P NP A NA R NR
9 Multipole expansion from charges R(x, y, z) R(x, y, z) R 1 R2 φ R ( R i ) = φ R ( M) M S(0, 0, 0) S(0, 0, 0) R i
10 Multipole expansion from charges (for boxes in the finest level) φ c2m = with N i=1 Q i (xi x) 2 + (y i y) 2 + (z i z) 2 = 1 + x2 i +y2 i +zi 2 x 2 +y 2 +z 2 d 1 = d 3 = Q i / x 2 + y 2 + z 2 2x ix x 2 +y 2 +z 2 2y iy x 2 +y 2 +z 2 2z iz x 2 +y 2 +z 2 Q i d 1 =, 1 + (xi 2 + yi 2 + zi 2)d2 1 2x id 2 2y i d 3 2z i d 4 1 x 2 + y 2 + z 2 = 1 r, d 2 = y x 2 + y 2 + z 2 = y r 2, d 4 = x x 2 + y 2 + z 2 = x r 2, z x 2 + y 2 + z 2 = z r 2,
11 Multipole expansion in the higher level boxes M M M M M
12 Translation of a Multipole Expansion R(x, y, z) R(x, y, z ) S (x s, y s, z s) M S (0, 0, 0) M S(0, 0, 0) φ R ( M) = φ R ( M ) S( x s, y s, z s)
13 DA variables in S frame. d 1 = 1 x 2 + y 2 + z 2 = 1 r, d 2 = d 3 = y x 2 + y 2 + z 2 = y x x x 2 + y 2 = + z 2 r 2, r 2, d 4 = z x 2 + y 2 + z 2 = z Relation between the new and old DA variables (M 1 ). d 1 = 1 + (x s 2 + y s 2 + z s 2 ( d d 2 = 2 d x s d 1 )d 2 ) ( d d1 2, d 3 = 3 d y s 1 + 2x s d 2 + 2y s d 3 + 2z sd 4 Potential in S frame is φ m2m = φ c2m M 1. r 2, ) ( d d1 2, d 4 = 4 d z s ) d 2 1.
14 Conversion of a Multipole Expansion (in the interaction list) into a Local Expansion R(x, y, z) R(x, y, z ) O(x o, y o, z o ) L O(0, 0, 0) M S(0, 0, 0) φ R ( M) = φ R ( L) S( x o, y o, z o )
15 DA variables in the observer frame O. d 1 = x, d 2 = y, d 3 = z. Relation between the DA variables in the source frame S and the observer frame O. (M 2 ) d 1 = 1 (xo + d 1 )2 + (y o + d 2 )2 + (z o + d 3 )2 d 2 = d 3 = d 4 = x o + d 1 (x o + d 1 )2 + (y o + d 2 )2 + (z o + d 3 )2, y o + d 2 (x o + d 1 )2 + (y o + d 2 )2 + (z o + d 3 )2, z o + d 3 (x o + d 1 )2 + (y o + d 2 )2 + (z o + d 3 )2. The potential in the observer frame O is φ m2l = φ c2m M 2.
16 Local Expansion inherited from the parent box. L L L L L
17 Translation of a Local Expansion R(x, y,z) R(x, y, z ) L L O (x o, y o, z o) O(0, 0,0) O (0,0, 0) φ R ( L) = φ R ( L ) O( x o, y o, z o)
18 DA variables in the new observer frame O. d 1 = x, d 2 = y, d 3 = z. Relation between the DA variables in the old and new frame. (M 3 ) d 1 = x o + d 1, d 2 = y o + d 2, d 3 = z o + d 3. The potential in the observer frame O is φ l2l = φ m2l M 3.
19 Field is easy to calculate. In the local expansion, the potential is represented as a polynomial of the local coordinates. The calculate the field, one just need to take derivative of the the respect coordinate. This is also important in the high order map method.
20 Check the convergence. Case 1, source box center (0,0,0), observer box center (2,0,0), length of the box side 1, 50 electrons in each box, repeat 1000 times. order M error 1.488E E E E E-5 L error 3.026E E E E E-5 Case 2, source box center (0,0,0), observer box center (2,2,0), length of the box side 1, 50 electrons in each box, repeat 1000 times. order M error 3.923E E E E E-6 L error 7.109E E E E E-6
21 Case 3, source box center (0,0,0), observer box center (2,2,2), length of the box side 1, 50 electrons in each box, repeat 1000 times. order M error 2.567E E E E E-7 L error 4.281E E E E E-7 Case 4, DA order 3, 50 electrons in each box, repeat 1000 times, change the position of the observer box,50 electrons in each box, repeat 1000 times. observer (2,0,0) (3,0,0) (4,0,0) (5,0,0) M error 1.488E E E E-5 L error 3.026E E E E-5
22 Work to do Finish the code,some low level tools for COSY to increase efficiency. How about bunch size in some dimension is much larger/smaller than the other dimensions. Apply it in some simulation. Error Analysis, rigorous error bound by TM.
23 Thank you!
He Zhang (now Jefferson Lab), Zhensheng Tao, Jenni Portman, Phillip Duxbury, Chong-Yu Ruan, Kyoko Makino, Martin Berz. Michigan State University
The Multiple Level Fast Multipole Method in the Differential Algebra Framework for Space Charge Field Calculation and Simulations on femtosecond electron imaging and spectroscopy He Zhang (now Jefferson
More informationMultiple Level Fast Multipole Algorithm in Differential Algebra Frame and Its Prospective Usage in Photoemission Simulation
Multiple Level Fast Multipole Algorithm in Differential Algebra Frame and Its Prospective Usage in Photoemission Simulation Beam Theory and Dynamic Group, Department of Physics and Astronomy, Michigan
More informationA Crash Course on Fast Multipole Method (FMM)
A Crash Course on Fast Multipole Method (FMM) Hanliang Guo Kanso Biodynamical System Lab, 2018 April What is FMM? A fast algorithm to study N body interactions (Gravitational, Coulombic interactions )
More information18.336J/6.335J: Fast methods for partial differential and integral equations. Lecture 13. Instructor: Carlos Pérez Arancibia
18.336J/6.335J: Fast methods for partial differential and integral equations Lecture 13 Instructor: Carlos Pérez Arancibia MIT Mathematics Department Cambridge, October 24, 2016 Fast Multipole Method (FMM)
More informationFast multipole method
203/0/ page Chapter 4 Fast multipole method Originally designed for particle simulations One of the most well nown way to tae advantage of the low-ran properties Applications include Simulation of physical
More informationAn implementation of the Fast Multipole Method without multipoles
An implementation of the Fast Multipole Method without multipoles Robin Schoemaker Scientific Computing Group Seminar The Fast Multipole Method Theory and Applications Spring 2002 Overview Fast Multipole
More informationMIL-DTL-5015 Style Circular Connectors
--01 y i oo /- i ooi --01 /- i i oi i --01 oi iio oo. io oiio o, oi i o i o o - -o-. /- i i oi i 12 i o iz o 10 o, i o o iz o #1 o #0 7 i o i o oo i iy o iio. o, i oo, i, oiio i i i o y oi --01, - o: i
More informationCOSY INFINITY Version 7
COSY INFINITY Version 7 Kyoko Makino and Martin Berz Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory Michigan State University, East Lansing, MI 48824 Abstract An
More informationFast Multipole Methods for The Laplace Equation. Outline
Fast Multipole Methods for The Laplace Equation Ramani Duraiswami Nail Gumerov Outline 3D Laplace equation and Coulomb potentials Multipole and local expansions Special functions Legendre polynomials Associated
More informationAn Introduction to Differential Algebra
An Introduction to Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al. 1 ESA Advanced Concepts Team (TEC-SF) SRL, Milan Dinamica Outline 1 Overview Five Views of Differential Algebra
More informationINTRODUCTION TO FAST MULTIPOLE METHODS LONG CHEN
INTRODUCTION TO FAST MULTIPOLE METHODS LONG CHEN ABSTRACT. This is a simple introduction to fast multipole methods for the N-body summation problems. Low rank approximation plus hierarchical decomposition
More informationScalability Metrics for Parallel Molecular Dynamics
Scalability Metrics for arallel Molecular Dynamics arallel Efficiency We define the efficiency of a parallel program running on processors to solve a problem of size W Let T(W, ) be the execution time
More informationMath 110 Midterm 1 Study Guide October 14, 2013
Name: For more practice exercises, do the study set problems in sections: 3.4 3.7, 4.1, and 4.2. 1. Find the domain of f, and express the solution in interval notation. (a) f(x) = x 6 D = (, ) or D = R
More informationNotation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i
LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent
More informationHigh-Order Representation of Poincaré Maps
High-Order Representation of Poincaré Maps Johannes Grote, Martin Berz, and Kyoko Makino Department of Physics and Astronomy, Michigan State University, East Lansing, MI, USA. {grotejoh,berz,makino}@msu.edu
More informationAlgebraic Expressions
Algebraic Expressions 1. Expressions are formed from variables and constants. 2. Terms are added to form expressions. Terms themselves are formed as product of factors. 3. Expressions that contain exactly
More informationFast multipole boundary element method for the analysis of plates with many holes
Arch. Mech., 59, 4 5, pp. 385 401, Warszawa 2007 Fast multipole boundary element method for the analysis of plates with many holes J. PTASZNY, P. FEDELIŃSKI Department of Strength of Materials and Computational
More informationA fast method for solving the Heat equation by Layer Potentials
A fast method for solving the Heat equation by Layer Potentials Johannes Tausch Abstract Boundary integral formulations of the heat equation involve time convolutions in addition to surface potentials.
More informationCALCULUS JIA-MING (FRANK) LIOU
CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion
More informationFormal groups. Peter Bruin 2 March 2006
Formal groups Peter Bruin 2 March 2006 0. Introduction The topic of formal groups becomes important when we want to deal with reduction of elliptic curves. Let R be a discrete valuation ring with field
More informationSection 5.1 Composite Functions
Section 5. Composite Functions Objective #: Form a Composite Function. In many cases, we can create a new function by taking the composition of two functions. For example, suppose f(x) x and g(x) x +.
More informationThis exam contains 9 problems. CHECK THAT YOU HAVE A COMPLETE EXAM.
Math 126 Final Examination Autumn 2011 Your Name Your Signature Student ID # Quiz Section Professor s Name TA s Name This exam contains 9 problems. CHECK THAT YOU HAVE A COMPLETE EXAM. This exam is closed
More informationPolynomial Degree Leading Coefficient. Sign of Leading Coefficient
Chapter 1 PRE-TEST REVIEW Polynomial Functions MHF4U Jensen Section 1: 1.1 Power Functions 1) State the degree and the leading coefficient of each polynomial Polynomial Degree Leading Coefficient y = 2x
More informationConvergence of sequences and series
Convergence of sequences and series A sequence f is a map from N the positive integers to a set. We often write the map outputs as f n rather than f(n). Often we just list the outputs in order and leave
More informationChapter 8. Exploring Polynomial Functions. Jennifer Huss
Chapter 8 Exploring Polynomial Functions Jennifer Huss 8-1 Polynomial Functions The degree of a polynomial is determined by the greatest exponent when there is only one variable (x) in the polynomial Polynomial
More informationLECTURE 5, FRIDAY
LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationMATH 228: Calculus III (FALL 2016) Sample Problems for FINAL EXAM SOLUTIONS
MATH 228: Calculus III (FALL 216) Sample Problems for FINAL EXAM SOLUTIONS MATH 228 Page 2 Problem 1. (2pts) Evaluate the line integral C xy dx + (x + y) dy along the parabola y x2 from ( 1, 1) to (2,
More informationFourth Week: Lectures 10-12
Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore
More informationLecture 2: The Fast Multipole Method
CBMS Conference on Fast Direct Solvers Dartmouth College June 23 June 27, 2014 Lecture 2: The Fast Multipole Method Gunnar Martinsson The University of Colorado at Boulder Research support by: Recall:
More informationLecture 10: Predicate Logic and Its Language
Discrete Mathematics (II) Spring 2017 Lecture 10: Predicate Logic and Its Language Lecturer: Yi Li 1 Predicates and Quantifiers In this action, we show you why a richer language should be introduced than
More informationFrom Particle Accelerators to Celestial Dynamics: An Introduction to Differential Algebra
AstroNet II Summer School 2014 Friday, 27 June 2014 Zielona Góra (Poland) From Particle Accelerators to Celestial Dynamics: An Introduction to Differential Algebra 1, Pierluigi di Lizia 1, Roberto Armellin
More informationHandout 5, Summer 2014 Math May Consider the following table of values: x f(x) g(x) f (x) g (x)
Handout 5, Summer 204 Math 823-7 29 May 204. Consider the following table of values: x f(x) g(x) f (x) g (x) 3 4 8 4 3 4 2 9 8 8 3 9 4 Let h(x) = (f g)(x) and l(x) = g(f(x)). Compute h (3), h (4), l (8),
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationFast Algorithms for Many-Particle Simulations on Peta-Scale Parallel Architectures
Mitglied der Helmholtz-Gemeinschaft Fast Algorithms for Many-Particle Simulations on Peta-Scale Parallel Architectures Godehard Sutmann Institute for Advanced Simulation (IAS) - Jülich Supercomputing Centre
More informationCOSY INFINITY version 8
Nuclear Instruments and Methods in Physics Research A 427 (1999) 338}343 COSY INFINITY version 8 Kyoko Makino*, Martin Berz Department of Physics and National Superconducting Cyclotron Laboratory, Michigan
More informationJuly 21 Math 2254 sec 001 Summer 2015
July 21 Math 2254 sec 001 Summer 2015 Section 8.8: Power Series Theorem: Let a n (x c) n have positive radius of convergence R, and let the function f be defined by this power series f (x) = a n (x c)
More information1) The line has a slope of ) The line passes through (2, 11) and. 6) r(x) = x + 4. From memory match each equation with its graph.
Review Test 2 Math 1314 Name Write an equation of the line satisfying the given conditions. Write the answer in standard form. 1) The line has a slope of - 2 7 and contains the point (3, 1). Use the point-slope
More informationSTAT 450: Statistical Theory. Distribution Theory. Reading in Casella and Berger: Ch 2 Sec 1, Ch 4 Sec 1, Ch 4 Sec 6.
STAT 45: Statistical Theory Distribution Theory Reading in Casella and Berger: Ch 2 Sec 1, Ch 4 Sec 1, Ch 4 Sec 6. Basic Problem: Start with assumptions about f or CDF of random vector X (X 1,..., X p
More informationALGEBRAIC GEOMETRY HOMEWORK 3
ALGEBRAIC GEOMETRY HOMEWORK 3 (1) Consider the curve Y 2 = X 2 (X + 1). (a) Sketch the curve. (b) Determine the singular point P on C. (c) For all lines through P, determine the intersection multiplicity
More informationMath 205b Homework 2 Solutions
Math 5b Homework Solutions January 5, 5 Problem (R-S, II.) () For the R case, we just expand the right hand side and use the symmetry of the inner product: ( x y x y ) = = ((x, x) (y, y) (x, y) (y, x)
More informationTaylor Model Range Bounding Schemes
Taylor Model Range Bounding Schemes I Kyoko Makino II Martin Berz Department of Physics and Astronomy Michigan State University Introduction LDB (Linear Dominated Bounder) QDB (Quadratic Dominated Bounder)
More informationA Fast Adaptive Multipole Algorithm in Three Dimensions
Journal of Computational Physics 155, 468 498 (1999) Article ID jcph.1999.6355, available online at http://www.idealibrary.com on A Fast Adaptive Multipole Algorithm in Three Dimensions H. Cheng, L. Greengard,
More informationSeries Solutions of Differential Equations
Chapter 6 Series Solutions of Differential Equations In this chapter we consider methods for solving differential equations using power series. Sequences and infinite series are also involved in this treatment.
More informationMath 671: Tensor Train decomposition methods
Math 671: Eduardo Corona 1 1 University of Michigan at Ann Arbor December 8, 2016 Table of Contents 1 Preliminaries and goal 2 Unfolding matrices for tensorized arrays The Tensor Train decomposition 3
More informationROOT FINDING REVIEW MICHELLE FENG
ROOT FINDING REVIEW MICHELLE FENG 1.1. Bisection Method. 1. Root Finding Methods (1) Very naive approach based on the Intermediate Value Theorem (2) You need to be looking in an interval with only one
More informationDefinition A.1. We say a set of functions A C(X) separates points if for every x, y X, there is a function f A so f(x) f(y).
The Stone-Weierstrass theorem Throughout this section, X denotes a compact Hausdorff space, for example a compact metric space. In what follows, we take C(X) to denote the algebra of real-valued continuous
More informationCS 542G: The Poisson Problem, Finite Differences
CS 542G: The Poisson Problem, Finite Differences Robert Bridson November 10, 2008 1 The Poisson Problem At the end last time, we noticed that the gravitational potential has a zero Laplacian except at
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationSection 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series
Section 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series Power Series for Functions We can create a Power Series (or polynomial series) that can approximate a function around
More informationAn adaptive fast multipole boundary element method for the Helmholtz equation
An adaptive fast multipole boundary element method for the Helmholtz equation Vincenzo Mallardo 1, Claudio Alessandri 1, Ferri M.H. Aliabadi 2 1 Department of Architecture, University of Ferrara, Italy
More informationA fast adaptive numerical solver for nonseparable elliptic partial differential equations
J. KSIAM Vol.2. No.1. 27-39, 1998 27 A fast adaptive numerical solver for nonseparable elliptic partial differential equations June-Yub Lee Dept of Math, Ewha Womans Univ, Seoul 120-750, KOREA jylee@math.ewha.ac.kr
More informationChapter 1- Polynomial Functions
Chapter 1- Polynomial Functions WORKBOOK MHF4U W1 1.1 Power Functions MHF4U Jensen 1) Identify which of the following are polynomial functions: a) p x = cos x b) h x = 7x c) f x = 2x, d) y = 3x / 2x 0
More informationMarch Algebra 2 Question 1. March Algebra 2 Question 1
March Algebra 2 Question 1 If the statement is always true for the domain, assign that part a 3. If it is sometimes true, assign it a 2. If it is never true, assign it a 1. Your answer for this question
More information8 Building New Functions from Old Ones
Arkansas Tech University MATH 2243: Business Calculus Dr. Marcel B. Finan 8 Building New Functions from Old Ones In this section we discuss various ways for building new functions from old ones. New functions
More informationName: Class: Date: PostAssessment Polynomial Unit. Multiple Choice Identify the choice that best completes the statement or answers the question.
Name: _ lass: _ ate: Postssessment Polynomial Unit Multiple hoice Identify the choice that best completes the statement or answers the question. 1 Write the polynomial in standard form. Then name the polynomial
More informationVerified Global Optimization with Taylor Model based Range Bounders
Verified Global Optimization with Taylor Model based Range Bounders KYOKO MAKINO and MARTIN BERZ Department of Physics and Astronomy Michigan State University East Lansing, MI 88 USA makino@msu.edu, berz@msu.edu
More informatione x2 dxdy, e x2 da, e x2 x 3 dx = e
STS26-4 Calculus II: The fourth exam Dec 15, 214 Please show all your work! Answers without supporting work will be not given credit. Write answers in spaces provided. You have 1 hour and 2minutes to complete
More informationεx 2 + x 1 = 0. (2) Suppose we try a regular perturbation expansion on it. Setting ε = 0 gives x 1 = 0,
4 Rescaling In this section we ll look at one of the reasons that our ε = 0 system might not have enough solutions, and introduce a tool that is fundamental to all perturbation systems. We ll start with
More informationApproximation theory
Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2
More informationParallel Adaptive Fast Multipole Method: application, design, and more...
Parallel Adaptive Fast Multipole Method: application, design, and more... Stefan Engblom UPMARC @ TDB/IT, Uppsala University PSCP, Uppsala, March 4, 2011 S. Engblom (UPMARC/TDB) Parallel Adaptive FMM PSCP,
More informationPreCalculus: Semester 1 Final Exam Review
Name: Class: Date: ID: A PreCalculus: Semester 1 Final Exam Review Short Answer 1. Determine whether the relation represents a function. If it is a function, state the domain and range. 9. Find the domain
More informationImproved Fast Gauss Transform. (based on work by Changjiang Yang and Vikas Raykar)
Improved Fast Gauss Transform (based on work by Changjiang Yang and Vikas Raykar) Fast Gauss Transform (FGT) Originally proposed by Greengard and Strain (1991) to efficiently evaluate the weighted sum
More informationSubgradients. subgradients. strong and weak subgradient calculus. optimality conditions via subgradients. directional derivatives
Subgradients subgradients strong and weak subgradient calculus optimality conditions via subgradients directional derivatives Prof. S. Boyd, EE364b, Stanford University Basic inequality recall basic inequality
More informationMATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field.
MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field. Vector space A vector space is a set V equipped with two operations, addition V V
More informationPDE: The Method of Characteristics Page 1
PDE: The Method of Characteristics Page y u x (x, y) + x u y (x, y) =, () u(, y) = cos y 2. Solution The partial differential equation given can be rewritten as follows: u(x, y) y, x =, (2) where = / x,
More informationSection 0.2 & 0.3 Worksheet. Types of Functions
MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2
More information4.3 General attacks on LFSR based stream ciphers
67 4.3 General attacks on LFSR based stream ciphers Recalling our initial discussion on possible attack scenarios, we now assume that z = z 1,z 2,...,z N is a known keystream sequence from a generator
More informationChapter Generating Functions
Chapter 8.1.1-8.1.2. Generating Functions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 8. Generating Functions Math 184A / Fall 2017 1 / 63 Ordinary Generating Functions (OGF) Let a n (n = 0, 1,...)
More informationJoint Iterative Decoding of LDPC Codes and Channels with Memory
Joint Iterative Decoding of LDPC Codes and Channels with Memory Henry D. Pfister and Paul H. Siegel University of California, San Diego 3 rd Int l Symposium on Turbo Codes September 1, 2003 Outline Channels
More informationPade Approximations and the Transcendence
Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k
More informationName: Class: Date: Rationals Multiple Choice Pre-Test. Multiple Choice Identify the choice that best completes the statement or answers the question.
Name: _ Class: _ Date: Rationals Multiple Choice Pre-Test Multiple Choice Identify the choice that best completes the statement or answers the question. 1 Solve the equation for g: 3 2g + 1 6g = 3. - 5
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. A linear functional µ[p ] = P (x) dµ(x), µ
More informationEngg. Math. I. Unit-I. Differential Calculus
Dr. Satish Shukla 1 of 50 Engg. Math. I Unit-I Differential Calculus Syllabus: Limits of functions, continuous functions, uniform continuity, monotone and inverse functions. Differentiable functions, Rolle
More informationMATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces.
MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces. Linear operations on vectors Let x = (x 1, x 2,...,x n ) and y = (y 1, y 2,...,y n ) be n-dimensional vectors, and r R be a scalar. Vector sum:
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationSchemes. Philipp Keding AT15, San Antonio, TX. Quarklet Frames in Adaptive Numerical. Schemes. Philipp Keding. Philipps-University Marburg
AT15, San Antonio, TX 5-23-2016 Joint work with Stephan Dahlke and Thorsten Raasch Let H be a Hilbert space with its dual H. We are interested in the solution u H of the operator equation Lu = f, with
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. 2 MEASURES
More informationA HIERARCHICAL 3-D DIRECT HELMHOLTZ SOLVER BY DOMAIN DECOMPOSITION AND MODIFIED FOURIER METHOD
SIAM J. SCI. COMPUT. Vol. 26, No. 5, pp. 1504 1524 c 2005 Society for Industrial and Applied Mathematics A HIERARCHICAL 3-D DIRECT HELMHOLTZ SOLVER BY DOMAIN DECOMPOSITION AND MODIFIED FOURIER METHOD E.
More informationPolynomial Review Problems
Polynomial Review Problems 1. Find polynomial function formulas that could fit each of these graphs. Remember that you will need to determine the value of the leading coefficient. The point (0,-3) is on
More informationHigher order derivatives of the inverse function
Higher order derivatives of the inverse function Andrej Liptaj Abstract A general recursive and limit formula for higher order derivatives of the inverse function is presented. The formula is next used
More informationTransactions on Modelling and Simulation vol 18, 1997 WIT Press, ISSN X
Application of the fast multipole method to the 3-D BEM analysis of electron guns T. Nishida and K. Hayami Department of Mathematical Engineering and Information Physics, School of Engineering, University
More informationCurve Fitting. Objectives
Curve Fitting Objectives Understanding the difference between regression and interpolation. Knowing how to fit curve of discrete with least-squares regression. Knowing how to compute and understand the
More informationPART III. Outline. Codes and Cryptography. Sources. Optimal Codes (I) Jorge L. Villar. MAMME, Fall 2015
Outline Codes and Cryptography 1 Information Sources and Optimal Codes 2 Building Optimal Codes: Huffman Codes MAMME, Fall 2015 3 Shannon Entropy and Mutual Information PART III Sources Information source:
More informationMath 32B Discussion Session Session 3 Notes August 14, 2018
Math 3B Discussion Session Session 3 Notes August 4, 8 In today s discussion we ll think about two common applications of multiple integrals: locating centers of mass and moments of inertia. Centers of
More informationToday we will prove one result from probability that will be useful in several statistical tests. ... B1 B2 Br. Figure 23.1:
Lecture 23 23. Pearson s theorem. Today we will prove one result from probability that will be useful in several statistical tests. Let us consider r boxes B,..., B r as in figure 23.... B B2 Br Figure
More informationOptimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints
Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints 1 Objectives Optimization of functions of multiple variables subjected to equality constraints
More informationMath 40510, Algebraic Geometry
Math 40510, Algebraic Geometry Problem Set 1, due February 10, 2016 1. Let k = Z p, the field with p elements, where p is a prime. Find a polynomial f k[x, y] that vanishes at every point of k 2. [Hint:
More informationOptimization and Calculus
Optimization and Calculus To begin, there is a close relationship between finding the roots to a function and optimizing a function. In the former case, we solve for x. In the latter, we solve: g(x) =
More informationNeed help? Try or 4.1 Practice Problems
Day Date Assignment (Due the next class meeting) Friday 9/29/17 (A) Monday 10/9/17 (B) 4.1 Operations with polynomials Tuesday 10/10/17 (A) Wednesday 10/11/17 (B) 4.2 Factoring and solving completely Thursday
More informationFast reversion of formal power series
Fast reversion of formal power series Fredrik Johansson LFANT, INRIA Bordeaux RAIM, 2016-06-29, Banyuls-sur-mer 1 / 30 Reversion of power series F = exp(x) 1 = x + x 2 2! + x 3 3! + x 4 G = log(1 + x)
More informationMath 2233 Homework Set 7
Math 33 Homework Set 7 1. Find the general solution to the following differential equations. If initial conditions are specified, also determine the solution satisfying those initial conditions. a y 4
More informationICES REPORT A Multilevel-WENO Technique for Solving Nonlinear Conservation Laws
ICES REPORT 7- August 7 A Multilevel-WENO Technique for Solving Nonlinear Conservation Laws by Todd Arbogast, Chieh-Sen Huang, and Xikai Zhao The Institute for Computational Engineering and Sciences The
More information(1) u i = g(x i, x j )q j, i = 1, 2,..., N, where g(x, y) is the interaction potential of electrostatics in the plane. 0 x = y.
Encyclopedia entry on Fast Multipole Methods. Per-Gunnar Martinsson, University of Colorado at Boulder, August 2012 Short definition. The Fast Multipole Method (FMM) is an algorithm for rapidly evaluating
More informationChapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010
Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression
More informationConvergence Order Studies for Elliptic Test Problems with COMSOL Multiphysics
Convergence Order Studies for Elliptic Test Problems with COMSOL Multiphysics Shiming Yang and Matthias K. Gobbert Abstract. The convergence order of finite elements is related to the polynomial order
More information1 Fundamental Concepts From Algebra & Precalculus
Fundamental Concepts From Algebra & Precalculus. Review Exercises.. Simplify eac expression.. 5 7) [ 5)) ]. ) 5) 7) 9 + 8 5. 8 [ 5) 8 6)] [9 + 8 5 ]. 9 + 8 5 ) 8) + 5. 5 + [ )6)] 7) 7 + 6 5 6. 8 5 ) 6
More informationarxiv: v1 [cs.lg] 26 Jul 2017
Updating Singular Value Decomposition for Rank One Matrix Perturbation Ratnik Gandhi, Amoli Rajgor School of Engineering & Applied Science, Ahmedabad University, Ahmedabad-380009, India arxiv:70708369v
More informationA Multilevel Proximal Algorithm for Large Scale Composite Convex Optimization
A Multilevel Proximal Algorithm for Large Scale Composite Convex Optimization Panos Parpas Department of Computing Imperial College London www.doc.ic.ac.uk/ pp500 p.parpas@imperial.ac.uk jointly with D.V.
More information