Chapter 1: Introduction and mathematical preliminaries
|
|
- Lenard Holt
- 5 years ago
- Views:
Transcription
1 Chapter 1: Introduction and mathematical preliminaries Evy Kersalé September 26, 2011
2 Motivation Most of the mathematical problems you have encountered so far can be solved analytically. However, in real-life, analytic solutions are rather rare, and therefore we must devise a way of approximating the solutions.
3 Motivation Most of the mathematical problems you have encountered so far can be solved analytically. However, in real-life, analytic solutions are rather rare, and therefore we must devise a way of approximating the solutions. For example, while 2 1 e x dx has a well known analytic solution, only be solved in terms of special functions and solution e x2 dx can e x3 dx has no analytic
4 Motivation Most of the mathematical problems you have encountered so far can be solved analytically. However, in real-life, analytic solutions are rather rare, and therefore we must devise a way of approximating the solutions. For example, while 2 1 e x dx has a well known analytic solution, only be solved in terms of special functions and solution e x2 dx can e x3 dx has no analytic These integrals exist as the area under the curves y = exp(x 2 ) and y = exp(x 3 ). We can obtain a numerical approximation by estimating this area, e.g. by dividing it into strips and using the trapezium rule. 1 2
5 Definition Numerical analysis is a part of mathematics concerned with
6 Definition Numerical analysis is a part of mathematics concerned with devising methods, called numerical algorithms, for obtaining numerical approximate solutions to mathematical problems;
7 Definition Numerical analysis is a part of mathematics concerned with devising methods, called numerical algorithms, for obtaining numerical approximate solutions to mathematical problems; being able to estimate the error involved.
8 Definition Numerical analysis is a part of mathematics concerned with devising methods, called numerical algorithms, for obtaining numerical approximate solutions to mathematical problems; being able to estimate the error involved. Traditionally, numerical algorithms are built upon the most simple arithmetic operations (+,, and ).
9 Definition Numerical analysis is a part of mathematics concerned with devising methods, called numerical algorithms, for obtaining numerical approximate solutions to mathematical problems; being able to estimate the error involved. Traditionally, numerical algorithms are built upon the most simple arithmetic operations (+,, and ). Interestingly, digital computers can only do these very basic operations. However, they are very fast and, hence, have led to major advances in applied mathematics in the last 60 years.
10 Computer arithmetic: Floating point numbers. Computers can store integers exactly but not real numbers in general. Instead, they approximate them as floating point numbers.
11 Computer arithmetic: Floating point numbers. Computers can store integers exactly but not real numbers in general. Instead, they approximate them as floating point numbers. A decimal floating point (or machine number) is a number of the form ± 0. d 1 d 2... d }{{ k 10 ±n, 0 d } i 9, d 1 0, m where the significand or mantissa m (i.e. the fractional part) and the exponent n are fixed-length integers. (m cannot start with a zero.)
12 Computer arithmetic: Floating point numbers. Computers can store integers exactly but not real numbers in general. Instead, they approximate them as floating point numbers. A decimal floating point (or machine number) is a number of the form ± 0. d 1 d 2... d }{{ k 10 ±n, 0 d } i 9, d 1 0, m where the significand or mantissa m (i.e. the fractional part) and the exponent n are fixed-length integers. (m cannot start with a zero.) In fact, computers use binary numbers (base 2) rather than decimal numbers (base 10) but the same principle applies (see handout).
13 Computer arithmetic: Machine ε. Consider a simple computer where m is 3 digits long and n is one digit long. The smallest positive number this computer can store is and the largest is
14 Computer arithmetic: Machine ε. Consider a simple computer where m is 3 digits long and n is one digit long. The smallest positive number this computer can store is and the largest is Thus, the length of the exponent determines the range of numbers that can be stored.
15 Computer arithmetic: Machine ε. Consider a simple computer where m is 3 digits long and n is one digit long. The smallest positive number this computer can store is and the largest is Thus, the length of the exponent determines the range of numbers that can be stored. However, not all values in the range can be distinguished: numbers can only be recorded to a certain relative accuracy ε.
16 Computer arithmetic: Machine ε. Consider a simple computer where m is 3 digits long and n is one digit long. The smallest positive number this computer can store is and the largest is Thus, the length of the exponent determines the range of numbers that can be stored. However, not all values in the range can be distinguished: numbers can only be recorded to a certain relative accuracy ε. For example, on our simple computer, the next floating point number after 1 = is = The quantity ε machine = 0.01 (machine ε) is the worst relative uncertainty in the floating point representation of a number.
17 Chopping and rounding There are two ways of terminating the mantissa of the k-digit decimal machine number approximating 0.d 1 d 2... d k d k+1 d k n, 0 d i 9, d 1 0,
18 Chopping and rounding There are two ways of terminating the mantissa of the k-digit decimal machine number approximating 0.d 1 d 2... d k d k+1 d k n, 0 d i 9, d 1 0, Chopping: chop off the digits d k+1, d k+2,... to get 0.d 1 d 2... d k 10 n.
19 Chopping and rounding There are two ways of terminating the mantissa of the k-digit decimal machine number approximating 0.d 1 d 2... d k d k+1 d k n, 0 d i 9, d 1 0, Chopping: chop off the digits d k+1, d k+2,... to get 0.d 1 d 2... d k 10 n. Rounding: add 5 10 n (k+1) and chop off the k + 1, k + 2,... digits. (If d k+1 5 we add 1 to d k before chopping.) Rounding is more accurate than chopping.
20 Chopping and rounding There are two ways of terminating the mantissa of the k-digit decimal machine number approximating 0.d 1 d 2... d k d k+1 d k n, 0 d i 9, d 1 0, Chopping: chop off the digits d k+1, d k+2,... to get 0.d 1 d 2... d k 10 n. Rounding: add 5 10 n (k+1) and chop off the k + 1, k + 2,... digits. (If d k+1 5 we add 1 to d k before chopping.) Rounding is more accurate than chopping. Example The five-digit floating-point form of π = is using chopping and using rounding.
21 Chopping and rounding There are two ways of terminating the mantissa of the k-digit decimal machine number approximating 0.d 1 d 2... d k d k+1 d k n, 0 d i 9, d 1 0, Chopping: chop off the digits d k+1, d k+2,... to get 0.d 1 d 2... d k 10 n. Rounding: add 5 10 n (k+1) and chop off the k + 1, k + 2,... digits. (If d k+1 5 we add 1 to d k before chopping.) Rounding is more accurate than chopping. Example The five-digit floating-point form of π = is using chopping and using rounding. Similarly, the five-digit floating-point form of 2/3 = is using chopping and using rounding but that of 1/3 = is using either chopping or rounding.
22 Measure of the error Much of numerical analysis is concerned with controlling the size of errors in calculations. These errors, quantified in two different ways, arise from two distinct sources.
23 Measure of the error Much of numerical analysis is concerned with controlling the size of errors in calculations. These errors, quantified in two different ways, arise from two distinct sources. Let p be the result of a numerical calculation and p the exact answer (i.e. p is an approximation to p). We define two measures of the error,
24 Measure of the error Much of numerical analysis is concerned with controlling the size of errors in calculations. These errors, quantified in two different ways, arise from two distinct sources. Let p be the result of a numerical calculation and p the exact answer (i.e. p is an approximation to p). We define two measures of the error, Absolute error: E = p p
25 Measure of the error Much of numerical analysis is concerned with controlling the size of errors in calculations. These errors, quantified in two different ways, arise from two distinct sources. Let p be the result of a numerical calculation and p the exact answer (i.e. p is an approximation to p). We define two measures of the error, Absolute error: E = p p Relative error: E r = p p / p (provided p 0) which takes into consideration the size of the value.
26 Measure of the error Much of numerical analysis is concerned with controlling the size of errors in calculations. These errors, quantified in two different ways, arise from two distinct sources. Let p be the result of a numerical calculation and p the exact answer (i.e. p is an approximation to p). We define two measures of the error, Absolute error: E = p p Relative error: E r = p p / p (provided p 0) which takes into consideration the size of the value. Example If p = 2 and p = 2.1, the absolute error E = 10 1 ; if p = and p = , E = 10 4 is smaller; and if p = and p = , E = 10 2 is larger but in all three cases the relative error remains the same, E r =
27 Round-off errors Caused by the imprecision of using finite-digit arithmetic in practical calculations (e.g. floating point numbers).
28 Round-off errors Caused by the imprecision of using finite-digit arithmetic in practical calculations (e.g. floating point numbers). Example The 4-digit representation of x = 2 = is x = = Using 4-digit arithmetic, we can evaluate x 2 = , due to round-off errors.
29 Round-off errors Caused by the imprecision of using finite-digit arithmetic in practical calculations (e.g. floating point numbers). Example The 4-digit representation of x = 2 = is x = = Using 4-digit arithmetic, we can evaluate x 2 = , due to round-off errors. Round-off errors can be minimised by reducing the number of arithmetic operations, particularly those that magnify errors.
30 Magnification of the error.
31 Magnification of the error. Computers store numbers to a relative accuracy ε. Thus, the true value of a floating point number x could be anywhere between x (1 ε) and x (1 + ε).
32 Magnification of the error. Computers store numbers to a relative accuracy ε. Thus, the true value of a floating point number x could be anywhere between x (1 ε) and x (1 + ε). Now, if we add two numbers together, x + y, the true value lies in the interval (x + y ε( x + y ), x + y + ε( x + y )).
33 Magnification of the error. Computers store numbers to a relative accuracy ε. Thus, the true value of a floating point number x could be anywhere between x (1 ε) and x (1 + ε). Now, if we add two numbers together, x + y, the true value lies in the interval (x + y ε( x + y ), x + y + ε( x + y )). Thus, the absolute error is the sum of the errors in x and y, E = ε( x + y ) but the relative error of the answer is E r = ε x + y x + y.
34 Magnification of the error. Computers store numbers to a relative accuracy ε. Thus, the true value of a floating point number x could be anywhere between x (1 ε) and x (1 + ε). Now, if we add two numbers together, x + y, the true value lies in the interval (x + y ε( x + y ), x + y + ε( x + y )). Thus, the absolute error is the sum of the errors in x and y, E = ε( x + y ) but the relative error of the answer is x + y E r = ε x + y. If x and y both have the same sign the relative accuracy remains equal to ε, but if the have opposite signs the relative error will be larger.
35 Magnification of the error. Computers store numbers to a relative accuracy ε. Thus, the true value of a floating point number x could be anywhere between x (1 ε) and x (1 + ε). Now, if we add two numbers together, x + y, the true value lies in the interval (x + y ε( x + y ), x + y + ε( x + y )). Thus, the absolute error is the sum of the errors in x and y, E = ε( x + y ) but the relative error of the answer is x + y E r = ε x + y. If x and y both have the same sign the relative accuracy remains equal to ε, but if the have opposite signs the relative error will be larger. This magnification becomes particularly significant when two very close numbers are subtracted.
36 Magnification of the error: Example Recall: the exact solutions of the quadratic equation ax 2 + bx + c = 0 are x 1 = b b 2 4ac 2a, x 2 = b + b 2 4ac. 2a
37 Magnification of the error: Example Recall: the exact solutions of the quadratic equation ax 2 + bx + c = 0 are x 1 = b b 2 4ac 2a, x 2 = b + b 2 4ac. 2a Using 4-digit rounding arithmetic, solve the quadratic equation x x + 1 = 0, with roots x and x
38 Magnification of the error: Example Recall: the exact solutions of the quadratic equation ax 2 + bx + c = 0 are x 1 = b b 2 4ac 2a, x 2 = b + b 2 4ac. 2a Using 4-digit rounding arithmetic, solve the quadratic equation x x + 1 = 0, with roots x and x The discriminant b 2 4ac = 3840 = is close to b = 62. Thus, x 1 = ( )/2 = 124.0/2 = 62, with a relative error E r = , but x 2 = ( )/2 = , with a much larger relative error E r =
39 Magnification of the error: Example Recall: the exact solutions of the quadratic equation ax 2 + bx + c = 0 are x 1 = b b 2 4ac 2a, x 2 = b + b 2 4ac. 2a Using 4-digit rounding arithmetic, solve the quadratic equation x x + 1 = 0, with roots x and x The discriminant b 2 4ac = 3840 = is close to b = 62. Thus, x 1 = ( )/2 = 124.0/2 = 62, with a relative error E r = , but x 2 = ( )/2 = , with a much larger relative error E r = Similarly, division by small numbers (or equivalently, multiplication by large numbers) magnifies the absolute error, leaving the relative error unchanged.
40 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.)
41 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.) Example Calculate the derivative of a function f (x) at the point x 0. Recall the definition of the derivative df (x0) = lim dx h 0 f (x 0 + h) f (x 0). h
42 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.) Example Calculate the derivative of a function f (x) at the point x 0. Recall the definition of the derivative df (x0) = lim dx h 0 f (x 0 + h) f (x 0). h However, on a computer we cannot take h 0 (there exists a smallest positive floating point number), so h must take a finite value.
43 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.) Example Calculate the derivative of a function f (x) at the point x 0. Recall the definition of the derivative df (x0) = lim dx h 0 f (x 0 + h) f (x 0). h However, on a computer we cannot take h 0 (there exists a smallest positive floating point number), so h must take a finite value.
44 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.) Example Calculate the derivative of a function f (x) at the point x 0. Recall the definition of the derivative df (x0) = lim dx h 0 f (x 0 + h) f (x 0). h However, on a computer we cannot take h 0 (there exists a smallest positive floating point number), so h must take a finite value. Using Taylor s theorem, f (x 0 + h) = f (x 0) + hf (x 0) + h 2 /2 f (ξ), where x 0 < ξ < x 0 + h.
45 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.) Example Calculate the derivative of a function f (x) at the point x 0. Recall the definition of the derivative df (x0) = lim dx h 0 f (x 0 + h) f (x 0). h However, on a computer we cannot take h 0 (there exists a smallest positive floating point number), so h must take a finite value. Using Taylor s theorem, f (x 0 + h) = f (x 0) + hf (x 0) + h 2 /2 f (ξ), where x 0 < ξ < x 0 + h. Therefore, f (x 0 + h) f (x 0) h = hf (x 0) + h 2 /2 f (ξ) h = f (x 0)+ h 2 f (ξ) f (x 0)+ h 2 f (x 0).
46 Truncation errors Caused by the approximations in the computational algorithm itself. (An algorithm only gives an approximate solution to a mathematical problem, even if the arithmetic is exact.) Example Calculate the derivative of a function f (x) at the point x 0. Recall the definition of the derivative df (x0) = lim dx h 0 f (x 0 + h) f (x 0). h However, on a computer we cannot take h 0 (there exists a smallest positive floating point number), so h must take a finite value. Using Taylor s theorem, f (x 0 + h) = f (x 0) + hf (x 0) + h 2 /2 f (ξ), where x 0 < ξ < x 0 + h. Therefore, f (x 0 + h) f (x 0) h = hf (x 0) + h 2 /2 f (ξ) h = f (x 0)+ h 2 f (ξ) f (x 0)+ h 2 f (x 0). Using a finite value of h leads to a truncation error of size h/2 f (x 0).
47 Truncation errors: Example continued Clearly, the truncation error h/2 f (x 0) decreases with decreasing h.
48 Truncation errors: Example continued Clearly, the truncation error h/2 f (x 0) decreases with decreasing h. The absolute round-off error in f (x 0 + h) f (x 0) is 2ε f (x 0) and that in the derivative (f (x 0 + h) f (x 0))/h is 2ε/h f (x 0). So, the round-off error increases with decreasing h.
49 Truncation errors: Example continued Clearly, the truncation error h/2 f (x 0) decreases with decreasing h. The absolute round-off error in f (x 0 + h) f (x 0) is 2ε f (x 0) and that in the derivative (f (x 0 + h) f (x 0))/h is 2ε/h f (x 0). So, the round-off error increases with decreasing h. The relative accuracy of the calculation of f (x 0) (i.e. the sum of the relative truncation and round-off errors) is E r 1 h h E r = h f 2 f + 2ε f h f, h m h which has a minimum, min(e r ) = 2 ε ff / f, for h m = 2 ε f /f.
Introduction and mathematical preliminaries
Chapter Introduction and mathematical preliminaries Contents. Motivation..................................2 Finite-digit arithmetic.......................... 2.3 Errors in numerical calculations.....................
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 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 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 informationChapter 1 Mathematical Preliminaries and Error Analysis
Chapter 1 Mathematical Preliminaries and Error Analysis Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Limits and Continuity
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 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 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 informationHow do computers represent numbers?
How do computers represent numbers? Tips & Tricks Week 1 Topics in Scientific Computing QMUL Semester A 2017/18 1/10 What does digital mean? The term DIGITAL refers to any device that operates on discrete
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 informationFloating Point Number Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le
Floating Point Number Systems Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le 1 Overview Real number system Examples Absolute and relative errors Floating point numbers Roundoff
More informationFloating-point Computation
Chapter 2 Floating-point Computation 21 Positional Number System An integer N in a number system of base (or radix) β may be written as N = a n β n + a n 1 β n 1 + + a 1 β + a 0 = P n (β) where a i are
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 November 6, 2007 2 kostas.kokkotas@uni-tuebingen.de http://www.tat.physik.uni-tuebingen.de/kokkotas Kostas Kokkotas 3 Error Analysis Definition : Suppose that x is an approximation to
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 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 informationChapter 1 Mathematical Preliminaries and Error Analysis
Numerical Analysis (Math 3313) 2019-2018 Chapter 1 Mathematical Preliminaries and Error Analysis Intended learning outcomes: Upon successful completion of this chapter, a student will be able to (1) list
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 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 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 informationChapter 4 Number Representations
Chapter 4 Number Representations SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} February 9, 2016 Table of Contents 1 Fundamentals 2 Signed Numbers 3 Fixed-Point
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 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 informationElements of Floating-point Arithmetic
Elements of Floating-point Arithmetic Sanzheng Qiao Department of Computing and Software McMaster University July, 2012 Outline 1 Floating-point Numbers Representations IEEE Floating-point Standards Underflow
More informationRound-off Errors and Computer Arithmetic - (1.2)
Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed
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 informationElements of Floating-point Arithmetic
Elements of Floating-point Arithmetic Sanzheng Qiao Department of Computing and Software McMaster University July, 2012 Outline 1 Floating-point Numbers Representations IEEE Floating-point Standards Underflow
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 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 informationNumerical Methods - Lecture 2. Numerical Methods. Lecture 2. Analysis of errors in numerical methods
Numerical Methods - Lecture 1 Numerical Methods Lecture. Analysis o errors in numerical methods Numerical Methods - Lecture Why represent numbers in loating point ormat? Eample 1. How a number 56.78 can
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 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 informationBACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES
No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks
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 informationChapter 1. Numerical Errors. Module No. 1. Errors in Numerical Computations
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-73209 email: anita.buie@gmail.com . Chapter Numerical Errors Module
More informationAn Introduction to Differential Algebra
An Introduction to Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al. 1 ESA Advanced Concepts Team (TEC-SF) SRL, Milan Dinamica Outline 1 Overview Five Views of Differential Algebra
More informationNUMERICAL MATHEMATICS & COMPUTING 6th Edition
NUMERICAL MATHEMATICS & COMPUTING 6th Edition Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 September 1, 2011 2011 1 / 42 1.1 Mathematical
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 informationCS412: Introduction to Numerical Methods
CS412: Introduction to Numerical Methods MIDTERM #1 2:30PM - 3:45PM, Tuesday, 03/10/2015 Instructions: This exam is a closed book and closed notes exam, i.e., you are not allowed to consult any textbook,
More informationNumerical Mathematical Analysis
Numerical Mathematical Analysis Numerical Mathematical Analysis Catalin Trenchea Department of Mathematics University of Pittsburgh September 20, 2010 Numerical Mathematical Analysis Math 1070 Numerical
More informationEssential Mathematics
Appendix B 1211 Appendix B Essential Mathematics Exponential Arithmetic Exponential notation is used to express very large and very small numbers as a product of two numbers. The first number of the product,
More informationINTRODUCTION TO COMPUTATIONAL MATHEMATICS
INTRODUCTION TO COMPUTATIONAL MATHEMATICS Course Notes for CM 271 / AMATH 341 / CS 371 Fall 2007 Instructor: Prof. Justin Wan School of Computer Science University of Waterloo Course notes by Prof. Hans
More informationApplied Mathematics 205. Unit 0: Overview of Scientific Computing. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit 0: Overview of Scientific Computing Lecturer: Dr. David Knezevic Scientific Computing Computation is now recognized as the third pillar of science (along with theory and experiment)
More informationMTH303. Section 1.3: Error Analysis. R.Touma
MTH303 Section 1.3: Error Analysis R.Touma These lecture slides are not enough to understand the topics of the course; they could be used along with the textbook The numerical solution of a mathematical
More information5.3 SOLVING TRIGONOMETRIC EQUATIONS
5.3 SOLVING TRIGONOMETRIC EQUATIONS Copyright Cengage Learning. All rights reserved. What You Should Learn Use standard algebraic techniques to solve trigonometric equations. Solve trigonometric equations
More informationWhat Every Programmer Should Know About Floating-Point Arithmetic DRAFT. Last updated: November 3, Abstract
What Every Programmer Should Know About Floating-Point Arithmetic Last updated: November 3, 2014 Abstract The article provides simple answers to the common recurring questions of novice programmers about
More informationNumerics and Error Analysis
Numerics and Error Analysis CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Numerics and Error Analysis 1 / 30 A Puzzle What
More informationCISE-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 informationQUADRATIC PROGRAMMING?
QUADRATIC PROGRAMMING? WILLIAM Y. SIT Department of Mathematics, The City College of The City University of New York, New York, NY 10031, USA E-mail: wyscc@cunyvm.cuny.edu This is a talk on how to program
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More information2. Review of Calculus Notation. C(X) all functions continuous on the set X. C[a, b] all functions continuous on the interval [a, b].
CHAPTER Mathematical Preliminaries and Error Analysis. Review of Calculus Notation. C(X) all functions continuous on the set X. C[a, b] all functions continuous on the interval [a, b]. C n(x) all functions
More informationExamples MAT-INF1100. Øyvind Ryan
Examples MAT-INF00 Øyvind Ryan February 9, 20 Example 0.. Instead of converting 76 to base 8 let us convert it to base 6. We find that 76//6 = 2 with remainder. In the next step we find 2//6 = 4 with remainder.
More informationChapter 1 Computer Arithmetic
Numerical Analysis (Math 9372) 2017-2016 Chapter 1 Computer Arithmetic 1.1 Introduction Numerical analysis is a way to solve mathematical problems by special procedures which use arithmetic operations
More informationESO 208A: Computational Methods in Engineering. Saumyen Guha
ESO 208A: Computational Methods in Engineering Introduction, Error Analysis Saumyen Guha Department of Civil Engineering IIT Kanpur What is Computational Methods or Numerical Methods in Engineering? Formulation
More informationIntroduction to Finite Di erence Methods
Introduction to Finite Di erence Methods ME 448/548 Notes Gerald Recktenwald Portland State University Department of Mechanical Engineering gerry@pdx.edu ME 448/548: Introduction to Finite Di erence Approximation
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More informationSolutions - Homework 1 (Due date: September 25 th ) Presentation and clarity are very important! Show your procedure!
c 10 =0 c 9 =0 c 8 =0 c 7 =0 c 6 =0 c 5 =0 c 10 =1 c 9 =1 c 8 =1 c 7 =0 c 6 =1 c 5 =1 c 4 =1 c 8 =1 c 7 =1 c 6 =0 c 5 =0 c 8 =0 c 7 =0 c 6 =0 c 5 =0 c 8 =1 c 7 =1 c 6 =1 c 5 =0 c 4 =1 b 7 =0 b 6 =0 b 5
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 3-1 Roundoff errors and floating-point arithmetic
More informationNext, we include the several conversion from type to type.
Number Conversions: Binary Decimal; Floating Points In order to communicate with a computer, we need, at some point, to speak the same language. The words of our language are made up of combinations of
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... Introduce the topic of numerical methods Consider the Error analysis and sources of errors Introduction A numerical method which
More informationNumerical Methods. Dr Dana Mackey. School of Mathematical Sciences Room A305 A Dana Mackey (DIT) Numerical Methods 1 / 12
Numerical Methods Dr Dana Mackey School of Mathematical Sciences Room A305 A Email: Dana.Mackey@dit.ie Dana Mackey (DIT) Numerical Methods 1 / 12 Practical Information The typed notes will be available
More informationTheme 1: Solving Nonlinear Equations
Theme 1: Solving Nonlinear Equations Prof. Mapundi K. Banda (Tuks) WTW263 Semester II 1 / 22 Sources of Errors Finite decimal representation (Rounding): Finite decimal representation will be used to represent
More informationIntroduction to Scientific Computing
(Lecture 2: Machine precision and condition number) B. Rosić, T.Moshagen Institute of Scientific Computing General information :) 13 homeworks (HW) Work in groups of 2 or 3 people Each HW brings maximally
More informationACM 106a: Lecture 1 Agenda
1 ACM 106a: Lecture 1 Agenda Introduction to numerical linear algebra Common problems First examples Inexact computation What is this course about? 2 Typical numerical linear algebra problems Systems of
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 informationIntroductory Numerical Analysis
Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationNUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR)
NUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR) Autumn Session UNIT 1 Numerical analysis is the study of algorithms that uses, creates and implements algorithms for obtaining numerical solutions to problems
More informationMath 471. Numerical methods Introduction
Math 471. Numerical methods Introduction Section 1.1 1.4 of Bradie 1.1 Algorithms Here is an analogy between Numerical Methods and Gastronomy: Calculus, Lin Alg., Diff. eq. Ingredients Algorithm Recipe
More informationIntroduction to Numerical Analysis
Introduction to Numerical Analysis S. Baskar and S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Powai, Mumbai 400 076. Introduction to Numerical Analysis Lecture Notes
More informationBinary floating point
Binary floating point Notes for 2017-02-03 Why do we study conditioning of problems? One reason is that we may have input data contaminated by noise, resulting in a bad solution even if the intermediate
More informationMathematics for Engineers. Numerical mathematics
Mathematics for Engineers Numerical mathematics Integers Determine the largest representable integer with the intmax command. intmax ans = int32 2147483647 2147483647+1 ans = 2.1475e+09 Remark The set
More information1.2 Finite Precision Arithmetic
MACM Assignment Solutions.2 Finite Precision Arithmetic.2:e Rounding Arithmetic Use four-digit rounding arithmetic to perform the following calculation. Compute the absolute error and relative error with
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationApplied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight
Applied Numerical Analysis (AE0-I) R. Klees and R.P. Dwight February 018 Contents 1 Preliminaries: Motivation, Computer arithmetic, Taylor series 1 1.1 Numerical Analysis Motivation..........................
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 informationNumber Systems III MA1S1. Tristan McLoughlin. December 4, 2013
Number Systems III MA1S1 Tristan McLoughlin December 4, 2013 http://en.wikipedia.org/wiki/binary numeral system http://accu.org/index.php/articles/1558 http://www.binaryconvert.com http://en.wikipedia.org/wiki/ascii
More informationThe Euclidean Division Implemented with a Floating-Point Multiplication and a Floor
The Euclidean Division Implemented with a Floating-Point Multiplication and a Floor Vincent Lefèvre 11th July 2005 Abstract This paper is a complement of the research report The Euclidean division implemented
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 informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More informationALGEBRA GRADE 7 MINNESOTA ACADEMIC STANDARDS CORRELATED TO MOVING WITH MATH. Part B Student Book Skill Builders (SB)
MINNESOTA ACADEMIC STANDARDS CORRELATED TO MOVING WITH MATH ALGEBRA GRADE 7 NUMBER AND OPERATION Read, write, represent and compare positive and negative rational numbers, expressed as integers, fractions
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 informationNotes on Conditioning
Notes on Conditioning Robert A. van de Geijn The University of Texas Austin, TX 7872 October 6, 204 NOTE: I have not thoroughly proof-read these notes!!! Motivation Correctness in the presence of error
More information(i) 2-5 (ii) (3 + 23) - 23 (v) 2π
Number System - Worksheet Question 1: Express the following in the form p/q, where p and q are integers and q 0. Question 2: Express 0.99999... in the form p/q. Are you surprised by your answer? With your
More informationMath 128A: Homework 2 Solutions
Math 128A: Homework 2 Solutions Due: June 28 1. In problems where high precision is not needed, the IEEE standard provides a specification for single precision numbers, which occupy 32 bits of storage.
More informationMathematics Pacing. Instruction: 9/7/17 10/31/17 Assessment: 11/1/17 11/8/17. # STUDENT LEARNING OBJECTIVES NJSLS Resources
# STUDENT LEARNING OBJECTIVES NJSLS Resources 1 Describe real-world situations in which (positive and negative) rational numbers are combined, emphasizing rational numbers that combine to make 0. Represent
More informationCHAPTER 3. Iterative Methods
CHAPTER 3 Iterative Methods As we have seen in the previous two chapters, even for problems, which are theoretically well understood, such as computing the square root, one cannot provide the perfect answer
More informationUNIT 5 QUADRATIC FUNCTIONS Lesson 2: Creating and Solving Quadratic Equations in One Variable Instruction
Prerequisite Skills This lesson requires the use of the following skills: simplifying radicals working with complex numbers Introduction You can determine how far a ladder will extend from the base of
More informationNumerical Differentiation & Integration. Numerical Differentiation III
Numerical Differentiation & Integration Numerical Differentiation III Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University
More informationDegree of a polynomial
Variable Algebra Term Polynomial Monomial Binomial Trinomial Degree of a term Degree of a polynomial Linear A generalization of arithmetic. Letters called variables are used to denote numbers, which are
More informationMATH ASSIGNMENT 03 SOLUTIONS
MATH444.0 ASSIGNMENT 03 SOLUTIONS 4.3 Newton s method can be used to compute reciprocals, without division. To compute /R, let fx) = x R so that fx) = 0 when x = /R. Write down the Newton iteration for
More informationNumber Representation and Waveform Quantization
1 Number Representation and Waveform Quantization 1 Introduction This lab presents two important concepts for working with digital signals. The first section discusses how numbers are stored in memory.
More informationA Brief Introduction to Numerical Methods for Differential Equations
A Brief Introduction to Numerical Methods for Differential Equations January 10, 2011 This tutorial introduces some basic numerical computation techniques that are useful for the simulation and analysis
More informationMathematics Review. Sid Rudolph
Physics 2010 Sid Rudolph General Physics Mathematics Review These documents in mathematics are intended as a brief review of operations and methods. Early in this course, you should be totally familiar
More informationA quadratic expression is a mathematical expression that can be written in the form 2
118 CHAPTER Algebra.6 FACTORING AND THE QUADRATIC EQUATION Textbook Reference Section 5. CLAST OBJECTIVES Factor a quadratic expression Find the roots of a quadratic equation A quadratic expression is
More informationConversions between Decimal and Binary
Conversions between Decimal and Binary Binary to Decimal Technique - use the definition of a number in a positional number system with base 2 - evaluate the definition formula ( the formula ) using decimal
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationUnit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power.
MODULE 1 1 Polynomial A function that contains 1 or more or terms. The variables may be to any non-negative power. 1 Modeling Mathematical modeling is the process of using, and to represent real world
More informationBinary Floating-Point Numbers
Binary Floating-Point Numbers S exponent E significand M F=(-1) s M β E Significand M pure fraction [0, 1-ulp] or [1, 2) for β=2 Normalized form significand has no leading zeros maximum # of significant
More information1.2. Indices. Introduction. Prerequisites. Learning Outcomes
Indices 1.2 Introduction Indices, or powers, provide a convenient notation when we need to multiply a number by itself several times. In this Section we explain how indices are written, and state the rules
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon s method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More information