V(0.1) V( 0.5) 0.6 V(0.5) V( 0.5)
|
|
- Ashlee Fletcher
- 6 years ago
- Views:
Transcription
1 In-class exams are closed book, no calculators, except for one 8.5"x11" page, written in any density (student may bring a magnifier). Students are bound by the University of Florida honor code. Exam papers are likely to have more than one version. Providing a solution to a version different from the one you get is typically evidence of cheating. Fourth in-term exam About a quarter of the problems will be from the assigned homework. You need to be know the following Matlab functions polyfit, polyval, spline, interpl, interp, trapz, quad, diff, gradient, ode45. Sample problems: 1. (Based on problem 15.9) Given the following table of current and voltages i V a. Write Matlab code to fit the all data with a single polynomial and evaluate the voltage for i=0.1. >> i=[ ] i = e e e e e e+000 >> v=[ ] v = e e e e e e+00 >> p=polyfit(i,v,5) p = e e e e e e-014 >> v01=polyval(p,0.1) v01 =.340e+000 b. Calculate by hand the value obtained for the same voltage from linear interpolation. V(0.1) V( 0.5) 0.6 V(0.5) V( 0.5)
2 . Write Matlab code to fit the data in Problem 1using splines with the end slopes specified to be the slopes that correspond to the two data point closest to each end. The slope at the left end is ( )/1=540.5, and it is the same slope at the other end. >> vsp01=spline(i,[540.5 v 540.5],0.1) vsp01 = 3.587e (Based on 17.8) Determine the distance travelled from the following data: t v a. Write Matlab code to do with trapezoidal rule >> t=[ ] t = e e e e e e e+000 Columns 8 through e e e+001 >> v=[ ] v = e e e e e e e+000 Columns 8 through e e e+000 >> dist=trapz(t,v) dist = 6.045e+001 b. Write Matlab code to fit with cubic polynomial and calculate the integral from the polynomial. >> p=polyfit(t,v,3) p = e e e e+000 >> tt=linspace(1,10); >> vv=polyval(p,tt);
3 >> dist3=trapz(tt,vv) dist3 = e Calculate by hand the distance traveled between t=6 and t=8, by Trapezoidal rule, Simpson s rule, and Trapezoidal rule combined with Richardson extrapolation. 1 (6) 4 (7) (8) 1 (8 4 7) Simpson s rule, Eq. 17. d v v v Trapezoidal rule over the entire interval will give us 8+7=15. Trapezoidal rule using the mid-point at 7 will give d 1 v(6) v(7) v(8) 1 (8 1 7) 13.5 Then the Richardson extrapolation, Eq I 4 I( h ) I( h1) Calculate by hand the integral answer. 3 x dx 0 using -point Gaussian integration and compare to exact 1 The two integration points for the interval (-1,1) are Since our interval is translated by , the two points become 0.433, The integrals is then The exact integral is 4 x Write Matlab code to estimate the accelerations in Problem 3. Also, calculate by hand the acceleration at t=6 and t=7 using three-point difference equations. difft = e e e e e e e- 001 Columns 8 through e e-001 >> diffv=diff(v) diffv = e e e e e e e+000
4 Columns 8 through e+000 >> acc=diffv./difft acc = e e e e e e e+000 Columns 8 through e+000 >> accp=[acc,acc(9)] accp = e e e e e e e+000 Columns 8 through e e+000 For t=7, we can use the central difference equation a(7) v(8) v(6) / (6 8.5) / 1.5 For t=6, we can use the 3-point forward difference equation, nd equation in Figure 19.3 v(8) 4 v(7) 3 v(6) a(6) (Based on 0.1) Consider the following initial value problem dy yx y y dx 1.1 (0) 1 a. Perform one step of the explicit Euler method with x 1 y'(0) 1.1, y(1) y(0) xy'(0) b. Perform one step of the implicit Euler method with the same step. y(1) y(0) xy'(1) y(0) 1 y(1) 1.1 y(1) y(0) 0.1 y(1) y(1) y(0) / c. Perform one step of Heun s method with the same step. Can use Eq. 0.17, or reason as follows. With the prediction of explicit Euler, y(1)=-0.1. So the derivative at x=1 is predicted to be dy yx y dx So we will use the average of the this derivative and the derivative at x=0, that is ( )/=
5 Then y(1) dydx = d. Write Matlab code to obtain the solution up to x= using one of the ode routines built into >> [x,y]=ode45(dydx,[0 1],1); >> y(length(y)) ans = e-001 Third in-term exam Students whose last names start with A-R will take the exam in the regular classroom, 0 FLG. Students whose last names begin in S-Z will take it in CSE E-0. The exam covers chapters 8-14, and most of the problems will be taken (though simplified) from the Problems section at the end of the chapters. About a quarter of the problems will be from the assigned homework. You need to be know the Matlab matrix operations in Chapter 8 and the following Matlab functions lu, chol,inv, norm, cond, fminsearch, hist, rand, randn, polyfit, polyval, regress. Sample problems: (Simplified 8.4): Given the matrices A 1, B 3 1, perform all the 3 1 multiplications that can be performed between the two.. (Combined 9. and 9.4): Given the system of equations 4x18x 4 x 6x 34 1 a) Write Matlab code to solve graphically. (b) Solve by Gauss elimination (c) Write Matlab code to solve using Matlab left division. (d) Solve by Cramer s rule 3. (Simplified 10.4): Use LU factorization to solve the following system of equations. Show also how to perform the solution in Matlab using the factorization. x1x 7 6x 5x 19 1
6 (Problem 10.14) Compute the Cholesky factorization of Show Matlab code using the corresponding Matlab functions. 5. Calculate the inverse of the matrix in Problem 4, show also the Matlab command that will do that. 6. (Simplified 11.9) Calculate the Frobenius and infinity norms of the matrix in Problem 3. Show also the Matlab commands for doing that, as well as the Matlab command that will calculate the condition number of the matrix. 7. Do one iteration of the Gauss-Seidel solution of the equations in Problem 3, using the vector (,) as initial guess. 8. (Simplified 1.8) Do one iteration of Newton-Raphson for solution of the following system starting with (1,1) x 5 y y1 x 9. (Modified 13.9) : The concentration of bacteria E. coli in a swimming pool after a storm was measured as function of time and given in the following table. T (hr) C (CFU/100ml) (a) Write the Matlab code to fit a linear polynomial to the data and use it to estimate the concentration at time t=0. (b) Because the concentration of bacteria cannot be negative, a linear fit is not likely to do well to predict future concentrations (it will eventually become negative). Suggest a relation between concentration and time that also has two unknowns parameters and that will not go negative, and write the Matlab code to implement it and use it to estimate the concentration at t= (Simplified 14.10) In Problem 9 assume that there are two varieties of E. coli, each decaying exponentially with time. Write Matlab code to estimate their concentrations at t=0, first with regression, and then by minimizing the residuals using fminsearch. Exam 3 with solution: Second in-term exam All students take the exam in the regular classroom. The exam covers chapters 5-7, and most of the problems will be taken from the Problems section at the end of the chapters. About a quarter of the problems will be from the assigned homework. The Matlab functions that you need to know are fzero, optimset, roots, polyval, fminbnd, contour, fminsearch, and fmincon. The function meshgrid is also useful. Sample problems.
7 1. (Problem 5.6b,c) Determine the root of f(x)=-14-0x+19x -3x 3 in the interval (-1,1) (b) Do one iteration of bisection, and (c) one iteration of false position.. Write Matlab code to find the root using fzero. 3. (Problem 6.3mod). Determine the lowest root of f(x)=x 3-6x +11x-6 (a). Do one iteration of Newton s method using x=0 as starting point; (b) Do one iteration of the secant method using the two points x=-1 and x=0; (c) Write a possible fixed point iteration and do one iteration starting at x=0; (d) write Matlab code to calculate the roots using the roots function; (e) write Matlab code to calculate the lowest root using fzero. 4. (Problem 6.8mod). Find the root of the equation e x =6-10x (a) Write a possible fixed point iteration and assess its convergence potential for x in (0,1); (b) perform one iteration of the fixed point iteration; (c) perform one iteration of Newton s method starting at x=1. Use e= (Problem 7.7mod). Find the maximum of the function f(x)=4x-x +x 3-0.5x 4 known to be in the interval (0,) (a) Indicate at what value of x you will evaluate the function for the golden search method; (b) Using parabolic interpolation with the points x=0, x=1, x=. (c) Do one iteration of Newton s method starting at x=1; (d) write Matlab code to solve the problem using fminbnd. 6. (Problem 7.19mod) Write Matlab code to use fminsearch to calculate the minimum of f(x,y)=y -.5xy-1.75y+1.5x starting at (0,0). Write Matlab code to solve the same problem graphically using contours. Exam and solution. First in-term exam Students whose last names start with A-R will take the exam in the regular classroom, 0 FLG. Students whose last names begin in S-Z will take it in CSE E-0. The exam covers chapters 1-4, and the problems will be taken entirely from the Problems section at the end of the chapters. About a quarter or a third of the problems will be from the assigned homework. Sample problems: 1, Problem.4 is an example of a problem that can be given as is a short problem without changes, because the solution involves a single Matlab statement. Problems.,.11, 3.4, 3.11 are examples of problems that can be given as long problem without changes because the solutions require only five Matlab statements or less per problem. 3. Problem.15b is an example of a problem that can be shortened by asking only as q[4::10]; sum(q); 4. Problem 3.8 is an example of a problem that can be shortened to 8 statements by giving everybody below 80 a C grade. It can be further shortened by giving you the first and last statements. (function grade = lettergrade(score), and end). 5. Problem 4.1 is an example of a problem that can be converted into a short problem by leaving out the first couple of digits. That is what is the base 10 number corresponding to binary. 6. Problem 4.8 is an example of a problem that cannot be given on the exam because it requires a calculator.
8 7. Problem 4.15 is an example that can be simplified so that it can be done without a calculator, by simplifying f(x)=x and changing the step size to h=1. Exam-1 solution.
EGR 102 Introduction to Engineering Modeling. Lab 09B Recap Regression Analysis & Structured Programming
EGR 102 Introduction to Engineering Modeling Lab 09B Recap Regression Analysis & Structured Programming EGR 102 - Fall 2018 1 Overview Data Manipulation find() built-in function Regression in MATLAB using
More informationChapter 7 One-Dimensional Search Methods
Chapter 7 One-Dimensional Search Methods An Introduction to Optimization Spring, 2014 1 Wei-Ta Chu Golden Section Search! Determine the minimizer of a function over a closed interval, say. The only assumption
More informationMarket Risk Analysis Volume I
Market Risk Analysis Volume I Quantitative Methods in Finance Carol Alexander John Wiley & Sons, Ltd List of Figures List of Tables List of Examples Foreword Preface to Volume I xiii xvi xvii xix xxiii
More informationCS227-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
More informationThis method uses not only values of a function f(x), but also values of its derivative f'(x). If you don't know the derivative, you can't use it.
Finding Roots by "Open" Methods The differences between "open" and "closed" methods The differences between "open" and "closed" methods are closed open ----------------- --------------------- uses a bounded
More informationNumerical Analysis Math 370 Spring 2009 MWF 11:30am - 12:25pm Fowler 110 c 2009 Ron Buckmire
Numerical Analysis Math 37 Spring 9 MWF 11:3am - 1:pm Fowler 11 c 9 Ron Buckmire http://faculty.oxy.edu/ron/math/37/9/ Worksheet 9 SUMMARY Other Root-finding Methods (False Position, Newton s and Secant)
More informationImplementing 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
More informationBARUCH COLLEGE MATH 2003 SPRING 2006 MANUAL FOR THE UNIFORM FINAL EXAMINATION
BARUCH COLLEGE MATH 003 SPRING 006 MANUAL FOR THE UNIFORM FINAL EXAMINATION The final examination for Math 003 will consist of two parts. Part I: Part II: This part will consist of 5 questions similar
More informationCS 3331 Numerical Methods Lecture 2: Functions of One Variable. Cherung Lee
CS 3331 Numerical Methods Lecture 2: Functions of One Variable Cherung Lee Outline Introduction Solving nonlinear equations: find x such that f(x ) = 0. Binary search methods: (Bisection, regula falsi)
More informationEC316a: Advanced Scientific Computation, Fall Discrete time, continuous state dynamic models: solution methods
EC316a: Advanced Scientific Computation, Fall 2003 Notes Section 4 Discrete time, continuous state dynamic models: solution methods We consider now solution methods for discrete time models in which decisions
More informationFigure (1) The approximation can be substituted into equation (1) to yield the following iterative equation:
Computers & Softw are Eng. Dep. The Secant Method: A potential problem in implementing the Newton - Raphson method is the evolution o f the derivative. Although this is not inconvenient for polynomials
More informationFinding Zeros of Single- Variable, Real Func7ons. Gautam Wilkins University of California, San Diego
Finding Zeros of Single- Variable, Real Func7ons Gautam Wilkins University of California, San Diego General Problem - Given a single- variable, real- valued func7on, f, we would like to find a real number,
More informationFinal Exam Review - MAT 0028
Final Exam Review - MAT 0028 All questions on the final exam are multiple choice. You will be graded on your letter choices only - no partial credit will be awarded. To maximize the benefit of this review,
More informationGolden-Section Search for Optimization in One Dimension
Golden-Section Search for Optimization in One Dimension Golden-section search for maximization (or minimization) is similar to the bisection method for root finding. That is, it does not use the derivatives
More informationMath 229 FINAL EXAM Review: Fall Final Exam Monday December 11 ALL Projects Due By Monday December 11
Math 229 FINAL EXAM Review: Fall 2018 1 Final Exam Monday December 11 ALL Projects Due By Monday December 11 1. Problem 1: (a) Write a MatLab function m-file to evaluate the following function: f(x) =
More informationTest # 4 Review Math MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Test # 4 Review Math 25 Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Find the integral. ) 4(2x + 5) A) 4 (2x + 5) 4 + C B) 4 (2x + 5) 4 +
More informationFinancial derivatives exam Winter term 2014/2015
Financial derivatives exam Winter term 2014/2015 Problem 1: [max. 13 points] Determine whether the following assertions are true or false. Write your answers, without explanations. Grading: correct answer
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More information5 Error Control. 5.1 The Milne Device and Predictor-Corrector Methods
5 Error Control 5. The Milne Device and Predictor-Corrector Methods We already discussed the basic idea of the predictor-corrector approach in Section 2. In particular, there we gave the following algorithm
More informationFactoring is the process of changing a polynomial expression that is essentially a sum into an expression that is essentially a product.
Ch. 8 Polynomial Factoring Sec. 1 Factoring is the process of changing a polynomial expression that is essentially a sum into an expression that is essentially a product. Factoring polynomials is not much
More informationSensitivity Analysis with Data Tables. 10% annual interest now =$110 one year later. 10% annual interest now =$121 one year later
Sensitivity Analysis with Data Tables Time Value of Money: A Special kind of Trade-Off: $100 @ 10% annual interest now =$110 one year later $110 @ 10% annual interest now =$121 one year later $100 @ 10%
More informationLecture 3: Review of Probability, MATLAB, Histograms
CS 4980/6980: Introduction to Data Science c Spring 2018 Lecture 3: Review of Probability, MATLAB, Histograms Instructor: Daniel L. Pimentel-Alarcón Scribed and Ken Varghese This is preliminary work and
More informationFactoring is the process of changing a polynomial expression that is essentially a sum into an expression that is essentially a product.
Ch. 8 Polynomial Factoring Sec. 1 Factoring is the process of changing a polynomial expression that is essentially a sum into an expression that is essentially a product. Factoring polynomials is not much
More informationHIGH ORDER DISCONTINUOUS GALERKIN METHODS FOR 1D PARABOLIC EQUATIONS. Ahmet İzmirlioğlu. BS, University of Pittsburgh, 2004
HIGH ORDER DISCONTINUOUS GALERKIN METHODS FOR D PARABOLIC EQUATIONS by Ahmet İzmirlioğlu BS, University of Pittsburgh, 24 Submitted to the Graduate Faculty of Art and Sciences in partial fulfillment of
More informationDirect Methods for linear systems Ax = b basic point: easy to solve triangular systems
NLA p.1/13 Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems... 0 0 0 etc. a n 1,n 1 x n 1 = b n 1 a n 1,n x n solve a n,n x n = b n then back substitution: takes n
More informationWhat can we do with numerical optimization?
Optimization motivation and background Eddie Wadbro Introduction to PDE Constrained Optimization, 2016 February 15 16, 2016 Eddie Wadbro, Introduction to PDE Constrained Optimization, February 15 16, 2016
More informationFinal Study Guide MATH 111
Final Study Guide MATH 111 The final will be cumulative. There will probably be a very slight emphasis on the material from the second half of the class. In terms of the material in the first half, please
More information32.4. Parabolic PDEs. Introduction. Prerequisites. Learning Outcomes
Parabolic PDEs 32.4 Introduction Second-order partial differential equations (PDEs) may be classified as parabolic, hyperbolic or elliptic. Parabolic and hyperbolic PDEs often model time dependent processes
More informationSolution of Equations
Solution of Equations Outline Bisection Method Secant Method Regula Falsi Method Newton s Method Nonlinear Equations This module focuses on finding roots on nonlinear equations of the form f()=0. Due to
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationYou are responsible for upholding the University of Maryland Honor Code while taking this exam.
Econ 300 Spring 013 First Midterm Exam version W Answers This exam consists of 5 multiple choice questions. The maximum duration of the exam is 50 minutes. 1. In the spaces provided on the scantron, write
More informationStatistics and Machine Learning Homework1
Statistics and Machine Learning Homework1 Yuh-Jye Lee National Taiwan University of Science and Technology dmlab1.csie.ntust.edu.tw/leepage/index c.htm Exercise 1: (a) Solve 1 min x R 2 2 xt 1 0 0 900
More informationFinal Projects Introduction to Numerical Analysis Professor: Paul J. Atzberger
Final Projects Introduction to Numerical Analysis Professor: Paul J. Atzberger Due Date: Friday, December 12th Instructions: In the final project you are to apply the numerical methods developed in the
More informationThe method of false position is also an Enclosure or bracketing method. For this method we will be able to remedy some of the minuses of bisection.
Section 2.2 The Method of False Position Features of BISECTION: Plusses: Easy to implement Almost idiot proof o If f(x) is continuous & changes sign on [a, b], then it is GUARANTEED to converge. Requires
More informationFebruary 2 Math 2335 sec 51 Spring 2016
February 2 Math 2335 sec 51 Spring 2016 Section 3.1: Root Finding, Bisection Method Many problems in the sciences, business, manufacturing, etc. can be framed in the form: Given a function f (x), find
More informationTopic #1: Evaluating and Simplifying Algebraic Expressions
John Jay College of Criminal Justice The City University of New York Department of Mathematics and Computer Science MAT 105 - College Algebra Departmental Final Examination Review Topic #1: Evaluating
More informationEconomics 2010c: Lecture 4 Precautionary Savings and Liquidity Constraints
Economics 2010c: Lecture 4 Precautionary Savings and Liquidity Constraints David Laibson 9/11/2014 Outline: 1. Precautionary savings motives 2. Liquidity constraints 3. Application: Numerical solution
More informationName Date Student id #:
Math1090 Final Exam Spring, 2016 Instructor: Name Date Student id #: Instructions: Please show all of your work as partial credit will be given where appropriate, and there may be no credit given for problems
More informationPrinciples of Financial Computing
Principles of Financial Computing Prof. Yuh-Dauh Lyuu Dept. Computer Science & Information Engineering and Department of Finance National Taiwan University c 2008 Prof. Yuh-Dauh Lyuu, National Taiwan University
More informationMath Winter 2014 Exam 1 January 30, PAGE 1 13 PAGE 2 11 PAGE 3 12 PAGE 4 14 Total 50
Name: Math 112 - Winter 2014 Exam 1 January 30, 2014 Section: Student ID Number: PAGE 1 13 PAGE 2 11 PAGE 3 12 PAGE 4 14 Total 50 After this cover page, there are 5 problems spanning 4 pages. Please make
More informationContents Critique 26. portfolio optimization 32
Contents Preface vii 1 Financial problems and numerical methods 3 1.1 MATLAB environment 4 1.1.1 Why MATLAB? 5 1.2 Fixed-income securities: analysis and portfolio immunization 6 1.2.1 Basic valuation of
More informationThe method of Maximum Likelihood.
Maximum Likelihood The method of Maximum Likelihood. In developing the least squares estimator - no mention of probabilities. Minimize the distance between the predicted linear regression and the observed
More informationNUMERICAL AND SIMULATION TECHNIQUES IN FINANCE
NUMERICAL AND SIMULATION TECHNIQUES IN FINANCE Edward D. Weinberger, Ph.D., F.R.M Adjunct Assoc. Professor Dept. of Finance and Risk Engineering edw2026@nyu.edu Office Hours by appointment This half-semester
More informationMath1090 Midterm 2 Review Sections , Solve the system of linear equations using Gauss-Jordan elimination.
Math1090 Midterm 2 Review Sections 2.1-2.5, 3.1-3.3 1. Solve the system of linear equations using Gauss-Jordan elimination. 5x+20y 15z = 155 (a) 2x 7y+13z=85 3x+14y +6z= 43 x+z= 2 (b) x= 6 y+z=11 x y+
More informationHKUST. MATH1003 Calculus and Linear Algebra. Directions:
HKUST MATH1003 Calculus and Linear Algebra Midterm Exam (Version A) 8th October 2016 Name: Student ID: 10:30-12:00 Lecture Section: Directions: Do NOT open the exam until instructed to do so. Please turn
More informationFinding Roots by "Closed" Methods
Finding Roots by "Closed" Methods One general approach to finding roots is via so-called "closed" methods. Closed methods A closed method is one which starts with an interval, inside of which you know
More information2) Endpoints of a diameter (-1, 6), (9, -2) A) (x - 2)2 + (y - 4)2 = 41 B) (x - 4)2 + (y - 2)2 = 41 C) (x - 4)2 + y2 = 16 D) x2 + (y - 2)2 = 25
Math 101 Final Exam Review Revised FA17 (through section 5.6) The following problems are provided for additional practice in preparation for the Final Exam. You should not, however, rely solely upon these
More informationMath 1526 Summer 2000 Session 1
Math 1526 Summer 2 Session 1 Lab #2 Part #1 Rate of Change This lab will investigate the relationship between the average rate of change, the slope of a secant line, the instantaneous rate change and the
More informationLos Angeles Unified School District Division of Instruction Financial Algebra Course 2
Unit 1 Discretionary Expenses FAS 1-1 Discretionary vs. Essential Expenses - measures of central tendency (revisited) FAS 1-2 Travel Expenses - cumulative frequency (revisited), relative frequency, percentiles
More informationRandom Variables and Probability Distributions
Chapter 3 Random Variables and Probability Distributions Chapter Three Random Variables and Probability Distributions 3. Introduction An event is defined as the possible outcome of an experiment. In engineering
More informationMultivariate Statistics Lecture Notes. Stephen Ansolabehere
Multivariate Statistics Lecture Notes Stephen Ansolabehere Spring 2004 TOPICS. The Basic Regression Model 2. Regression Model in Matrix Algebra 3. Estimation 4. Inference and Prediction 5. Logit and Probit
More informationGraduate Macro Theory II: Notes on Value Function Iteration
Graduate Macro Theory II: Notes on Value Function Iteration Eric Sims University of Notre Dame Spring 07 Introduction These notes discuss how to solve dynamic economic models using value function iteration.
More information( ) 4 ( )! x f) h(x) = 2cos x + 1
Chapter Prerequisite Skills BLM -.. Identifying Types of Functions. Identify the type of function (polynomial, rational, logarithmic, etc.) represented by each of the following. Justify your response.
More informationFinal Projects Introduction to Numerical Analysis atzberg/fall2006/index.html Professor: Paul J.
Final Projects Introduction to Numerical Analysis http://www.math.ucsb.edu/ atzberg/fall2006/index.html Professor: Paul J. Atzberger Instructions: In the final project you will apply the numerical methods
More informationInstantaneous rate of change (IRC) at the point x Slope of tangent
CHAPTER 2: Differentiation Do not study Sections 2.1 to 2.3. 2.4 Rates of change Rate of change (RC) = Two types Average rate of change (ARC) over the interval [, ] Slope of the line segment Instantaneous
More informationAn IMEX-method for pricing options under Bates model using adaptive finite differences Rapport i Teknisk-vetenskapliga datorberäkningar
PROJEKTRAPPORT An IMEX-method for pricing options under Bates model using adaptive finite differences Arvid Westlund Rapport i Teknisk-vetenskapliga datorberäkningar Jan 2014 INSTITUTIONEN FÖR INFORMATIONSTEKNOLOGI
More informationFinal Exam Key, JDEP 384H, Spring 2006
Final Exam Key, JDEP 384H, Spring 2006 Due Date for Exam: Thursday, May 4, 12:00 noon. Instructions: Show your work and give reasons for your answers. Write out your solutions neatly and completely. There
More informationThe Intermediate Value Theorem states that if a function g is continuous, then for any number M satisfying. g(x 1 ) M g(x 2 )
APPM/MATH 450 Problem Set 5 s This assignment is due by 4pm on Friday, October 25th. You may either turn it in to me in class or in the box outside my office door (ECOT 235). Minimal credit will be given
More informationAppendix G: Numerical Solution to ODEs
Appendix G: Numerical Solution to ODEs The numerical solution to any transient problem begins with the derivation of the governing differential equation, which allows the calculation of the rate of change
More informationlecture 31: The Secant Method: Prototypical Quasi-Newton Method
169 lecture 31: The Secant Method: Prototypical Quasi-Newton Method Newton s method is fast if one has a good initial guess x 0 Even then, it can be inconvenient and expensive to compute the derivatives
More informationMath 111 Midterm II February 20th, 2007
NAME: Student ID #: QUIZ SECTION: Math 111 Midterm II February 0th, 007 Problem 1 15 Problem 14 Problem 3 15 Problem 4 6 Total: 50 Your exam should contain 5 pages in total and 4 problems Please check
More informationPractice Final Exam Fall a) Write the equations for the revenue, cost, and profit functions. Let x be the number of batteries.
Practice Final Exam Fall 2017 1) A manufacturer sells car batteries for $150 each. The company s fixed costs are $45,000 per month, and marginal costs are $55 per battery. a) Write the equations for the
More informationParameter estimation in SDE:s
Lund University Faculty of Engineering Statistics in Finance Centre for Mathematical Sciences, Mathematical Statistics HT 2011 Parameter estimation in SDE:s This computer exercise concerns some estimation
More informationMath 115 Chapter 4 Exam - Part 1 Spring Break 2011
Spring 20 Name: Math 5 Chapter 4 Exam - Part Spring Break 20 Directions: i. On 8.5" x " paper, show all relavent work. No work, no credit. ii. On two 882-E SCANTRON forms, fill in all your answers. iii.
More informationFeb. 4 Math 2335 sec 001 Spring 2014
Feb. 4 Math 2335 sec 001 Spring 2014 Propagated Error in Function Evaluation Let f (x) be some differentiable function. Suppose x A is an approximation to x T, and we wish to determine the function value
More informationUnit 1 Maths Methods (CAS) Exam 2013 Thursday June 6th pm
Name: Teacher: Unit 1 Maths Methods (CAS) Exam 2013 Thursday June 6th 1.50-3.20 pm Reading time: 10 Minutes Writing time: 80 Minutes Instruction to candidates: Students are permitted to bring into the
More informationOptimization for Chemical Engineers, 4G3. Written midterm, 23 February 2015
Optimization for Chemical Engineers, 4G3 Written midterm, 23 February 2015 Kevin Dunn, kevin.dunn@mcmaster.ca McMaster University Note: No papers, other than this test and the answer booklet are allowed
More informationSolutions of Equations in One Variable. Secant & Regula Falsi Methods
Solutions of Equations in One Variable Secant & Regula Falsi Methods Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University
More informationHints on Some of the Exercises
Hints on Some of the Exercises of the book R. Seydel: Tools for Computational Finance. Springer, 00/004/006/009/01. Preparatory Remarks: Some of the hints suggest ideas that may simplify solving the exercises
More informationELEMENTS OF MONTE CARLO SIMULATION
APPENDIX B ELEMENTS OF MONTE CARLO SIMULATION B. GENERAL CONCEPT The basic idea of Monte Carlo simulation is to create a series of experimental samples using a random number sequence. According to the
More informationA CONTROL PERSPECTIVE TO ADAPTIVE TIME STEPPING IN RESERVOIR SIMULATION. A Thesis DANY ELOM AKAKPO
A CONTROL PERSPECTIVE TO ADAPTIVE TIME STEPPING IN RESERVOIR SIMULATION A Thesis by DANY ELOM AKAKPO Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment
More informationBARUCH COLLEGE MATH 2205 SPRING MANUAL FOR THE UNIFORM FINAL EXAMINATION Joseph Collison, Warren Gordon, Walter Wang, April Allen Materowski
BARUCH COLLEGE MATH 05 SPRING 006 MANUAL FOR THE UNIFORM FINAL EXAMINATION Joseph Collison, Warren Gordon, Walter Wang, April Allen Materowski The final examination for Math 05 will consist of two parts.
More informationSTA 103: Final Exam. Print clearly on this exam. Only correct solutions that can be read will be given credit.
STA 103: Final Exam June 26, 2008 Name: } {{ } by writing my name i swear by the honor code Read all of the following information before starting the exam: Print clearly on this exam. Only correct solutions
More informationCalculus Review with Matlab
Calculus Review with Matlab While Matlab is capable of doing symbolic math (i.e. algebra) for us, the real power of Matlab comes out when we use it to implement numerical methods for solving problems,
More informationAlg2A Factoring and Equations Review Packet
1 Multiplying binomials: We have a special way of remembering how to multiply binomials called FOIL: F: first x x = x 2 (x + 7)(x + 5) O: outer x 5 = 5x I: inner 7 x = 7x x 2 + 5x +7x + 35 (then simplify)
More informationMaximum Likelihood Estimation
Maximum Likelihood Estimation EPSY 905: Fundamentals of Multivariate Modeling Online Lecture #6 EPSY 905: Maximum Likelihood In This Lecture The basics of maximum likelihood estimation Ø The engine that
More informationPricing Bermudan options in Lévy process models
1 1 Dept. of Industrial & Enterprise Systems Engineering University of Illinois at Urbana-Champaign Joint with Xiong Lin Bachelier Finance Society 6th Congress 6/24/2010 American options in Lévy models
More informationAlgebra I EOC - Review 1 st Semester, (2x + 1) 3
Algebra I EOC - Review 1 st Semester, 2013 Simplify the following. 1. - 2 1 (x 3) + 5 4 (2x + 1) 2. 4 3 (2x + 1) 3 2 (x 1) 3. (6x 4) + 5(2x + 3) 4. -2(3x 1) 4(x + 1) Find the following for each of the
More informationExact shape-reconstruction by one-step linearization in EIT
Exact shape-reconstruction by one-step linearization in EIT Bastian von Harrach harrach@ma.tum.de Department of Mathematics - M1, Technische Universität München, Germany Joint work with Jin Keun Seo, Yonsei
More informationMath Final Examination STUDY GUIDE Fall Name Score TOTAL Final Grade
Math 10006 Final Examination STUDY GUIDE Fall 010 Name Score TOTAL Final Grade The Use of a calculator is permitted on this exam. Duration of the test is 13 minutes and will have less number of questions
More informationChapter 2 Rocket Launch: AREA BETWEEN CURVES
ANSWERS Mathematics (Mathematical Analysis) page 1 Chapter Rocket Launch: AREA BETWEEN CURVES RL-. a) 1,.,.; $8, $1, $18, $0, $, $6, $ b) x; 6(x ) + 0 RL-. a), 16, 9,, 1, 0; 1,,, 7, 9, 11 c) D = (-, );
More informationPartitioned Analysis of Coupled Systems
Partitioned Analysis of Coupled Systems Hermann G. Matthies, Rainer Niekamp, Jan Steindorf Technische Universität Braunschweig Brunswick, Germany wire@tu-bs.de http://www.wire.tu-bs.de Coupled Problems
More informationHomework #4. Due back: Beginning of class, Friday 5pm, December 11, 2009.
Fatih Guvenen University of Minnesota Homework #4 Due back: Beginning of class, Friday 5pm, December 11, 2009. Questions indicated by a star are required for everybody who attends the class. You can use
More information25 Increasing and Decreasing Functions
- 25 Increasing and Decreasing Functions It is useful in mathematics to define whether a function is increasing or decreasing. In this section we will use the differential of a function to determine this
More informationEcon 582 Nonlinear Regression
Econ 582 Nonlinear Regression Eric Zivot June 3, 2013 Nonlinear Regression In linear regression models = x 0 β (1 )( 1) + [ x ]=0 [ x = x] =x 0 β = [ x = x] [ x = x] x = β it is assumed that the regression
More informationStatistical analysis of the inverse problem
Statistical analysis of the inverse problem Hongyuan Cao and Jayanta Kumar Pal SAMSI SAMSI/CRSC Undergraduate Workshop at NCSU May 24, 2007 Outline 1 Introduction 2 Preliminary analysis Estimation of parameters
More informationSystems of Ordinary Differential Equations. Lectures INF2320 p. 1/48
Systems of Ordinary Differential Equations Lectures INF2320 p. 1/48 Lectures INF2320 p. 2/48 ystems of ordinary differential equations Last two lectures we have studied models of the form y (t) = F(y),
More informationProject exam for STK Computational statistics
Project exam for STK4051 - Computational statistics Fall 2017 Part 1 (of 2) This is the first part of the exam project set for STK4051/9051, fall semester 2017. It is made available on the course website
More informationSlide 1 / 128. Polynomials
Slide 1 / 128 Polynomials Slide 2 / 128 Table of Contents Factors and GCF Factoring out GCF's Factoring Trinomials x 2 + bx + c Factoring Using Special Patterns Factoring Trinomials ax 2 + bx + c Factoring
More informationACCUPLACER Elementary Algebra Assessment Preparation Guide
ACCUPLACER Elementary Algebra Assessment Preparation Guide Please note that the guide is for reference only and that it does not represent an exact match with the assessment content. The Assessment Centre
More informationThe Impact of Computational Error on the Volatility Smile
The Impact of Computational Error on the Volatility Smile Don M. Chance Louisiana State University Thomas A. Hanson Kent State University Weiping Li Oklahoma State University Jayaram Muthuswamy Kent State
More informationExact shape-reconstruction by one-step linearization in EIT
Exact shape-reconstruction by one-step linearization in EIT Bastian von Harrach harrach@math.uni-mainz.de Zentrum Mathematik, M1, Technische Universität München, Germany Joint work with Jin Keun Seo, Yonsei
More informationUnit 8 Notes: Solving Quadratics by Factoring Alg 1
Unit 8 Notes: Solving Quadratics by Factoring Alg 1 Name Period Day Date Assignment (Due the next class meeting) Tuesday Wednesday Thursday Friday Monday Tuesday Wednesday Thursday Friday Monday Tuesday
More informationMAE384 HW1 Discussion
MAE384 HW1 Discussion Prob. 1 We have already discussed this problem in some detail in class. The only point of note is that chopping, instead of rounding, should be applied to every step of the calculation
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2018 Last Time: Markov Chains We can use Markov chains for density estimation, p(x) = p(x 1 ) }{{} d p(x
More informationSJAM MPM 1D Unit 5 Day 13
Homework 1. Identify the dependent variable. a) The distance a person walks depends on the time they walk. b) The recipe for 1 muffins requires cups of flour. c) Houses need 1 fire alarm per floor.. Identify
More informationFINANCIAL ECONOMETRICS AND EMPIRICAL FINANCE - MODULE 2 General Exam - June 2012
FINANCIAL ECONOMETRICS AND EMPIRICAL FINANCE - MODULE 2 General Exam - June 2012 Time Allowed: 105 Minutes Family Name (Surname). First Name. Student Number (Matr.) Please answer all the questions by choosing
More informationStrong Stability Preserving Time Discretizations
Strong Stability Preserving Time Discretizations Sigal Gottlieb University of Massachusetts Dartmouth AFOSR Computational Math Program Review August 2015 SSP time stepping August2015 1 / 33 Past and Current
More informationFrequency Distributions
Frequency Distributions January 8, 2018 Contents Frequency histograms Relative Frequency Histograms Cumulative Frequency Graph Frequency Histograms in R Using the Cumulative Frequency Graph to Estimate
More informationChapter 3: Black-Scholes Equation and Its Numerical Evaluation
Chapter 3: Black-Scholes Equation and Its Numerical Evaluation 3.1 Itô Integral 3.1.1 Convergence in the Mean and Stieltjes Integral Definition 3.1 (Convergence in the Mean) A sequence {X n } n ln of random
More information