GENG2140, S2, 2012 Week 7: Curve fitting
|
|
- Jennifer Jefferson
- 5 years ago
- Views:
Transcription
1 GENG2140, S2, 2012 Week 7: Curve fitting Curve fitting is the process of constructing a curve, or mathematical function, f(x) that has the best fit to a series of data points Involves fitting lines and polynomial curves to data points. f(x) Polynomial Curve Connects exactly y = ax + b First order Straight line Two points y = ax + bx + c Second order Quadratic Three points y = ax + bx + cx + d Third order Cubic Four points Why get an approximate fit when we could just increase the degree of the polynomial equation and get an exact match? A divergent case (exact fit cannot be calculated, or it might take too long). Averaging out questionable data points in a sample, rather than distorting the curve to fit them exactly. Runge's phenomenon (oscillations at the edges of an interval which occurs when interpolating between equidistant points with high degree polynomials). Low-order polynomials tend to be smooth and high order polynomial curves tend to be "lumpy".
2 Methods 1. LAGRANGE INTERPOLATION: Curve made to pass through all the points exactly by a polynomial. Advantages: No need to solve linear equations Less susceptible to round-off errors Allows interpolation even when function values are expressed by symbols Disadvantages: Susceptible to Runge's phenomenon Changing the interpolation points requires recalculating the entire interpolant. 2. SPLINES: A series of unique polynomials are fitted between each pair of the data points by piecewise polynomials called a spline. Advantages: Spline interpolation is preferred over Lagrange interpolation high level of smoothness The interpolation error can be made small even when using low degree polynomials for the spline. avoids the problem of Runge's phenomenon. Disadvantages: Computationally intensive Rather slow
3 Linear spline: Draws straight lines between consecutive data Quadratic spline: Draws a second-order polynomial instead of a straight line going through consecutive data points. Cubic spline: A series of unique cubic polynomials are fitted between each of the data points. 100 random data points Clearly, no correlation can be established between the random 100 data points. A Lagrange interpolation would require a 99 th order polynomial to fit to these data points. However, cubic splines can interpolate all 100 points without the drastic behavior which a 99 th order polynomial would exhibit. Cubic spline curves through the random data
4 3. LEAST SQUARE METHOD Finds the parameter of a model that the best-fit the data when the residual is the minimum. A residual is defined as the difference between the actual value of the dependent variable and the value predicted by the model. Does not seek an exact fit, but fits to the trend of the data Apply when data is not reliable Least square fit
5 Week 8: Numerical methods for solving nonlinear algebraic equations (root finding) Nonlinear problems : In mathematics, a nonlinear system is one that does not satisfy the superposition principle, or one whose output is not directly proportional to its input. Most physical systems are inherently nonlinear in nature. Nonlinear equations are difficult to solve. It is often difficult to determine the existence or number solutions to nonlinear equations. Whereas for system of linear equations the number of solutions must be either zero, one or infinitely many, nonlinear equations can have any number of solutions. Determining existence and uniqueness of solutions is more complicated for nonlinear equations than for linear equations. For example, e x -x=0 has no solution, e x -x-1=0 has a repeated root. Solution of Non-Linear Equations: Two types Polynomial equations (algebraic equations) Transcendental equations (non-algebraic equations) Polynomial equations: Formed by equating a polynomial to zero, that is, given a function f(x), we seek value x for which f(x) = 0. Solution x is called a root of equation, or zero of function f. Thus, the problem is known as root or zero finding. f(x) = x 2-5x + 6 = 0 y=f(x) x (x -2) (x -3)=0 x = 2; x = 3 (zeros of the function) 2 3 x
6 Transcendental equations (non-algebraic equations) Made of transcendental functions, that is functions not expressible as a finite combination of the algebraic operations of addition, subtraction, multiplication, division, raising to a power, and extracting a root. Examples: log x, sin x, cos x, e x Such an equation cannot be solved for one factor in terms of another and are expressible in algebraic terms only as infinite series. Some methods of finding solutions to a transcendental equation use graphical or numerical methods - Graphical method may be time-consuming, numerical methods preferred Direct methods : 1. Give the exact value of the roots (in the absence of round off errors) in a finite number of steps. 2. These methods determine all the roots at the same time. Numerical (iterative) methods: 1. Based on the idea of successive approximations. Starting with one or more initial approximations to the root, we obtain a sequence of iterations which in the limit converges to the root. 2. These methods determine one or two roots at a time.
7 The problems we want to answer are: Does the problem have a solution? Is the solution unique? Is the iteration well-defined? Does the iteration converge to a limit? How quickly does the method converge? Solution of non-linear equations Find the value of x for which f(x) = 0 Heart of numerical analysis is iteration 1. Bisection method (binary search): Repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. A convergence test is specified In order to decide when a sufficiently accurate solution has (hopefully) been found. y = f(x) f(x l ) f(x r ) x l f(x r ) x u x f(x u ) Make initial guess of x l and x r At each step the method divides the interval in two by computing the midpoint x r = (x l +x u )/2 f(x l ) f(x r ) < 0 ; Lower subinterval, make x u =x r f(x l ) f(x r ) > 0 ; Upper subinterval, make x l =x r f(x l ) f(x r ) =0 ; Root = x r
8 In each step, the interval is reduced by 50%. The process is continued until the interval (error), e a is sufficiently small. e x x x < tolerance To determine in advance the number of iterations that the bisection method would need to converge to a root to within a certain tolerance. x x 2 < tolerance Simple and robust but is slow. Therefore used to obtain a rough approximation to solution which is then used as a starting point for more rapidly converging methods, such as the Newton-Rhapson method. 2. Newton-Rhapson method Extremely powerful technique - in general the convergence is quadratic. Most widely used of all root finding methods. Method Make an initial guess which is reasonably close to the true root. Take the derivative of the function at a point Draw a tangent line from the point and extend it to the x-axis This x-intercept will typically be a better approximation to the function's root than the original guess. Iterate the Newton-Rhapson formula until the error falls below the tolerance. x = x ( ) ( ) i = 0,1,2. n The method will usually converge, provided this initial guess is close enough to the unknown zero.
9 Disadvantages Cases where it performs poorly multiple roots May result in slow convergence due to nature of certain functions An analytical expression for the derivative may not be easily obtainable In these situations, it may be appropriate to approximate the derivative by using the slope of a line through two nearby points on the function. Using this approximation would result in something like the secant method whose convergence is slower than that of Newton's method. 1) Multiple root at zero In these situations, it may be appropriate to approximate the derivative by using the slope of a line through two nearby points on the function. Using this approximation would result in something like the secant method whose convergence is slower than that of Newton's method.
10 3. Secant method Graphical interpretation is similar to the Newton - Rhapson method. Instead of a tangent line, we draw a secant line (a straight line which crosses the curve at two points). Derivative approximated by a backward finite divided difference. Secant formula: x = x f(x )(x x ) f(x ) f(x ) Since the calculation of x i+1 requires x i and x i-1, two initial points must be prescribed at the beginning; Advantage: Derivative of the function need not be calculated.
11 Week 10: One Dimensional Unconstrained Optimization Most of the mathematical models we have dealt with to this point have been descriptive models. That is, they have been derived to simulate the behavior of an engineering device or system. In contrast optimization typically deals with finding the best result, or optimum solution, of a problem Engineers must continuously design devices that perform tasks in an efficient fashion. In doing so, they are constrained by the limitations of the physical world. Further, they must keep costs down. Thus, they are always confronting optimization problems that balance performance and limitations. Some optimization examples. 1. Design aircraft for minimum weight and maximum strength 2. Optimal trajectories of space vehicle. 3. Design civil engineering structures for minimum cost. 4. Design pump and heat transfer equipment for maximum efficiency. 5. Shortest route of sales person visiting various cities during one sales trip.
12 Root location and optimization are related in the sense that both involve guessing and searching for a point on a function. f(x) f (x) = 0 f (x) < 0 X Maxima X f(x)=0 root root f (x) =0 f (x)>0 X Minima x One-dimensional optimization - minimum and maximum of a function f(x) of a single variable x Multi-dimensional optimization - minimum and maximum of a function of two or more variables f(x,y). Unconstrained optimization problem min x f(x) or max x f(x) Constrained optimization problem min x f(x) or max x f(x) subject to g(x) = 0 We will consider one-dimensional unconstrained optimization problem only
13 1. Golden section method Incremental search for max/min using Golden ratio The search interval in each iteration reduced by the GR = Step 1. Choose two initial guesses, x l, x u Step 2. Choose two interior points x 1, x 2 according to the GR Step 3. If f(x 1 ) > f(x 2 ) discard region left to x 2, set x l =x 2 If f(x 2 ) > f(x 1 ) discard region right to x 1, set x u =x 1 Step 4. Iterate until interval is less than tolerance Comparison of Bisection method and Golden section method Bisection method Method of incremental search Used to find roots of f(x) Golden Section method Method of incremental search Used to find max and min values of f(x) Find x for f(x)=0 Find x for f (x) =0 and f (x) > 0 for max point f (x) < 0 for min point Requires 2 points for the incremental search Looks for sign change of the function between the two points Interval section reduces by 0.5 in each iteration: x x 2 Requires min 3 points (upto 4 points) for incremental search Looks for higher/lower value of the function between the three points Interval section reduces by the Golden number in each iteration: 5 1 (x 2 x )
14 2. Quadratic (parabolic) interpolation A second order polynomial often provides a good approximation to the shape of f(x) near an optimum. Just as there is only one straight line connecting two points, there is only one quadratic or parabola connecting three points. Thus, if we have three points (x 0, x 1, x 2 ) that jointly bracket an optimum, we can fit a parabola to the points. Then we can differentiate it, set the results equal to zero, and solve for an estimate of the optimal x 3. It can be shown that : x = f(x )(x x ) + f(x )(x x ) + f(x )(x x ) 2 f(x )(x x ) + 2 f(x )(x x ) + 2 f(x )(x x ) where x o, x 1 and x 2 are the initial guesses, and x 3 is the optimal x obtained by the quadratic fitting. Advantages: Useful only when the function is quite smooth in the interval. Convergence is almost quadratic, (approximately 1.324). superior to that of other methods with only linear convergence (such as line search). Does not requiring the computation of derivatives, popular alternative to other methods that do require them (such as gradient descent and Newton's method).
15 Disadvantages: Convergence (even to a local extremum) is not guaranteed e.g. three points are collinear. (the resulting parabola is degenerate and thus does not provide a new candidate point). Can get hung up with just one end of the interval converging. Thus, the convergence can be slow. If function derivatives are available, Newton's method is applicable and exhibits quadratic convergence.
16 Week 10/11: Numerical Integration (Quadrature) In numerical analysis, numerical integration (numerical quadrature) is used for calculating the numerical value of a definite integral. The basic problem considered by numerical integration is to compute an approximate solution to a definite integral of a function f(x): A = f(x) dx which is the area of the curve (shaded) bounded by the limits a and b. Definite integral can be thought of as an infinite sum of rectangles of infinitesimal width.
17 There are several reasons for carrying out numerical integration. In real applications, some integrals may be too complex, and cannot be found exactly. Some integrals may require special functions which themselves are a challenge to compute, and are too slow. The integrand f(x) may be known only at certain points, such as obtained by sampling (observations at a certain number of points). In that case, we do not have a nice formula but only some data points. A formula for the integrand may be known, but it may be difficult or impossible to find an antiderivative e.g, f(x) = exp( x 2 ), the antiderivative of which (the error function, times a constant) cannot be written in elementary form.
18 Applications Chemical engineering: an analytic function is integrated numerically to determine the heat required to raise the temperature of a material Civil engineering: Numerical integration to determine the total wind force acting on the mast of a racing sailboat. The total force exerted on the mast can be expressed as z F = 200 ( 5 + z )e/ dz This non-linear equation is difficult to evaluate analytically. Therefore, it is convenient to apply numerical integration such as Simpson rule. Elect. engineering: Determination of the root mean square (rms) current of a electric circuit Mech. engineering: Calculation of work required to move a block
19 Methods Newton-Cotes formulas - approximates a complicated function tabulated at equally spaced intervals by an approximating polynomial. o Trapezoidal rule If the approximating polynomial is a first order (a straight line joining two end points) it is called the trapezoidal rule. o Simpson's rule If there is an additional point available in between, the three points can be connected by a parabola. If there are two additional points equally spaced in-between, the four points can be connected by a third order polynomial more accurate Gaussian quadrature points are not equally spaced.
Review. 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 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 informationChapter 3: Root Finding. September 26, 2005
Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
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 informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationRoot Finding: Close Methods. Bisection and False Position Dr. Marco A. Arocha Aug, 2014
Root Finding: Close Methods Bisection and False Position Dr. Marco A. Arocha Aug, 2014 1 Roots Given function f(x), we seek x values for which f(x)=0 Solution x is the root of the equation or zero of the
More informationBisection and False Position Dr. Marco A. Arocha Aug, 2014
Bisection and False Position Dr. Marco A. Arocha Aug, 2014 1 Given function f, we seek x values for which f(x)=0 Solution x is the root of the equation or zero of the function f Problem is known as root
More information3.1 Introduction. Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x x 1.5 =0, tan x x =0.
3.1 Introduction Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x 3 +1.5x 1.5 =0, tan x x =0. Practical existence test for roots: by intermediate value theorem, f C[a, b] & f(a)f(b)
More informationMA6452 STATISTICS AND NUMERICAL METHODS UNIT IV NUMERICAL DIFFERENTIATION AND INTEGRATION
MA6452 STATISTICS AND NUMERICAL METHODS UNIT IV NUMERICAL DIFFERENTIATION AND INTEGRATION By Ms. K. Vijayalakshmi Assistant Professor Department of Applied Mathematics SVCE NUMERICAL DIFFERENCE: 1.NEWTON
More information4.9 APPROXIMATING DEFINITE INTEGRALS
4.9 Approximating Definite Integrals Contemporary Calculus 4.9 APPROXIMATING DEFINITE INTEGRALS The Fundamental Theorem of Calculus tells how to calculate the exact value of a definite integral IF the
More informationIntegration, differentiation, and root finding. Phys 420/580 Lecture 7
Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:
More informationNumerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point
Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error In this method we assume initial value of x, and substitute in the equation. Then modify x and continue till we
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationMTH301 Calculus II Glossary For Final Term Exam Preparation
MTH301 Calculus II Glossary For Final Term Exam Preparation Glossary Absolute maximum : The output value of the highest point on a graph over a given input interval or over all possible input values. An
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 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 informationNumerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.
Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal
More informationROOT FINDING REVIEW MICHELLE FENG
ROOT FINDING REVIEW MICHELLE FENG 1.1. Bisection Method. 1. Root Finding Methods (1) Very naive approach based on the Intermediate Value Theorem (2) You need to be looking in an interval with only one
More information8.7 MacLaurin Polynomials
8.7 maclaurin polynomials 67 8.7 MacLaurin Polynomials In this chapter you have learned to find antiderivatives of a wide variety of elementary functions, but many more such functions fail to have an antiderivative
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationSolution of Nonlinear Equations
Solution of Nonlinear Equations (Com S 477/577 Notes) Yan-Bin Jia Sep 14, 017 One of the most frequently occurring problems in scientific work is to find the roots of equations of the form f(x) = 0. (1)
More informationNumerical Methods. Roots of Equations
Roots of Equations by Norhayati Rosli & Nadirah Mohd Nasir Faculty of Industrial Sciences & Technology norhayati@ump.edu.my, nadirah@ump.edu.my Description AIMS This chapter is aimed to compute the root(s)
More informationSOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD
BISECTION METHOD If a function f(x) is continuous between a and b, and f(a) and f(b) are of opposite signs, then there exists at least one root between a and b. It is shown graphically as, Let f a be negative
More informationNumerical Methods for Engineers
Numerical Methods for Engineers SEVENTH EDITION Steven C Chopra Berger Chair in Computing and Engineering Tufts University Raymond P. Canal Professor Emeritus of Civil Engineering of Michiaan University
More information19.4 Spline Interpolation
c9-b.qxd 9/6/5 6:4 PM Page 8 8 CHAP. 9 Numerics in General 9.4 Spline Interpolation Given data (function values, points in the xy-plane) (x, ƒ ), (x, ƒ ),, (x n, ƒ n ) can be interpolated by a polynomial
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 informationOutline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations
Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
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 informationCHAPTER 4 ROOTS OF EQUATIONS
CHAPTER 4 ROOTS OF EQUATIONS Chapter 3 : TOPIC COVERS (ROOTS OF EQUATIONS) Definition of Root of Equations Bracketing Method Graphical Method Bisection Method False Position Method Open Method One-Point
More informationSolution of Algebric & Transcendental Equations
Page15 Solution of Algebric & Transcendental Equations Contents: o Introduction o Evaluation of Polynomials by Horner s Method o Methods of solving non linear equations o Bracketing Methods o Bisection
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
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 informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 5 Nonlinear Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More informationCS 450 Numerical Analysis. Chapter 5: Nonlinear Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
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 informationNumerical Methods. Scientists. Engineers
Third Edition Numerical Methods for Scientists and Engineers K. Sankara Rao Numerical Methods for Scientists and Engineers Numerical Methods for Scientists and Engineers Third Edition K. SANKARA RAO Formerly,
More informationMA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs
MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and
More informationCS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More informationIn practice one often meets a situation where the function of interest, f(x), is only represented by a discrete set of tabulated points,
1 Interpolation 11 Introduction In practice one often meets a situation where the function of interest, f(x), is only represented by a discrete set of tabulated points, {x i, y i = f(x i ) i = 1 n, obtained,
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 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 informationToday s class. Numerical differentiation Roots of equation Bracketing methods. Numerical Methods, Fall 2011 Lecture 4. Prof. Jinbo Bi CSE, UConn
Today s class Numerical differentiation Roots of equation Bracketing methods 1 Numerical Differentiation Finite divided difference First forward difference First backward difference Lecture 3 2 Numerical
More informationWellston City Schools Calculus Curriculum Calendar
Wellston City Schools Calculus 2006-2007 Curriculum Calendar Grading Period 1:Week 1: Review 11 th grade standards Learn to represent functions using: *Words *Tables of values *Graphs *Formulas Present
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationEngg. Math. II (Unit-IV) Numerical Analysis
Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided
More informationcha1873x_p02.qxd 3/21/05 1:01 PM Page 104 PART TWO
cha1873x_p02.qxd 3/21/05 1:01 PM Page 104 PART TWO ROOTS OF EQUATIONS PT2.1 MOTIVATION Years ago, you learned to use the quadratic formula x = b ± b 2 4ac 2a to solve f(x) = ax 2 + bx + c = 0 (PT2.1) (PT2.2)
More information15 Nonlinear Equations and Zero-Finders
15 Nonlinear Equations and Zero-Finders This lecture describes several methods for the solution of nonlinear equations. In particular, we will discuss the computation of zeros of nonlinear functions f(x).
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 Taylor s Theorem Can often approximate a function by a polynomial The error in the approximation
More information1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
More informationChapter 8: Techniques of Integration
Chapter 8: Techniques of Integration Section 8.1 Integral Tables and Review a. Important Integrals b. Example c. Integral Tables Section 8.2 Integration by Parts a. Formulas for Integration by Parts b.
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 informationCS 257: Numerical Methods
CS 57: Numerical Methods Final Exam Study Guide Version 1.00 Created by Charles Feng http://www.fenguin.net CS 57: Numerical Methods Final Exam Study Guide 1 Contents 1 Introductory Matter 3 1.1 Calculus
More informationLecture 8. Root finding II
1 Introduction Lecture 8 Root finding II In the previous lecture we considered the bisection root-bracketing algorithm. It requires only that the function be continuous and that we have a root bracketed
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationCh. 03 Numerical Quadrature. Andrea Mignone Physics Department, University of Torino AA
Ch. 03 Numerical Quadrature Andrea Mignone Physics Department, University of Torino AA 2017-2018 Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. y
More informationNumerical Methods of Approximation
Contents 31 Numerical Methods of Approximation 31.1 Polynomial Approximations 2 31.2 Numerical Integration 28 31.3 Numerical Differentiation 58 31.4 Nonlinear Equations 67 Learning outcomes In this Workbook
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
1 P a g e INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 04 Name : Mathematics-II Code : A0006 Class : II B. Tech I Semester Branch : CIVIL Year : 016 017 FRESHMAN ENGINEERING
More informationSolving Non-Linear Equations (Root Finding)
Solving Non-Linear Equations (Root Finding) Root finding Methods What are root finding methods? Methods for determining a solution of an equation. Essentially finding a root of a function, that is, a zero
More informationNumerical techniques to solve equations
Programming for Applications in Geomatics, Physical Geography and Ecosystem Science (NGEN13) Numerical techniques to solve equations vaughan.phillips@nateko.lu.se Vaughan Phillips Associate Professor,
More informationOptimization. Totally not complete this is...don't use it yet...
Optimization Totally not complete this is...don't use it yet... Bisection? Doing a root method is akin to doing a optimization method, but bi-section would not be an effective method - can detect sign
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 6 Optimization Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 6 Optimization Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationMATH 4211/6211 Optimization Basics of Optimization Problems
MATH 4211/6211 Optimization Basics of Optimization Problems Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 A standard minimization
More informationNumerical Analysis Exam with Solutions
Numerical Analysis Exam with Solutions Richard T. Bumby Fall 000 June 13, 001 You are expected to have books, notes and calculators available, but computers of telephones are not to be used during the
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 5. Nonlinear Equations
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T Heath Chapter 5 Nonlinear Equations Copyright c 2001 Reproduction permitted only for noncommercial, educational
More informationUnit 2: Solving Scalar Equations. Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright
cs416: introduction to scientific computing 01/9/07 Unit : Solving Scalar Equations Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright 1 Introduction We now
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationEmpirical Models Interpolation Polynomial Models
Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationOutline. Scientific Computing: An Introductory Survey. Optimization. Optimization Problems. Examples: Optimization Problems
Outline Scientific Computing: An Introductory Survey Chapter 6 Optimization 1 Prof. Michael. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More informationScientific Computing. Roots of Equations
ECE257 Numerical Methods and Scientific Computing Roots of Equations Today s s class: Roots of Equations Bracketing Methods Roots of Equations Given a function f(x), the roots are those values of x that
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 informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationFUNCTIONS AND MODELS
1 FUNCTIONS AND MODELS FUNCTIONS AND MODELS 1.2 MATHEMATICAL MODELS: A CATALOG OF ESSENTIAL FUNCTIONS In this section, we will learn about: The purpose of mathematical models. MATHEMATICAL MODELS A mathematical
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 informationINSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad MECHANICAL ENGINEERING TUTORIAL QUESTION BANK
Course Name Course Code Class Branch INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 Mathematics-II A30006 II-I B. Tech Freshman Engineering Year 016 017 Course Faculty MECHANICAL ENGINEERING
More informationMotivation: We have already seen an example of a system of nonlinear equations when we studied Gaussian integration (p.8 of integration notes)
AMSC/CMSC 460 Computational Methods, Fall 2007 UNIT 5: Nonlinear Equations Dianne P. O Leary c 2001, 2002, 2007 Solving Nonlinear Equations and Optimization Problems Read Chapter 8. Skip Section 8.1.1.
More informationComputational Methods CMSC/AMSC/MAPL 460. Solving nonlinear equations and zero finding. Finding zeroes of functions
Computational Methods CMSC/AMSC/MAPL 460 Solving nonlinear equations and zero finding Ramani Duraiswami, Dept. of Computer Science Where does it arise? Finding zeroes of functions Solving functional equations
More informationMon Jan Improved acceleration models: linear and quadratic drag forces. Announcements: Warm-up Exercise:
Math 2250-004 Week 4 notes We will not necessarily finish the material from a given day's notes on that day. We may also add or subtract some material as the week progresses, but these notes represent
More informationPART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435
PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435 Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu
More informationconverges to a root, it may not always be the root you have in mind.
Math 1206 Calculus Sec. 4.9: Newton s Method I. Introduction For linear and quadratic equations there are simple formulas for solving for the roots. For third- and fourth-degree equations there are also
More informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationRoots of equations, minimization, numerical integration
Roots of equations, minimization, numerical integration Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University November 1, 2017 Roots of equations Find the roots solve equation
More informationCOURSE Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method
COURSE 7 3. Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method The presence of derivatives in the remainder difficulties in applicability to practical problems
More informationGLOSSARY. Accumulation function A function of the form a
GLOSSARY Absolute maximum The output value of the highest point on a graph over a given input interval or over all possible input values. An absolute maximum point either is a local maximum point or occurs
More informationLine Search Methods. Shefali Kulkarni-Thaker
1 BISECTION METHOD Line Search Methods Shefali Kulkarni-Thaker Consider the following unconstrained optimization problem min f(x) x R Any optimization algorithm starts by an initial point x 0 and performs
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 informationOptimization. Next: Curve Fitting Up: Numerical Analysis for Chemical Previous: Linear Algebraic and Equations. Subsections
Next: Curve Fitting Up: Numerical Analysis for Chemical Previous: Linear Algebraic and Equations Subsections One-dimensional Unconstrained Optimization Golden-Section Search Quadratic Interpolation Newton's
More informationNumerical Methods in Informatics
Numerical Methods in Informatics Lecture 2, 30.09.2016: Nonlinear Equations in One Variable http://www.math.uzh.ch/binf4232 Tulin Kaman Institute of Mathematics, University of Zurich E-mail: tulin.kaman@math.uzh.ch
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationfunction independent dependent domain range graph of the function The Vertical Line Test
Functions A quantity y is a function of another quantity x if there is some rule (an algebraic equation, a graph, a table, or as an English description) by which a unique value is assigned to y by a corresponding
More informationRoots of Equations. ITCS 4133/5133: Introduction to Numerical Methods 1 Roots of Equations
Roots of Equations Direct Search, Bisection Methods Regula Falsi, Secant Methods Newton-Raphson Method Zeros of Polynomials (Horner s, Muller s methods) EigenValue Analysis ITCS 4133/5133: Introduction
More informationNUMERICAL MATHEMATICS AND COMPUTING
NUMERICAL MATHEMATICS AND COMPUTING Fourth Edition Ward Cheney David Kincaid The University of Texas at Austin 9 Brooks/Cole Publishing Company I(T)P An International Thomson Publishing Company Pacific
More informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
More informationMathematics AQA Advanced Subsidiary GCE Core 1 (MPC1) January 2010
Link to past paper on AQA website: http://store.aqa.org.uk/qual/gce/pdf/aqa-mpc1-w-qp-jan10.pdf These solutions are for your personal use only. DO NOT photocopy or pass on to third parties. If you are
More information