DOCSLIB.ORG

Financial Numerical Recipes in C++

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Financial Numerical Recipes in C++. Bernt Arne Ødegaard June 2014 5.1 The interchangeability of discount factors, spot interest rates and forward interest rates . 52 5.2 The term structure as an object . 55 5.2.1 Base class . 55 5.2.2 Flat term structure. 57 5.3 Using the currently observed term structure. 58 5.3.1 Linear Interpolation. 59 5.3.2 Interpolated term structure class. 61 Contents 5.4 Bond calculations with a general term structure and continous compounding . 64 6 The Mean Variance Frontier 67 6.1 Setup . 67 6.2 The minimum variance frontier . 69 1 On C++ and programming. 5 6.3 Calculation of frontier portfolios . 69 1.1 Compiling and linking . 5 6.4 The global minimum variance portfolio . 72 1.2 The structure of a C++ program . 6 6.5 Efficient portfolios . 72 1.2.1 Types . 6 6.6 The zero beta portfolio . 73 1.2.2 Operations . 6 6.7 Allowing for a riskless asset. 73 1.2.3 Functions and libraries . 7 6.8 Efficient sets with risk free assets. 74 1.2.4 Templates and libraries . 7 6.9 Short-sale constraints . 75 1.2.5 Flow control . 8 6.10 The Sharpe Ratio . 75 1.2.6 Input Output . 8 6.11 Equilibrium: CAPM . 76 1.2.7 Splitting up a program . 8 6.11.1 Treynor . 76 1.2.8 Namespaces . 9 6.11.2 Jensen . 76 1.3 Extending the language, the class concept. 9 6.12 Working with Mean Variance and CAPM . 76 1.3.1 date, an example class . 10 6.13 Mean variance analysis using matrix libraries . 77 1.4 Const references . 16 1.5 Other C++ concepts . 16 7 Futures algoritms. 81 7.1 Pricing of futures contract. 81 2 Matrix Tools 17 2.1 The first screen . 18 8 Binomial option pricing 82 2.2 Linear algebra . 18 8.1 Options . 82 2.2.1 Basic matrix operations . 18 8.2 Pricing . 82 2.2.2 Arithmetic Matrix Operations. 19 8.3 Multiperiod binomial pricing . 85 2.3 Solving linear equations . 22 9 Basic Option Pricing, the Black Scholes formula 89 2.4 Element by element operations . 24 9.1 The formula . 90 2.5 Function definitions . 24 9.2 Understanding the why’s of the formula . 92 2.6 m files . 24 9.2.1 The original Black Scholes analysis . 93 2.7 Flow control . 24 9.2.2 The limit of a binomial case . 93 2.8 Plotting . 24 9.2.3 The representative agent framework . 93 2.9 Libraries . 25 9.3 Partial derivatives. 93 2.10 References . 25 9.3.1 Delta . 93 3 The value of time 26 9.3.2 Other Derivatives . 94 3.1 Present value . 26 9.3.3 Implied Volatility. 96 3.2 One interest rate with annual compounding . 27 9.4 References . 98 3.2.1 Internal rate of return. 30 10 Warrants 99 3.3 Continously compounded interest . 34 10.1 Warrant value in terms of assets . 99 3.3.1 Present value . 35 10.2 Valuing warrants when observing the stock value 100 3.4 Further readings . 35 10.3 Readings . 101 4 Bond Pricing with a flat term structure 36 11 Extending the Black Scholes formula 102 4.1 Flat term structure with discrete, annual com- pounding . 37 11.1 Adjusting for payouts of the underlying. 102 4.1.1 Bond Price . 37 11.1.1 Continous Payouts from underlying. 102 4.1.2 Yield to maturity . 38 11.1.2 Dividends. 103 4.1.3 Duration . 41 11.2 American options . 104 4.1.4 Measuring bond sensitivity to interest 11.2.1 Exact american call formula when stock is rate changes . 43 paying one dividend. 105 4.2 Continously compounded interest . 47 11.3 Options on futures . 108 4.3 Further readings . 50 11.3.1 Black’s model . 108 11.4 Foreign Currency Options . 109 5 The term structure of interest rates and an object lesson 51 11.5 Perpetual puts and calls . 110 1 11.6 Readings . 111 17 Generic binomial pricing 177 17.1 Introduction . 177 12 Option pricing with binomial approximations 112 17.2 Delta calculation . 182 12.1 Introduction . 112 12.2 Pricing of options in the Black Scholes setting . 113 18 Trinomial trees 183 12.2.1 European Options . 114 18.1 Intro . 183 12.2.2 American Options . 114 18.2 Implementation . 183 12.2.3 Matlab implementation . 116 18.3 Further reading . 185 12.3 How good is the binomial approximation? . 119 19 Alternatives to the Black Scholes type option formula 186 12.3.1 Estimating partials. 120 19.1 Merton’s Jump diffusion model. 186 12.4 Adjusting for payouts for the underlying . 123 19.2 Hestons pricing formula for a stochastic volatility 12.5 Pricing options on stocks paying dividends using model . 188 a binomial approximation . 124 12.5.1 Checking for early exercise in the bino- 20 Pricing of bond options, basic models 191 mial model. 124 20.1 Black Scholes bond option pricing . 191 12.5.2 Proportional dividends. 124 20.2 Binomial bond option pricing . 193 12.5.3 Discrete dividends . 126 12.6 Option on futures . 128 21 Credit risk 195 12.7 Foreign Currency options . 130 21.1 The Merton Model . 195 12.8 References . 131 21.2 Issues in implementation . 196 13 Finite Differences 132 22 Term Structure Models 197 13.1 Explicit Finite differences . 132 22.1 The Nelson Siegel term structure approximation 198 13.2 European Options. 132 22.2 Extended Nelson Siegel models . 200 13.3 American Options. 134 22.3 Cubic spline. 202 13.4 Implicit finite differences . 137 22.4 Cox Ingersoll Ross. 205 13.5 An example matrix class . 137 22.5 Vasicek . 208 13.6 Finite Differences . 137 22.6 Readings . 210 13.7 American Options . 137 13.8 European Options . 140 23 Binomial Term Structure models 211 13.9 References . 141 23.1 The Rendleman and Bartter model . 211 23.2 Readings . 213 14 Option pricing by simulation 142 14.1 Simulating lognormally distributed random vari- 24 Interest rate trees 214 ables . 143 24.1 The movement of interest rates . 214 14.2 Pricing of European Call options . 143 24.2 Discount factors . 216 14.3 Hedge parameters . 144 24.3 Pricing bonds . 216 14.4 More general payoffs. Function prototypes . 146 24.4 Callable bond . 218 14.5 Improving the efficiency in simulation . 147 24.5 Readings . 220 14.5.1 Control variates. 147 14.5.2 Antithetic variates. 148 25 Building term structure trees using the Ho and Lee (1986) approach 221 14.6 More exotic options . 151 25.1 Intro . 221 14.7 References . 152 25.2 Building trees of term structures . 221 25.3 Ho Lee term structure class . 221 15 Pricing American Options – Approximations 153 25.4 Pricing things . 224 15.1 The Johnson (1983) approximation . 153 25.5 References . 226 15.2 An approximation to the American Put due to Geske and Johnson (1984) . 156 26 Term Structure Derivatives 227 15.3 A quadratic approximation to American prices 26.1 Vasicek bond option pricing . 227 due to Barone–Adesi and Whaley. 159 15.4 An alternative approximation to american op- 27 Date (and time) revisited - the BOOST libraries 229 tions due to Bjerksund and Stensland (1993) . 162 27.1 References . 230 15.5 Readings . 165 A Normal Distribution approximations. 231 16 Average, lookback and other exotic options 166 A.1 The normal distribution function . 231 16.1 Bermudan options . 166 A.2 The cumulative normal distribution . 232 16.2 Asian options . 169 A.3 Multivariate normal . 232 16.3 Lookback options . 170 A.4 Calculating cumulative bivariate normal proba- 16.4 Monte Carlo Pricing of options whose payoff de- bilities . 233 pend on the whole price path . 172 A.5 Simulating random normal numbers . 235 16.4.1 Generating a series of lognormally dis- A.6 Cumulative probabilities for general multivariate tributed variables . 172 distributions . 236 16.5 Control variate . 175 A.7 Implementation in C++11.
Recommended publications
  • (LINUX) Computer in Three Parts

    (LINUX) Computer in Three Parts

    Science on a (LINUX) computer in three parts Introductory short couse, Part II Thorsten Becker University of Southern California, Los Angeles September 2007 The first part dealt with ● UNIX: what and why ● File system, Window managers ● Shell environment ● Editing files ● Command line tools ● Scripts and GUIs ● Virtualization Contents part II ● Typesetting ● Programming – common languages – philosophy – compiling, debugging, make, version control – C and F77 interfacing – libraries and packages ● Number crunching ● Visualization tools Programming: Traditional languages in the natural sciences ● Fortran: higher level, good for math – F77: legacy, don't use (but know how to read) – F90/F95: nice vector features, finally implements C capabilities (structures, memory allocation) ● C: low level (e.g. pointers), better structured – very close to UNIX philosophy – structures offer nice way of modular programming, see Wikipedia on C ● I recommend F95, and use C happily myself Programming: Some Languages that haven't completely made it to scientific computing ● C++: object oriented programming model – reusable objects with methods and such – can be partly realized by modular programming in C ● Java: what's good for commercial projects (or smart, or elegant) doesn't have to be good for scientific computing ● Concern about portability as well as general access Programming: Compromises ● Python – Object oriented – Interpreted – Interfaces easily with F90/C – Numerous scientific packages Programming: Other interpreted, high- abstraction languages
  • Redacted for Privacy Professor Donald Guthrie, Jr

    Redacted for Privacy Professor Donald Guthrie, Jr

    AN ABSTRACT OF THE THESIS OF John Anthony Battilega for the DOCTOR OF PHILOSOPHY (Name) (Degree) in Mathematics presented on May 4, 1973 (Major) (Date) Title: COMPUTATIONAL IMPROVEMENTS TO BENDERS DECOMPOSITION FOR GENERALIZED FIXED CHARGE PROBLEMS Abstract approved Redacted for privacy Professor Donald Guthrie, Jr. A computationally efficient algorithm has been developed for determining exact or approximate solutions for large scale gener- alized fixed charge problems. This algorithm is based on a relaxa- tion of the Benders decomposition procedure, combined with a linear mixed integer programming (MIP) algorithm specifically designed to solve the problem associated with Benders decomposition and a com- putationally improved generalized upper bounding (GUB) algorithm which solves a convex separable programming problem by generalized linear programming. A dynamic partitioning technique is defined and used to improve computational efficiency.All component algor- ithms have been theoretically and computationally integrated with the relaxed Benders algorithm for maximum efficiency for the gener- alized fixed charge problem. The research was directed toward the approximate solution of a particular class of large scale generalized fixed charge problems, and extensive computational results for problemsof this type are given.As the size of the problem diminishes, therelaxations can be enforced, resulting in a classical Bendersdecomposition, but with special purpose sub-algorithmsand improved convergence pro- perties. Many of the results obtained apply to the sub-algorithmsinde- pendently of the context in which theywere developed. The proce- dure for solving the associated MIP is applicableto any linear 0/1 problem of Benders form, and the techniquesdeveloped for the linear program are applicable to any large scale generalized GUB implemen- tation.
  • 4.4 Improper Integrals 135

    4.4 Improper Integrals 135

    4.4 Improper Integrals 135 converges (with parameters as shown above) on the very first extrapolation, after just 5 calls to trapzd, while qsimp requires 8 calls (8 times as many evaluations of the integrand) and qtrap requires 13 calls (making 256 times as many evaluations of the integrand). CITED REFERENCES AND FURTHER READING: http://www.nr.com or call 1-800-872-7423 (North America only), or send email to [email protected] (outside North Amer readable files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, v Permission is granted for internet users to make one paper copy their own personal use. Further reproduction, or any copyin Copyright (C) 1986-1992 by Cambridge University Press. Programs Copyright (C) 1986-1992 by Numerical Recipes Software. Sample page from NUMERICAL RECIPES IN FORTRAN 77: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43064-X) Stoer, J., and Bulirsch, R. 1980, Introduction to Numerical Analysis (New York: Springer-Verlag), §§3.4–3.5. Dahlquist, G., and Bjorck, A. 1974, Numerical Methods (Englewood Cliffs, NJ: Prentice-Hall), §§7.4.1–7.4.2. Ralston, A., and Rabinowitz, P. 1978, A First Course in Numerical Analysis, 2nd ed. (New York: McGraw-Hill), §4.10–2. 4.4 Improper Integrals For our present purposes, an integral will be “improper” if it has any of the following problems: • its integrand goes to a finite limiting value at finite upper and lower limits, but cannot be evaluated right on one of those limits (e.g., sin x/x at x =0) • its upper limit is ∞ , or its lower limit is −∞ • it has an integrable singularity at either limit (e.g., x−1/2 at x =0) • it has an integrable singularity at a known place between its upper and lower limits • it has an integrable singularity at an unknown place between its upper and lower limits ∞ −1 If an integral is infinite (e.g., 1 x dx), or does not exist in a limiting sense ∞ (e.g., −∞ cos xdx), we do not call it improper; we call it impossible.
  • 3.2 Rational Function Interpolation and Extrapolation

    3.2 Rational Function Interpolation and Extrapolation

    104 Chapter 3. Interpolation and Extrapolation do 11 i=1,n Here we find the index ns of the closest table entry, dift=abs(x-xa(i)) if (dift.lt.dif) then ns=i dif=dift endif c(i)=ya(i) and initialize the tableau of c’s and d’s. d(i)=ya(i) http://www.nr.com or call 1-800-872-7423 (North America only), or send email to [email protected] (outside North Amer readable files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, v Permission is granted for internet users to make one paper copy their own personal use. Further reproduction, or any copyin Copyright (C) 1986-1992 by Cambridge University Press. Programs Copyright (C) 1986-1992 by Numerical Recipes Software. Sample page from NUMERICAL RECIPES IN FORTRAN 77: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43064-X) enddo 11 y=ya(ns) This is the initial approximation to y. ns=ns-1 do 13 m=1,n-1 For each column of the tableau, do 12 i=1,n-m we loop over the current c’s and d’s and update them. ho=xa(i)-x hp=xa(i+m)-x w=c(i+1)-d(i) den=ho-hp if(den.eq.0.)pause ’failure in polint’ This error can occur only if two input xa’s are (to within roundoff)identical. den=w/den d(i)=hp*den Here the c’s and d’s are updated. c(i)=ho*den enddo 12 if (2*ns.lt.n-m)then After each column in the tableau is completed, we decide dy=c(ns+1) which correction, c or d, we want to add to our accu- else mulating value of y, i.e., which path to take through dy=d(ns) the tableau—forking up or down.
  • Dynamic Functions in Dyalog

    Dynamic Functions in Dyalog

    Direct Functions in Dyalog APL John Scholes – Dyalog Ltd. [email protected] A Direct Function (dfn) is a new function definition style, which bridges the gap between named function expressions such as and APL’s traditional ‘header’ style definition. Simple Expressions The simplest form of dfn is: {expr} where expr is an APL expression containing s and s representing the left and right argument of the function respectively. For example: A dfn can be used in any function context ... ... and of course, assigned a name: Dfns are ambivalent. Their right (and if present, left) arguments are evaluated irrespective of whether these are subsequently referenced within the function body. Guards A guard is a boolean-single valued expression followed by . A simple expression can be preceded by a guard, and any number of guarded expressions can occur separated by s. Guards are evaluated in turn (left to right) until one of them yields a 1. Its corresponding expr is then evaluated as the result of the dfn. A guard is equivalent to an If-Then-Else or Switch-Case construct. A final simple expr can be thought of as a default case: The s can be replaced with newlines. For readability, extra null phrases can be included. The parity example above becomes: Named dfns can be reviewed using the system editor: or , and note how you can comment them in the normal way using . The following example interprets a dice throw: Local Definition The final piece of dfn syntax is the local definition. An expression whose principal function is a simple or vector assignment, introduces a name that is local to the dfn.
  • Xerox University Microfilms 300 North Zeeb Road Ann Arbor, Michigan 48106 76-15,823

    Xerox University Microfilms 300 North Zeeb Road Ann Arbor, Michigan 48106 76-15,823

    INFORMATION TO USERS This material was produced from a microfilm copy of the original document. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependent upon the quality of the original submitted. The following explanation of techniques is provided to help you understand markings or patterns which may appear on this reproduction. 1. The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting thru an image and duplicating adjacent pages to insure you complete continuity. 2. When an image on the film is obliterated with a large round black mark, it is an indication that the photographer suspected that the copy may have moved during exposure and thus cause a blurred image. You will find a good image of the page in the adjacent frame. 3. When a map, drawing or chart, etc., was part of the material being photographed the photographer followed a definite method in "sectioning" the material. It is customary to begin photoing at the upper left hand corner of a large sheet and to continue photoing from left to right in equal sections with a small overlap. If necessary, sectioning is continued again — beginning below the first row and continuing on until complete. 4. The majority of users indicate that the textual content is of greatest value, however, a somewhat higher quality reproduction could be made from "photographs" if essential to the understanding of the dissertation.
  • GNU Scientific Library – 設計と実装の指針

    GNU Scientific Library – 設計と実装の指針

    GNU Scienti¯c Library { 設計と実装の指針 マーク・ガラッシ (Mark Galassi) Los Alamos National Laboratory ジェイムズ・ティラー (James Theiler) Astrophysics and Radiation Measurements Group, Los Alamos National Laboratory ブライアン・ガウ (Brian Gough) Network Theory Limited とみながだいすけ訳 (translation: Daisuke Tominaga) 産業技術総合研究所 生命情報工学研究センター Copyright °c 1996,1997,1998,1999,2000,2001,2004 The GSL Project. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modi¯ed versions of this manual under the con- ditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another lan- guage, under the above conditions for modi¯ed versions, except that this permission notice may be stated in a translation approved by the Foundation. このライセンスの文面をつけさえすれば、この文書をそのままの形でコピー、再配布して構 いません。また、この文書を改編したものについても、同じライセンスにしたがうのであれ ば、コピー、再配布して構いません。この文書を翻訳したものについても、米フリーソフト ウェア財団 (the Free Software Foundation) が認可した翻訳済みのライセンス文面を添付す れば、コピー、再配布して構いません。 そういうわけで、この日本語に翻訳した文書は、GFDL 1.3 にしたがった複製、再配布を認 めるものとします。ライセンスの詳細はこの文書に添付されています。 平成 21 年 6 月 4 日 とみながだいすけ i Table of Contents GSL について :::::::::::::::::::::::::::::::::::::::: 1 1 目標 :::::::::::::::::::::::::::::::::::::::::::::: 2 2 開発への参加:::::::::::::::::::::::::::::::::::::: 4 2.1 パッケージ :::::::::::::::::::::::::::::::::::::::::::::::::::::
  • Ginger Documentation Release 1.0

    Ginger Documentation Release 1.0

    Ginger Documentation Release 1.0 sfkl / gjh Nov 03, 2017 Contents 1 Contents 3 2 Help Topics 27 3 Common Syntax 53 4 Design Rationales 55 5 The Ginger Toolchain 83 6 Low-Level Implementation 99 7 Release Notes 101 8 Indices and tables 115 Bibliography 117 i ii Ginger Documentation, Release 1.0 This documentation is still very much work in progress The aim of the Ginger Project is to create a modern programming language and its ecosystem of libraries, documen- tation and supporting tools. The Ginger language draws heavily on the multi-language Poplog environment. Contents 1 Ginger Documentation, Release 1.0 2 Contents CHAPTER 1 Contents 1.1 Overview of Ginger Author Stephen Leach Email [email protected] 1.1.1 Background Ginger is our next evolution of the Spice project. Ginger itself is a intended to be a rigorous but friendly programming language and supporting toolset. It includes a syntax-neutral programming language, a virtual machine implemented in C++ that is designed to support the family of Spice language efficiently, and a collection of supporting tools. Spice has many features that are challenging to support efficiently in existing virtual machines: pervasive multiple values, multiple-dispatch, multiple-inheritance, auto-loading and auto-conversion, dynamic virtual machines, implicit forcing and last but not least fully dynamic typing. The virtual machine is a re-engineering of a prototype interpreter that I wrote on holiday while I was experimenting with GCC’s support for FORTH-like threaded interpreters. But the toolset is designed so that writing alternative VM implementations is quite straightforward - and we hope to exploit that to enable embedding Ginger into lots of other systems.
  • Numerical Methods in Engineering with MATLAB R

    Numerical Methods in Engineering with MATLAB R

    P1: PHB cuus734 CUUS734/Kiusalaas 0 521 19133 3 August 29, 2009 12:17 This page intentionally left blank ii P1: PHB cuus734 CUUS734/Kiusalaas 0 521 19133 3 August 29, 2009 12:17 Numerical Methods in Engineering with MATLAB R Second Edition Numerical Methods in Engineering with MATLAB R is a text for engi- neering students and a reference for practicing engineers. The choice of numerical methods was based on their relevance to engineering prob- lems. Every method is discussed thoroughly and illustrated with prob- lems involving both hand computation and programming. MATLAB M-files accompany each method and are available on the book Web site. This code is made simple and easy to understand by avoiding com- plex bookkeeping schemes while maintaining the essential features of the method. MATLAB was chosen as the example language because of its ubiquitous use in engineering studies and practice. This new edi- tion includes the new MATLAB anonymous functions, which allow the programmer to embed functions into the program rather than storing them as separate files. Other changes include the addition of rational function interpolation in Chapter 3, the addition of Ridder’s method in place of Brent’s method in Chapter 4, and the addition of the downhill simplex method in place of the Fletcher–Reeves method of optimization in Chapter 10. Jaan Kiusalaas is a Professor Emeritus in the Department of Engineer- ing Science and Mechanics at the Pennsylvania State University. He has taught numerical methods, including finite element and boundary ele- ment methods, for more than 30 years. He is also the co-author of four other books – Engineering Mechanics: Statics, Engineering Mechanics: Dynamics, Mechanics of Materials,andNumerical Methods in Engineer- ing with Python, Second Edition.
  • NUMERICAL RECIPES in FORTRAN 77: the ART of SCIENTIFIC COMPUTING (ISBN 0-521-43064-X) Copyright (C) 1986-1992 by Cambridge University Press

    NUMERICAL RECIPES in FORTRAN 77: the ART of SCIENTIFIC COMPUTING (ISBN 0-521-43064-X) Copyright (C) 1986-1992 by Cambridge University Press

    Numerical Recipes http://www.nr.com or call 1-800-872-7423 (North America only), or send email to [email protected] (outside North Amer readable files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, v Permission is granted for internet users to make one paper copy their own personal use. Further reproduction, or any copyin Copyright (C) 1986-1992 by Cambridge University Press. Programs Copyright (C) 1986-1992 by Numerical Recipes Software. Sample page from NUMERICAL RECIPES IN FORTRAN 77: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43064-X) in Fortran 77 The Art of Scientific Computing Second Edition Volume 1 of Fortran Numerical Recipes William H. Press Harvard-Smithsonian Center for Astrophysics Saul A. Teukolsky Department of Physics, Cornell University William T. Vetterling Polaroid Corporation Brian P. Flannery g of machine- EXXON Research and Engineering Company isit website ica). Published by the Press Syndicate of the University of Cambridge The Pitt Building, Trumpington Street, Cambridge CB2 1RP 40 West 20th Street, New York, NY 10011-4211, USA 10 Stamford Road, Oakleigh, Melbourne 3166, Australia Copyright c Cambridge University Press 1986, 1992 except for §13.10, which is placed into the public domain, and except for all other computer programs and procedures, which are http://www.nr.com or call 1-800-872-7423 (North America only), or send email to [email protected] (outside North Amer readable files (including this one) to any server computer, is strictly prohibited. To order Numerical Recipes books or CDROMs, v Permission is granted for internet users to make one paper copy their own personal use.
  • Chapter 1. Preliminaries

    Chapter 1. Preliminaries

    Chapter 1. Preliminaries 1.0 Introduction This book, like its sibling versions in other computer languages, is supposed to teach you methods of numerical computing that are practical, efficient, and (insofar as possible) elegant. We presume throughout this book that you, the reader, have particular tasks that you want to get done. We view our job as educating you on how to proceed. Occasionally we may try to reroute you briefly onto a particularly beautiful side road; but by and large, we will guide you along main highways that lead to practical destinations. Throughout this book, you will find us fearlessly editorializing, telling you what you should and shouldn’t do. This prescriptive tone results from a conscious decision on our part, and we hope that you will not find it irritating. We do not claim that our advice is infallible! Rather, we are reacting against a tendency, in the textbook literature of computation, to discuss every possible method that has ever been invented, without ever offering a practical judgment on relative merit. We do, therefore, offer you our practical judgments whenever we can. As you gain experience, you will form your own opinion of how reliable our advice is. We presume that you are able to read computer programs in C++, that being the language of this version of Numerical Recipes. The books Numerical Recipes in Fortran 77, Numerical Recipes in Fortran 90, and Numerical Recipes in C are separately available, if you prefer to program in one of those languages. Earlier editions of Numerical Recipes in Pascal and Numerical Recipes Routines and Ex- amples in BASIC are also available; while not containing the additional material of the Second Edition versions, these versions are perfectly serviceable if Pascal or BASIC is your language of choice.
  • Speeches and Papers

    Speeches and Papers

    ROOMS 1-2-3 THE IMPACT OF STANDARDIZATION FOR THE 70's (PANEL) ROBERT W. BEMER General Electric Company Phoenix, Arizona CHAIRMAN AND TECHNICAL PROGRAM CHAIRMAN'S MESSAGE , CONFERENCE AWARDS ' - Harry Goode Memorial Award 3 Best Paper Award 3 Best Presentation Award 3 TECHNICAL PROGRAM 4 CONFERENCE-AT-A-GLANCE (Centerfold) 52,53 CONFERENCE LUNCHEON 75 Luncheon Speaker 75 EDUCATION PROGRAM 76 SPECIAL ACTIVITIES 76 Conference Reception 76 Conference Luncheon 76 Computer Science and Art Theater 76 Computer Art Exhibit 77 Computer Music Exhibit 77 Scope Tour 77 LADIES PROGRAM 78 Hospitality Suite 78 Activities 78 GENERAL INFORMATION 79 Conference Location 79 MASSACHUSETTS INSTITUTE OF TECHNOLOGY PROJECT MAC Reply to: Project MAC 545 Technology Square Cambridge, Mass. 02139 June 5, 1969 Telephone: (617 ) 864-6900 x6201 Mr. Robert W. Bemer General Electric Company (C-85) 13430 North Black Canyon Highway Phoenix, Arizona 85029 Dear Bob: Thank you very much for your participation in my panel session at the Spring Joint Computer Conference. On the basis of a number of comments I received from both strangers and friends and also my own assessment, I think we had a successful session. I particularly appreciate your willingness to contribute your time and efforts to discussion of the problems of managing software projects. As I may have told you previously, I have been teaching a seminar on this same subject at M.I.T. A number of my students who attended the session were particularly interested in the presentations by the panelists. I would appreciate it if you could send me copies of your slide material for use in my class.