Cubature Rules for High-dimensional Adaptive Integration
|
|
- Ruth Stone
- 6 years ago
- Views:
Transcription
1 Cubature Rules for High-dimensional Adaptive Integration January 24 th, 2001 Rudolf Schrer 1
2 The Problem Given a function f :C s, with C s denoting an s-dimensional hyper-rectangular region [r 1 ; t 1 ] [r s ; t s ] s. Calculate an approximation Qf for the multivariate integral If := f(x) dx. C s 2
3 Basic Principle of Numerical Integration: Q n f = n i=1 w i f(x i ) Q n f If 0 for n. Fast! All x i should be inside C s n i=1 w i should be as small as possible If some w i or x i depend on previously calculated f(x j ) with j < i, the algorithm is called adaptive. 3
4 Scope of this Talk Only about adaptive algorithms based on interpolatory cubature rules Especially on the impact of different cubature formulas on the standard algorithm 4
5 Adaptive Algorithm 1. Calculate estimation for result and error for the whole region. 2. Store region and estimations in region collection. 3. Take region with highest estimated error from collection 4. Split into subregions 5. Calculate estimation for result and error for these subregions 6. Store regions and estimations 7. If not finished, goto 2 Step 1 and 4 require Cubature Rules for estimation of result and error. 5
6 Parallelization Manager-Worker Approach Manager responsible for region management Workers check out regions do refinements (maybe multiple times) return results Does not scale: Bottleneck! 6
7 Decentralized Design No dedicated manager. equal. All nodes are Every node maintains its own region collection, containing one subset of a partition of the initial domain Topology: Multi-dimensional periodic mesh Nodes talk only to their neighbors to exchange bad regions Nodes perform local refinements, interrupted by redistribution procedure Performance inferior to sequential algorithm, but good scalability 7
8 Benchmark # Correct Digits PNs 4 PNs 8 PNs 16 PNs 32 PNs LocalList - Corner Peak, dim= Time (msec) PNs 4 PNs 8 PNs 16 PNs 32 PNs LocalList - Corner Peak, dim=10 Speed-up # Correct Digits 8
9 Cubature Rules Take advantage of the smoothness of f! Construct Cubature Rules that are exact for all polynomials up to a certain degree ( Interpolatory Formulas) Smooth functions can be approximated by polynomials (Weierstrass et al.) Interpolatory formulas can be expected to give good results for smooth functions The integral of a polynomial can be calculated analytically 9
10 Error Estimation Use two rules Q n and Q m of different degree (deg Q n > deg Q m ) For most f, Q n f Q m f > Q n f If, which gives an upper bound on the integration error. Embedded Rules: Abscissas of Q m are a subset of abscissas of Q n, so no extra integrand evaluation are performed 10
11 Construction of multi-variate cubature rules There is no silver bullet! Momentum Equations: Invent basic structure One equation for each monomial Non-linear Solutions must not be complex Abscissas must be inside C s n i=1 w i should be small Rule should exist for arbitrary dimensions Building simple rules is guessing 11
12 Example Degree 5, C s = [ 1; 1] s Basic Structure: Abscissas w i #Abscissas (0,..., 0) W 0 1 (α, 0,..., 0) FS W 1 2s (α, α, 0,..., 0) FS W 2 2s(s 1) 2s Momentum Equations: All monomials? 1, x 1,..., x s, x 2 1,..., x2 s, x 2 1 x3 2, x5 1,... Monomials: 1, x 2 1, x2 1 x2 2, x4 1 Equations, e. g. for monomial x 2 1 : W W 1 α 2 + 4(s 1)W 2 α 2 = 2s 3 12
13 Implemented Rules Name Deg n ni=1 w i Midpoint Octahedron 3 2s 1 Product Gauss 3 2 s 1 Hammer & Stroud 5 O(s 2 ) O(s) Stroud 5 O(s 2 ) O(s) Phillips 7 O(s 3 ) O(s 2 ) Dobrodeev 7 O(s 3 ) O(s 2 ) Stenger 9 O(s 4 ) O(s 3 ) Genz & Malik 7 O(2 s ) O(s) High degree is not enough (Genz & Malik does better than Phillips) #abscissas in Genz & Malik increases exponentially, but for s 11 it uses less points than Phillips Genz & Malik is already an embedded Rule 13
14 Testing Accuracy Compare accuracy and take number of integrand evaluations into account Test setup: Calculate accuracy for given number of integrand evaluations Determine the number of possible rule evaluations Split C s. Distribute splitting evenly on all dimensions Apply rule to each sub-cube Add up results 14
15 Results # Correct Digits Comp_1Midpoint Comp_3Gauss Comp_3Octahedron Comp_5Hammer Comp_5Stroud Comp_7-5Genz Comp_7Dobrodeev Comp_7Phillips Comp_9Stenger Corner Peak, dim= e+06 1e+07 # Integrand Evaluations # Correct Digits Comp_1Midpoint Comp_3Gauss Comp_3Octahedron Comp_5Hammer Comp_5Stroud Comp_7-5Genz Comp_7Dobrodeev Comp_7Phillips Comp_9Stenger Product Peak, dim= e+06 1e+07 # Integrand Evaluations 15
16 Testing Error Estimation We do not need good approximations We do not need reliable upper bounds What we need is: implies E (B 1) f > E (B 2) f Q (B 1) f I (B 1 ) f > Q (B 2) f I (B 2 ) f 16
17 Testing Error Estimation Test procedure: Create k = random cubes C s Apply rule to each sub-cube and estimate integral and error Sort sub-cubes by real error (Position r i ) Sort sub-cubes by estimated error (Position e i ) Calculate quality parameter k (r i e i ) 2 i=1 17
18 Results # Integrand Evaluations GenzMalik Phillips-Hammer Stenger-Phillips Hammer-Octahedron Phillips-Hammer-Stroud Corner Peak, dim=7 0 1e+08 1e+09 1e+10 1e+11 Errors # Integrand Evaluations GenzMalik Phillips-Hammer Stenger-Phillips Hammer-Octahedron Phillips-Hammer-Stroud C0, dim=15 0 1e+06 1e+07 1e+08 Errors 18
19 Final Results Discontinuous, dim=10, #PN=16 Adapt_7-5Genz_LL Adapt_9-7_LL Adapt_7-5-5_LL Adapt_5-3_LL Niederreiter_Net_Comp_NoLB # Correct Digits # Correct Digits e+06 1e+07 # Integrand Evaluations Gaussian, dim=30, #PN=16 Adapt_9-7_LL Adapt_7-5-5_LL Adapt_5-3_LL Niederreiter_Net_Comp_NoLB e+06 1e+07 # Integrand Evaluations 19
CHAPTER 5 NUMERICAL INTEGRATION METHODS OVER N- DIMENSIONAL REGIONS USING GENERALIZED GAUSSIAN QUADRATURE
CHAPTER 5 NUMERICAL INTEGRATION METHODS OVER N- DIMENSIONAL REGIONS USING GENERALIZED GAUSSIAN QUADRATURE 5.1 Introduction Multidimensional integration appears in many mathematical models and can seldom
More informationNodal Basis Functions for Serendipity Finite Elements
Nodal Basis Functions for Serendipity Finite Elements Andrew Gillette Department of Mathematics University of Arizona joint work with Michael Floater (University of Oslo) Andrew Gillette - U. Arizona Nodal
More informationnag 1d quad gauss (d01bac)
1. Purpose nag 1d quad gauss () nag 1d quad gauss () computes an estimate of the definite integral of a function of known analytical form, using a Gaussian quadrature formula with a specified number of
More informationnag 1d quad gauss 1 (d01tac)
1. Purpose nag 1d quad gauss 1 () nag 1d quad gauss 1 () computes an estimate of the definite integral of a function of known analytical form, using a Gaussian quadrature formula with a specified number
More informationNAG Library Routine Document D01BAF.1
NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationContents. Hilary Term. Summary of Numerical Analysis for this term. Sources of error in numerical calculation. Solving Problems
Contents Hilary Term 1 Root Finding 4 11 Bracketing and Bisection 5 111 Finding the root numerically 5 112 Pseudo BRACKET code 7 113 Drawbacks 8 114 Tips for success with Bracketing & Bisection 9 115 Virtues
More informationCross-Parameterization and Compatible Remeshing of 3D Models
Cross-Parameterization and Compatible Remeshing of 3D Models Vladislav Kraevoy Alla Sheffer University of British Columbia Authors Vladislav Kraevoy Ph.D. Student Alla Sheffer Assistant Professor Outline
More informationD01FCF NAG Fortran Library Routine Document
D01FCF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationTopologies. Maurizio Palesi. Maurizio Palesi 1
Topologies Maurizio Palesi Maurizio Palesi 1 Network Topology Static arrangement of channels and nodes in an interconnection network The roads over which packets travel Topology chosen based on cost and
More informationA Low Level Introduction to High Dimensional Sparse Grids
A Low Level Introduction to High Dimensional Sparse Grids http://people.sc.fsu.edu/ jburkardt/presentations/sandia 2007.pdf... John 1 Clayton Webster 2 1 Virginia Tech 2 Sandia National Laboratory. 21
More informationAn Introduction to PDF Estimation and Clustering
Sigmedia, Electronic Engineering Dept., Trinity College, Dublin. 1 An Introduction to PDF Estimation and Clustering David Corrigan corrigad@tcd.ie Electrical and Electronic Engineering Dept., University
More informationSome Open Problems in Graph Theory and Computational Geometry
Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research
More informationJoe Warren, Scott Schaefer Rice University
Joe Warren, Scott Schaefer Rice University Polygons are a ubiquitous modeling primitive in computer graphics. Their popularity is such that special purpose graphics hardware designed to render polygons
More informationNetwork-on-chip (NOC) Topologies
Network-on-chip (NOC) Topologies 1 Network Topology Static arrangement of channels and nodes in an interconnection network The roads over which packets travel Topology chosen based on cost and performance
More informationComputer Experiments. Designs
Computer Experiments Designs Differences between physical and computer Recall experiments 1. The code is deterministic. There is no random error (measurement error). As a result, no replication is needed.
More informationProblem #3 Daily Lessons and Assessments for AP* Calculus AB, A Complete Course Page Mark Sparks 2012
Problem # Daily Lessons and Assessments for AP* Calculus AB, A Complete Course Page 490 Mark Sparks 01 Finding Anti-derivatives of Polynomial-Type Functions If you had to explain to someone how to find
More informationImproved Attack on Full-round Grain-128
Improved Attack on Full-round Grain-128 Ximing Fu 1, and Xiaoyun Wang 1,2,3,4, and Jiazhe Chen 5, and Marc Stevens 6, and Xiaoyang Dong 2 1 Department of Computer Science and Technology, Tsinghua University,
More information10th August Part One: Introduction to Parallel Computing
Part One: Introduction to Parallel Computing 10th August 2007 Part 1 - Contents Reasons for parallel computing Goals and limitations Criteria for High Performance Computing Overview of parallel computer
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 4
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationAPPM/MATH Problem Set 4 Solutions
APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal
More informationClustering Part 4 DBSCAN
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationLecture 3 Box-partitions and dimension of spline spaces over Box-partition
Lecture 3 Box-partitions and dimension of spline spaces over Box-partition Definition of LR B-splines some geometric properties Tor Dokken CIME-EMS Summer School June 8 - June, 0 Cetraro, Italy Box-partitions
More information10.7 Triple Integrals. The Divergence Theorem of Gauss
10.7 riple Integrals. he Divergence heorem of Gauss We begin by recalling the definition of the triple integral f (x, y, z) dv, (1) where is a bounded, solid region in R 3 (for example the solid ball {(x,
More informationSection 1.1 The Distance and Midpoint Formulas; Graphing Utilities; Introduction to Graphing Equations
Section 1.1 The Distance and Midpoint Formulas; Graphing Utilities; Introduction to Graphing Equations origin (x, y) Ordered pair (x-coordinate, y-coordinate) (abscissa, ordinate) x axis Rectangular or
More informationAdaptive numerical methods
METRO MEtallurgical TRaining On-line Adaptive numerical methods Arkadiusz Nagórka CzUT Education and Culture Introduction Common steps of finite element computations consists of preprocessing - definition
More informationScanning Real World Objects without Worries 3D Reconstruction
Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects
More informationLinear Regression and K-Nearest Neighbors 3/28/18
Linear Regression and K-Nearest Neighbors 3/28/18 Linear Regression Hypothesis Space Supervised learning For every input in the data set, we know the output Regression Outputs are continuous A number,
More informationNon-Parametric Modeling
Non-Parametric Modeling CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Introduction Non-Parametric Density Estimation Parzen Windows Kn-Nearest Neighbor
More informationWhat is Performance for Internet/Grid Computation?
Goals for Internet/Grid Computation? Do things you cannot otherwise do because of: Lack of Capacity Large scale computations Cost SETI Scale/Scope of communication Internet searches All of the above 9/10/2002
More informationSimulation Details for 2D
Appendix B Simulation Details for 2D In this appendix we add some details two-dimensional simulation method. The details provided here describe the method used to obtain results reported in Chapters 3
More informationEasy way to Find Multivariate Interpolation
International Journal of Emerging Trends in Science Technology IC Value: 7689 (Index Copernicus) Impact Factor: 4219 DOI: https://dxdoiorg/1018535/ijetst/v4i511 Easy way to Find Multivariate Interpolation
More informationMonte Carlo integration
Monte Carlo integration Introduction Monte Carlo integration is a quadrature (cubature) where the nodes are chosen randomly. Typically no assumptions are made about the smoothness of the integrand, not
More informationMore Ways to Solve & Graph Quadratics The Square Root Property If x 2 = a and a R, then x = ± a
More Ways to Solve & Graph Quadratics The Square Root Property If x 2 = a and a R, then x = ± a Example: Solve using the square root property. a) x 2 144 = 0 b) x 2 + 144 = 0 c) (x + 1) 2 = 12 Completing
More informationw KLUWER ACADEMIC PUBLISHERS Global Optimization with Non-Convex Constraints Sequential and Parallel Algorithms Roman G. Strongin Yaroslav D.
Global Optimization with Non-Convex Constraints Sequential and Parallel Algorithms by Roman G. Strongin Nizhni Novgorod State University, Nizhni Novgorod, Russia and Yaroslav D. Sergeyev Institute of Systems
More informationLecture 3: Sorting 1
Lecture 3: Sorting 1 Sorting Arranging an unordered collection of elements into monotonically increasing (or decreasing) order. S = a sequence of n elements in arbitrary order After sorting:
More informationBasis Functions. Volker Tresp Summer 2017
Basis Functions Volker Tresp Summer 2017 1 Nonlinear Mappings and Nonlinear Classifiers Regression: Linearity is often a good assumption when many inputs influence the output Some natural laws are (approximately)
More informationFour equations are necessary to evaluate these coefficients. Eqn
1.2 Splines 11 A spline function is a piecewise defined function with certain smoothness conditions [Cheney]. A wide variety of functions is potentially possible; polynomial functions are almost exclusively
More informationConvergence of C 2 Deficient Quartic Spline Interpolation
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 4 (2017) pp. 519-527 Research India Publications http://www.ripublication.com Convergence of C 2 Deficient Quartic Spline
More informationSYSTEMS OF NONLINEAR EQUATIONS
SYSTEMS OF NONLINEAR EQUATIONS Widely used in the mathematical modeling of real world phenomena. We introduce some numerical methods for their solution. For better intuition, we examine systems of two
More informationA spectral boundary element method
Boundary Elements XXVII 165 A spectral boundary element method A. Calaon, R. Adey & J. Baynham Wessex Institute of Technology, Southampton, UK Abstract The Boundary Element Method (BEM) is not local and
More information6 BLAS (Basic Linear Algebra Subroutines)
161 BLAS 6.1 Motivation 6 BLAS (Basic Linear Algebra Subroutines) 6.1 Motivation How to optimise programs that use a lot of linear algebra operations? Efficiency depends on but also on: processor speed
More informationChanging Variables in Multiple Integrals
Changing Variables in Multiple Integrals 3. Examples and comments; putting in limits. If we write the change of variable formula as (x, y) (8) f(x, y)dx dy = g(u, v) dudv, (u, v) where (x, y) x u x v (9)
More informationSubdivision Curves and Surfaces: An Introduction
Subdivision Curves and Surfaces: An Introduction Corner Cutting De Casteljau s and de Boor s algorithms all use corner-cutting procedures. Corner cutting can be local or non-local. A cut is local if it
More informationFathi El-Yafi Project and Software Development Manager Engineering Simulation
An Introduction to Geometry Design Algorithms Fathi El-Yafi Project and Software Development Manager Engineering Simulation 1 Geometry: Overview Geometry Basics Definitions Data Semantic Topology Mathematics
More informationMAT Business Calculus - Quick Notes
MAT 136 - Business Calculus - Quick Notes Last Updated: 4/3/16 Chapter 2 Applications of Differentiation Section 2.1 Using First Derivatives to Find Maximum and Minimum Values and Sketch Graphs THE FIRST-DERIVATIVE
More informationChapter 5 Efficient Memory Information Retrieval
Chapter 5 Efficient Memory Information Retrieval In this chapter, we will talk about two topics: (1) What is a kd-tree? (2) How can we use kdtrees to speed up the memory-based learning algorithms? Since
More informationUniversity of California, Berkeley
University of California, Berkeley FINAL EXAMINATION, Fall 2012 DURATION: 3 hours Department of Mathematics MATH 53 Multivariable Calculus Examiner: Sean Fitzpatrick Total: 100 points Family Name: Given
More informationA study on adaptive algorithms for numerical quadrature on heterogeneous GPU and multicore based systems
A study on adaptive algorithms for numerical quadrature on heterogeneous GPU and multicore based systems Giuliano Laccetti 1, Marco Lapegna 1, Valeria Mele 1, Diego Romano 2 1 Deptartment of Mathematics
More informationD01ARF NAG Fortran Library Routine Document
D01ARF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More information4.7 Approximate Integration
4.7 Approximate Integration Some anti-derivatives are difficult to impossible to find. For example, 1 0 e x2 dx or 1 1 1 + x3 dx We came across this situation back in calculus I when we introduced the
More informationCS 450 Numerical Analysis. Chapter 7: Interpolation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationSegmentation and Grouping
Segmentation and Grouping How and what do we see? Fundamental Problems ' Focus of attention, or grouping ' What subsets of pixels do we consider as possible objects? ' All connected subsets? ' Representation
More informationEvaluation of Loop Subdivision Surfaces
Evaluation of Loop Subdivision Surfaces Jos Stam Alias wavefront, Inc. 8 Third Ave, 8th Floor, Seattle, WA 980, U.S.A. jstam@aw.sgi.com Abstract This paper describes a technique to evaluate Loop subdivision
More informationSolving Linear Recurrence Relations (8.2)
EECS 203 Spring 2016 Lecture 18 Page 1 of 10 Review: Recurrence relations (Chapter 8) Last time we started in on recurrence relations. In computer science, one of the primary reasons we look at solving
More informationRendering Algebraic Surfaces CS348B Final Project
Rendering Algebraic Surfaces CS348B Final Project Gennadiy Chuyeshov Overview This project is devoted to the visualization of a class consisting of implicit algebraic surfaces in three-dimensional space,
More informationNumerical integration of polynomials and discontinuous functions on irregular convex polygons and polyhedrons
Noname manuscript No. (will be inserted by the editor) Numerical integration of polynomials and discontinuous functions on irregular convex polygons and polyhedrons S. E. Mousavi N. Sukumar Received: date
More informationDomain Decomposition and hp-adaptive Finite Elements
Domain Decomposition and hp-adaptive Finite Elements Randolph E. Bank 1 and Hieu Nguyen 1 Department of Mathematics, University of California, San Diego, La Jolla, CA 9093-011, USA, rbank@ucsd.edu. Department
More informationSmooth rounded corner. Smooth rounded corner. Smooth rounded corner
3.2 Graphs of Higher Degree Polynomial Functions Definition of a Polynomial Function Let n be a nonnegative integer and let a n, a n-1,,a 2, a 1, a 0, be real numbers with a n 0. The function defined by
More informationInterpolatory 3-Subdivision
EUROGRAPHICS 2000 / M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19 (2000), Number 3 Interpolatory 3-Subdivision U. Labsik G. Greiner Computer Graphics Group University of Erlangen-Nuremberg Am Weichselgarten
More informationA Basic Introduction to QtiPlot
1 Introduction A Basic Introduction to QtiPlot What is QtiPlot: a program that could: 1) represent data graphically; 2) do data analysis. 2 Installation Steps for installing QtiPlot: Go to this link: http://www.qtiplot.com/download.html
More informationTopological Issues in Hexahedral Meshing
Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationMath 205B - Topology. Dr. Baez. January 19, Christopher Walker. p(x) = (cos(2πx), sin(2πx))
Math 205B - Topology Dr. Baez January 19, 2007 Christopher Walker Theorem 53.1. The map p : R S 1 given by the equation is a covering map p(x) = (cos(2πx), sin(2πx)) Proof. First p is continuous since
More informationVolume Enclosed by Example Subdivision Surfaces
Volume Enclosed by Example Subdivision Surfaces by Jan Hakenberg - May 5th, this document is available at vixra.org and hakenberg.de Abstract Simple meshes such as the cube, tetrahedron, and tripod frequently
More informationMATRIX INTEGRALS AND MAP ENUMERATION 1
MATRIX INTEGRALS AND MAP ENUMERATION 1 IVAN CORWIN Abstract. We explore the connection between integration with respect to the GUE and enumeration of maps. This connection is faciliated by the Wick Formula.
More informationGeometric data structures:
Geometric data structures: Machine Learning for Big Data CSE547/STAT548, University of Washington Sham Kakade Sham Kakade 2017 1 Announcements: HW3 posted Today: Review: LSH for Euclidean distance Other
More informationNodal Integration Technique in Meshless Method
IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE) e-issn: 2278-1684,p-ISSN: 2320-334X, Volume 11, Issue 1 Ver. IV (Feb. 2014), PP 18-26 Nodal Integration Technique in Meshless Method Ahmed MJIDILA
More informationDetecting and Identifying Moving Objects in Real-Time
Chapter 9 Detecting and Identifying Moving Objects in Real-Time For surveillance applications or for human-computer interaction, the automated real-time tracking of moving objects in images from a stationary
More informationAPPENDIX: DETAILS ABOUT THE DISTANCE TRANSFORM
APPENDIX: DETAILS ABOUT THE DISTANCE TRANSFORM To speed up the closest-point distance computation, 3D Euclidean Distance Transform (DT) can be used in the proposed method. A DT is a uniform discretization
More informationEuler s formula n e + f = 2 and Platonic solids
Euler s formula n e + f = and Platonic solids Euler s formula n e + f = and Platonic solids spherical projection makes these planar graphs Euler s formula n e + f = and Platonic solids spherical projection
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationMath 226A Homework 4 Due Monday, December 11th
Math 226A Homework 4 Due Monday, December 11th 1. (a) Show that the polynomial 2 n (T n+1 (x) T n 1 (x)), is the unique monic polynomial of degree n + 1 with roots at the Chebyshev points x k = cos ( )
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationCS281 Section 3: Practical Optimization
CS281 Section 3: Practical Optimization David Duvenaud and Dougal Maclaurin Most parameter estimation problems in machine learning cannot be solved in closed form, so we often have to resort to numerical
More informationObject Recognition Using Pictorial Structures. Daniel Huttenlocher Computer Science Department. In This Talk. Object recognition in computer vision
Object Recognition Using Pictorial Structures Daniel Huttenlocher Computer Science Department Joint work with Pedro Felzenszwalb, MIT AI Lab In This Talk Object recognition in computer vision Brief definition
More informationDynamic Programming. An Introduction to DP
Dynamic Programming An Introduction to DP Dynamic Programming? A programming technique Solve a problem by breaking into smaller subproblems Similar to recursion with memoisation Usefulness: Efficiency
More informationGeostatistics Predictions with Deterministic Procedures
Instituto Superior de Estatística e Gestão de Informação Universidade Nova de Lisboa Master of Science in Geospatial Technologies Geostatistics Predictions with Deterministic Procedures Carlos Alberto
More informationA Geometric Approach to the Bisection Method
Geometric pproach to the isection Method laudio Gutierrez 1, Flavio Gutierrez 2, and Maria-ecilia Rivara 1 1 epartment of omputer Science, Universidad de hile lanco Encalada 2120, Santiago, hile {cgutierr,mcrivara}@dcc.uchile.cl
More informationComputational Geometry
Windowing queries Windowing Windowing queries Zoom in; re-center and zoom in; select by outlining Windowing Windowing queries Windowing Windowing queries Given a set of n axis-parallel line segments, preprocess
More informationAppropriate Gaussian quadrature formulae for triangles
International Journal of Applied Mathematics and Computation Journal homepage: www.darbose.in/ijamc ISSN: 097-665 (Print) 097-673 (Online) Volume (1) 01 3 Appropriate Gaussian quadrature formulae for triangles
More informationMATH 417 Homework 8 Instructor: D. Cabrera Due August 4. e i(2z) (z 2 +1) 2 C R. z 1 C 1. 2 (z 2 + 1) dz 2. φ(z) = ei(2z) (z i) 2
MATH 47 Homework 8 Instructor: D. abrera Due August 4. ompute the improper integral cos x (x + ) dx Solution: To evaluate the integral consider the complex integral e i(z) (z + ) dz where is the union
More informationCOMP/CS 605: Introduction to Parallel Computing Topic: Parallel Computing Overview/Introduction
COMP/CS 605: Introduction to Parallel Computing Topic: Parallel Computing Overview/Introduction Mary Thomas Department of Computer Science Computational Science Research Center (CSRC) San Diego State University
More informationChapter 3. Numerical Differentiation, Interpolation, and Integration. Instructor: Dr. Ming Ye
Chapter 3 Numerical Differentiation, Interpolation, and Integration Instructor: Dr. Ming Ye Measuring Flow in Natural Channels Mean-Section Method (1) Divide the stream into a number of rectangular elements
More informationReconstruction of Images Distorted by Water Waves
Reconstruction of Images Distorted by Water Waves Arturo Donate and Eraldo Ribeiro Computer Vision Group Outline of the talk Introduction Analysis Background Method Experiments Conclusions Future Work
More informationALF USER GUIDE. Date: September
ALF USER GUIDE R. VERFÜRTH Contents 1. Introduction 1 2. User interface 2 3. Domain and initial grid 3 4. Differential equation 9 5. Discretization 12 6. Solver 12 7. Mesh refinement 14 8. Number of nodes
More information1) Find. a) b) c) d) e) 2) The function g is defined by the formula. Find the slope of the tangent line at x = 1. a) b) c) e) 3) Find.
1 of 7 1) Find 2) The function g is defined by the formula Find the slope of the tangent line at x = 1. 3) Find 5 1 The limit does not exist. 4) The given function f has a removable discontinuity at x
More informationData Partitioning. Figure 1-31: Communication Topologies. Regular Partitions
Data In single-program multiple-data (SPMD) parallel programs, global data is partitioned, with a portion of the data assigned to each processing node. Issues relevant to choosing a partitioning strategy
More informationLecture 17 - Friday May 8th
Lecture 17 - Friday May 8th jacques@ucsd.edu Key words: Multiple integrals Key concepts: Know how to evaluate multiple integrals 17.1 Multiple Integrals A rectangular parallelepiped in R n is a set of
More informationSubdivision Curves and Surfaces
Subdivision Surfaces or How to Generate a Smooth Mesh?? Subdivision Curves and Surfaces Subdivision given polyline(2d)/mesh(3d) recursively modify & add vertices to achieve smooth curve/surface Each iteration
More informationCPSC 340: Machine Learning and Data Mining. Principal Component Analysis Fall 2017
CPSC 340: Machine Learning and Data Mining Principal Component Analysis Fall 2017 Assignment 3: 2 late days to hand in tonight. Admin Assignment 4: Due Friday of next week. Last Time: MAP Estimation MAP
More informationDaubechies Wavelets and Interpolating Scaling Functions and Application on PDEs
Daubechies Wavelets and Interpolating Scaling Functions and Application on PDEs R. Schneider F. Krüger TUB - Technical University of Berlin November 22, 2007 R. Schneider F. Krüger Daubechies Wavelets
More informationAppendix E Calculating Normal Vectors
OpenGL Programming Guide (Addison-Wesley Publishing Company) Appendix E Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Frank C. Langbein F.C.Langbein@cs.cf.ac.uk Department of Computer Science Cardiff University 13th February 2001 Constraint Satisfaction Problems (CSPs) A CSP is a high
More informationPractical Parallel Processing
Talk at Royal Military Academy, Brussels, May 2004 Practical Parallel Processing Jan Lemeire Parallel Systems lab Vrije Universiteit Brussel (VUB) Parallel@RMA 1 /21 Example: Matrix Multiplication C =
More informationAn Investigation into Iterative Methods for Solving Elliptic PDE s Andrew M Brown Computer Science/Maths Session (2000/2001)
An Investigation into Iterative Methods for Solving Elliptic PDE s Andrew M Brown Computer Science/Maths Session (000/001) Summary The objectives of this project were as follows: 1) Investigate iterative
More informationAdaptive-Mesh-Refinement Pattern
Adaptive-Mesh-Refinement Pattern I. Problem Data-parallelism is exposed on a geometric mesh structure (either irregular or regular), where each point iteratively communicates with nearby neighboring points
More informationarxiv: v3 [physics.comp-ph] 3 Jun 2015
Computing the demagnetizing tensor for finite difference micromagnetic simulations via numerical integration arxiv:143.1978v3 [physics.comp-ph] 3 Jun 215 Dmitri S. Chernyshenko and Hans Fangohr Engineering
More informationInstance-based Learning CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2015
Instance-based Learning CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2015 Outline Non-parametric approach Unsupervised: Non-parametric density estimation Parzen Windows K-Nearest
More informationQuadratic Functions Dr. Laura J. Pyzdrowski
1 Names: (8 communication points) About this Laboratory A quadratic function in the variable x is a polynomial where the highest power of x is 2. We will explore the domains, ranges, and graphs of quadratic
More informationPAMIHR. A Parallel FORTRAN Program for Multidimensional Quadrature on Distributed Memory Architectures
PAMIHR. A Parallel FORTRAN Program for Multidimensional Quadrature on Distributed Memory Architectures G. Laccetti and M. Lapegna Center for Research on Parallel Computing and Supercomputers - CNR University
More information