CUDA Implementation of the Lattice Boltzmann Method
|
|
|
- Marsha Kennedy
- 6 years ago
- Views:
Transcription
1 CUDA Implementation of the Lattice Boltzmann Method CSE 633 Parallel Algorithms Andrew Leach University at Buffalo 2 Dec 2010 A. Leach (University at Buffalo) CUDA LBM Nov / 16
2 Motivation The Lattice Boltzmann Method(LBM) solves the Navier-Stokes equation accurately and efficiently. A. Leach (University at Buffalo) CUDA LBM Nov / 16
3 Motivation The Lattice Boltzmann Method(LBM) solves the Navier-Stokes equation accurately and efficiently. Uniformity makes it easy to parallelize. A. Leach (University at Buffalo) CUDA LBM Nov / 16
4 Motivation The Lattice Boltzmann Method(LBM) solves the Navier-Stokes equation accurately and efficiently. Uniformity makes it easy to parallelize. High volume of simple calculations make it ideal for GPGPU computing. A. Leach (University at Buffalo) CUDA LBM Nov / 16
5 LBM Degrees of Freedom F2 F6 F5 F3 F1 F7 F8 F4 Each lattice point has an associated mass density A. Leach (University at Buffalo) CUDA LBM Nov / 16
6 LBM Degrees of Freedom F2 F6 F5 F3 F1 F7 F8 F4 Each lattice point has an associated mass density This mass density is projected in 9 directions A. Leach (University at Buffalo) CUDA LBM Nov / 16
7 LBM Stream F8 F4 F7 F1 F3 F5 F2 F6 At each time step, each neighbor passes mass density A. Leach (University at Buffalo) CUDA LBM Nov / 16
8 LBM Collision F6 F2 F5 F3 F1 F7 F4 F8 Collision occurs with the accepted mass densities A. Leach (University at Buffalo) CUDA LBM Nov / 16
9 LBM Collision F6 F2 F5 F3 F1 F7 F4 F8 Collision occurs with the accepted mass densities Equillibrium condition is solved A. Leach (University at Buffalo) CUDA LBM Nov / 16
10 LBM Collision F6 F2 F5 F3 F1 F7 F4 F8 Collision occurs with the accepted mass densities Equillibrium condition is solved New projected mass densities are assigned A. Leach (University at Buffalo) CUDA LBM Nov / 16
11 LBM Boundary Conditions Bounceback is implemented at solid boundaries A. Leach (University at Buffalo) CUDA LBM Nov / 16
12 LBM Boundary Conditions Bounceback is implemented at solid boundaries The inlet has predetermined mass density A. Leach (University at Buffalo) CUDA LBM Nov / 16
13 LBM Boundary Conditions Bounceback is implemented at solid boundaries The inlet has predetermined mass density The outlet accepts outward flow A. Leach (University at Buffalo) CUDA LBM Nov / 16
14 Code: Data Structures F1 HOST Device Data initialized as an array on host A. Leach (University at Buffalo) CUDA LBM Nov / 16
15 Code: Data Structures F1 HOST Data initialized as an array on host Pitch stores the width of a row in memory, determined by CudaMallocPitch() Device A. Leach (University at Buffalo) CUDA LBM Nov / 16
16 Code: Data Structures F1 HOST Data initialized as an array on host Pitch stores the width of a row in memory, determined by CudaMallocPitch() Memory is allocated on the device linear memory with CudaMallocArray() Device A. Leach (University at Buffalo) CUDA LBM Nov / 16
17 Code: Data Structures F1 HOST Data initialized as an array on host Pitch stores the width of a row in memory, determined by CudaMallocPitch() Memory is allocated on the device linear memory with CudaMallocArray() Array copied from host to device with CudaMemcpy2D() Device A. Leach (University at Buffalo) CUDA LBM Nov / 16
18 Code: Textures The stream step requires a lot of data retrieval A. Leach (University at Buffalo) CUDA LBM Nov / 16
19 Code: Textures The stream step requires a lot of data retrieval Texture memory has fast retrieval but limited space A. Leach (University at Buffalo) CUDA LBM Nov / 16
20 Code: Textures The stream step requires a lot of data retrieval Texture memory has fast retrieval but limited space Use cudabindtexturetoarray() to copy data as a texture A. Leach (University at Buffalo) CUDA LBM Nov / 16
21 Code: Kernels A kernel is launched on a grid of blocks A. Leach (University at Buffalo) CUDA LBM Nov / 16
22 Code: Kernels A kernel is launched on a grid of blocks Each block consists of threads which will independently run the kernel(simd) A. Leach (University at Buffalo) CUDA LBM Nov / 16
23 Code: Kernels A kernel is launched on a grid of blocks Each block consists of threads which will independently run the kernel(simd) What follows is the Kernel for the stream() method. This example utilizes a lock-step texture look up. A. Leach (University at Buffalo) CUDA LBM Nov / 16
24 Code: Stream A. Leach (University at Buffalo) CUDA LBM Nov / 16
25 Runtime Analysis The following slides contain graphs comparing run times for the LBM on a laptop with 1.3 GHZ processor running sequential C code and a single Tesla GPU running parallel code in CUDA. The change in performance based on block size is also explored. A. Leach (University at Buffalo) CUDA LBM Nov / 16
26 Sequential vs Parallel Time A. Leach (University at Buffalo) CUDA LBM Nov / 16
27 Sequential vs Parallel Time (s Comparison A. Leach (University at Buffalo) CUDA LBM Nov / 16
28 Sequential vs Parallel speed up (X A. Leach (University at Buffalo) CUDA LBM Nov / 16
29 Thank You Thanks to Dr.Graham Pullan from Cambridge University for letting me use and modify his code. A. Leach (University at Buffalo) CUDA LBM Nov / 16
30 Bibliography Alexander Wagner, A Practical Introduction to the Lattice Boltzmann Method. North Dakota State University, March Graham Pullan, A 2D Lattice Boltzmann Flow Solver Demo. University of Cambridge. A. Leach (University at Buffalo) CUDA LBM Nov / 16
History of Monte Carlo Method
Monte Carlo Methods History of Monte Carlo Method Errors in Estimation and Two Important Questions for Monte Carlo Controlling Error A simple Monte Carlo simulation to approximate the value of pi could
Monte-Carlo Pricing under a Hybrid Local Volatility model
Monte-Carlo Pricing under a Hybrid Local Volatility model Mizuho International plc GPU Technology Conference San Jose, 14-17 May 2012 Introduction Key Interests in Finance Pricing of exotic derivatives
PRICING AMERICAN OPTIONS WITH LEAST SQUARES MONTE CARLO ON GPUS. Massimiliano Fatica, NVIDIA Corporation
PRICING AMERICAN OPTIONS WITH LEAST SQUARES MONTE CARLO ON GPUS Massimiliano Fatica, NVIDIA Corporation OUTLINE! Overview! Least Squares Monte Carlo! GPU implementation! Results! Conclusions OVERVIEW!
Financial Computations on the GPU
Financial Computations on the GPU A Major Qualifying Project Report Submitted to the Faculty Of the WORCESTER POLYTECHNIC INSTITUTE In partial fulfillment of the requirements for the Degree of Bachelor
Financial Mathematics and Supercomputing
GPU acceleration in early-exercise option valuation Álvaro Leitao and Cornelis W. Oosterlee Financial Mathematics and Supercomputing A Coruña - September 26, 2018 Á. Leitao & Kees Oosterlee SGBM on GPU
GRAPHICAL ASIAN OPTIONS
GRAPHICAL ASIAN OPTIONS MARK S. JOSHI Abstract. We discuss the problem of pricing Asian options in Black Scholes model using CUDA on a graphics processing unit. We survey some of the issues with GPU programming
Stochastic Grid Bundling Method
Stochastic Grid Bundling Method GPU Acceleration Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee London - December 17, 2015 A. Leitao &
Black-Scholes option pricing. Victor Podlozhnyuk
Black-Scholes option pricing Victor Podlozhnyuk vpodlozhnyuk@nvidia.com Document Change History Version Date Responsible Reason for Change 0.9 007/03/19 Victor Podlozhnyuk Initial release 1.0 007/04/06
Monte Carlo Option Pricing
Monte Carlo Option Pricing Victor Podlozhnyuk vpodlozhnyuk@nvidia.com Mark Harris mharris@nvidia.com Document Change History Version Date Responsible Reason for Change 1. 2/3/27 vpodlozhnyuk Initial release
Computational Finance in CUDA. Options Pricing with Black-Scholes and Monte Carlo
Computational Finance in CUDA Options Pricing with Black-Scholes and Monte Carlo Overview CUDA is ideal for finance computations Massive data parallelism in finance Highly independent computations High
New GPU Pricing Library
New GPU Pricing Library! Client project for Bank Sarasin! Highly regarded sustainable Swiss private bank! Founded 1841! Core business! Asset management! Investment advisory! Investment funds! Structured
6.4 Solving Linear Inequalities by Using Addition and Subtraction
6.4 Solving Linear Inequalities by Using Addition and Subtraction Solving EQUATION vs. INEQUALITY EQUATION INEQUALITY To solve an inequality, we USE THE SAME STRATEGY AS FOR SOLVING AN EQUATION: ISOLATE
Extra Practice Chapter 6
Extra Practice Chapter 6 Topics Include: Equation of a Line y = mx + b & Ax + By + C = 0 Graphing from Equations Parallel & Perpendicular Find an Equation given Solving Systems of Equations 6. - Practice:
CUDA-enabled Optimisation of Technical Analysis Parameters
CUDA-enabled Optimisation of Technical Analysis Parameters John O Rourke (Allied Irish Banks) School of Science and Computing Institute of Technology, Tallaght Dublin 24, Ireland Email: John.ORourke@ittdublin.ie
Towards efficient option pricing in incomplete markets
Towards efficient option pricing in incomplete markets GPU TECHNOLOGY CONFERENCE 2016 Shih-Hau Tan 1 2 1 Marie Curie Research Project STRIKE 2 University of Greenwich Apr. 6, 2016 (University of Greenwich)
HPC IN THE POST 2008 CRISIS WORLD
GTC 2016 HPC IN THE POST 2008 CRISIS WORLD Pierre SPATZ MUREX 2016 STANFORD CENTER FOR FINANCIAL AND RISK ANALYTICS HPC IN THE POST 2008 CRISIS WORLD Pierre SPATZ MUREX 2016 BACK TO 2008 FINANCIAL MARKETS
Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA
Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA Rajesh Bordawekar and Daniel Beece IBM T. J. Watson Research Center 3/17/2015 2014 IBM Corporation
Pricing Early-exercise options
Pricing Early-exercise options GPU Acceleration of SGBM method Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee Lausanne - December 4, 2016
Architecture Exploration for Tree-based Option Pricing Models
Architecture Exploration for Tree-based Option Pricing Models MEng Final Year Project Report Qiwei Jin qj04@doc.ic.ac.uk http://www.doc.ic.ac.uk/ qj04/project Supervisor: Prof. Wayne Luk 2nd Marker: Dr.
Outline. GPU for Finance SciFinance SciFinance CUDA Risk Applications Testing. Conclusions. Monte Carlo PDE
Outline GPU for Finance SciFinance SciFinance CUDA Risk Applications Testing Monte Carlo PDE Conclusions 2 Why GPU for Finance? Need for effective portfolio/risk management solutions Accurately measuring,
Liangzi AUTO: A Parallel Automatic Investing System Based on GPUs for P2P Lending Platform. Gang CHEN a,*
2017 2 nd International Conference on Computer Science and Technology (CST 2017) ISBN: 978-1-60595-461-5 Liangzi AUTO: A Parallel Automatic Investing System Based on GPUs for P2P Lending Platform Gang
NAG for HPC in Finance
NAG for HPC in Finance John Holden Jacques Du Toit 3 rd April 2014 Computation in Finance and Insurance, post Napier Experts in numerical algorithms and HPC services Agenda NAG and Financial Services Why
List the quadrant(s) in which the given point is located. 1) (-10, 0) A) On an axis B) II C) IV D) III
MTH 55 Chapter 2 HW List the quadrant(s) in which the given point is located. 1) (-10, 0) 1) A) On an axis B) II C) IV D) III 2) The first coordinate is positive. 2) A) I, IV B) I, II C) III, IV D) II,
Mark Redekopp, All rights reserved. EE 357 Unit 12. Performance Modeling
EE 357 Unit 12 Performance Modeling An Opening Question An Intel and a Sun/SPARC computer measure their respective rates of instruction execution on the same application written in C Mark Redekopp, All
GPU-Accelerated Quant Finance: The Way Forward
GPU-Accelerated Quant Finance: The Way Forward NVIDIA GTC Express Webinar Gerald A. Hanweck, Jr., PhD CEO, Hanweck Associates, LLC Hanweck Associates, LLC 30 Broad St., 42nd Floor New York, NY 10004 www.hanweckassoc.com
A distributed Laplace transform algorithm for European options
A distributed Laplace transform algorithm for European options 1 1 A. J. Davies, M. E. Honnor, C.-H. Lai, A. K. Parrott & S. Rout 1 Department of Physics, Astronomy and Mathematics, University of Hertfordshire,
Accelerating Quantitative Financial Computing with CUDA and GPUs
Accelerating Quantitative Financial Computing with CUDA and GPUs NVIDIA GPU Technology Conference San Jose, California Gerald A. Hanweck, Jr., PhD CEO, Hanweck Associates, LLC Hanweck Associates, LLC 30
Application of High Performance Computing in Investment Banks
British Computer Society FiNSG and APSG Public Application of High Performance Computing in Investment Banks Dr. Tony K. Chau Lead Architect, IB CTO, UBS January 8, 2014 Table of contents Section 1 UBS
SPEED UP OF NUMERIC CALCULATIONS USING A GRAPHICS PROCESSING UNIT (GPU)
SPEED UP OF NUMERIC CALCULATIONS USING A GRAPHICS PROCESSING UNIT (GPU) NIKOLA VASILEV, DR. ANATOLIY ANTONOV Eurorisk Systems Ltd. 31, General Kiselov str. BG-9002 Varna, Bulgaria Phone +359 52 612 367
Accelerating Financial Computation
Accelerating Financial Computation Wayne Luk Department of Computing Imperial College London HPC Finance Conference and Training Event Computational Methods and Technologies for Finance 13 May 2013 1 Accelerated
F1 Acceleration for Montecarlo: financial algorithms on FPGA
F1 Acceleration for Montecarlo: financial algorithms on FPGA Presented By Liang Ma, Luciano Lavagno Dec 10 th 2018 Contents Financial problems and mathematical models High level synthesis Optimization
MDPs: Bellman Equations, Value Iteration
MDPs: Bellman Equations, Value Iteration Sutton & Barto Ch 4 (Cf. AIMA Ch 17, Section 2-3) Adapted from slides kindly shared by Stuart Russell Sutton & Barto Ch 4 (Cf. AIMA Ch 17, Section 2-3) 1 Appreciations
Modeling Path Dependent Derivatives Using CUDA Parallel Platform
Modeling Path Dependent Derivatives Using CUDA Parallel Platform A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Mathematical Sciences in the Graduate School of The
arxiv: v1 [q-fin.cp] 17 Jan 2011
![arxiv: v1 [q-fin.cp] 17 Jan 2011](/thumbs/83/88792374.jpg "arxiv: v1 [q-fin.cp] 17 Jan 2011")
arxiv:1101.3228v1 [q-fin.cp] 17 Jan 2011 GPGPUs in computational finance: Massive parallel computing for American style options Gilles Pagès Benedikt Wilbertz January 18, 2011 Abstract The pricing of American
Barrier Option. 2 of 33 3/13/2014
FPGA-based Reconfigurable Computing for Pricing Multi-Asset Barrier Options RAHUL SRIDHARAN, GEORGE COOKE, KENNETH HILL, HERMAN LAM, ALAN GEORGE, SAAHPC '12, PROCEEDINGS OF THE 2012 SYMPOSIUM ON APPLICATION
Enhanced Shell Sorting Algorithm
Enhanced ing Algorithm Basit Shahzad, and Muhammad Tanvir Afzal Abstract Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion sort
A t S + b r t T B (h i + 1) (t S + t T ) C h i (t S + t T ) + t S + b t T D (h i + n) (t S + t T )
Suppose we have a primary B+-tree index where the leaves contain search keys and RIDs, and the RIDs point to the records in a file that is ordered on the index search key. Assume that the blocks in the
Efficient Reconfigurable Design for Pricing Asian Options
Efficient Reconfigurable Design for Pricing Asian Options Anson H.T. Tse, David B. Thomas, K.H. Tsoi, Wayne Luk Department of Computing Imperial College London, UK {htt08,dt10,khtsoi,wl}@doc.ic.ac.uk ABSTRACT
ANALYSIS OF THE BINOMIAL METHOD
ANALYSIS OF THE BINOMIAL METHOD School of Mathematics 2013 OUTLINE 1 CONVERGENCE AND ERRORS OUTLINE 1 CONVERGENCE AND ERRORS 2 EXOTIC OPTIONS American Options Computational Effort OUTLINE 1 CONVERGENCE
Computational Finance Binomial Trees Analysis
Computational Finance Binomial Trees Analysis School of Mathematics 2018 Review - Binomial Trees Developed a multistep binomial lattice which will approximate the value of a European option Extended the
CS 343: Artificial Intelligence
CS 343: Artificial Intelligence Markov Decision Processes II Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC
Real-Time Market Data Technology Overview
Real-Time Market Data Technology Overview Zoltan Radvanyi Morgan Stanley Session Outline What is market data? Basic terms used in market data world Market data processing systems Real time requirements
Algorithmic Differentiation of a GPU Accelerated Application
of a GPU Accelerated Application Numerical Algorithms Group 1/31 Disclaimer This is not a speedup talk There won t be any speed or hardware comparisons here This is about what is possible and how to do
Dividing Polynomials
OpenStax-CNX module: m49348 1 Dividing Polynomials OpenStax OpenStax Precalculus This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 4.0 In this section, you
Partial Differential Equations of Fluid Dynamics
Partial Differential Equations of Fluid Dynamics Ville Vuorinen,D.Sc.(Tech.) 1 1 Department of Energy Technology, Internal Combustion Engine Research Group Department of Energy Technology Outline Introduction
Binomial American Option Pricing on CPU-GPU Hetergenous System
Binomial American Option Pricing on CPU-GPU Hetergenous System Nan Zhang, Chi-Un Lei and Ka Lok Man Abstract We present a novel parallel binomial algorithm to compute prices of American options. The algorithm
HIGH PERFORMANCE COMPUTING IN THE LEAST SQUARES MONTE CARLO APPROACH. GILLES DESVILLES Consultant, Rationnel Maître de Conférences, CNAM
HIGH PERFORMANCE COMPUTING IN THE LEAST SQUARES MONTE CARLO APPROACH GILLES DESVILLES Consultant, Rationnel Maître de Conférences, CNAM Introduction Valuation of American options on several assets requires
Chapter 6 Analyzing Accumulated Change: Integrals in Action
Chapter 6 Analyzing Accumulated Change: Integrals in Action 6. Streams in Business and Biology You will find Excel very helpful when dealing with streams that are accumulated over finite intervals. Finding
November 2018 Abstract
etxcoin@outlook.com November 2018 Abstract A purely peer-to-peer version of electronic cash scalable and friendly to use would allow online payments to be sent directly from one party to another without
Ultimate Control. Maxeler RiskAnalytics
Ultimate Control Maxeler RiskAnalytics Analytics Risk Financial markets are rapidly evolving. Data volume and velocity are growing exponentially. To keep ahead of the competition financial institutions
Why know about performance
1 Performance Today we ll discuss issues related to performance: Latency/Response Time/Execution Time vs. Throughput How do you make a reasonable performance comparison? The 3 components of CPU performance
$0.00 $0.50 $1.00 $1.50 $2.00 $2.50 $3.00 $3.50 $4.00 Price
Orange Juice Sales and Prices In this module, you will be looking at sales and price data for orange juice in grocery stores. You have data from 83 stores on three brands (Tropicana, Minute Maid, and the
Efficient Reconfigurable Design for Pricing Asian Options
Efficient Reconfigurable Design for Pricing Asian Options Anson H.T. Tse, David B. Thomas, K.H. Tsoi, Wayne Luk Department of Computing Imperial College London, UK (htt08,dtl O,khtsoi,wl)@doc.ic.ac.uk
A Highly Efficient Implementation on GPU Clusters of PDE-Based Pricing Methods for Path-Dependent Foreign Exchange Interest Rate Derivatives
A Highly Efficient Implementation on GPU Clusters of PDE-Based Pricing Methods for Path-Dependent Foreign Exchange Interest Rate Derivatives Duy-Minh Dang 1, Christina C. Christara 2, and Kenneth R. Jackson
Scaling SGD Batch Size to 32K for ImageNet Training
Scaling SGD Batch Size to 32K for ImageNet Training Yang You Computer Science Division of UC Berkeley youyang@cs.berkeley.edu Yang You (youyang@cs.berkeley.edu) 32K SGD Batch Size CS Division of UC Berkeley
STOCK PITCH AMD. (Advanced Micro Devices) Stock Summary
STOCK PITCH AMD (Advanced Micro Devices) Stock Summary 2016 2020 Share Price (current) $10.16 EPS -$0.6 $0.66* Market Cap. (2016) $9.47B Shares Outstanding 835M 940M* Net Debt (2016) $1.43B EBITDA -$372M
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Program Advisor: Howard Elman Department of Computer Science May 5, 2016 Tengfei
Finite Element Method
In Finite Difference Methods: the solution domain is divided into a grid of discrete points or nodes the PDE is then written for each node and its derivatives replaced by finite-divided differences In
COS 318: Operating Systems. CPU Scheduling. Jaswinder Pal Singh Computer Science Department Princeton University
COS 318: Operating Systems CPU Scheduling Jaswinder Pal Singh Computer Science Department Princeton University (http://www.cs.princeton.edu/courses/cos318/) Today s Topics u CPU scheduling basics u CPU
Linear Modeling Business 5 Supply and Demand
Linear Modeling Business 5 Supply and Demand Supply and demand is a fundamental concept in business. Demand looks at the Quantity (Q) of a product that will be sold with respect to the Price (P) the product
Parallel Multilevel Monte Carlo Simulation
Parallel Simulation Mathematisches Institut Goethe-Universität Frankfurt am Main Advances in Financial Mathematics Paris January 7-10, 2014 Simulation Outline 1 Monte Carlo 2 3 4 Algorithm Numerical Results
Application of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem
Application of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem Malgorzata A. Jankowska 1, Andrzej Marciniak 2 and Tomasz Hoffmann 2 1 Poznan University
Administration CSE 326: Data Structures
Administration CSE : Data Structures Binomial Queues Neva Cherniavsky Summer Released today: Project, phase B Due today: Homework Released today: Homework I have office hours tomorrow // Binomial Queues
Hardware Accelerators for Financial Mathematics - Methodology, Results and Benchmarking
Hardware Accelerators for Financial Mathematics - Methodology, Results and Benchmarking Christian de Schryver #, Henning Marxen, Daniel Schmidt # # Micrelectronic Systems Design Department, University
Section 9.1 Solving Linear Inequalities
Section 9.1 Solving Linear Inequalities We know that a linear equation in x can be expressed as ax + b = 0. A linear inequality in x can be written in one of the following forms: ax + b < 0, ax + b 0,
ifko, LANB, PWML, PCA & Other Fascinating Post-ICL Acronyms
ifko, LANB, PWML, PCA & Other Fascinating Post-ICL Acronyms R. Clint Whaley (whaley@cs.utsa.edu) Dave Whalley Florida State University www.cs.utsa.edu/ whaley Anthony M. Castaldo (castaldo@cs.utsa.edu)
Numerical Methods in Option Pricing (Part III)
Numerical Methods in Option Pricing (Part III) E. Explicit Finite Differences. Use of the Forward, Central, and Symmetric Central a. In order to obtain an explicit solution for the price of the derivative,
Reconfigurable Acceleration for Monte Carlo based Financial Simulation
Reconfigurable Acceleration for Monte Carlo based Financial Simulation G.L. Zhang, P.H.W. Leong, C.H. Ho, K.H. Tsoi, C.C.C. Cheung*, D. Lee**, Ray C.C. Cheung*** and W. Luk*** The Chinese University of
CS 188: Artificial Intelligence Fall 2011
CS 188: Artificial Intelligence Fall 2011 Lecture 9: MDPs 9/22/2011 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 2 Grid World The agent lives in
Reinforcement Learning. Slides based on those used in Berkeley's AI class taught by Dan Klein
Reinforcement Learning Slides based on those used in Berkeley's AI class taught by Dan Klein Reinforcement Learning Basic idea: Receive feedback in the form of rewards Agent s utility is defined by the
Fast American Basket Option Pricing on a multi-gpu Cluster
Fast American Basket Option Pricing on a multi-gpu Cluster Michael Benguigui, Françoise Baude To cite this version: Michael Benguigui, Françoise Baude. Fast American Basket Option Pricing on a multi-gpu
MLC at Boise State Polynomials Activity 3 Week #5
Polynomials Activity 3 Week #5 This activity will be discuss maximums, minimums and zeros of a quadratic function and its application to business, specifically maximizing profit, minimizing cost and break-even
PARELLIZATION OF DIJKSTRA S ALGORITHM: COMPARISON OF VARIOUS PRIORITY QUEUES
PARELLIZATION OF DIJKSTRA S ALGORITHM: COMPARISON OF VARIOUS PRIORITY QUEUES WIKTOR JAKUBIUK, KESHAV PURANMALKA 1. Introduction Dijkstra s algorithm solves the single-sourced shorest path problem on a
How to Make Calls Into Puts
UNDERSTANDING SYNTHETIC EQUIVALENCE How to Make Calls Into Puts COPYRIGHT 2012, OPTIONPIT.COM CHAPTER 1 How to Make Calls Into Puts Or... There is no such thing as a credit spread www.optionpit.com How
Numerical software & tools for the actuarial community
Numerical software & tools for the actuarial community John Holden john.holden@nag.co.uk 20 th March 203 The Actuarial Profession Staple Inn Hall Experts in numerical algorithms and HPC services Agenda
COS 318: Operating Systems. CPU Scheduling. Today s Topics. CPU Scheduler. Preemptive and Non-Preemptive Scheduling
Today s Topics COS 318: Operating Systems u CPU scheduling basics u CPU scheduling algorithms CPU Scheduling Jaswinder Pal Singh Computer Science Department Princeton University (http://www.cs.princeton.edu/courses/cos318/)
91.420/543: Artificial Intelligence UMass Lowell CS Fall 2010
91.420/543: Artificial Intelligence UMass Lowell CS Fall 2010 Lecture 17 & 18: Markov Decision Processes Oct 12 13, 2010 A subset of Lecture 9 slides from Dan Klein UC Berkeley Many slides over the course
COS402- Artificial Intelligence Fall Lecture 17: MDP: Value Iteration and Policy Iteration
COS402- Artificial Intelligence Fall 2015 Lecture 17: MDP: Value Iteration and Policy Iteration Outline The Bellman equation and Bellman update Contraction Value iteration Policy iteration The Bellman
Accelerating Reconfigurable Financial Computing
Imperial College London Department of Computing Accelerating Reconfigurable Financial Computing Hong Tak Tse (Anson) Submitted in part fulfilment of the requirements for the degree of Doctor of Philosophy
Implementing hybrid PDE solvers
Implementing hybrid PDE solvers George Sarailidis and Manolis Vavalis ECE Department, University of Thessaly November 14, 2015 Outline Objectives State-of-the-art Basic Implementations Experimentation
MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
12B Practice for the Final Eam MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. If = -4 and = -2, evaluate the epression. 12-6 1) + 2 A) - 9 B) 0 C)
Los Angeles Fire and Police Pensions
Los Angeles Fire and Police Pensions SELF-TEST: Performance Measurement Presentation 1. True or false, Internal Rate of Return (IRR) is best used for measuring the performance of publicly traded securities.
Stochastic Local Volatility & High Performance Computing
Stochastic Local Volatility & High Performance Computing A thesis submitted to The University of Manchester for the degree of Master of Philosophy in the Faculty of Humanities. 2013 Zaid AIT HADDOU Manchester
Econ 337 Spring 2014 Due 10am 100 points possible
Econ 337 Spring 2014 Final Due 5/7/2014 @ 10am 100 points possible Fill in the blanks (2 points each) 1. Price discovery is the process by which and arrive at a specific price for a given lot of produce
Interest Rate Basis Curve Construction and Bootstrapping Guide
Interest Rate Basis Curve Construction and Bootstrapping Guide Michael Taylor FinPricing The term structure of an interest rate basis curve is defined as the relationship between the basis zero rate and
The Evaluation of American Compound Option Prices under Stochastic Volatility. Carl Chiarella and Boda Kang
The Evaluation of American Compound Option Prices under Stochastic Volatility Carl Chiarella and Boda Kang School of Finance and Economics University of Technology, Sydney CNR-IMATI Finance Day Wednesday,
Anne Bracy CS 3410 Computer Science Cornell University
Anne Bracy CS 3410 Computer Science Cornell University These slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. Complex question How fast is the
A Branch-and-Price method for the Multiple-depot Vehicle and Crew Scheduling Problem
A Branch-and-Price method for the Multiple-depot Vehicle and Crew Scheduling Problem SCIP Workshop 2018, Aachen Markó Horváth Tamás Kis Institute for Computer Science and Control Hungarian Academy of Sciences
arxiv: v1 [cs.dc] 14 Jan 2013
![arxiv: v1 [cs.dc] 14 Jan 2013](/thumbs/87/96490239.jpg "arxiv: v1 [cs.dc] 14 Jan 2013")
A parallel implementation of a derivative pricing model incorporating SABR calibration and probability lookup tables Qasim Nasar-Ullah 1 University College London, Gower Street, London, United Kingdom
Soft Response Generation and Thresholding Strategies for Linear and Feed-Forward MUX PUFs
Soft Response Generation and Thresholding Strategies for Linear and Feed-Forward MUX PUFs Chen Zhou, SarojSatapathy, YingjieLao, KeshabK. Parhiand Chris H. Kim Department of ECE University of Minnesota
JADE LICENSING DOCUME N T V E R S I O N 1 2 JADE SOFTWARE CORPORATION
JADE LICENSING DOCUME N T V E R S I O N 1 2 JADE SOFTWARE CORPORATION 14 MARCH 2013 Jade Software Corporation Limited cannot accept any financial or other responsibilities that may be the result of your
Math Performance Task Teacher Instructions
Math Performance Task Teacher Instructions Stock Market Research Instructions for the Teacher The Stock Market Research performance task centers around the concepts of linear and exponential functions.
Business Statistics 41000: Probability 3
Business Statistics 41000: Probability 3 Drew D. Creal University of Chicago, Booth School of Business February 7 and 8, 2014 1 Class information Drew D. Creal Email: dcreal@chicagobooth.edu Office: 404
Option Pricing with the SABR Model on the GPU
Option Pricing with the SABR Model on the GPU Yu Tian, Zili Zhu, Fima C. Klebaner and Kais Hamza School of Mathematical Sciences, Monash University, Clayton, VIC3800, Australia Email: {yu.tian, fima.klebaner,
Unblinded Sample Size Re-Estimation in Bioequivalence Trials with Small Samples. Sam Hsiao, Cytel Lingyun Liu, Cytel Romeo Maciuca, Genentech
Unblinded Sample Size Re-Estimation in Bioequivalence Trials with Small Samples Sam Hsiao, Cytel Lingyun Liu, Cytel Romeo Maciuca, Genentech Goal Describe simple adjustment to CHW method (Cui, Hung, Wang
Rayleigh Curves A Tutorial
Rayleigh Curves A Tutorial Hear F. Chelson Richard L. Coleman Jessica R. Summerville Steven L. Van Drew SCEA 2004 Manhattan Beach, CA June 2004 Outline Background Description Application The N-R Curve
Implementing Models in Quantitative Finance: Methods and Cases
Gianluca Fusai Andrea Roncoroni Implementing Models in Quantitative Finance: Methods and Cases vl Springer Contents Introduction xv Parti Methods 1 Static Monte Carlo 3 1.1 Motivation and Issues 3 1.1.1
CS227-Scientific Computing. Lecture 6: Nonlinear Equations
CS227-Scientific Computing Lecture 6: Nonlinear Equations A Financial Problem You invest $100 a month in an interest-bearing account. You make 60 deposits, and one month after the last deposit (5 years
Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration
Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration Piyush Rai CS5350/6350: Machine Learning November 29, 2011 Reinforcement Learning Supervised Learning: Uses explicit supervision
Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration
Reinforcement Learning (1): Discrete MDP, Value Iteration, Policy Iteration Piyush Rai CS5350/6350: Machine Learning November 29, 2011 Reinforcement Learning Supervised Learning: Uses explicit supervision