Numerical Methods - Lecture 2. Numerical Methods. Lecture 2. Analysis of errors in numerical methods
|
|
- Hector Black
- 5 years ago
- Views:
Transcription
1 Numerical Methods - Lecture 1 Numerical Methods Lecture. Analysis o errors in numerical methods
2 Numerical Methods - Lecture Why represent numbers in loating point ormat? Eample 1. How a number can be represented using 5-places? What is the smallest number that can be represented in this ormat? What is the largest number that can be represented in this ormat?
3 Numerical Methods - Lecture 3 Why represent numbers in loating point ormat? Eample. How a number can be represented using 5-places? rounded o chopped Conclusion: The error is smaller than 0.01
4 Numerical Methods - Lecture 4 Calculation o errors True Error o accurate or true value o o Relative True Error o o Calculations: t o o % 100% %
5 Numerical Methods - Lecture 5 Calculation o errors Relative errors o small numbers are large. Compare: t o o % 100% % t o o % 100% % Absolute true errors are the same: o
6 Numerical Methods - Lecture 6 How to keep relative true errors at a constant level? The number can be represented as: sign mantissa 10 eponent or sign mantissa eponent is written as is written as is written as
7 Numerical Methods - Lecture 7 Floating point arithmetic decimal representation Form o a number e m10 an integer eponent sign (-1 or +1) mantissa (1) 10 m<(10) 10 Eample m.5678 e
8 Numerical Methods - Lecture 8 Floating point arithmetic binary representation Form o a number e m an integer eponent sign (0 positive or 1 negative) mantisses (1) m<() Eample: (101) 1 is not represented 0 m e 101
9 Numerical Methods - Lecture 9 What do we gain by using the loating point representation? The rage o the numbers that can be epressed has increased I we use only 5 places to represent a positive number with a positive eponent, the smallest number that can be epressed is 1 and the largest is mantissa eponent The range o numbers that can be represented has increased rom to
10 Numerical Methods - Lecture 10 What do we lose by using a loating point representation? Precision Why? The number will be represented as on ive places: mantissa eponent There will be a round-o error.
11 Numerical Methods - Lecture 11 Test problem 1 1. Write down the number on ive places in a similar manner as that discussed in the previous eample: mantissa eponent. Calculate the true error and the relative true error o round o 3. Compare the results with the previous eample (56.78).
12 Numerical Methods - Lecture 1 Test problem We have 9-bits irst bit represents the sign o the number, second bit represents the sign o the eponent, the net our bits represent the mantissa, the last three bits represent the eponent 0 0 sign eponent sign mantissa eponent Find the number (in decimal), which is presented above
13 Numerical Methods - Lecture 13 Solution o the problem 1 1. The number written on ive places is: mantissa eponent. The true error is 9.78 and the relative true error is % 3. For the number these errors are: 0.0 (smaller) and % (comparable)
14 Numerical Methods - Lecture 14 Solution o the problem is not represented 54 10
15 Numerical Methods - Lecture 15 What is the accuracy ε? For each digital machine epsilon ε is deined as a parameter determining the accuracy o the calculations: t ε N where: N= (in binary), N=10 (in decimal), t is the number o bits representing the mantissa 5 ε is lowered when more bits are allocated to represent the mantissa M Epsilon ε can be regarded as a parameter characterizing the accuracy o the computing machine (small ε = more accurate calculations). Double precision (Fortran) DP
16 Numerical Methods - Lecture 16 What is the accuracy ε? Epsilon ε is the smallest number that when added to produces a number that can be represented as dierent rom Eample: 10-bit word M N w sign eponent mantissa eponent sign the net number 10 mach
17 Numerical Methods - Lecture 17 Single precision in IEEE-754 ormat (Institute o Electrical and Electronics Engineers) 3 bits or single precision sign (s) eponent (e ) mantissa (m) Number e' 17 1 m. s ( 1)
18 Numerical Methods - Lecture 18 Eample Sign (s) Biased Eponent (e ) Mantissa (m) Value s e' m 1 ( )
19 Numerical Methods - Lecture 19 The eponent or the 3-bit IEEE -754 standard 8-bit eponent means 17 e 18 0 e 55 The ied eponent shit is 17 and thereore In act, 1 e 54 e 0 e 55 Numbers and are reserved or special cases Eponent range 16 e 17
20 Numerical Methods - Lecture 0 Representation o special numbers e e 0 55 all zeros all ones e s m Represents 0 zeros zeros 0 1 zeros zeros -0 0 ones zeros 1 ones zeros 0 or 1 ones nonzero NaN
21 1 IEEE-754 Format The largest number The smallest number Epsilon mach
22 Numerical Methods - Lecture Analysis o errors I we do not know the eact value o o we calculate the approimate error as the dierence in the values obtained in the consecutive approimations: n n1 Relative error ε a : a n n1 n
23 Numerical Methods - Lecture 3 Eample For 0.5 ( ) 7e at a) () or h 0. 3 () b) or h ind c) approimate error Solution ' ( ) ( h) h ( ) a) h 0.3 '() ( 0,3) 0,3 () 7e 0,5(,3) 7e 0,3 0,5() 10,65
24 Numerical Methods - Lecture 4 Eample (cont.) b) h 0.15 '() ( 0,15) 0,15 () 7e 0,5(,15) 0,15 7e 0,5() 9,880 c) a n n1 n a 9,880 10,65 9,8800 0,0389 Error 3,89%
25 Numerical Methods - Lecture 5 The relative error as a criterion or ending the iterative procedure I the relative error is less than or equal to a predetermined number then urther iterations are no longer required a s I we require at least m signiicant digits in the result then ε a m
26 Numerical Methods - Lecture 6 Relative error and signiicant digits ε a m h () N/A a m The eact value is 9.514
27 Numerical Methods - Lecture 7 Sources o errors in numerical calculations 1. Input errors (input data errors). Truncation error 3. Round o error Input errors occur when the input data entered into the computer memory are dierent rom the eact values. Truncation errors are errors due to numerical procedures caused by reducing the number o operations. Round o errors are errors that usually can not be avoided. They arise in the course o the calculations, and can be reduced by setting skillully the method and sequence o tasks.
28 Numerical Methods - Lecture 8 Input errors Sources o input errors: the input data are the result o measurement o physical quantities a inite length o binary words and thereore prerounding is needed preliminary rounding o irrational numbers Rounding o numbers that cannot be epressed eactly is accomplished by: chopping rounding o
29 Numerical Methods - Lecture 9 Eample: 3,1415 3, ,1416 chopping rounding o Rounding o introduces smaller error than chopping.
30 Numerical Methods - Lecture 30 Truncation error Caused by the use o the approimate ormula instead o a ull mathematical operation: when calculating the sum o the ininite series when calculating integral, derivative W lim 0 1 F 1 Fd work
31 Numerical Methods - Lecture 31 Taylor series I the unction is continuous and all derivatives ', '',... n eist within the interval [, + h] the value o the unction at the point + h can be calculated as: h h! h 3! h 3 The Maclaurin series is simply the Taylor series about the point =0 0 h 0 0h 0 0 h! h 3 3!
32 Numerical Methods - Lecture 3 Eamples Some eamples o Taylor series which you must have seen cos( ) 1! 4 4! 6 6! sin( ) 3 3! 5 5! 7 7! e 1! 3 3!
33 33 Truncation error in the Taylor series R n h h h h n n n!! ' ' remainder c n h R n n n 1 1 1)! ( ) ( h c Numerical Methods - Lecture
34 Eample The Taylor series or e at point =0 is given by e 1! 3 3! 4 4! 5 5! It can be seen that as the number o terms used increases, the error decreases and hence a better estimate can be ound. Question: How many terms would it require to get an approimation o e 1 with a true error o less than 10-6? 1 e 1 11! Numerical Methods - Lecture 1 3 3! 1 4! 1 5!
35 Numerical Methods - Lecture 35 Solution 0, h 1, ( ) e R n h n1 c ( n n1 1)! R n 0 1 n n1 1! n1 c since c 0 c c 1 h ( n 1 1)! n 1 1 e n 1! R n c 0 ( n e 1)!
36 Numerical Methods - Lecture 36 Solution e ( n 1)! 10 6 true error ( n 1)! 6 10 e ( n 1)! n 9 It means that 9 terms or more are needed to get a true error less than 10-6
37 Numerical Methods - Lecture 37 Arithmetic operations 1. Addition and subtraction To add or subtract two standard loating-point numbers, the eponents should be made equal with an adequate shit o the mantissa. Eample: Add 0, to 0, shit 0, , =0, Answer: We loose some signiicant digits
38 Numerical Methods - Lecture 38 Arithmetic operations. Multiplication Eample: Multiply 0, by 0, Multiply mantissas and add the eponents. 0, , =0, =0, Division Eample: Divide 0, by 0, , /0, =0, All the time we loose some signiicant digits which is the source o the error
39 Numerical Methods - Lecture 39 Sequence o operations (a+b)-c (a-c)+b lack o associativity a(b-c) (ab-ac) lack o distributive property Eample: a= 0, , b=0, , c=0, (a+b)=0, , =0, , =0, (a+b)-c=0, , =0, (a-c)=0, , =0, =0, (a-c)+b=0, , =0,
40 Numerical Methods - Lecture 40 Wilkinson Lemma Rounding o errors occurring during loating point operations are equivalent to substitution o accurate numbers by slightly perturbed numbers on which we act eactly. For individual arithmetical operations: l( 1 ) 1(1 1) (1 ) l( 1 ) 1 (1 3) 1 (1 3) l( 1 / ) 1 (1 4) / 1 /( (1 5)) symbol o operation perormed on loating-point data and ε i
41 Numerical Methods - Lecture 41 Tragic eample o the rounding o error On February 5th, 1991 in Dhahran, Saudi Arabia, 8 American soldiers were killed in the attack o the Iraqi Scud missiles. The deense system Patriot did not detect any assault. Why? The system calculates the area, which should be scanned based on the speed o the object and the last detection. The internal clock was set to measure every 1/10 second and 4-bit word length was assumed. Due to rounding o, the absolute error was s which ater 100 hours amounted to: sec Based on this, the calculated displacement is 687 m. Object is considered outside the range when the displacement is 137 m
42 Numerical Methods - Lecture 4 Useul hints: In the numerical calculations it is advantageous: To solve the same problem by another method, or by the same method, but with a dierent order o operations To solve the problem on slightly perturbed input data
43 y Numerical Methods - Lecture 44 Propagation o errors u(y) unction y = () tangent dy/d u (y) u() u() dy d 0 0 4
44 Numerical Methods - Lecture 45 Total dierential in application to errors For y=( 1,,... n ) where maimum uncertainties 1,,... n are small compared with the values o the variables 1,,... n the maimum uncertainty o y can be epressed as: y y y y n n
45 Numerical Methods - Lecture 46 Eample Estimate the uncertainty o density ρ o a sphere o mass m and radius R ( m, R) (4 m 3)πR 3 absolute error m m R R but m πR R 3m πr relative error 3 m R
46 Numerical Methods - Lecture 47 Errors o arithmetic operations Addition A a a B b b absolute errors A B a b a b a b ( a b) the addition absolute error Thereore, the addition (subtraction) absolute error is equal to the sum o absolute errors o components. ( a b) a b
47 Numerical Methods - Lecture 48 Errors o arithmetic operations the addition relative error ab the subtraction relative error ab a a a a b b b b Subtraction relative error can be large even i the relative errors o minuend and subtrahend are small. Subtracting o nearly equal numbers should be avoided! This phenomenon is called reduction o signiicant digits It is important or the calculation o Newton s dierence quotients approimating derivatives o unctions, roots o a quadratic equation with the dominant actor o the irst power, etc.
48 The concept o zero We lose the precise meaning o the number 0 i we perorm numerical calculations Eact roots are Approimate solutions 1 3 0, o Veriy that upon substitution o the approimate solutions to +- you will not get 0!!! You should thereore avoid subtraction and the loop condition should not be set to "zero", 0 Numerical Methods - Lecture i a-b<ε 49
49 Numerical Methods - Lecture 50 Tasks and numerical algorithms Numerical task requires a clear and unambiguous description o the unctional relationship between the input or "independent variables" o the task and output data, i.e. searched results. Numerical task is a problem determining the results vector w on the basis o data vector a a Projection W task well-deined w W (a) D w unambiguous assignment
50 Numerical Methods - Lecture 51 Tasks and numerical algorithms Numerical algorithm is a ull description o the operations correctly transorming the input data vector to the vector o output data. The algorithm is ormulated correctly when the number o necessary actions is inite DN D w WN ( a, ) a DN Projection WN w Resulting vector depends on the computing accuracy ε o the machine
51 Numerical Methods - Lecture 5 Eamples o algorithms Given a comple number a=+iy. Calculate 1/a Algorithm I: 1. t y / (tangent phase o number a). 3. a 1 Re a y 1 / a / (module o number a) 1 t 1 t 1 Im a 1 / a / t 1 t The task is well-deined i: y 0 that is: D R (0,0) This algorithm is ormulated correctly (11 necessary steps)
52 Numerical Methods - Lecture 53 Eamples o algorithms Not or each data pair (, y) 0 the solution to the problem can be ound using the algorithm I. 1. There will be an overlow o loating point numbers (or = 0, also because o rounding to zero). The overlow may happen even in the irst step when = 10-5 and y = 10 5 because o the division y / 3. For = 0, and y 0 the solution cannot be determined using this algorithm. The increase in the accuracy o the calculation does not change this act. Algorithm I is not numerically stable
53 Numerical Methods - Lecture 54 Eamples o algorithms Given a comple number a=+iy. Calculate 1/a Algorithm II: 1. r Re 1 a y y. u Im 1 a y y Algorithm II is ormulated correctly (9 necessary steps) Algorithm II is numerically stable due to the continuity o equations or y 0
54 Numerical Methods - Lecture 55 Conditioning and stability The calculation algorithm is numerically stable i or any selected data vector a 0 D there eists an accuracy o the calculations ε 0, that or ε<ε 0 we have a 0 DN( ) and WN ( a, ) W ( a ) lim The algorithm is numerically stable when increasing the accuracy o the calculations any eisting solution to the problem can be ound.
55 Numerical Methods - Lecture 56 Conditioning and stability Due to the rounding o error WN ( a, ) W ( a) By lemma o Wilkinson disturbed data vector can be selected a a D or which WN ( a, ) W ( a a) Size o the disturbance -the data vector a a depends on: -the number o perormed operations -the accuracy o calculations
56 Numerical Methods - Lecture 57 Conditioning and stability Based on Wilkinson s Lemma: when 0 0 Conditioning tells us how much the result o the disturbed vector data diers rom the eact result or vector data that is: a a W(a a) W(a) Condition number B(a) is the number or which the ollowing ormula is satisied: w w B(a) a a w WN ( a, ) W ( a)
57 58 Let us assume the relative error o Condition number ~ ~ The relative error o () ) ~ ( ) ~ )( ~ ( ' ) ~ ( ) ~ ( ) ( Condition number: ) ~ ( ) ~ ( ' ~ Numerical Methods - Lecture
58 Numerical Methods - Lecture 59 Condition number Eample ( ) Condition number: ~ '( ~ ) ( ~ ) 1 1 task is well-conditioned when condition number is small
59 Numerical Methods - Lecture 60 Condition number Eample ( ) 10 1 Condition number: ~ '( ~ ) ( ~ ) 1 ill-conditioned task near =1 i =-1
CISE-301: Numerical Methods Topic 1:
CISE-3: Numerical Methods Topic : Introduction to Numerical Methods and Taylor Series Lectures -4: KFUPM Term 9 Section 8 CISE3_Topic KFUPM - T9 - Section 8 Lecture Introduction to Numerical Methods What
More informationMath Review and Lessons in Calculus
Math Review and Lessons in Calculus Agenda Rules o Eponents Functions Inverses Limits Calculus Rules o Eponents 0 Zero Eponent Rule a * b ab Product Rule * 3 5 a / b a-b Quotient Rule 5 / 3 -a / a Negative
More informationRATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions
RATIONAL FUNCTIONS Finding Asymptotes..347 The Domain....350 Finding Intercepts.....35 Graphing Rational Functions... 35 345 Objectives The ollowing is a list o objectives or this section o the workbook.
More informationIntroduction CSE 541
Introduction CSE 541 1 Numerical methods Solving scientific/engineering problems using computers. Root finding, Chapter 3 Polynomial Interpolation, Chapter 4 Differentiation, Chapter 4 Integration, Chapters
More informationSyllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function.
Precalculus Notes: Unit Polynomial Functions Syllabus Objective:.9 The student will sketch the graph o a polynomial, radical, or rational unction. Polynomial Function: a unction that can be written in
More informationy2 = 0. Show that u = e2xsin(2y) satisfies Laplace's equation.
Review 1 1) State the largest possible domain o deinition or the unction (, ) = 3 - ) Determine the largest set o points in the -plane on which (, ) = sin-1( - ) deines a continuous unction 3) Find the
More informationDifferentiation. The main problem of differential calculus deals with finding the slope of the tangent line at a point on a curve.
Dierentiation The main problem o dierential calculus deals with inding the slope o the tangent line at a point on a curve. deinition() : The slope o a curve at a point p is the slope, i it eists, o the
More informationMath 2412 Activity 1(Due by EOC Sep. 17)
Math 4 Activity (Due by EOC Sep. 7) Determine whether each relation is a unction.(indicate why or why not.) Find the domain and range o each relation.. 4,5, 6,7, 8,8. 5,6, 5,7, 6,6, 6,7 Determine whether
More informationMATH Dr. Halimah Alshehri Dr. Halimah Alshehri
MATH 1101 haalshehri@ksu.edu.sa 1 Introduction To Number Systems First Section: Binary System Second Section: Octal Number System Third Section: Hexadecimal System 2 Binary System 3 Binary System The binary
More information8. THEOREM If the partial derivatives f x. and f y exist near (a, b) and are continuous at (a, b), then f is differentiable at (a, b).
8. THEOREM I the partial derivatives and eist near (a b) and are continuous at (a b) then is dierentiable at (a b). For a dierentiable unction o two variables z= ( ) we deine the dierentials d and d to
More informationChapter 1: Introduction and mathematical preliminaries
Chapter 1: Introduction and mathematical preliminaries Evy Kersalé September 26, 2011 Motivation Most of the mathematical problems you have encountered so far can be solved analytically. However, in real-life,
More informationGrade 10 Arithmetic Progressions
ID : us-0-arithmetic-progressions [] Grade 0 Arithmetic Progressions For more such worksheets visit www.edugain.com Answer t he quest ions () The sum of f irst 9 terms of an arithmetic progression is -234
More informationThe 2nd Texas A&M at Galveston Mathematics Olympiad. September 24, Problems & Solutions
nd Math Olympiad Solutions Problem #: The nd Teas A&M at Galveston Mathematics Olympiad September 4, 00 Problems & Solutions Written by Dr. Lin Qiu A runner passes 5 poles in 30 seconds. How long will
More informationErrors Intensive Computation
Errors Intensive Computation Annalisa Massini - 2015/2016 OVERVIEW Sources of Approimation Before computation modeling empirical measurements previous computations During computation truncation or discretization
More informationObjectives. By the time the student is finished with this section of the workbook, he/she should be able
FUNCTIONS Quadratic Functions......8 Absolute Value Functions.....48 Translations o Functions..57 Radical Functions...61 Eponential Functions...7 Logarithmic Functions......8 Cubic Functions......91 Piece-Wise
More informationAPPENDIX 1 ERROR ESTIMATION
1 APPENDIX 1 ERROR ESTIMATION Measurements are always subject to some uncertainties no matter how modern and expensive equipment is used or how careully the measurements are perormed These uncertainties
More informationThis is only a list of questions use a separate sheet to work out the problems. 1. (1.2 and 1.4) Use the given graph to answer each question.
Mth Calculus Practice Eam Questions NOTE: These questions should not be taken as a complete list o possible problems. The are merel intended to be eamples o the diicult level o the regular eam questions.
More information9.1 The Square Root Function
Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section
More informationIntroduction and mathematical preliminaries
Chapter Introduction and mathematical preliminaries Contents. Motivation..................................2 Finite-digit arithmetic.......................... 2.3 Errors in numerical calculations.....................
More informationNew Functions from Old Functions
.3 New Functions rom Old Functions In this section we start with the basic unctions we discussed in Section. and obtain new unctions b shiting, stretching, and relecting their graphs. We also show how
More informationChapter 1: Preliminaries and Error Analysis
Chapter 1: Error Analysis Peter W. White white@tarleton.edu Department of Tarleton State University Summer 2015 / Numerical Analysis Overview We All Remember Calculus Derivatives: limit definition, sum
More informationNotes on floating point number, numerical computations and pitfalls
Notes on floating point number, numerical computations and pitfalls November 6, 212 1 Floating point numbers An n-digit floating point number in base β has the form x = ±(.d 1 d 2 d n ) β β e where.d 1
More informationSection 3.4: Concavity and the second Derivative Test. Find any points of inflection of the graph of a function.
Unit 3: Applications o Dierentiation Section 3.4: Concavity and the second Derivative Test Determine intervals on which a unction is concave upward or concave downward. Find any points o inlection o the
More informationErrors. Intensive Computation. Annalisa Massini 2017/2018
Errors Intensive Computation Annalisa Massini 2017/2018 Intensive Computation - 2017/2018 2 References Scientific Computing: An Introductory Survey - Chapter 1 M.T. Heath http://heath.cs.illinois.edu/scicomp/notes/index.html
More information18-660: Numerical Methods for Engineering Design and Optimization
8-66: Numerical Methods or Engineering Design and Optimization Xin Li Department o ECE Carnegie Mellon University Pittsburgh, PA 53 Slide Overview Linear Regression Ordinary least-squares regression Minima
More informationSupplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values
Supplementary material or Continuous-action planning or discounted ininite-horizon nonlinear optimal control with Lipschitz values List o main notations x, X, u, U state, state space, action, action space,
More informationRelating axial motion of optical elements to focal shift
Relating aial motion o optical elements to ocal shit Katie Schwertz and J. H. Burge College o Optical Sciences, University o Arizona, Tucson AZ 857, USA katie.schwertz@gmail.com ABSTRACT In this paper,
More informationA Fourier Transform Model in Excel #1
A Fourier Transorm Model in Ecel # -This is a tutorial about the implementation o a Fourier transorm in Ecel. This irst part goes over adjustments in the general Fourier transorm ormula to be applicable
More informationINTRODUCTORY MATHEMATICAL ANALYSIS
INTRODUCTORY MATHEMATICAL ANALYSIS For Business, Economics, and the Lie and Social Sciences Chapter 11 Dierentiation 011 Pearson Education, Inc. Chapter 11: Dierentiation Chapter Objectives To compute
More informationLab on Taylor Polynomials. This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor.
Lab on Taylor Polynomials This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor. In this Lab we will approimate complicated unctions by simple unctions. The
More informationNumerical Analysis. Yutian LI. 2018/19 Term 1 CUHKSZ. Yutian LI (CUHKSZ) Numerical Analysis 2018/19 1 / 41
Numerical Analysis Yutian LI CUHKSZ 2018/19 Term 1 Yutian LI (CUHKSZ) Numerical Analysis 2018/19 1 / 41 Reference Books BF R. L. Burden and J. D. Faires, Numerical Analysis, 9th edition, Thomsom Brooks/Cole,
More informationTangent Line Approximations
60_009.qd //0 :8 PM Page SECTION.9 Dierentials Section.9 EXPLORATION Tangent Line Approimation Use a graphing utilit to graph. In the same viewing window, graph the tangent line to the graph o at the point,.
More informationPolynomials and Polynomial Functions
Unit 5: Polynomials and Polynomial Functions Evaluating Polynomial Functions Objectives: SWBAT identify polynomial functions SWBAT evaluate polynomial functions. SWBAT find the end behaviors of polynomial
More informationImage Enhancement (Spatial Filtering 2)
Image Enhancement (Spatial Filtering ) Dr. Samir H. Abdul-Jauwad Electrical Engineering Department College o Engineering Sciences King Fahd University o Petroleum & Minerals Dhahran Saudi Arabia samara@kupm.edu.sa
More informationLecture 8 Optimization
4/9/015 Lecture 8 Optimization EE 4386/5301 Computational Methods in EE Spring 015 Optimization 1 Outline Introduction 1D Optimization Parabolic interpolation Golden section search Newton s method Multidimensional
More informationRelating axial motion of optical elements to focal shift
Relating aial motion o optical elements to ocal shit Katie Schwertz and J. H. Burge College o Optical Sciences, University o Arizona, Tucson AZ 857, USA katie.schwertz@gmail.com ABSTRACT In this paper,
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 1 Chapter 4 Roundoff and Truncation Errors PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationChapter 1 Error Analysis
Chapter 1 Error Analysis Several sources of errors are important for numerical data processing: Experimental uncertainty: Input data from an experiment have a limited precision. Instead of the vector of
More informationArithmetic and Error. How does error arise? How does error arise? Notes for Part 1 of CMSC 460
Notes for Part 1 of CMSC 460 Dianne P. O Leary Preliminaries: Mathematical modeling Computer arithmetic Errors 1999-2006 Dianne P. O'Leary 1 Arithmetic and Error What we need to know about error: -- how
More informationis the intuition: the derivative tells us the change in output y (from f(b)) in response to a change of input x at x = b.
Uses of differentials to estimate errors. Recall the derivative notation df d is the intuition: the derivative tells us the change in output y (from f(b)) in response to a change of input at = b. Eamples.
More informationWe would now like to turn our attention to a specific family of functions, the one to one functions.
9.6 Inverse Functions We would now like to turn our attention to a speciic amily o unctions, the one to one unctions. Deinition: One to One unction ( a) (b A unction is called - i, or any a and b in the
More informationMini Lecture 9.1 Finding Roots
Mini Lecture 9. Finding Roots. Find square roots.. Evaluate models containing square roots.. Use a calculator to find decimal approimations for irrational square roots. 4. Find higher roots. Evaluat. a.
More information9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions
9. Graphing Functions by Plotting Points, The Domain and Range o Functions Now that we have a basic idea o what unctions are and how to deal with them, we would like to start talking about the graph o
More information8.4 Inverse Functions
Section 8. Inverse Functions 803 8. Inverse Functions As we saw in the last section, in order to solve application problems involving eponential unctions, we will need to be able to solve eponential equations
More informationMathematical preliminaries and error analysis
Mathematical preliminaries and error analysis Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Round-off errors and computer arithmetic
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More information! " k x 2k$1 # $ k x 2k. " # p $ 1! px! p " p 1 # !"#$%&'"()'*"+$",&-('./&-/. !"#$%&'()"*#%+!'",' -./#")'.,&'+.0#.1)2,'!%)2%! !"#$%&'"%(")*$+&#,*$,#
"#$%&'()"*#%+'",' -./#")'.,&'+.0#.1)2,' %)2% "#$%&'"()'*"+$",&-('./&-/. Taylor Series o a unction at x a is " # a k " # " x a# k k0 k It is a Power Series centered at a. Maclaurin Series o a unction is
More informationChapter 6. Nonlinear Equations. 6.1 The Problem of Nonlinear Root-finding. 6.2 Rate of Convergence
Chapter 6 Nonlinear Equations 6. The Problem of Nonlinear Root-finding In this module we consider the problem of using numerical techniques to find the roots of nonlinear equations, f () =. Initially we
More informationNotes for Chapter 1 of. Scientific Computing with Case Studies
Notes for Chapter 1 of Scientific Computing with Case Studies Dianne P. O Leary SIAM Press, 2008 Mathematical modeling Computer arithmetic Errors 1999-2008 Dianne P. O'Leary 1 Arithmetic and Error What
More information1 ERROR ANALYSIS IN COMPUTATION
1 ERROR ANALYSIS IN COMPUTATION 1.2 Round-Off Errors & Computer Arithmetic (a) Computer Representation of Numbers Two types: integer mode (not used in MATLAB) floating-point mode x R ˆx F(β, t, l, u),
More informationMHF 4U Unit 7: Combining Functions May 29, Review Solutions
MHF 4U Unit 7: Combining Functions May 9, 008. Review Solutions Use the ollowing unctions to answer questions 5, ( ) g( ), h( ) sin, w {(, ), (3, ), (4, 7)}, r, and l ) log ( ) + (, ) Determine: a) + w
More informationFLUID MECHANICS. Lecture 7 Exact solutions
FLID MECHANICS Lecture 7 Eact solutions 1 Scope o Lecture To present solutions or a ew representative laminar boundary layers where the boundary conditions enable eact analytical solutions to be obtained.
More informationDifferential Equaitons Equations
Welcome to Multivariable Calculus / Dierential Equaitons Equations The Attached Packet is or all students who are planning to take Multibariable Multivariable Calculus/ Dierential Equations in the all.
More informationTheorem Let J and f be as in the previous theorem. Then for any w 0 Int(J), f(z) (z w 0 ) n+1
(w) Second, since lim z w z w z w δ. Thus, i r δ, then z w =r (w) z w = (w), there exist δ, M > 0 such that (w) z w M i dz ML({ z w = r}) = M2πr, which tends to 0 as r 0. This shows that g = 2πi(w), which
More informationComputer Arithmetic. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Computer Arithmetic
Computer Arithmetic MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Machine Numbers When performing arithmetic on a computer (laptop, desktop, mainframe, cell phone,
More informationand ( x, y) in a domain D R a unique real number denoted x y and b) = x y = {(, ) + 36} that is all points inside and on
Mat 7 Calculus III Updated on 10/4/07 Dr. Firoz Chapter 14 Partial Derivatives Section 14.1 Functions o Several Variables Deinition: A unction o two variables is a rule that assigns to each ordered pair
More informationCompute the behavior of reality even if it is impossible to observe the processes (for example a black hole in astrophysics).
1 Introduction Read sections 1.1, 1.2.1 1.2.4, 1.2.6, 1.3.8, 1.3.9, 1.4. Review questions 1.1 1.6, 1.12 1.21, 1.37. The subject of Scientific Computing is to simulate the reality. Simulation is the representation
More informationOPTIMAL PLACEMENT AND UTILIZATION OF PHASOR MEASUREMENTS FOR STATE ESTIMATION
OPTIMAL PLACEMENT AND UTILIZATION OF PHASOR MEASUREMENTS FOR STATE ESTIMATION Xu Bei, Yeo Jun Yoon and Ali Abur Teas A&M University College Station, Teas, U.S.A. abur@ee.tamu.edu Abstract This paper presents
More informationwhose domain D is a set of n-tuples in is defined. The range of f is the set of all values f x1,..., x n
Grade (MCV4UE) - AP Calculus Etended Page o A unction o n-variales is a real-valued unction... n whose domain D is a set o n-tuples... n in which... n is deined. The range o is the set o all values...
More informationReview of Prerequisite Skills for Unit # 2 (Derivatives) U2L2: Sec.2.1 The Derivative Function
UL1: Review o Prerequisite Skills or Unit # (Derivatives) Working with the properties o exponents Simpliying radical expressions Finding the slopes o parallel and perpendicular lines Simpliying rational
More informationThe concept of limit
Roberto s Notes on Dierential Calculus Chapter 1: Limits and continuity Section 1 The concept o limit What you need to know already: All basic concepts about unctions. What you can learn here: What limits
More informationNumerical Algorithms. IE 496 Lecture 20
Numerical Algorithms IE 496 Lecture 20 Reading for This Lecture Primary Miller and Boxer, Pages 124-128 Forsythe and Mohler, Sections 1 and 2 Numerical Algorithms Numerical Analysis So far, we have looked
More information2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction
. ETA EVALUATIONS USING WEBER FUNCTIONS Introduction So ar we have seen some o the methods or providing eta evaluations that appear in the literature and we have seen some o the interesting properties
More informationDefinition: Let f(x) be a function of one variable with continuous derivatives of all orders at a the point x 0, then the series.
2.4 Local properties o unctions o several variables In this section we will learn how to address three kinds o problems which are o great importance in the ield o applied mathematics: how to obtain the
More informationFeedback Linearization
Feedback Linearization Peter Al Hokayem and Eduardo Gallestey May 14, 2015 1 Introduction Consider a class o single-input-single-output (SISO) nonlinear systems o the orm ẋ = (x) + g(x)u (1) y = h(x) (2)
More information1.1 COMPUTER REPRESENTATION OF NUM- BERS, REPRESENTATION ERRORS
Chapter 1 NUMBER REPRESENTATION, ERROR ANALYSIS 1.1 COMPUTER REPRESENTATION OF NUM- BERS, REPRESENTATION ERRORS Floating-point representation x t,r of a number x: x t,r = m t P cr, where: P - base (the
More informationFP1 PAST EXAM QUESTIONS ON NUMERICAL METHODS: NEWTON-RAPHSON ONLY
FP PAST EXAM QUESTIONS ON NUMERICAL METHODS: NEWTON-RAPHSON ONLY A number of questions demand that you know derivatives of functions now not included in FP. Just look up the derivatives in the mark scheme,
More informationMODULE 6 LECTURE NOTES 1 REVIEW OF PROBABILITY THEORY. Most water resources decision problems face the risk of uncertainty mainly because of the
MODULE 6 LECTURE NOTES REVIEW OF PROBABILITY THEORY INTRODUCTION Most water resources decision problems ace the risk o uncertainty mainly because o the randomness o the variables that inluence the perormance
More informationResidue Number Systems. Alternative number representations. TSTE 8 Digital Arithmetic Seminar 2. Residue Number Systems.
TSTE8 Digital Arithmetic Seminar Oscar Gustafsson The idea is to use the residues of the numbers and perform operations on the residues Also called modular arithmetic since the residues are computed using
More informationExponential, Logarithmic and Inverse Functions
Chapter Review Sec.1 and. Eponential, Logarithmic and Inverse Functions I. Review o Inverrse I Functti ions A. Identiying One-to-One Functions is one-to-one i every element in the range corresponds to
More information. This is the Basic Chain Rule. x dt y dt z dt Chain Rule in this context.
Math 18.0A Gradients, Chain Rule, Implicit Dierentiation, igher Order Derivatives These notes ocus on our things: (a) the application o gradients to ind normal vectors to curves suraces; (b) the generaliation
More informationToday. Introduction to optimization Definition and motivation 1-dimensional methods. Multi-dimensional methods. General strategies, value-only methods
Optimization Last time Root inding: deinition, motivation Algorithms: Bisection, alse position, secant, Newton-Raphson Convergence & tradeos Eample applications o Newton s method Root inding in > 1 dimension
More informationLecture 7. Floating point arithmetic and stability
Lecture 7 Floating point arithmetic and stability 2.5 Machine representation of numbers Scientific notation: 23 }{{} }{{} } 3.14159265 {{} }{{} 10 sign mantissa base exponent (significand) s m β e A floating
More informationA Simple Explanation of the Sobolev Gradient Method
A Simple Explanation o the Sobolev Gradient Method R. J. Renka July 3, 2006 Abstract We have observed that the term Sobolev gradient is used more oten than it is understood. Also, the term is oten used
More informationMat 267 Engineering Calculus III Updated on 9/19/2010
Chapter 11 Partial Derivatives Section 11.1 Functions o Several Variables Deinition: A unction o two variables is a rule that assigns to each ordered pair o real numbers (, ) in a set D a unique real number
More informationFLOATING POINT ARITHMETHIC - ERROR ANALYSIS
FLOATING POINT ARITHMETHIC - ERROR ANALYSIS Brief review of floating point arithmetic Model of floating point arithmetic Notation, backward and forward errors Roundoff errors and floating-point arithmetic
More informationIntroduction to Scientific Computing Languages
1 / 21 Introduction to Scientific Computing Languages Prof. Paolo Bientinesi pauldj@aices.rwth-aachen.de Numerical Representation 2 / 21 Numbers 123 = (first 40 digits) 29 4.241379310344827586206896551724137931034...
More informationMAT 460: Numerical Analysis I. James V. Lambers
MAT 460: Numerical Analysis I James V. Lambers January 31, 2013 2 Contents 1 Mathematical Preliminaries and Error Analysis 7 1.1 Introduction............................ 7 1.1.1 Error Analysis......................
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 5. Ax = b.
CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 5 GENE H GOLUB Suppose we want to solve We actually have an approximation ξ such that 1 Perturbation Theory Ax = b x = ξ + e The question is, how
More information«Develop a better understanding on Partial fractions»
«Develop a better understanding on Partial ractions» ackground inormation: The topic on Partial ractions or decomposing actions is irst introduced in O level dditional Mathematics with its applications
More informationSec 3.1. lim and lim e 0. Exponential Functions. f x 9, write the equation of the graph that results from: A. Limit Rules
Sec 3. Eponential Functions A. Limit Rules. r lim a a r. I a, then lim a and lim a 0 3. I 0 a, then lim a 0 and lim a 4. lim e 0 5. e lim and lim e 0 Eamples:. Starting with the graph o a.) Shiting 9 units
More informationVisit us at: for a wealth of information about college mathematics placement testing!
North Carolina Early Mathematics Placement Testing Program, 9--4. Multiply: A. 9 B. C. 9 9 9 D. 9 E. 9 Solution and Answer to Question # will be provided net Monday, 9-8-4 North Carolina Early Mathematics
More informationECS 231 Computer Arithmetic 1 / 27
ECS 231 Computer Arithmetic 1 / 27 Outline 1 Floating-point numbers and representations 2 Floating-point arithmetic 3 Floating-point error analysis 4 Further reading 2 / 27 Outline 1 Floating-point numbers
More informationLesson #33 Solving Incomplete Quadratics
Lesson # Solving Incomplete Quadratics A.A.4 Know and apply the technique of completing the square ~ 1 ~ We can also set up any quadratic to solve it in this way by completing the square, the technique
More informationPolynomial Functions of Higher Degree
SAMPLE CHAPTER. NOT FOR DISTRIBUTION. 4 Polynomial Functions of Higher Degree Polynomial functions of degree greater than 2 can be used to model data such as the annual temperature fluctuations in Daytona
More informationFinding roots. Lecture 4
Finding roots Lecture 4 Finding roots: Find such that 0 or given. Bisection method: The intermediate value theorem states the obvious: i a continuous unction changes sign within a given interval, it has
More informationLecture Notes 7, Math/Comp 128, Math 250
Lecture Notes 7, Math/Comp 128, Math 250 Misha Kilmer Tufts University October 23, 2005 Floating Point Arithmetic We talked last time about how the computer represents floating point numbers. In a floating
More information0,0 B 5,0 C 0, 4 3,5. y x. Recitation Worksheet 1A. 1. Plot these points in the xy plane: A
Math 13 Recitation Worksheet 1A 1 Plot these points in the y plane: A 0,0 B 5,0 C 0, 4 D 3,5 Without using a calculator, sketch a graph o each o these in the y plane: A y B 3 Consider the unction a Evaluate
More informationMath 19, Homework-1 Solutions
SSEA Summer 207 Math 9, Homework- Solutions. Consider the graph of function f shown below. Find the following its or eplain why they do not eist: (a) t 2 f(t). = 0. (b) t f(t). =. (c) t 0 f(t). (d) Does
More informationIntroduction to Scientific Computing Languages
1 / 19 Introduction to Scientific Computing Languages Prof. Paolo Bientinesi pauldj@aices.rwth-aachen.de Numerical Representation 2 / 19 Numbers 123 = (first 40 digits) 29 4.241379310344827586206896551724137931034...
More informationTu: 9/3/13 Math 471, Fall 2013, Section 001 Lecture 1
Tu: 9/3/13 Math 71, Fall 2013, Section 001 Lecture 1 1 Course intro Notes : Take attendance. Instructor introduction. Handout : Course description. Note the exam days (and don t be absent). Bookmark the
More informationMathematical Preliminaries. Developed for the Members of Azera Global By: Joseph D. Fournier B.Sc.E.E., M.Sc.E.E.
Mathematical Preliminaries Developed or the Members o Azera Global B: Joseph D. Fournier B.Sc.E.E., M.Sc.E.E. Outline Chapter One, Sets: Slides: 3-27 Chapter Two, Introduction to unctions: Slides: 28-36
More informationNumerical Methods - Preliminaries
Numerical Methods - Preliminaries Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Preliminaries 2013 1 / 58 Table of Contents 1 Introduction to Numerical Methods Numerical
More informationAP Calculus AB Summer Assignment
AP Calculus AB Summer Assignment As Advanced placement students, our irst assignment or the 07-08 school ear is to come to class the ver irst da in top mathematical orm. Calculus is a world o change. While
More informationSolutions to the Exercises of Chapter 8
8A Domains of Functions Solutions to the Eercises of Chapter 8 1 For 7 to make sense, we need 7 0or7 So the domain of f() is{ 7} For + 5 to make sense, +5 0 So the domain of g() is{ 5} For h() to make
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Computer Representation of Numbers Counting numbers (unsigned integers) are the numbers 0,
More informationMATH SKILL HANDBOOK. a (b ) II. Measurements and Significant Figures. 0 mm
I. Symbols Δ change in quantity is defined as ± plus or minus a quantity a b ab is proportional to a (b ) = is equal to a b is approimately equal to a/b a_ b is less than or equal to a multiplied by b
More information8. INTRODUCTION TO STATISTICAL THERMODYNAMICS
n * D n d Fluid z z z FIGURE 8-1. A SYSTEM IS IN EQUILIBRIUM EVEN IF THERE ARE VARIATIONS IN THE NUMBER OF MOLECULES IN A SMALL VOLUME, SO LONG AS THE PROPERTIES ARE UNIFORM ON A MACROSCOPIC SCALE 8. INTRODUCTION
More informationAPPM 1360 Final Exam Spring 2016
APPM 36 Final Eam Spring 6. 8 points) State whether each of the following quantities converge or diverge. Eplain your reasoning. a) The sequence a, a, a 3,... where a n ln8n) lnn + ) n!) b) ln d c) arctan
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More information