CISE-301: Numerical Methods Topic 1:
|
|
- Candice Strickland
- 5 years ago
- Views:
Transcription
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
2 Lecture Introduction to Numerical Methods What are NUMERICAL METHODS? Why do we need them? Topics covered in CISE3. Reading Assignment: Pages 3- o tetboo CISE3_Topic KFUPM - T9 - Section 8
3 Numerical Methods Numerical Methods: Algorithms that are used to obtain numerical solutions o a mathematical problem. Why do we need them?. No analytical solution eists,. An analytical solution is diicult to obtain or not practical. CISE3_Topic KFUPM - T9 - Section 8 3
4 What do we need? Basic Needs in the Numerical Methods: Practical: Can be computed in a reasonable amount o time. Accurate: Good approimate to the true value, Inormation about the approimation error Bounds, error order,. CISE3_Topic KFUPM - T9 - Section 8 4
5 Outlines o the Course Taylor Theorem Number Representation Solution o nonlinear Equations Interpolation Numerical Dierentiation Numerical Integration Solution o linear Equations Least Squares curve itting Solution o ordinary dierential equations Solution o Partial dierential equations CISE3_Topic KFUPM - T9 - Section 8 5
6 Solution o Nonlinear Equations Some simple equations can be solved analytically: 4 3 Analyticsolution roots and 3 4 ± 4 43 Many other equations have no analytical solution: 9 5 No analyticsolution e CISE3_Topic KFUPM - T9 - Section 8 6
7 Methods or Solving Nonlinear Equations o Bisection Method o Newton-Raphson Method o Secant Method CISE3_Topic KFUPM - T9 - Section 8 7
8 CISE3_Topic KFUPM - T9 - Section 8 8 Solution o Systems o Linear Equations equations in unnowns. we have What to do i 3, 5 3, 3 We can solve it as : 5 3
9 Cramer s Rule is Not Practical Cramer's Rule can be used to solve the system : 3 5, 3 5 But Cramer's Rule is not practical or large problems. Tosolve N equations with N unnowns, we need N N N! multiplications. To solve a 3 by 3 system,.3 A super computer needs more than 35 multiplications are needed. years to compute this. CISE3_Topic KFUPM - T9 - Section 8 9
10
11 Curve Fitting Given a set o data: y Select a curve that best its the data. One choice is to ind the curve so that the sum o the square o the error is minimized. CISE3_Topic KFUPM - T9 - Section 8
12 Interpolation Given a set o data: i y i Find a polynomial P whose graph passes through all tabulated points. y i P i i i is in the table CISE3_Topic KFUPM - T9 - Section 8
13 Methods or Curve Fitting o Least Squares o Linear Regression o Nonlinear Least Squares Problems o Interpolation o Newton Polynomial Interpolation o Lagrange Interpolation CISE3_Topic KFUPM - T9 - Section 8 3
14 Integration Some unctions can be integrated analytically: 3 But many unctions a d e d? have no analyticalsolutions : CISE3_Topic KFUPM - T9 - Section 8 4
15 Methods or Numerical Integration o Upper and Lower Sums o Trapezoid Method o Romberg Method o Gauss Quadrature CISE3_Topic KFUPM - T9 - Section 8 5
16 Solution o Ordinary Dierential Equations A solution to the dierential equation : t 3 t 3 t ; is a unction t that satisies the equations. * Analyticalsolutions are available or special cases only. CISE3_Topic KFUPM - T9 - Section 8 6
17 Solution o Partial Dierential Equations Partial Dierential Equations are more diicult to solve than ordinary dierential equations: u t u u, t u, t, u, sin π CISE3_Topic KFUPM - T9 - Section 8 7
18 Summary Numerical Methods: Algorithms that are used to obtain numerical solution o a mathematical problem. We need them when No analytical solution eists or it is diicult to obtain it. Topics Covered in the Course Solution o Nonlinear Equations Solution o Linear Equations Curve Fitting Least Squares Interpolation Numerical Integration Numerical Dierentiation Solution o Ordinary Dierential Equations Solution o Partial Dierential Equations CISE3_Topic KFUPM - T9 - Section 8 8
19 Lecture Number Representation and Accuracy Number Representation Normalized Floating Point Representation Signiicant Digits Accuracy and Precision Rounding and Chopping Reading Assignment: Chapter 3 CISE3_Topic KFUPM - T9 - Section 8 9
20 Representing Real Numbers You are amiliar with the decimal system: Decimal System: Base, Digits,,,9 Standard Representations: ± sign integral raction part part CISE3_Topic KFUPM - T9 - Section 8
21 Normalized Floating Point Representation Normalized Floating Point Representation: ±. d d d 3 sign mantissa eponent d 4 n d, n : integer No integral part, Advantage: Eicient in representing very small or very large numbers. CISE3_Topic KFUPM - T9 - Section 8
22 Calculator Eample Suppose you want to compute: *.39 using a calculator with two-digit ractions 3.57 * True answer: CISE3_Topic KFUPM - T9 - Section 8
23 Binary System Binary System: Base, Digits {,} ±. b b3 b4 sign mantissa eponent n b b CISE3_Topic KFUPM - T9 - Section 8 3
24 7-Bit Representation sign: bit, mantissa: 3bits, eponent: 3 bits CISE3_Topic KFUPM - T9 - Section 8 4
25 Fact Numbers that have a inite epansion in one numbering system may have an ininite epansion in another numbering system:.... You can never represent. eactly in any computer. CISE3_Topic KFUPM - T9 - Section 8 5
26 Representation Hypothetical Machine real computers use 3 bit mantissa Mantissa: 3 bits Eponent: bits Sign: bit Possible positive machine numbers: CISE3_Topic KFUPM - T9 - Section 8 6
27 Representation Gap near zero CISE3_Topic KFUPM - T9 - Section 7 7
28 Remars Numbers that can be eactly represented are called machine numbers. Dierence between machine numbers is not uniorm Sum o machine numbers is not necessarily a machine number: not a machine number CISE3_Topic KFUPM - T9 - Section 8 8
29 Signiicant Digits Signiicant digits are those digits that can be used with conidence. CISE3_Topic KFUPM - T9 - Section 8 9
30 Signiicant Digits - Eample 48.9 CISE3_Topic KFUPM - T9 - Section 8 3
31 Accuracy and Precision Accuracy is related to the closeness to the true value. Precision is related to the closeness to other estimated values. CISE3_Topic KFUPM - T9 - Section 8 3
32 CISE3_Topic KFUPM - T9 - Section 8 3
33 Rounding and Chopping Rounding: Replace the number by the nearest machine number. Chopping: Throw all etra digits. CISE3_Topic KFUPM - T9 - Section 8 33
34 Rounding and Chopping - Eample CISE3_Topic KFUPM - T9 - Section 8 34
35 Error Deinitions True Error Can be computed i the true value is nown: Absolute True Error E t true value approimation Absolute Percent RelativeError ε t true value approimation true value * CISE3_Topic KFUPM - T9 - Section 8 35
36 Error Deinitions Estimated Error When the true value is not nown: Estimated Absolute Error E a current estimate previous estimate Estimated Absolute Percent Relative Error ε a current estimate previous estimate current estimate * CISE3_Topic KFUPM - T9 - Section 8 36
37 Notation We say that the estimate is correct to n decimal digits i: Error n We say that the estimate is correct to n decimal digits rounded i: Error n CISE3_Topic KFUPM - T9 - Section 8 37
38 Summary Number Representation Numbers that have a inite epansion in one numbering system may have an ininite epansion in another numbering system. Normalized Floating Point Representation Eicient in representing very small or very large numbers, Dierence between machine numbers is not uniorm, Representation error depends on the number o bits used in the mantissa. CISE3_Topic KFUPM - T9 - Section 8 38
39 Lectures 3-4 Taylor Theorem Motivation Taylor Theorem Eamples Reading assignment: Chapter 4 CISE3_Topic KFUPM - T9 - Section 8 39
40 Motivation We can easily compute epressions lie: 3 4 But, How do you compute 4., sin.6? We can use the deinition to compute sin.6? b a is this a practical way?.6 CISE3_Topic KFUPM - T9 - Section 8 4
41 CISE3_Topic KFUPM - T9 - Section 8 4 Taylor Series 3 3 '! can write : we converge, series the I!... 3!! : about epansion o series Taylor The Series Taylor or
42 CISE3_Topic KFUPM - T9 - Section 8 4 Taylor Series Eample. The series converges or!! ' ' < e or e e e e : about o epansion series Taylor Obtain e
43 Taylor Series 3 Eample.5 ep CISE3_Topic KFUPM - T9 - Section 8 43
44 Taylor Series Eample Obtain Taylor series epansion o sin about : sin ' cos ' sin 3 cos 3 sin! The series converges or <. 3 3! 5 5! 7 7!... CISE3_Topic KFUPM - T9 - Section 8 44
45 4 3-3 /3! 5 /5! sin /3! CISE3_Topic KFUPM - T9 - Section 8 45
46 Convergence o Taylor Series Observations, Eample The Taylor series converges ast ew terms are needed when is near the point o epansion. I -c is large then more terms are needed to get a good approimation. CISE3_Topic KFUPM - T9 - Section 8 46
47 Taylor Series Eample 3 Obtain Taylor series epansion o ' Taylor Series Epansion o : about ' : CISE3_Topic KFUPM - T9 - Section 8 47
48 Eample 3 Remars Can we apply Taylor series or >?? How many terms are needed to get a good approimation??? These questions will be answered using Taylor s Theorem. CISE3_Topic KFUPM - T9 - Section 8 48
49 Taylor s Theorem I a unction possesses o orders,,..., n in a then or any c [a,b]: continuous closed interval derivatives [a,b], n terms Truncated Taylor Series where : E n n n n! c! c c ξ n E n and ξ is Remainder between c and. CISE3_Topic KFUPM - T9 - Section 8 49
50 Taylor s Theorem We can apply Taylor's theorem or : with the point o epansion c i <. I [ a, b] includes, then the unction and its derivatives are not deined. Taylor Theorem is not applicable. CISE3_Topic KFUPM - T9 - Section 8 5
51 Error Term To get an idea about the approimation we can derive an upper bound on : E ξ n n c n n! or all values o ξ between c and. error, CISE3_Topic KFUPM - T9 - Section 8 5
52 Error Term Eample 4 How large is the error i we replaced the irst 4 terms n 3o its Taylor series epansion about when.? E n E n e n n ξ!. e n! c n ξ n or. E 8.468E 5 CISE3_Topic KFUPM - T9 - Section e. e by
53 Alternative orm o Taylor s Theorem Let have continuous derivatives o orders,,..., n on an interval [a,b], and [a,b] and h [a,b], then : h n! h E n E n n ξ n! h n where ξ is between and h CISE3_Topic KFUPM - T9 - Section 8 53
54 CISE3_Topic KFUPM - T9 - Section 8 54 Taylor s Theorem Alternative orms. and between is!!,. and between is!! h where h n h h c h c where c n c c n n n n n n ξ ξ ξ ξ
55 Mean Value Theorem I is a continuous unction on a closed interval[a, b] and its derivative is deined on the open interval a,b then there eists ξ [ a, b] dξ d b a b-a Proo : Use Taylor's Theorem or n, a, h b b a dξ d b-a CISE3_Topic KFUPM - T9 - Section 8 55
56 Alternating Series Theorem Consider the alternating series : S a I a a lim n a and a a n 3 a 3 a 4 a 4 then The series converges and S Sn an S a n n : : Partial sum sum o First omitted term the irst n terms CISE3_Topic KFUPM - T9 - Section 8 56
57 Alternating Series Eample 5 sin can be computed using : sin 3! This is a convergent alternating series since : a a Then : a 3 sin sin 3! 3! a 4 5! 5! and 7! lim n a n 5! 7! CISE3_Topic KFUPM - T9 - Section 8 57
58 Eample 6 Obtain the o e How large can the error be when n termsare used to approimate Taylor series epansion about c.5the center o epansion e with? CISE3_Topic KFUPM - T9 - Section 8 58
59 CISE3_Topic KFUPM - T9 - Section 8 59 Eample 6 Taylor Series...!.5...! ! '.5 '.5 e e e e e e e e e e e e e.5, o epansion series Taylor Obtain c e
60 CISE3_Topic KFUPM - T9 - Section 8 6 Eample 6 Error Term! ma!.5!.5.5! 3 [.5,] n e Error e n Error n e Error n Error e n n n n n n ξ ξ ξ ξ
61 Remar In this course, all angles are assumed to be in radian unless you are told otherwise. CISE3_Topic KFUPM - T9 - Section 8 6
62 Maclaurin Series Find Maclaurin series epansion o cos. Maclaurin series is a special case o Taylor series with the center o epansion c. CISE3_Topic KFUPM - T9 - Section 8 6
63 Maclaurin Series Eample 7 Obtain Maclaurin series epansion o : cos cos ' sin ' cos 3 sin 3 cos! The series converges or! <. 4 4! 6 6!... CISE3_Topic KFUPM - T9 - Section 8 63
Numerical 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 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 informationExact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
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 informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More information(One Dimension) Problem: for a function f(x), find x 0 such that f(x 0 ) = 0. f(x)
Solving Nonlinear Equations & Optimization One Dimension Problem: or a unction, ind 0 such that 0 = 0. 0 One Root: The Bisection Method This one s guaranteed to converge at least to a singularity, i not
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 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 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 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 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 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 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 informationTABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1. Chapter Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9
TABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1 Chapter 01.01 Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9 Chapter 01.02 Measuring errors 11 True error 11 Relative
More informationBasic properties of limits
Roberto s Notes on Dierential Calculus Chapter : Limits and continuity Section Basic properties o its What you need to know already: The basic concepts, notation and terminology related to its. What you
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 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 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 informationNumerical Integration (Quadrature) Another application for our interpolation tools!
Numerical Integration (Quadrature) Another application for our interpolation tools! Integration: Area under a curve Curve = data or function Integrating data Finite number of data points spacing specified
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 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 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 informationTopic 4b. Open Methods for Root Finding
Course Instructor Dr. Ramond C. Rump Oice: A 337 Phone: (915) 747 6958 E Mail: rcrump@utep.edu Topic 4b Open Methods or Root Finding EE 4386/5301 Computational Methods in EE Outline Open Methods or Root
More informationReview. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn
Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations
More informationA NOVEL METHOD OF INTERPOLATION AND EXTRAPOLATION OF FUNCTIONS BY A LINEAR INITIAL VALUE PROBLEM
A OVEL METHOD OF ITERPOLATIO AD EXTRAPOLATIO OF FUCTIOS BY A LIEAR IITIAL VALUE PROBLEM Michael Shatalov Sensor Science and Technolog o CSIR Manuacturing and Materials, P.O.Bo 395, Pretoria, CSIR and Department
More informationNumerical Optimization
Numerical Optimization General Setup Let (. be a unction such that bn R R where b is a vector o unnown parameters. In many cases, b will not have a closed orm solution. We will estimate b by minimizing
More informationIntroduction and mathematical preliminaries
Chapter Introduction and mathematical preliminaries Contents. Motivation..................................2 Finite-digit arithmetic.......................... 2.3 Errors in numerical calculations.....................
More informationContinuity and Differentiability
Continuity and Dierentiability Tis capter requires a good understanding o its. Te concepts o continuity and dierentiability are more or less obvious etensions o te concept o its. Section - INTRODUCTION
More informationNonlinear Equations. Chapter The Bisection Method
Chapter 6 Nonlinear Equations Given a nonlinear function f(), a value r such that f(r) = 0, is called a root or a zero of f() For eample, for f() = e 016064, Fig?? gives the set of points satisfying y
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 informationChapter 2 Section 3. Partial Derivatives
Chapter Section 3 Partial Derivatives Deinition. Let be a unction o two variables and. The partial derivative o with respect to is the unction, denoted b D1 1 such that its value at an point (,) in the
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 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 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 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 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 informationMATH1901 Differential Calculus (Advanced)
MATH1901 Dierential Calculus (Advanced) Capter 3: Functions Deinitions : A B A and B are sets assigns to eac element in A eactl one element in B A is te domain o te unction B is te codomain o te unction
More informationIncreasing and Decreasing Functions and the First Derivative Test. Increasing and Decreasing Functions. Video
SECTION and Decreasing Functions and the First Derivative Test 79 Section and Decreasing Functions and the First Derivative Test Determine intervals on which a unction is increasing or decreasing Appl
More informationTelescoping Decomposition Method for Solving First Order Nonlinear Differential Equations
Telescoping Decomposition Method or Solving First Order Nonlinear Dierential Equations 1 Mohammed Al-Reai 2 Maysem Abu-Dalu 3 Ahmed Al-Rawashdeh Abstract The Telescoping Decomposition Method TDM is a new
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 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 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 information3. Several Random Variables
. Several Random Variables. Two Random Variables. Conditional Probabilit--Revisited. Statistical Independence.4 Correlation between Random Variables. Densit unction o the Sum o Two Random Variables. Probabilit
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 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 informationMAT137 Calculus! Lecture 45
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 45 Today: Taylor Polynomials Taylor Series Next: Taylor Series Power Series Definition (Power Series) A power series is a series of the form
More informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
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 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 informationOrder of convergence. MA3232 Numerical Analysis Week 3 Jack Carl Kiefer ( ) Question: How fast does x n
Week 3 Jack Carl Kiefer (94-98) Jack Kiefer was an American statistician. Much of his research was on the optimal design of eperiments. However, he also made significant contributions to other areas of
More informationExample: When describing where a function is increasing, decreasing or constant we use the x- axis values.
Business Calculus Lecture Notes (also Calculus With Applications or Business Math II) Chapter 3 Applications o Derivatives 31 Increasing and Decreasing Functions Inormal Deinition: A unction is increasing
More informationNumerical Analysis & Computer Programming
++++++++++ Numerical Analysis & Computer Programming Previous year Questions from 07 to 99 Ramanasri Institute W E B S I T E : M A T H E M A T I C S O P T I O N A L. C O M C O N T A C T : 8 7 5 0 7 0 6
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 informationTHE SECANT METHOD. q(x) = a 0 + a 1 x. with
THE SECANT METHOD Newton s method was based on using the line tangent to the curve of y = f (x), with the point of tangency (x 0, f (x 0 )). When x 0 α, the graph of the tangent line is approximately the
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 informationComplex Variables. For ECON 397 Macroeconometrics Steve Cunningham
Comple Variables For ECON 397 Macroeconometrics Steve Cnningham Open Disks or Neighborhoods Deinition. The set o all points which satis the ineqalit
More informationComputational Methods
Numerical Computational Methods Revised Edition P. B. Patil U. P. Verma Alpha Science International Ltd. Oxford, U.K. CONTENTS Preface List ofprograms v vii 1. NUMER1CAL METHOD, ERROR AND ALGORITHM 1 1.1
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 informationFluctuationlessness Theorem and its Application to Boundary Value Problems of ODEs
Fluctuationlessness Theorem and its Application to Boundary Value Problems o ODEs NEJLA ALTAY İstanbul Technical University Inormatics Institute Maslak, 34469, İstanbul TÜRKİYE TURKEY) nejla@be.itu.edu.tr
More informationarxiv: v2 [math.co] 29 Mar 2017
COMBINATORIAL IDENTITIES FOR GENERALIZED STIRLING NUMBERS EXPANDING -FACTORIAL FUNCTIONS AND THE -HARMONIC NUMBERS MAXIE D. SCHMIDT arxiv:6.04708v2 [math.co 29 Mar 207 SCHOOL OF MATHEMATICS GEORGIA INSTITUTE
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 informationPreface. 2 Linear Equations and Eigenvalue Problem 22
Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits
More information4.1 & 4.2 Student Notes Using the First and Second Derivatives. for all x in D, where D is the domain of f. The number f()
4.1 & 4. Student Notes Using the First and Second Derivatives Deinition A unction has an absolute maimum (or global maimum) at c i ( c) ( ) or all in D, where D is the domain o. The number () c is called
More informationy x is symmetric with respect to which of the following?
AP Calculus Summer Assignment Name: Note: Unless otherwise specified, the domain of a function f is assumed to be the set of all real numbers for which f () is a real number. Part : Multiple Choice Solve
More informationAP Calculus Notes: Unit 1 Limits & Continuity. Syllabus Objective: 1.1 The student will calculate limits using the basic limit theorems.
Syllabus Objective:. The student will calculate its using the basic it theorems. LIMITS how the outputs o a unction behave as the inputs approach some value Finding a Limit Notation: The it as approaches
More information1 Relative degree and local normal forms
THE ZERO DYNAMICS OF A NONLINEAR SYSTEM 1 Relative degree and local normal orms The purpose o this Section is to show how single-input single-output nonlinear systems can be locally given, by means o a
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 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 informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
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 informationMathematical Methods for Numerical Analysis and Optimization
Biyani's Think Tank Concept based notes Mathematical Methods for Numerical Analysis and Optimization (MCA) Varsha Gupta Poonam Fatehpuria M.Sc. (Maths) Lecturer Deptt. of Information Technology Biyani
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 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 information9.8 APPLICATIONS OF TAYLOR SERIES EXPLORATORY EXERCISES. Using Taylor Polynomials to Approximate a Sine Value EXAMPLE 8.1
9-75 SECTION 9.8.. Applications of Taylor Series 677 and f 0) miles/min 3. Predict the location of the plane at time t min. 5. Suppose that an astronaut is at 0, 0) and the moon is represented by a circle
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 information10.4: WORKING WITH TAYLOR SERIES
04: WORKING WITH TAYLOR SERIES Contributed by OpenSta Mathematics at OpenSta CNX In the preceding section we defined Taylor series and showed how to find the Taylor series for several common functions
More informationCOURSE CONTRACT Course Name
COURSE CONTRACT Course Name Numerical Methods Course Code KPL Semester Odd /4 Days/ hours Tuesday/ 7.-. Place F8 Course Status compulsory Course Prerequisites. Calculus I. Calculus II. Linear Algebra 4.
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 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 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 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 informationApplications of local fractional calculus to engineering in fractal time-space:
Applications o local ractional calculus to engineering in ractal time-space: Local ractional dierential equations with local ractional derivative Yang XiaoJun Department o Mathematics and Mechanics, China
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 information2.29 Numerical Fluid Mechanics Spring 2015 Lecture 4
2.29 Spring 2015 Lecture 4 Review Lecture 3 Truncation Errors, Taylor Series and Error Analysis Taylor series: 2 3 n n i1 i i i i i n f( ) f( ) f '( ) f ''( ) f '''( )... f ( ) R 2! 3! n! n1 ( n1) Rn f
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Pro. Mark Fowler Note Set #10 Fourier Analysis or DT Signals eading Assignment: Sect. 4.2 & 4.4 o Proakis & Manolakis Much o Ch. 4 should be review so you are expected
More informationCourse. Print and use this sheet in conjunction with MathinSite s Maclaurin Series applet and worksheet.
Maclaurin Series Learning Outcomes After reading this theory sheet, you should recognise the difference between a function and its polynomial epansion (if it eists!) understand what is meant by a series
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 informationNumerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective
Numerical Solution o Ordinary Dierential Equations in Fluctuationlessness Theorem Perspective NEJLA ALTAY Bahçeşehir University Faculty o Arts and Sciences Beşiktaş, İstanbul TÜRKİYE TURKEY METİN DEMİRALP
More informationVirtual University of Pakistan
Virtual University of Pakistan File Version v.0.0 Prepared For: Final Term Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format, you can check Bookmarks menu Disclaimer:
More informationSECTION A. f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes.
SECTION A 1. State the maximal domain and range of the function f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes. 2. By evaluating f(0),
More informationOn High-Rate Cryptographic Compression Functions
On High-Rate Cryptographic Compression Functions Richard Ostertág and Martin Stanek Department o Computer Science Faculty o Mathematics, Physics and Inormatics Comenius University Mlynská dolina, 842 48
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 informationSolution of the Synthesis Problem in Hilbert Spaces
Solution o the Synthesis Problem in Hilbert Spaces Valery I. Korobov, Grigory M. Sklyar, Vasily A. Skoryk Kharkov National University 4, sqr. Svoboda 677 Kharkov, Ukraine Szczecin University 5, str. Wielkopolska
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 informationPage No.1. MTH603-Numerical Analysis_ Muhammad Ishfaq
Page No.1 File Version v1.5.3 Update: (Dated: 3-May-011) This version of file contains: Content of the Course (Done) FAQ updated version.(these must be read once because some very basic definition and
More informationMAT137 Calculus! Lecture 48
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 48 Today: Taylor Series Applications Next: Final Exams Important Taylor Series and their Radii of Convergence 1 1 x = e x = n=0 n=0 x n n!
More information211 Real Analysis. f (x) = x2 1. x 1. x 2 1
Part. Limits of functions. Introduction 2 Real Analysis Eample. What happens to f : R \ {} R, given by f () = 2,, as gets close to? If we substitute = we get f () = 0 which is undefined. Instead we 0 might
More informationTaylor Series. Math114. March 1, Department of Mathematics, University of Kentucky. Math114 Lecture 18 1/ 13
Taylor Series Math114 Department of Mathematics, University of Kentucky March 1, 2017 Math114 Lecture 18 1/ 13 Given a function, can we find a power series representation? Math114 Lecture 18 2/ 13 Given
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 informationRolle s Theorem and the Mean Value Theorem. Rolle s Theorem
0_00qd //0 0:50 AM Page 7 7 CHAPTER Applications o Dierentiation Section ROLLE S THEOREM French mathematician Michel Rolle irst published the theorem that bears his name in 9 Beore this time, however,
More information