CE 205 Numerical Methods. Some of the analysis methods you have used so far.. Algebra Calculus Differential Equations etc.

Size: px
Start display at page:

Download "CE 205 Numerical Methods. Some of the analysis methods you have used so far.. Algebra Calculus Differential Equations etc."

Transcription

1 CE 205 Numerical Methods Dr. Charisma Choudhury Lecture 1 March 30, 2009 Objective Some of the analysis methods you have used so far.. Algebra Calculus Differential Equations etc. Often not possible to determine analytical solution Complex calculation Sheer size of problem 1

2 Why Numerical Methods? Example: No closed form solution Length of one half of the curve y = sin(x): π 2 1+ cos ( ) 0 x dx Large matrices Computer is not so smart Need to break the problem to simple mathematical problems Add, subtract, multiply, divide, compare Practical considerations Example: Length of a board derived by solving equation: x 3 - x 2-3x + 3=0 How accurately can we measure for practical applications? Course Outline Numerical solution of algebraic and transcendental equations Solution of systems of linear equations Linear and non-linear curve-fitting by least square regression Finite differences Divided differences Interpolation Numerical differentiation and integration Numerical solution of differential equations 2

3 Course Outline Numerical solution of algebraic and transcendental equations Solution of systems of linear equations Linear and non-linear curve-fitting by least square regression Finite differences Divided differences Interpolation Numerical differentiation and integration Numerical solution of differential equations Lecture Plan Algebraic and transcendental equations Curve-fitting Differential equations CE applications and review 5 classes 3 classes 4 classes 1 class 3

4 References Any standard undergraduate textbook on Numerical Methods Some examples: Numerical Analysis: Goel & Mittal Applied Numerical Analysis: Gerald & Wheatley Numerical Methods for Engineers: Chapra & Canale Introductory Methods of Numerical Analysis: Sastry Grading Policy 3 quizzes Tentatively on 5 th, 9 th and 12 th class Or maybe one computer programming assignment? The last one is only a make-up quiz/assignment 4

5 Approach Often multiple methods for solving same problem Which is the most relevant method? Examine the problem What inputs do we have? What accuracy do we need? What is the computational burden? What is the rate of convergence? Errors in Numerical Methods Error in original data/measurement error Truncation error: e x =1+ x/1! + x 2 /2!+ Round-off error: 1/3, Calculations errors significant digits π etc. 5

6 Errors Abs error = true-apprx Relative= abs error /true 5000+/ /-0.1 True=10/3, apprx = Abs=1/3000 Rel=1/10000 Significant digits 4 Algebraic and Transcendental Equations Algebraic: y =ax+b Transcendental: y = a sinx+b cosx 6

7 Solution Methods Bisection/ Half-interval Search Method of false position/regula Falsi Secant Method Newton Raphson Iteration Method Many more Choice of Method Depends on.. Required accuracy Rate of convergence Inputs How does initial approximation affect the computation? Often combination of multiple methods is the optimum 7

8 Bisection/ Half-interval Search Background: Lessons from Graphical approach Solve: f(x)=0 Let y=f(x) Take a set of rectangular coordinates within a range (say x L and x U ) Plot Root(s): the point(s) where y crosses x Background Different variations (Examples shown in next page) Single root Multiple roots No root within specified range 8

9 1 root no roots 3 roots 2 roots Background Observations If f(x l ) and f(x U ) have opposite signs Odd number of roots in between If f(x l ) and f(x U ) have same signs Zero/even number of roots in between Exceptions Discontinuous function 9

10 Discontinuous Function Deductions If f(x) is continuous between x L and x U and f(x l ) * f(x U ) <0 (i.e. f(x l ) and f(x U ) have opposite signs) There is at least 1 real root f(x)=0 between x L and x U 10

11 Example Tangential functions can have any number of roots even irrespective of sign change/unchange Deductions If f(x) is continuous and strictly monotonic between x L and x U and f(x l ) * f(x U ) <0 (i.e. f(x l ) and f(x U ) have opposite signs) There is atmost 1 real root f(x)=0 between x L and x U 11

12 Basis of Bisection Method Narrow down interval [f(x L ) and f(x U ) ]to locate where the sign change occurs Divide into equal sub-intervals to search the point where the sign change occurs Steps Choose x L and x L such that f(x L )*f(x U )<0 Initial estimate of root x R =(x L + x U )/2 f(x R )*f(x L )<0, root is in lower interval, replace x U by x R f(x R )*f(x L )>0, root is in upper interval, replace x L by x R Terminate when f(x R )=f(x L ) or f(x U )-f(x L )<tolerance 12

13 Example f(x)=x 3 -x-1 x L =1,x U =2 x R =1.5 Solution: x=1.324 xl xr xu f(xl) f(xr) f(xu) DifferenceRemark ve +ve +ve replace upper ve -ve +ve replace lower ve +ve +ve replace upper ve -ve +ve replace lower ve +ve +ve replace upper ve +ve +ve replace upper ve -ve +ve replace lower ve -ve +ve replace lower ve +ve +ve OK at 0.01 tolerance Note: OK at 0.01 tolerance. Not ok at tolerance, need more iterations. 13

14 Practice Problems Find roots of the following in bisection method a. x π x e = Sin( ) 2 b. x xe = 2 14

TWO METHODS FOR OF EQUATIONS

TWO METHODS FOR OF EQUATIONS TWO METHODS FOR FINDING ROOTS OF EQUATIONS Closed (Bracketing) Methods Open Methods Motivation: i In engineering applications, it is often necessary to determine the rootofan of equation when a formula

More information

Solution of Algebric & Transcendental Equations

Solution 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 information

Zeroes of Transcendental and Polynomial Equations. Bisection method, Regula-falsi method and Newton-Raphson method

Zeroes of Transcendental and Polynomial Equations. Bisection method, Regula-falsi method and Newton-Raphson method Zeroes of Transcendental and Polynomial Equations Bisection method, Regula-falsi method and Newton-Raphson method PRELIMINARIES Solution of equation f (x) = 0 A number (real or complex) is a root of the

More information

SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD

SOLUTION 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 information

NUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR)

NUMERICAL 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 information

Chapter 4. Solution of Non-linear Equation. Module No. 1. Newton s Method to Solve Transcendental Equation

Chapter 4. Solution of Non-linear Equation. Module No. 1. Newton s Method to Solve Transcendental Equation Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-713209 email: anita.buie@gmail.com 1 . Chapter 4 Solution of Non-linear

More information

Numerical Methods. Roots of Equations

Numerical 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 information

Today 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. 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 information

Hence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1.

Hence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1. The Bisection method or BOLZANO s method or Interval halving method: Find the positive root of x 3 x = 1 correct to four decimal places by bisection method Let f x = x 3 x 1 Here f 0 = 1 = ve, f 1 = ve,

More information

UNIT - 2 Unit-02/Lecture-01

UNIT - 2 Unit-02/Lecture-01 UNIT - 2 Unit-02/Lecture-01 Solution of algebraic & transcendental equations by regula falsi method Unit-02/Lecture-01 [RGPV DEC(2013)] [7] Unit-02/Lecture-01 [RGPV JUNE(2014)] [7] Unit-02/Lecture-01 S.NO

More information

THE SECANT METHOD. q(x) = a 0 + a 1 x. with

THE 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 information

Scientific Computing. Roots of Equations

Scientific Computing. Roots of Equations ECE257 Numerical Methods and Scientific Computing Roots of Equations Today s s class: Roots of Equations Polynomials Polynomials A polynomial is of the form: ( x) = a 0 + a 1 x + a 2 x 2 +L+ a n x n f

More information

Root Finding (and Optimisation)

Root Finding (and Optimisation) Root Finding (and Optimisation) M.Sc. in Mathematical Modelling & Scientific Computing, Practical Numerical Analysis Michaelmas Term 2018, Lecture 4 Root Finding The idea of root finding is simple we want

More information

Regent College Maths Department. Further Pure 1 Numerical Solutions of Equations

Regent College Maths Department. Further Pure 1 Numerical Solutions of Equations Regent College Maths Department Further Pure 1 Numerical Solutions of Equations Further Pure 1 Numerical Solutions of Equations You should: Be able use interval bisection, linear interpolation and the

More information

Virtual University of Pakistan

Virtual 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 information

Review. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn

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 information

Numerical Methods. King Saud University

Numerical 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 information

Solutions of Equations in One Variable. Newton s Method

Solutions of Equations in One Variable. Newton s Method Solutions of Equations in One Variable Newton s Method Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011 Brooks/Cole,

More information

EAD 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 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 information

Numerical Analysis MTH603

Numerical Analysis MTH603 Numerical Analysis Course Contents Solution of Non Linear Equations Solution of Linear System of Equations Approximation of Eigen Values Interpolation and Polynomial Approximation Numerical Differentiation

More information

TABLE 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 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 information

Lecture 44. Better and successive approximations x2, x3,, xn to the root are obtained from

Lecture 44. Better and successive approximations x2, x3,, xn to the root are obtained from Lecture 44 Solution of Non-Linear Equations Regula-Falsi Method Method of iteration Newton - Raphson Method Muller s Method Graeffe s Root Squaring Method Newton -Raphson Method An approximation to the

More information

Variable. Peter W. White Fall 2018 / Numerical Analysis. Department of Mathematics Tarleton State University

Variable. Peter W. White Fall 2018 / Numerical Analysis. Department of Mathematics Tarleton State University Newton s Iterative s Peter W. White white@tarleton.edu Department of Mathematics Tarleton State University Fall 2018 / Numerical Analysis Overview Newton s Iterative s Newton s Iterative s Newton s Iterative

More information

Section 5.5 More Integration Formula (The Substitution Method) 2 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I

Section 5.5 More Integration Formula (The Substitution Method) 2 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I Section 5.5 More Integration Formula (The Substitution Method) 2 Lectures College of Science MATHS : Calculus I (University of Bahrain) Integrals / 7 The Substitution Method Idea: To replace a relatively

More information

Root 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 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 information

Justify all your answers and write down all important steps. Unsupported answers will be disregarded.

Justify all your answers and write down all important steps. Unsupported answers will be disregarded. Numerical Analysis FMN011 10058 The exam lasts 4 hours and has 13 questions. A minimum of 35 points out of the total 70 are required to get a passing grade. These points will be added to those you obtained

More information

Homework and Computer Problems for Math*2130 (W17).

Homework 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 information

Queens 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. 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 information

function independent dependent domain range graph of the function The Vertical Line Test

function 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 information

SBAME CALCULUS OF FINITE DIFFERENCES AND NUMERICAL ANLAYSIS-I Units : I-V

SBAME CALCULUS OF FINITE DIFFERENCES AND NUMERICAL ANLAYSIS-I Units : I-V SBAME CALCULUS OF FINITE DIFFERENCES AND NUMERICAL ANLAYSIS-I Units : I-V Unit I-Syllabus Solutions of Algebraic and Transcendental equations, Bisection method, Iteration Method, Regula Falsi method, Newton

More information

A Derivative Free Hybrid Equation Solver by Alloying of the Conventional Methods

A Derivative Free Hybrid Equation Solver by Alloying of the Conventional Methods DOI: 1.15415/mjis.213.129 A Derivative Free Hybrid Equation Solver by Alloying of the Conventional Methods Amit Kumar Maheshwari Advanced Materials and Processes Research Institute (CSIR, Bhopal, India

More information

Numerical and Statistical Methods

Numerical and Statistical Methods F.Y. B.Sc.(IT) : Sem. II Numerical and Statistical Methods Time : ½ Hrs.] Prelim Question Paper Solution [Marks : 75 Q. Attempt any THREE of the following : [5] Q.(a) What is a mathematical model? With

More information

CHAPTER-II ROOTS OF EQUATIONS

CHAPTER-II ROOTS OF EQUATIONS CHAPTER-II ROOTS OF EQUATIONS 2.1 Introduction The roots or zeros of equations can be simply defined as the values of x that makes f(x) =0. There are many ways to solve for roots of equations. For some

More information

CS 221 Lecture 9. Tuesday, 1 November 2011

CS 221 Lecture 9. Tuesday, 1 November 2011 CS 221 Lecture 9 Tuesday, 1 November 2011 Some slides in this lecture are from the publisher s slides for Engineering Computation: An Introduction Using MATLAB and Excel 2009 McGraw-Hill Today s Agenda

More information

ES-2 Lecture: More Least-squares Fitting. Spring 2017

ES-2 Lecture: More Least-squares Fitting. Spring 2017 ES-2 Lecture: More Least-squares Fitting Spring 2017 Outline Quick review of least-squares line fitting (also called `linear regression ) How can we find the best-fit line? (Brute-force method is not efficient)

More information

Lösning: Tenta Numerical Analysis för D, L. FMN011,

Lö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 information

Exact and Approximate Numbers:

Exact 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 information

Numerical Analysis: Solving Nonlinear Equations

Numerical Analysis: Solving Nonlinear Equations Numerical Analysis: Solving Nonlinear Equations Mirko Navara http://cmp.felk.cvut.cz/ navara/ Center for Machine Perception, Department of Cybernetics, FEE, CTU Karlovo náměstí, building G, office 104a

More information

Solving Non-Linear Equations (Root Finding)

Solving 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 information

Numerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods

Numerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods Numerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods So welcome to the next lecture of the 2 nd unit of this

More information

Figure 1: Graph of y = x cos(x)

Figure 1: Graph of y = x cos(x) Chapter The Solution of Nonlinear Equations f(x) = 0 In this chapter we will study methods for find the solutions of functions of single variables, ie values of x such that f(x) = 0 For example, f(x) =

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE 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 information

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad MECHANICAL ENGINEERING TUTORIAL QUESTION BANK

INSTITUTE 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 information

Determining the Roots of Non-Linear Equations Part I

Determining the Roots of Non-Linear Equations Part I Determining the Roots of Non-Linear Equations Part I Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term

More information

1 Lesson 13: Methods of Integration

1 Lesson 13: Methods of Integration Lesson 3: Methods of Integration Chapter 6 Material: pages 273-294 in the textbook: Lesson 3 reviews integration by parts and presents integration via partial fraction decomposition as the third of the

More information

Bisection and False Position Dr. Marco A. Arocha Aug, 2014

Bisection 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 information

SME 3023 Applied Numerical Methods

SME 3023 Applied Numerical Methods UNIVERSITI TEKNOLOGI MALAYSIA SME 3023 Applied Numerical Methods Solution of Nonlinear Equations Abu Hasan Abdullah Faculty of Mechanical Engineering Sept 2012 Abu Hasan Abdullah (FME) SME 3023 Applied

More information

Bisected Direct Quadratic Regula Falsi

Bisected Direct Quadratic Regula Falsi Applied Mathematical Sciences, Vol. 4, 2010, no. 15, 709-718 Bisected Direct Quadratic Regula Falsi Robert G. Gottlieb 1 and Blair F. Thompson Odyssey Space Research 1120 NASA Parkway, Suite 505 Houston,

More information

Therefore, the root is in the second interval and the lower guess is redefined as x l = The second iteration is

Therefore, the root is in the second interval and the lower guess is redefined as x l = The second iteration is 1 CHAPTER 5 5.1 The function to evaluate is gm gc d f ( cd ) tanh t v( t) c d m or substituting the given values 9.81(65) 9.81 ( ) tanh cd f c 4.5 d 35 c 65 d The first iteration is. +.3.5 f (.) f (.5)

More information

SAURASHTRA UNIVERSITY RAJKOT.

SAURASHTRA UNIVERSITY RAJKOT. SAURASHTRA UNIVERSITY RAJKOT. New Syllabus of B.Sc. Semester-3 According to Choice Based Credit System from June - 2011 (New Syllabus Effective from June - 2017) Program: Semester: 3 Subject: Course code:

More information

converges to a root, it may not always be the root you have in mind.

converges 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 information

1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that

1. 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 information

GENG2140, S2, 2012 Week 7: Curve fitting

GENG2140, S2, 2012 Week 7: Curve fitting 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

More information

Edexcel GCE Further Pure Mathematics (FP1) Required Knowledge Information Sheet. Daniel Hammocks

Edexcel GCE Further Pure Mathematics (FP1) Required Knowledge Information Sheet. Daniel Hammocks Edexcel GCE Further Pure Mathematics (FP1) Required Knowledge Information Sheet FP1 Formulae Given in Mathematical Formulae and Statistical Tables Booklet Summations o =1 2 = 1 + 12 + 1 6 o =1 3 = 1 64

More information

Numerical Analysis MTH603. Virtual University of Pakistan Knowledge beyond the boundaries

Numerical Analysis MTH603. Virtual University of Pakistan Knowledge beyond the boundaries Numerical Analysis MTH6 Virtual University of Pakistan Knowledge beyond the boundaries Table of Contents Lecture # Topics Page # Lecture Introduction Lecture Errors in Computations 6 Lecture Solution of

More information

SKMM 3023 Applied Numerical Methods

SKMM 3023 Applied Numerical Methods SKMM 3023 Applied Numerical Methods Solution of Nonlinear Equations ibn Abdullah Faculty of Mechanical Engineering Òº ÙÐÐ ÚºÒÙÐÐ ¾¼½ SKMM 3023 Applied Numerical Methods Solution of Nonlinear Equations

More information

Numerical techniques to solve equations

Numerical 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 information

MATH 20B MIDTERM #2 REVIEW

MATH 20B MIDTERM #2 REVIEW MATH 20B MIDTERM #2 REVIEW FORMAT OF MIDTERM #2 The format will be the same as the practice midterms. There will be six main questions worth 0 points each. These questions will be similar to problems you

More information

Numerical Analysis Fall. Roots: Open Methods

Numerical Analysis Fall. Roots: Open Methods Numerical Analysis 2015 Fall Roots: Open Methods Open Methods Open methods differ from bracketing methods, in that they require only a single starting value or two starting values that do not necessarily

More information

2x + 5 = x = x = 4

2x + 5 = x = x = 4 98 CHAPTER 3 Algebra Textbook Reference Section 5.1 3.3 LINEAR EQUATIONS AND INEQUALITIES Student CD Section.5 CLAST OBJECTIVES Solve linear equations and inequalities Solve a system of two linear equations

More information

INTRODUCTION TO NUMERICAL ANALYSIS

INTRODUCTION TO NUMERICAL ANALYSIS INTRODUCTION TO NUMERICAL ANALYSIS Cho, Hyoung Kyu Department of Nuclear Engineering Seoul National University 3. SOLVING NONLINEAR EQUATIONS 3.1 Background 3.2 Estimation of errors in numerical solutions

More information

MTH603 FAQ + Short Questions Answers.

MTH603 FAQ + Short Questions Answers. Absolute Error : Accuracy : The absolute error is used to denote the actual value of a quantity less it s rounded value if x and x* are respectively the rounded and actual values of a quantity, then absolute

More information

2.29 Numerical Fluid Mechanics Spring 2015 Lecture 4

2.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 information

Numerical and Statistical Methods

Numerical and Statistical Methods F.Y. B.Sc.(IT) : Sem. II Numerical and Statistical Methods Time : ½ Hrs.] Prelim Question Paper Solution [Marks : 75 Q. Attempt any THREE of the following : [5] Q.(a) What is a mathematical model? With

More information

This practice exam is intended to help you prepare for the final exam for MTH 142 Calculus II.

This practice exam is intended to help you prepare for the final exam for MTH 142 Calculus II. MTH 142 Practice Exam Chapters 9-11 Calculus II With Analytic Geometry Fall 2011 - University of Rhode Island This practice exam is intended to help you prepare for the final exam for MTH 142 Calculus

More information

Example. Evaluate. 3x 2 4 x dx.

Example. Evaluate. 3x 2 4 x dx. 3x 2 4 x 3 + 4 dx. Solution: We need a new technique to integrate this function. Notice that if we let u x 3 + 4, and we compute the differential du of u, we get: du 3x 2 dx Going back to our integral,

More information

Scientific Computing: An Introductory Survey

Scientific 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 information

Assignment # 8, Math 370, Fall 2018 SOLUTIONS:

Assignment # 8, Math 370, Fall 2018 SOLUTIONS: Assignment # 8, Math 370, Fall 018 SOLUTIONS: Problem 1: Solve the equations (a) y y = 3x + x 4, (i) y(0) = 1, y (0) = 1, y (0) = 1. Characteristic equation: α 3 α = 0 so α 1, = 0 and α 3 =. y c = C 1

More information

Numerical mathematics with GeoGebra in high school

Numerical mathematics with GeoGebra in high school Herceg 2009/2/18 23:36 page 363 #1 6/2 (2008), 363 378 tmcs@inf.unideb.hu http://tmcs.math.klte.hu Numerical mathematics with GeoGebra in high school Dragoslav Herceg and Ðorđe Herceg Abstract. We have

More information

Numerical Methods Lecture 3

Numerical Methods Lecture 3 Numerical Methods Lecture 3 Nonlinear Equations by Pavel Ludvík Introduction Definition (Root or zero of a function) A root (or a zero) of a function f is a solution of an equation f (x) = 0. We learn

More information

NUMERICAL 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. 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 information

Computer Problems for Fourier Series and Transforms

Computer Problems for Fourier Series and Transforms Computer Problems for Fourier Series and Transforms 1. Square waves are frequently used in electronics and signal processing. An example is shown below. 1 π < x < 0 1 0 < x < π y(x) = 1 π < x < 2π... and

More information

Introductory Numerical Analysis

Introductory 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 information

7.1 One-to-One Functions

7.1 One-to-One Functions 514 transcendental functions 7.1 One-to-One Functions You ve seen that some equations have only one solution (for eample, 5 2 = 3 and 3 = 8), while some have two solutions ( 2 + 3 = 7) and some even have

More information

NOTES FOR NUMERICAL METHODS MUHAMMAD USMAN HAMID

NOTES FOR NUMERICAL METHODS MUHAMMAD USMAN HAMID NOTES FOR NUMERICAL METHODS MUHAMMAD USMAN HAMID PREFACE In the beginning of university life I used only those books which were recommended by my teachers, soon I realized, that books were not enough to

More information

Continuity. MATH 161 Calculus I. J. Robert Buchanan. Fall Department of Mathematics

Continuity. MATH 161 Calculus I. J. Robert Buchanan. Fall Department of Mathematics Continuity MATH 161 Calculus I J. Robert Buchanan Department of Mathematics Fall 2017 Intuitive Idea A process or an item can be described as continuous if it exists without interruption. The mathematical

More information

1 Lecture 39: The substitution rule.

1 Lecture 39: The substitution rule. Lecture 39: The substitution rule. Recall the chain rule and restate as the substitution rule. u-substitution, bookkeeping for integrals. Definite integrals, changing limits. Symmetry-integrating even

More information

Lecture 7: Numerical Tools

Lecture 7: Numerical Tools Lecture 7: Numerical Tools Fatih Guvenen January 10, 2016 Fatih Guvenen Lecture 7: Numerical Tools January 10, 2016 1 / 18 Overview Three Steps: V (k, z) =max c,k 0 apple u(c)+ Z c + k 0 =(1 + r)k + z

More information

INTRODUCTION, FOUNDATIONS

INTRODUCTION, FOUNDATIONS 1 INTRODUCTION, FOUNDATIONS ELM1222 Numerical Analysis Some of the contents are adopted from Laurene V. Fausett, Applied Numerical Analysis using MATLAB. Prentice Hall Inc., 1999 2 Today s lecture Information

More information

2003 Mathematics. Advanced Higher. Finalised Marking Instructions

2003 Mathematics. Advanced Higher. Finalised Marking Instructions 2003 Mathematics Advanced Higher Finalised Marking Instructions 2003 Mathematics Advanced Higher Section A Finalised Marking Instructions Advanced Higher 2003: Section A Solutions and marks A. (a) Given

More information

Computational Methods. Solving Equations

Computational Methods. Solving Equations Computational Methods Solving Equations Manfred Huber 2010 1 Solving Equations Solving scalar equations is an elemental task that arises in a wide range of applications Corresponds to finding parameters

More information

cha1873x_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 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 information

MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series.

MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series. MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series. The objective of this section is to become familiar with the theory and application of power series and Taylor series. By

More information

BHAKT KAVI NARSINH MEHTAUNIVERSITY JUNAGADH.

BHAKT KAVI NARSINH MEHTAUNIVERSITY JUNAGADH. BHAKT KAVI NARSINH MEHTAUNIVERSITY JUNAGADH. Syllabus of B.Sc. Semester-3 According to Choice Based Credit System (Updated on Dt. 21/08/2017) (New Syllabus Effective from June - 2018) Program: Semester:

More information

ARC241 Structural Analysis I Lecture 1, Sections ST1.1 ST2.4

ARC241 Structural Analysis I Lecture 1, Sections ST1.1 ST2.4 Lecture 1, Sections ST1.1 ST2.4 ST1.1-ST1.2) Introduction ST1.3) Units of Measurements ST1.4) The International System (SI) of Units ST1.5) Numerical Calculations ST1.6) General Procedure of Analysis ST2.1)

More information

5. Hand in the entire exam booklet and your computer score sheet.

5. Hand in the entire exam booklet and your computer score sheet. WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test

More information

Pennsylvania Academic Standards for Mathematics Grade 11

Pennsylvania Academic Standards for Mathematics Grade 11 correlated to the Pennsylvania Academic Standards for Mathematics Grade 11 1/2003 2001 Algebra 1: Concepts and Skills 2001 correlated to the Pennsylvania Academic Standards for Mathematics Grade 11 2.1

More information

SAURASHTRA UNIVERSITY RAJKOT.

SAURASHTRA UNIVERSITY RAJKOT. SAURASHTRA UNIVERSITY RAJKOT. Syllabus of B.Sc. Semester-3 According to Choice Based Credit System Effective from June - 2011 Programme: Semester: 3 Subject: Course code: Title of Course: Section-wise

More information

PLC Papers. Created For:

PLC Papers. Created For: PLC Papers Created For: Algebra and proof 2 Grade 8 Objective: Use algebra to construct proofs Question 1 a) If n is a positive integer explain why the expression 2n + 1 is always an odd number. b) Use

More information

Learning Objectives for Math 165

Learning Objectives for Math 165 Learning Objectives for Math 165 Chapter 2 Limits Section 2.1: Average Rate of Change. State the definition of average rate of change Describe what the rate of change does and does not tell us in a given

More information

Numerical 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. 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 information

CHAPTER 1. INTRODUCTION. ERRORS.

CHAPTER 1. INTRODUCTION. ERRORS. CHAPTER 1. INTRODUCTION. ERRORS. SEC. 1. INTRODUCTION. Frequently, in fact most commonly, practical problems do not have neat analytical solutions. As examples of analytical solutions to mathematical problems,

More information

Section 4.1 Relative Extrema 3 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I

Section 4.1 Relative Extrema 3 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I Section 4.1 Relative Extrema 3 Lectures College of Science MATHS 101: Calculus I (University of Bahrain) Extrema 1 / 16 Application of Differentiation One of the most important applications of differential

More information

Chapter 5 Roots of Equations: Bracketing Models. Gab-Byung Chae

Chapter 5 Roots of Equations: Bracketing Models. Gab-Byung Chae Chapter 5 Roots of Equations: Bracketing Models Gab-Byung Chae 2008 4 17 2 Chapter Objectives Studying Bracketing Methods Understanding what roots problems are and where they occur in engineering and science.

More information

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES

BACHELOR 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 information

MALLA REDDY ENGINEERING COLLEGE

MALLA REDDY ENGINEERING COLLEGE MODULE I MALLA REDDY ENGINEERING COLLEGE (Autonomous) I B.Tech II Semester (MR15) I- Mid Question Bank Subject: Computational Mathematics (Common for CE, ME, CSE and Min.E) 1. If f(x) is continuous in

More information

Bindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 6: Monday, Mar 7. e k+1 = 1 f (ξ k ) 2 f (x k ) e2 k.

Bindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 6: Monday, Mar 7. e k+1 = 1 f (ξ k ) 2 f (x k ) e2 k. Problem du jour Week 6: Monday, Mar 7 Show that for any initial guess x 0 > 0, Newton iteration on f(x) = x 2 a produces a decreasing sequence x 1 x 2... x n a. What is the rate of convergence if a = 0?

More information

Numerical Methods. King Saud University

Numerical 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 information

Analysis Methods in Atmospheric and Oceanic Science

Analysis Methods in Atmospheric and Oceanic Science Analysis Methods in Atmospheric and Oceanic Science AOSC 652 Week 7, Day 1 13 Oct 2014 1 Student projects: 20% of the final grade: you will receive a numerical score for the project and final grade will

More information

AP Calculus AB UNIT 1: PRECALCULUS REVIEW UNIT 2: BRIDGE TO CALCULUS LESSON 1: INTRO TO CALCULUS LESSON 2: FUNCTIONS

AP Calculus AB UNIT 1: PRECALCULUS REVIEW UNIT 2: BRIDGE TO CALCULUS LESSON 1: INTRO TO CALCULUS LESSON 2: FUNCTIONS Advanced Placement AP Calculus AB In AP* Calculus AB, students learn to understand change geometrically and visually (by studying graphs of curves), analytically (by studying and working with mathematical

More information