Applications of MPI I

Size: px
Start display at page:

Download "Applications of MPI I"

Transcription

1 Applications of MPI I N-Dimensional Integration Using Monte Carlo Techniques Gürsan ÇOBAN

2 Outline Numerical Integration Techniques Monte Carlo Techniques for Numerical Integration Some MPI Examples (3D) Using external library with domain decomposition (CUBA library) Comparisons of different techniques 2

3 Numerical Integration Techniques Consider the definite integral Numerical Integration Methods - Newton-Cotes Rules (interpolation) - Quadrature 3

4 Numerical Integration Techniques Consider the definite integral Numerical Integration Methods - Monte Carlo Integration (random sampling) F(x) 4

5 Numerical Integration Techniques Consider the definite integral Partition the interval into small subintervals Construct a polynomial approximation to f in each subinterval. Approximate the integral over the subinterval by the values of polynomial Sum these approximated values 5

6 Numerical Integration Techniques Decomposition of computing domain x x x x x x n x? x x x x x x n x 6

7 Numerical Integration Techniques N-dimensional integration f ( x, x2,, xn) dxdx2 dx n Multidimensional integrals can also be solved by using listed numerical methods Especially interpolation based methods have implicit numerical structures which exaggerates the number of unknowns. These are expensive methods for high dimensions 7

8 Numerical Integration Techniques For multidimensional Integral, if we divide each dimension into 5 subintervals we have, subdomains Quadrature based methods still suffer from high dimension operations (nested structure). 0 f ( x) f ( x) dx 0 0 i 0 w i f ( x, z f ( x ) i,, z 9 ) dz dz 9 8

9 Numerical Integration Techniques Monte Carlo Integration with hit or miss method (Method I) d - Let be a set that contains has known volume V - Generate n randomly distributed points in. nˆ is the number of these points that also lie in. The estimate of the volume is given by, nˆ V V n which corresponds to a multidimensional integration. 9

10 Numerical Integration Techniques Monte Carlo Integration with sample mean (Method II) - The method is based on the mean-value theorem of calculus which states that the definite integral is determined by the average value of the integrand f(x) in the range a x b. y x x x2 x3 0

11 Numerical Integration Techniques N computing Pi from the area of a quarter-circle. x 2 y 2 ( equation ) x 2 y 2 for(i=0; i<n;i++) { x=pow((rand()%000)/000.0,2.0); y=pow((rand()%000)/000.0,2.0); if(sqrt(x+y)<=) count_inside++; } pi = 4*(count_inside)/n;

12 Numerical Integration Techniques P0 Domain Decompositon P P2 P3 Computation Parallel Algorithm for Integration - The domain is divided into #procs subdomains. - Each processor computes in its own subdomain. - Finally the local results are summed by master processor to obtain the overall integral. Reduction P0 2

13 Parallel Code (Newton-Cotes) Domain Decomposition of D integration Filling the blanks in mpi_pi.c program with following conditions: I. Master MPI process (rank 0) sends the number of intervals n to all worker processors. Use MPI_Send and MPI_Recv in an iterative manner. II. Master collects the locally stored mypi values. Then master sums all mypi and stores the final sum in variable pi. Use MPI_Send and MPI_Recv in an iterative manner. 3

14 Parallel Code (Method I) P Estimation of volume of sphere and Pi in 3-D Filling the blanks in MCpi_3d_par.c program with following conditions: P0 P2 I. All processors should know the boundaries of the domain of integration. MyFloor MyCeiling II. Master collects the locally stored mycountinside values. Then master sums all mycountinside and stores the final sum in variable CountInside. Use MPI_Send and MPI_Recv in an iterative manner. 4

15 Parallelization of Scientific Libraries What are Scientific Libraries - GNU Scientific Library - Numerical Linear Algebra (Blas, Lapack, Super-LU) - Netlib Software Repository for Fortran - Cuba Numerical Integration Library For general purpose numerical routines that are statically (or dynamically) linked to the existing software. Various high precision routines that reduce code development time. 5

16 Parallelization of Cuba Library The Cuba library offers a choice of four independent routines for multidimensional numerical integration: Vegas, Suave, Divonne, and Cuhre. Routine Basic integration method Algorithm type Variance reduction Vegas Sobol quasi-random sample or Mersenne Twister pseudo-random sample Monte Carlo Monte Carlo importance sampling Suave Sobol quasi-random sample or Mersenne Twister pseudo-random sample Monte Carlo Monte Carlo globally adaptive subdivision + importance sampling Divonne Korobov quasi-random sample or Sobol quasi-random sample or Mersenne Twister pseudo-random sample or cubature rules Monte Carlo Monte Carlo Monte Carlo deterministic stratified sampling, aided by methods from numerical optimization Cuhre cubature rules deterministic globally adaptive subdivision 6

17 Parallelization of Cuba Library Cuba library static library creation consists of following steps: wget tar xvf Cuba-3.0.tar.gz cd Cuba-3.0./configure make The static library libcuba.a is created under Cuba-3.0 directory 7

18 Parallelization of Cuba Library Run the sample program cd Cuba-3.0/demo/ cp Cuba-3.0/cuba.h. mpicc -o demo.out demo-c.c../libcuba.a./demo.out 8

19 Parallelization of Cuba Library h Parallelize the sample code mpi_cuba.c. Apply initialization Apply domain decomposition (choose strategy) Write a send-recv block which collects local sums in an iterative manner. n n n n f ( x,, xn, xn) dx dx n dx n P 2 P N- P N local_a local_b 9

20 Değerlendirme Genel Değerlendirme Genel değerlendirme (her bir çalıştayın son günü): Günlük değerlendirme formları: 20

Package R2Cuba. October 2, 2015

Package R2Cuba. October 2, 2015 Title Multidimensional Numerical Integration Version 1.1-0 Date 2015-10-01 Package R2Cuba October 2, 2015 Author The Cuba library has been written by Thomas Hahn (http://wwwth.mppmu.mpg.de/members/hahn);

More information

arxiv:hep-ph/ v1 2 Sep 2005

arxiv:hep-ph/ v1 2 Sep 2005 arxiv:hep-ph/0509016v1 2 Sep 2005 The Cuba Library T. Hahn Max-Planck-Institut für Physik Föhringer Ring 6, D 80805 Munich, Germany Concepts and implementation of the Cuba library for multidimensional

More information

Integration. Volume Estimation

Integration. Volume Estimation Monte Carlo Integration Lab Objective: Many important integrals cannot be evaluated symbolically because the integrand has no antiderivative. Traditional numerical integration techniques like Newton-Cotes

More information

Cuba.jl Documentation

Cuba.jl Documentation Cuba.jl Documentation Release 0.4.0 Mose Giordano Jan 08, 2018 Contents 1 Introduction 1 2 Installation 3 3 Usage 5 3.1 Arguments................................................ 6 3.2 Optional Keywords............................................

More information

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies slides3-1 Parallel Techniques Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations Load Balancing

More information

Introduction to Parallel Programming Message Passing Interface Practical Session Part I

Introduction to Parallel Programming Message Passing Interface Practical Session Part I Introduction to Parallel Programming Message Passing Interface Practical Session Part I T. Streit, H.-J. Pflug streit@rz.rwth-aachen.de October 28, 2008 1 1. Examples We provide codes of the theoretical

More information

A Superconvergent Monte Carlo Method for Multiple Integrals on the Grid

A Superconvergent Monte Carlo Method for Multiple Integrals on the Grid A Superconvergent Monte Carlo Method for Multiple Integrals on the Grid Sofiya Ivanovska, Emanouil Atanassov, and Aneta Karaivanova Institute for Parallel Processing - Bulgarian Academy of Sciences, Acad.

More information

1.00 Lecture 32. Integration. Reading for next time: Numerical Recipes Packaging Functions in Objects

1.00 Lecture 32. Integration. Reading for next time: Numerical Recipes Packaging Functions in Objects 1.00 Lecture 32 Integration Reading for next time: Numerical Recipes 347-368 Packaging Functions in Objects Consider writing a method that evaluates, integrates or finds the roots of a function: Evaluate:

More information

Numerical Integration

Numerical Integration Numerical Integration Numerical Integration is the process of computing the value of a definite integral, when the values of the integrand function, are given at some tabular points. As in the case of

More information

Quasi-Monte Carlo Methods Combating Complexity in Cost Risk Analysis

Quasi-Monte Carlo Methods Combating Complexity in Cost Risk Analysis Quasi-Monte Carlo Methods Combating Complexity in Cost Risk Analysis Blake Boswell Booz Allen Hamilton ISPA / SCEA Conference Albuquerque, NM June 2011 1 Table Of Contents Introduction Monte Carlo Methods

More information

MPI Lab. How to split a problem across multiple processors Broadcasting input to other nodes Using MPI_Reduce to accumulate partial sums

MPI Lab. How to split a problem across multiple processors Broadcasting input to other nodes Using MPI_Reduce to accumulate partial sums MPI Lab Parallelization (Calculating π in parallel) How to split a problem across multiple processors Broadcasting input to other nodes Using MPI_Reduce to accumulate partial sums Sharing Data Across Processors

More information

Monte Carlo Integration COS 323

Monte Carlo Integration COS 323 Monte Carlo Integration COS 323 Last time Interpolatory Quadrature Review formulation; error analysis Newton-Cotes Quadrature Midpoint, Trapezoid, Simpson s Rule Error analysis for trapezoid, midpoint

More information

A Low Level Introduction to High Dimensional Sparse Grids

A 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 information

Embarrassingly Parallel Computations

Embarrassingly Parallel Computations Parallel Techniques Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations Strategies that achieve

More information

MULTI-DIMENSIONAL MONTE CARLO INTEGRATION

MULTI-DIMENSIONAL MONTE CARLO INTEGRATION CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals

More information

Photon Maps. The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces)

Photon Maps. The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces) Photon Mapping 1/36 Photon Maps The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces) As opposed to the radiosity method that stores information on surface

More information

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies. Load Balancing and Termination Detection

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies. Load Balancing and Termination Detection Parallel Techniques Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations Load Balancing and Termination

More information

Monte Carlo Integration and Random Numbers

Monte Carlo Integration and Random Numbers Monte Carlo Integration and Random Numbers Higher dimensional integration u Simpson rule with M evaluations in u one dimension the error is order M -4! u d dimensions the error is order M -4/d u In general

More information

Monte Carlo integration

Monte 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 information

MPI Lab. Steve Lantz Susan Mehringer. Parallel Computing on Ranger and Longhorn May 16, 2012

MPI Lab. Steve Lantz Susan Mehringer. Parallel Computing on Ranger and Longhorn May 16, 2012 MPI Lab Steve Lantz Susan Mehringer Parallel Computing on Ranger and Longhorn May 16, 2012 1 MPI Lab Parallelization (Calculating p in parallel) How to split a problem across multiple processors Broadcasting

More information

Random and Parallel Algorithms a journey from Monte Carlo to Las Vegas

Random and Parallel Algorithms a journey from Monte Carlo to Las Vegas Random and Parallel Algorithms a journey from Monte Carlo to Las Vegas Google Maps couldn t help! Bogdán Zaválnij Institute of Mathematics and Informatics University of Pecs Ljubljana, 2014 Bogdán Zaválnij

More information

MPI Programming. Henrik R. Nagel Scientific Computing IT Division

MPI Programming. Henrik R. Nagel Scientific Computing IT Division 1 MPI Programming Henrik R. Nagel Scientific Computing IT Division 2 Outline Introduction Finite Difference Method Finite Element Method LU Factorization SOR Method Monte Carlo Method Molecular Dynamics

More information

Math 226A Homework 4 Due Monday, December 11th

Math 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

Halftoning and quasi-monte Carlo

Halftoning and quasi-monte Carlo Halftoning and quasi-monte Carlo Ken Hanson CCS-2, Methods for Advanced Scientific Simulations Los Alamos National Laboratory This presentation available at http://www.lanl.gov/home/kmh/ LA-UR-04-1854

More information

Monte Carlo Integration

Monte Carlo Integration Lab 18 Monte Carlo Integration Lab Objective: Implement Monte Carlo integration to estimate integrals. Use Monte Carlo Integration to calculate the integral of the joint normal distribution. Some multivariable

More information

Computational modeling

Computational modeling Computational modeling Lecture 5 : Monte Carlo Integration Physics: Integration The Monte Carlo method Programming: Subroutine Differences Subroutine/Function The Fortran random number subroutine Monte

More information

Intel Performance Libraries

Intel Performance Libraries Intel Performance Libraries Powerful Mathematical Library Intel Math Kernel Library (Intel MKL) Energy Science & Research Engineering Design Financial Analytics Signal Processing Digital Content Creation

More information

PPCES 2016: MPI Lab March 2016 Hristo Iliev, Portions thanks to: Christian Iwainsky, Sandra Wienke

PPCES 2016: MPI Lab March 2016 Hristo Iliev, Portions thanks to: Christian Iwainsky, Sandra Wienke PPCES 2016: MPI Lab 16 17 March 2016 Hristo Iliev, iliev@itc.rwth-aachen.de Portions thanks to: Christian Iwainsky, Sandra Wienke Synopsis The purpose of this hands-on lab is to make you familiar with

More information

Monte Carlo Simulations

Monte Carlo Simulations Monte Carlo Simulations DESCRIPTION AND APPLICATION Outline Introduction Description of Method Cost Estimating Example Other Considerations Introduction Most interesting things are probabilistic (opinion)

More information

Introduction to Optimization

Introduction to Optimization Introduction to Optimization Second Order Optimization Methods Marc Toussaint U Stuttgart Planned Outline Gradient-based optimization (1st order methods) plain grad., steepest descent, conjugate grad.,

More information

B. Examples Set up the integral(s) needed to find the area of the region bounded by

B. Examples Set up the integral(s) needed to find the area of the region bounded by Math 176 Calculus Sec. 6.1: Area Between Curves I. Area between the Curve and the x Axis A. Let f(x) 0 be continuous on [a,b]. The area of the region between the graph of f and the x-axis is A = f ( x)

More information

Modern Methods of Data Analysis - WS 07/08

Modern Methods of Data Analysis - WS 07/08 Modern Methods of Data Analysis Lecture XV (04.02.08) Contents: Function Minimization (see E. Lohrmann & V. Blobel) Optimization Problem Set of n independent variables Sometimes in addition some constraints

More information

AMath 483/583 Lecture 22. Notes: Another Send/Receive example. Notes: Notes: Another Send/Receive example. Outline:

AMath 483/583 Lecture 22. Notes: Another Send/Receive example. Notes: Notes: Another Send/Receive example. Outline: AMath 483/583 Lecture 22 Outline: MPI Master Worker paradigm Linear algebra LAPACK and the BLAS References: $UWHPSC/codes/mpi class notes: MPI section class notes: Linear algebra Another Send/Receive example

More information

DEDICATIONS. To my dear parents, and sisters. To my advisor Dr. Mahmoud Alrefaei. To my friends in and out the university.

DEDICATIONS. To my dear parents, and sisters. To my advisor Dr. Mahmoud Alrefaei. To my friends in and out the university. DEDICATIONS To my dear parents, and sisters. To my advisor Dr. Mahmoud Alrefaei. To my friends in and out the university. i ii TABLE OF CONTENTS Dedications Acknowledgements Table of Contents List of Tables

More information

Computer Experiments. Designs

Computer 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 information

L20 MPI Example, Numerical Integration. Let s now consider a real problem to write a parallel code for. Let s take the case of numerical integration.

L20 MPI Example, Numerical Integration. Let s now consider a real problem to write a parallel code for. Let s take the case of numerical integration. Geophysical Computing L20-1 L20 MPI Example, Numerical Integration 1. Numerical Integration Let s now consider a real problem to write a parallel code for. Let s take the case of numerical integration.

More information

Supercomputing in Plain English Exercise #6: MPI Point to Point

Supercomputing in Plain English Exercise #6: MPI Point to Point Supercomputing in Plain English Exercise #6: MPI Point to Point In this exercise, we ll use the same conventions and commands as in Exercises #1, #2, #3, #4 and #5. You should refer back to the Exercise

More information

GPU Integral Computations in Stochastic Geometry

GPU Integral Computations in Stochastic Geometry Outline GPU Integral Computations in Stochastic Geometry Department of Computer Science Western Michigan University June 25, 2013 Outline Outline 1 Introduction 2 3 4 Outline Outline 1 Introduction 2 3

More information

lslogin3$ cd lslogin3$ tar -xvf ~train00/mpibasic_lab.tar cd mpibasic_lab/pi cd mpibasic_lab/decomp1d

lslogin3$ cd lslogin3$ tar -xvf ~train00/mpibasic_lab.tar cd mpibasic_lab/pi cd mpibasic_lab/decomp1d MPI Lab Getting Started Login to ranger.tacc.utexas.edu Untar the lab source code lslogin3$ cd lslogin3$ tar -xvf ~train00/mpibasic_lab.tar Part 1: Getting Started with simple parallel coding hello mpi-world

More information

Monte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara

Monte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara Monte Carlo Simula/on and Copula Func/on by Gerardo Ferrara Introduc)on A Monte Carlo method is a computational algorithm that relies on repeated random sampling to compute its results. In a nutshell,

More information

1. Practice the use of the C ++ repetition constructs of for, while, and do-while. 2. Use computer-generated random numbers.

1. Practice the use of the C ++ repetition constructs of for, while, and do-while. 2. Use computer-generated random numbers. 1 Purpose This lab illustrates the use of looping structures by introducing a class of programming problems called numerical algorithms. 1. Practice the use of the C ++ repetition constructs of for, while,

More information

Distributed Memory Programming With MPI Computer Lab Exercises

Distributed Memory Programming With MPI Computer Lab Exercises Distributed Memory Programming With MPI Computer Lab Exercises Advanced Computational Science II John Burkardt Department of Scientific Computing Florida State University http://people.sc.fsu.edu/ jburkardt/classes/acs2

More information

Math 1206 Calculus Sec. 5.6: Substitution and Area Between Curves (Part 2) Overview of Area Between Two Curves

Math 1206 Calculus Sec. 5.6: Substitution and Area Between Curves (Part 2) Overview of Area Between Two Curves Math 1206 Calculus Sec. 5.6: Substitution and Area Between Curves (Part 2) III. Overview of Area Between Two Curves With a few modifications the area under a curve represented by a definite integral can

More information

The Plan: Basic statistics: Random and pseudorandom numbers and their generation: Chapter 16.

The Plan: Basic statistics: Random and pseudorandom numbers and their generation: Chapter 16. Scientific Computing with Case Studies SIAM Press, 29 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 28 What is a Monte-Carlo method?

More information

Numerical Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania

Numerical Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania Numerical Dynamic Programming Jesus Fernandez-Villaverde University of Pennsylvania 1 Introduction In the last set of lecture notes, we reviewed some theoretical background on numerical programming. Now,

More information

PAMIHR. A Parallel FORTRAN Program for Multidimensional Quadrature on Distributed Memory Architectures

PAMIHR. 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

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit IV Monte Carlo

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit IV Monte Carlo Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 2008 1 What is a Monte-Carlo

More information

1. In this problem we use Monte Carlo integration to approximate the area of a circle of radius, R = 1.

1. In this problem we use Monte Carlo integration to approximate the area of a circle of radius, R = 1. 1. In this problem we use Monte Carlo integration to approximate the area of a circle of radius, R = 1. A. For method 1, the idea is to conduct a binomial experiment using the random number generator:

More information

Numerical Integration

Numerical Integration Lecture 12: Numerical Integration (with a focus on Monte Carlo integration) Computer Graphics CMU 15-462/15-662, Fall 2015 Review: fundamental theorem of calculus Z b f(x)dx = F (b) F (a) a f(x) = d dx

More information

Acknowledgments. Amdahl s Law. Contents. Programming with MPI Parallel programming. 1 speedup = (1 P )+ P N. Type to enter text

Acknowledgments. Amdahl s Law. Contents. Programming with MPI Parallel programming. 1 speedup = (1 P )+ P N. Type to enter text Acknowledgments Programming with MPI Parallel ming Jan Thorbecke Type to enter text This course is partly based on the MPI courses developed by Rolf Rabenseifner at the High-Performance Computing-Center

More information

A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions

A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions Emanouil I. Atanassov, Ivan T. Dimov, and Mariya K. Durchova Central Laboratory for Parallel Processing, Bulgarian Academy

More information

MPI Tutorial. Shao-Ching Huang. High Performance Computing Group UCLA Institute for Digital Research and Education

MPI Tutorial. Shao-Ching Huang. High Performance Computing Group UCLA Institute for Digital Research and Education MPI Tutorial Shao-Ching Huang High Performance Computing Group UCLA Institute for Digital Research and Education Center for Vision, Cognition, Learning and Art, UCLA July 15 22, 2013 A few words before

More information

STEPHEN WOLFRAM MATHEMATICADO. Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS

STEPHEN WOLFRAM MATHEMATICADO. Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS STEPHEN WOLFRAM MATHEMATICADO OO Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS Table of Contents XXI a section new for Version 3 a section new for Version 4 a section substantially modified for

More information

Problem #3 Daily Lessons and Assessments for AP* Calculus AB, A Complete Course Page Mark Sparks 2012

Problem #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 information

APPM/MATH Problem Set 4 Solutions

APPM/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 information

D01GCF NAG Fortran Library Routine Document

D01GCF NAG Fortran Library Routine Document D1 Quadrature D1GCF 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

More information

A MIXED QUADRATURE FORMULA USING RULES OF LOWER ORDER

A MIXED QUADRATURE FORMULA USING RULES OF LOWER ORDER Bulletin of the Marathwada Mathematical Society Vol.5, No., June 004, Pages 6-4 ABSTRACT A MIXED QUADRATURE FORMULA USING RULES OF LOWER ORDER Namita Das And Sudhir Kumar Pradhan P.G. Department of Mathematics

More information

Double Integration: Non-Rectangular Domains

Double Integration: Non-Rectangular Domains Double Integration: Non-Rectangular Domains Thomas Banchoff and Associates June 18, 2003 1 Introduction In calculus of one variable, all domains are intervals which are subsets of the line. In calculus

More information

Applications of Integration. Copyright Cengage Learning. All rights reserved.

Applications of Integration. Copyright Cengage Learning. All rights reserved. Applications of Integration Copyright Cengage Learning. All rights reserved. Area of a Region Between Two Curves Copyright Cengage Learning. All rights reserved. Objectives Find the area of a region between

More information

7.6 Simple Monte Carlo Integration. 304 Chapter 7. Random Numbers

7.6 Simple Monte Carlo Integration. 304 Chapter 7. Random Numbers 304 Chapter 7. Random Numbers psdes(&lword,&irword); Pseudo-DES encode the words. itemp=jflone (jflmsk & irword); Mask to a floating number between 1 and ++(*idum); 2. return (*(float *)&itemp)-1.0; Subtraction

More information

Introduction to the Message Passing Interface (MPI)

Introduction to the Message Passing Interface (MPI) Introduction to the Message Passing Interface (MPI) CPS343 Parallel and High Performance Computing Spring 2018 CPS343 (Parallel and HPC) Introduction to the Message Passing Interface (MPI) Spring 2018

More information

Combinatorial Search; Monte Carlo Methods

Combinatorial Search; Monte Carlo Methods Combinatorial Search; Monte Carlo Methods Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico May 02, 2016 CPD (DEI / IST) Parallel and Distributed

More information

Lab 5 Monte Carlo integration

Lab 5 Monte Carlo integration Lab 5 Monte Carlo integration Edvin Listo Zec 9065-976 edvinli@student.chalmers.se October 0, 014 Co-worker: Jessica Fredby Introduction In this computer assignment we will discuss a technique for solving

More information

7.7 Quasi- (that is, Sub-) Random Sequences

7.7 Quasi- (that is, Sub-) Random Sequences 77 Quasi- (that is, Sub-) Random Sequences 299 If you think for a minute, you will realize that equation (767) was useful only because the part of the integrand that we wanted to eliminate (e 5z ) was

More information

Computational Methods. Randomness and Monte Carlo Methods

Computational Methods. Randomness and Monte Carlo Methods Computational Methods Randomness and Monte Carlo Methods Manfred Huber 2010 1 Randomness and Monte Carlo Methods Introducing randomness in an algorithm can lead to improved efficiencies Random sampling

More information

Non-blocking Communications

Non-blocking Communications Non-blocking Communications 名古屋大学情報基盤中心教授片桐孝洋 Takahiro Katagiri, Professor, Information Technology Center, Nagoya University 國家理論中心數學組 高效能計算 短期課程 1 Agenda 1. Technical terms of MPI for 1-to-1 communications

More information

VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung

VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung POLYTECHNIC UNIVERSITY Department of Computer and Information Science VARIANCE REDUCTION TECHNIQUES IN MONTE CARLO SIMULATIONS K. Ming Leung Abstract: Techniques for reducing the variance in Monte Carlo

More information

Interpolation & Polynomial Approximation. Cubic Spline Interpolation II

Interpolation & Polynomial Approximation. Cubic Spline Interpolation II Interpolation & Polynomial Approximation Cubic Spline Interpolation II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University

More information

Reliable Adaptive Algorithms for Integration, Interpolation and Optimization

Reliable Adaptive Algorithms for Integration, Interpolation and Optimization Reliable Adaptive Algorithms for Integration, Interpolation and Optimization Fred J. Hickernell Department of Applied Mathematics, Illinois Institute of Technology hickernell@iit.edu mypages.iit.edu/~hickernell

More information

Random Numbers and Monte Carlo Methods

Random Numbers and Monte Carlo Methods Random Numbers and Monte Carlo Methods Methods which make use of random numbers are often called Monte Carlo Methods after the Monte Carlo Casino in Monaco which has long been famous for games of chance.

More information

Introduction to OpenMP

Introduction to OpenMP Introduction to OpenMP Christian Terboven 10.04.2013 / Darmstadt, Germany Stand: 06.03.2013 Version 2.3 Rechen- und Kommunikationszentrum (RZ) History De-facto standard for

More information

MPI Case Study. Fabio Affinito. April 24, 2012

MPI Case Study. Fabio Affinito. April 24, 2012 MPI Case Study Fabio Affinito April 24, 2012 In this case study you will (hopefully..) learn how to Use a master-slave model Perform a domain decomposition using ghost-zones Implementing a message passing

More information

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 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 information

OpenMP Overview. in 30 Minutes. Christian Terboven / Aachen, Germany Stand: Version 2.

OpenMP Overview. in 30 Minutes. Christian Terboven / Aachen, Germany Stand: Version 2. OpenMP Overview in 30 Minutes Christian Terboven 06.12.2010 / Aachen, Germany Stand: 03.12.2010 Version 2.3 Rechen- und Kommunikationszentrum (RZ) Agenda OpenMP: Parallel Regions,

More information

Know it. Control points. B Spline surfaces. Implicit surfaces

Know it. Control points. B Spline surfaces. Implicit surfaces Know it 15 B Spline Cur 14 13 12 11 Parametric curves Catmull clark subdivision Parametric surfaces Interpolating curves 10 9 8 7 6 5 4 3 2 Control points B Spline surfaces Implicit surfaces Bezier surfaces

More information

Parallel Monte Carlo Approach for Integration of the Rendering Equation

Parallel Monte Carlo Approach for Integration of the Rendering Equation Parallel Monte Carlo Approach for Integration of the Rendering Equation Ivan T. Dimov 1,AntonA.Penzov 2, and Stanislava S. Stoilova 3 1 Institute for Parallel Processing, Bulgarian Academy of Sciences,

More information

Scientific Computing

Scientific Computing Lecture on Scientific Computing Dr. Kersten Schmidt Lecture 20 Technische Universität Berlin Institut für Mathematik Wintersemester 2014/2015 Syllabus Linear Regression, Fast Fourier transform Modelling

More information

Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 2019

Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 2019 Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 219 http://hadron.physics.fsu.edu/~eugenio/comphy/ eugenio@fsu.edu f(x) trapezoidal rule Series Integration review from

More information

Computational Physics PHYS 420

Computational Physics PHYS 420 Computational Physics PHYS 420 Dr Richard H. Cyburt Assistant Professor of Physics My office: 402c in the Science Building My phone: (304) 384-6006 My email: rcyburt@concord.edu My webpage: www.concord.edu/rcyburt

More information

Teaching numerical methods : a first experience. Ronojoy Adhikari The Institute of Mathematical Sciences Chennai.

Teaching numerical methods : a first experience. Ronojoy Adhikari The Institute of Mathematical Sciences Chennai. Teaching numerical methods : a first experience Ronojoy Adhikari The Institute of Mathematical Sciences Chennai. Numerical Methods : the first class 14 students, spread across second and third years of

More information

Introduction to Parallel Computing

Introduction to Parallel Computing Introduction to Parallel Computing W. P. Petersen Seminar for Applied Mathematics Department of Mathematics, ETHZ, Zurich wpp@math. ethz.ch P. Arbenz Institute for Scientific Computing Department Informatik,

More information

Previous Lecture: Today s Lecture: Announcements: Nesting if-statements Logical operators short-circuit. Iteration using for

Previous Lecture: Today s Lecture: Announcements: Nesting if-statements Logical operators short-circuit. Iteration using for Previous Lecture: Nesting if-statements Logical operators short-circuit Today s Lecture: Iteration using for Announcements: Discussion this week is in the classrooms as listed in Student Center Register

More information

6 BLAS (Basic Linear Algebra Subroutines)

6 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 information

Embarrassingly Parallel Computations

Embarrassingly Parallel Computations Embarrassingly Parallel Computations A computation that can be divided into a number of completely independent parts, each of which can be executed by a separate processor. Input data Processes Results

More information

CMSC 714 Lecture 4 OpenMP and UPC. Chau-Wen Tseng (from A. Sussman)

CMSC 714 Lecture 4 OpenMP and UPC. Chau-Wen Tseng (from A. Sussman) CMSC 714 Lecture 4 OpenMP and UPC Chau-Wen Tseng (from A. Sussman) Programming Model Overview Message passing (MPI, PVM) Separate address spaces Explicit messages to access shared data Send / receive (MPI

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction A Monte Carlo method is a compuational method that uses random numbers to compute (estimate) some quantity of interest. Very often the quantity we want to compute is the mean of

More information

Mathematical Libraries and Application Software on JUROPA, JUGENE, and JUQUEEN. JSC Training Course

Mathematical Libraries and Application Software on JUROPA, JUGENE, and JUQUEEN. JSC Training Course Mitglied der Helmholtz-Gemeinschaft Mathematical Libraries and Application Software on JUROPA, JUGENE, and JUQUEEN JSC Training Course May 22, 2012 Outline General Informations Sequential Libraries Parallel

More information

TEACHING & EXAMINATION SCHEME For the Examination COMPUTER SCIENCE. B.Sc. Part-I

TEACHING & EXAMINATION SCHEME For the Examination COMPUTER SCIENCE. B.Sc. Part-I TEACHING & EXAMINATION SCHEME For the Examination -2015 COMPUTER SCIENCE THEORY B.Sc. Part-I CS.101 Paper I Computer Oriented Numerical Methods and FORTRAN Pd/W Exam. Max. (45mts.) Hours Marks 150 2 3

More information

Parallel Processing. Dr. Guy Tel-Zur

Parallel Processing. Dr. Guy Tel-Zur Parallel Processing Dr. Guy Tel-Zur Agenda Sending a 2D array in MPI Network Performance Revisited Collective commands Send/Recv types and summary Performance Evaluation of Parallel Programs PBS demo mpip

More information

f( x ), or a solution to the equation f( x) 0. You are already familiar with ways of solving

f( x ), or a solution to the equation f( x) 0. You are already familiar with ways of solving The Bisection Method and Newton s Method. If f( x ) a function, then a number r for which f( r) 0 is called a zero or a root of the function f( x ), or a solution to the equation f( x) 0. You are already

More information

Parallel Mesh Partitioning in Alya

Parallel Mesh Partitioning in Alya Available online at www.prace-ri.eu Partnership for Advanced Computing in Europe Parallel Mesh Partitioning in Alya A. Artigues a *** and G. Houzeaux a* a Barcelona Supercomputing Center ***antoni.artigues@bsc.es

More information

Introduction to Laboratories

Introduction to Laboratories Introduction to Laboratories Lab 1 Demonstration of a typical industrial robot Introduction to main components of a typical robot Introduction to Laboratories Lab 2: Teaching and Repeatability Teaching:

More information

7.7 Quasi- (that is, Sub-) Random Sequences

7.7 Quasi- (that is, Sub-) Random Sequences 77 Quasi- (that is, Sub-) Random Sequences 39 CITED REFERENCES AND FURTHER READING: Hammersley, JM, and Handscomb, DC 1964, Monte Carlo Methods (London: Methuen) Shreider, Yu A (ed) 1966, The Monte Carlo

More information

Math 11 Fall 2016 Section 1 Monday, October 17, 2016

Math 11 Fall 2016 Section 1 Monday, October 17, 2016 Math 11 Fall 16 Section 1 Monday, October 17, 16 First, some important points from the last class: f(x, y, z) dv, the integral (with respect to volume) of f over the three-dimensional region, is a triple

More information

Curves and Surfaces Computer Graphics I Lecture 9

Curves and Surfaces Computer Graphics I Lecture 9 15-462 Computer Graphics I Lecture 9 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] February 19, 2002 Frank Pfenning Carnegie

More information

Monte Carlo Integration

Monte Carlo Integration Chapter 2 Monte Carlo Integration This chapter gives an introduction to Monte Carlo integration. The main goals are to review some basic concepts of probability theory, to define the notation and terminology

More information

An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s.

An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Using Monte Carlo to Estimate π using Buffon s Needle Problem An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Here s the problem (in a simplified form). Suppose

More information

Monte Carlo Methods. Named by Stanislaw Ulam and Nicholas Metropolis in 1940s for the famous gambling casino in Monaco.

Monte Carlo Methods. Named by Stanislaw Ulam and Nicholas Metropolis in 1940s for the famous gambling casino in Monaco. Monte Carlo Methods Named by Stanislaw Ulam and Nicholas Metropolis in 1940s for the famous gambling casino in Monaco. Used in numerous applications. Any method that uses random numbers to solve a problem

More information

The following information is for reviewing the material since Exam 3:

The following information is for reviewing the material since Exam 3: Outcomes List for Math 121 Calculus I Fall 2010-2011 General Information: The purpose of this Outcomes List is to give you a concrete summary of the material you should know, and the skills you should

More information

Dense matrix algebra and libraries (and dealing with Fortran)

Dense matrix algebra and libraries (and dealing with Fortran) Dense matrix algebra and libraries (and dealing with Fortran) CPS343 Parallel and High Performance Computing Spring 2018 CPS343 (Parallel and HPC) Dense matrix algebra and libraries (and dealing with Fortran)

More information