Transcription of I. Introduction to Applied Mathematics - Princeton University
{{id}} {{{paragraph}}}
Example: stock market
I. Introduction to Applied Mathematics - Princeton University
48I. Introduction to Applied Mathematics7 Randomized AlgorithmsAll the algorithms described so far in this article aredeterministic: if they are run repeatedly on the samedata, they produce the same result every time. Somealgorithms make random choices and so generally pro-duce a different result every time they are run. Forexample, we might approximate 10f(x)dx 1nn i=1f(xi),where thexiare independent random numbers uni-formly distributed in[0,1]. The standard deviation ofthe error in this approximation is of ordern 1/2. Thisis an example of aMonte Carlo algorithm; such algo-rithms have a deterministic run time and produce anoutput that is correct (or has a given accuracy) witha certain probability.
Very general methods such as precondition-ing and the finite-element method, which require much more information to produce a particular algorithm, are omitted. The table illustrates the wide variety of ... /, ’,. = , I. Introduction to Applied Mathematics so. ...
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Introduction to Methods of Applied Mathematics, Methods, Mathematical Methods in Engineering and, Applied mathematics, Lecture Notes on Mathematical Modelling in Applied Sciences, Applied Mathematical Methods, Mathematics Applied Mathematical Methods, Mathematical, METHODS OF APPLIED MATHEMATICS FOR ENGINEERS, METHODS OF APPLIED MATHEMATICS FOR ENGINEERS AND SCIENTISTS, HOW APPLIED MATHEMATICS BECAME PURE, Mathematics, Methods of Applied Mathematics, Introduction to Computational Mathematics