Review Taylor Series and Error Analysis Roots of Equations

Slides:



Advertisements
Similar presentations
CS-110 Computational Engineering Part 3
Advertisements

Lecture 5 Newton-Raphson Method
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 One-Dimensional Unconstrained Optimization Chapter.
Computational Methods in Physics PHYS 3437
Optimization Introduction & 1-D Unconstrained Optimization
NUMERICAL DIFFERENTIATION AND INTEGRATION
Chapter 7 Numerical Differentiation and Integration
Today’s class Romberg integration Gauss quadrature Numerical Methods
Lecture 18 - Numerical Differentiation
Numerical Integration
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 30 Numerical Integration & Differentiation.
Chapter 19 Numerical Differentiation §Estimate the derivatives (slope, curvature, etc.) of a function by using the function values at only a set of discrete.
CVEN Exam 1 Review. Matlab Basic commands and syntax Basic commands and syntax Creation of functions and programs Creation of functions and programs.
Revision.
CVEN Exam 1 Review. Matlab.m files Matlab.m files Programming: FOR, WHILE, IF and FUNCTION Programming: FOR, WHILE, IF and FUNCTION Taylor Series.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW III.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW II.
Chapter 6 Numerical Interpolation
Differential Equations and Boundary Value Problems
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
Numerical Solution of Ordinary Differential Equation
NUMERICAL DIFFERENTIATION The derivative of f (x) at x 0 is: An approximation to this is: for small values of h. Forward Difference Formula.
CISE301_Topic7KFUPM1 SE301: Numerical Methods Topic 7 Numerical Integration Lecture KFUPM Read Chapter 21, Section 1 Read Chapter 22, Sections 2-3.
-S.SIVARAJA Dept of MATHEMATICS.  N-NUMERICAL  M-METHODS EASY TO LEARN & EASY TO SCORE.
CISE301_Topic71 SE301: Numerical Methods Topic 7 Numerical Integration Lecture KFUPM (Term 101) Section 04 Read Chapter 21, Section 1 Read Chapter.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Numerical Differentiation and Integration Part 6 Calculus.
Today’s class Boundary Value Problems Eigenvalue Problems
Today’s class Numerical Integration Newton-Cotes Numerical Methods
MECN 3500 Inter - Bayamon Lecture Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Lecture 19 - Numerical Integration CVEN 302 July 22, 2002.
Introduction to Numerical Analysis Using MATLAB
1 Chapter 7 NUMERICAL INTEGRATION. 2 PRELIMINARIES We use numerical integration when the function f(x) may not be integrable in closed form or even in.
Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
CISE301_Topic11 CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4:
EE 3561_Unit_1(c)Al-Dhaifallah EE 3561 : - Computational Methods in Electrical Engineering Unit 1: Introduction to Computational Methods and Taylor.
Introduction to Numerical Analysis I MATH/CMPSC 455 Fall 2011 Instructor: Xiaozhe Hu (Shawn)
Lecture 22 - Exam 2 Review CVEN 302 July 29, 2002.
Today’s class Spline Interpolation Quadratic Spline Cubic Spline Fourier Approximation Numerical Methods Lecture 21 Prof. Jinbo Bi CSE, UConn 1.
Integration of 3-body encounter. Figure taken from
Numerical Methods for Engineering MECN 3500
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Introduction Course Outline.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
Today’s class Numerical Differentiation Finite Difference Methods Numerical Methods Lecture 14 Prof. Jinbo Bi CSE, UConn 1.
Chap. 11 Numerical Differentiation and Integration
CHAPTER 3 NUMERICAL METHODS
Today’s class Roots of equation Finish up incremental search
BE207 Numerical Analysis using Matlab Lecturer DR Abdullah Awad Faculty of Engineering.
Solving Non-Linear Equations (Root Finding)
Today’s class Numerical differentiation Roots of equation Bracketing methods Numerical Methods, Lecture 4 1 Prof. Jinbo Bi CSE, UConn.
Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm
Use of Newton-Cotes Formulas and eventual shortcomings Matlab code to increase number of segments with trapezoid, 1/3 and 3/8 rule.
Curve Fitting Introduction Least-Squares Regression Linear Regression Polynomial Regression Multiple Linear Regression Today’s class Numerical Methods.
ESO 208A/ESO 218 COMPUTATIONAL METHODS IN ENGINEERING.
Today’s class Ordinary Differential Equations Runge-Kutta Methods
Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm One double-sided cheat sheet (8.5in x 11in) allowed Bring your calculator to the exam Chapters.
SE301_Topic 6Al-Amer20051 SE301:Numerical Methods Topic 6 Numerical Integration Dr. Samir Al-Amer Term 053.
Quadrature – Concepts (numerical integration) Don Allen.
Answers for Review Questions for Lectures 1-4. Review Lectures 1-4 Problems Question 2. Derive a closed form for the estimate of the solution of the equation.
CHAPTER 3 NUMERICAL METHODS
NUMERICAL DIFFERENTIATION Forward Difference Formula
CHAPTER 3 NUMERICAL METHODS.
Interpolation Estimation of intermediate values between precise data points. The most common method is: Although there is one and only one nth-order.
Numerical Analysis Lecture 45.
Today’s class Multiple Variable Linear Regression
Numerical differentiation
Numerical Integration:
MATH-321 In One Slide MATH-321 & MATLAB Command.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Numerical Integration
Presentation transcript:

Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations Curve Fitting Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Taylor Series Lagrange remainder Numerical Methods Prof. Jinbo Bi Through mean-value theorem, we can derive the Lagrange remainder for Taylor Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Roots of Equations Bracketing Methods Open Methods Bisection Method False Position Method Open Methods Fixed Point Iteration Newton-Raphson Method Secant Method Roots of Polynomials Müller’s Method Bairstow’s Method Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Bisection Method Example: Use range of [202:204] Root is in upper subinterval Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Bisection Method Use range of [203:204] Root is in lower subinterval Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Fixed Point Iteration Example Special attention Read Chap 6.1, 6.6 Fixed Point Iteration Example Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Newton-Raphson Method Use tangent to guide you to the root Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Linear Algebraic Systems Gaussian Elimination Forward Elimination Back Substitution LU Decomposition Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Gaussian Elimination Forward elimination Eliminate x1 from row 2 Multiply row 1 by a21/a11 Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Gaussian Elimination Eliminate x1 from row 2 Subtract row 1 from row 2 Eliminate x1 from all other rows in the same way Then eliminate x2 from rows 3-n and so on Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Gaussian Elimination Forward elimination Back substitute to solve for x Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

LU Decomposition Substitute the factorization into the linear system We have transformed the problem into two steps Factorize A into L and U Solve the two sub-problems LD = B UX = D Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

LU Decomposition Example Factorize A using forward elimination Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

LU Decomposition Example Numerical Methods Prof. Jinbo Bi Lecture 22 CSE, UConn

LU Decomposition Example Numerical Methods Prof. Jinbo Bi Lecture 22 CSE, UConn

LU Decomposition Example Numerical Methods Prof. Jinbo Bi Lecture 22 CSE, UConn

Optimization Methods One-dimensional unconstrained optimization Golden-Section Quadratic Interpolation Newton’s Method Multidimensional unconstrained optimization Direct Methods Gradient Methods Constrained Optimization Linear Programming Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Golden-section search Algorithm Pick two interior points in the interval using the golden ratio Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Golden-section search Two possibilities Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Golden-section search Example Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Golden-section search Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Golden-section search Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Newton’s Method Newton-Raphson could be used to find the root of an function When finding a function optimum, use the fact that we want to find the root of the derivative and apply Newton-Raphson Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Newton’s Method Example Numerical Methods Prof. Jinbo Bi Lecture 22 CSE, UConn

Newton’s Method Example Numerical Methods Prof. Jinbo Bi Lecture 22 CSE, UConn

Quadratic interpolation Special attention Quadratic interpolation Use a second order polynomial as an approximation of the function near the optimum Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Special attention Gradient Methods Given a starting point, use the gradient to tell you which direction to proceed The gradient gives you the largest slope out from the current position Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Numerical Integration Newton-Cotes Trapezoidal Rule Simpson’s Rules (Special attention for unevenly distributed points) Romberg Integration Gauss Quadrature Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Newton-Cotes Formulas Special attention Read Chap 21.2-3 Newton-Cotes Formulas Trapezoidal Rule Simpson’s 1/3 Rule Simpson’s 3/8 Rule Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Integration of Equations Romberg Integration Use two estimates of integration and then extrapolate to get a better estimate Special case where you always halve the interval - i.e. h2=h1/2 Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Romberg Integration Numerical Methods Prof. Jinbo Bi Lecture 22 CSE, UConn

Ordinary Differential Equations Runge-Kutta Methods Euler’s Method Heun’s Method RK4 Multistep Methods Boundary Value Problems Eigenvalue Problems Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Euler’s Method Example: True: h=0.5 Numerical Methods Prof. Jinbo Bi Lecture 22 Prof. Jinbo Bi CSE, UConn

Heun’s Method Local truncation error is O(h3) and global truncation error is O(h2) Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Heun’s Method Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Classic 4th-order R-K method Special attention to ODE equation system Not only one equation Classic 4th-order R-K method Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Curve Fitting Least Squares Regression Interpolation Fourier Approximation Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Polynomial Regression Special attention Lecture note 19 Chap 17.1 Polynomial Regression An mth order polynomial will require that you solve a system of m+1 linear equations Standard error Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Newton (divided difference) Interpolation polynomials Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Newton (divided difference) Interpolation polynomials Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Interpolation General Scheme for Divided Difference Coefficients Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Interpolation General Scheme for Divided Difference Coefficients Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Interpolation Example: Estimate ln 2 with data points at (1,0), (4,1.386294) Linear interpolation Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Interpolation Example: Estimate ln 2 with data points at (1,0), (4,1.386294), (5,1.609438) Quadratic interpolation Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Interpolation Example: Estimate ln 2 with data points at (1,0), (4,1.386294), (5,1.609438), (6,1.791759) Cubic interpolation Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Spline Interpolation Spline interpolation applies low-order polynomial to connect two neighboring points and uses it to interpolate between them. Typical Spline functions Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Cubic Spline Functions This gives us n-1 equation with n-1 unknowns – the second derivatives Once we solve for the second derivatives, we can plug it into the Lagrange interpolating polynomial for second derivative to solve for the splines Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Cubic Spline Functions Example: (3,2.5), (4.5,1), (7,2.5), (9,0.5) At x=x1=4 Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Cubic Spline Functions At x=x2=7 Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Cubic Spline Functions Solve the system of equations to find the second derivatives Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Cubic Spline Equations Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Cubic Spline Equations Substituting for other intervals Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn

Final Exam December 13 Friday, 10:30 AM~12:30 PM, ITE 119 Closed book, three cheat sheets (8.5x11in) allowed Office hours: December 12, 1-3pm, or by appointment TA December 10, 11am-12noon or by appointment Numerical Methods Lecture 22 Prof. Jinbo Bi CSE, UConn