Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point

Size: px
Start display at page:

Download "Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point"

Transcription

1 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 get the solution. Ex:- solve the equation 2x 2 x 1(by using trial and error) 2x 2 x 1 0 Let x 1 F(0) -1 Let x 0.5 F(0.5) -1 Let x 1 F(1) 0 (first root) Let x F(-0.5) 0 (second root) 2- Fixed point In this method, we try to put x g(x) than assuming an initial value for x and evaluating the next value of x, as follows:- X n+1 g(x n ) And continue in this iteration till we get X n+1 g(x n ) Ex:- resolve the last example using fixed point method 2x 2 x 1 x 2x 2 1 Let x o 0 n x n X n (first root) Let x o 2 n x n X n Divergence Let x o -2 n x n X n Divergence Let x Let x o 0

2 n x n x n (second root) 3- Newton-Raphson method x 0 x 1 Generally x n+1 x n Ex:- resolve the last example using Newton Raphson method F(x) 2x 2 x 1 0 x) 4x-1 x n+1 x n Let x o 0 n x n X n (first root) Let x o 1 n x n X n (second root) Curve Fitting 1- Leaner Fitting y(x) ax+b E + + +

3 Multiply equ.2 by and subtract it from equ.1 Ex:- Find the best line passing though the following points (0,1), (1.3), (2,4), (3,8), (4,10) Sol: i Average Polynomial Fitting y(x) m : degree of polynomial For m2 y(x) 1

4 Generally..2.3 Ex:- Find the best parabola representing the following points (0,1), (1.3), (2,4), (3,11), (4,15) Sol: y i average Then find by using Gauss elimination method or by using Gauss-Jordon forward b 3- Exponential Fitting Taking Ex:- Find the best exponential function passing though the following points (1,3), (2,8), (3,27), (4,80) Sol:

5 i Y Average Power Fitting 1- Taking 2- Perform linear fitting ; Ex:- Find the best power function passing though the following points (1,3), (2,8), (3,27), (4,80) Sol: i Y X Average

6 Newton Interpolation Formula a- Forward Interpolation Formula b- Backward Interpolation Form Where r and h Ex:- give the following data (x n, f n ) find f(0.25), f(1.3) and f(-0.35) x F Using linear, quadratic interpolation and 4-trem Newton interpolation formula Sol:- n X F(0.25) h 0.2 let 0.2, 3.43 and 2.72 linear f (0.25) quadratic f (0.25) trem Newton interpolation formula r 0.25 F(0.25) F(1.3) h 0.2 r 2.5

7 let 0.8, 25.7 and 29.9 linear f (1.3) quadratic let 0.6; ; ; h 0.2 r 3.5 f (1.3) trem Newton interpolation formula r 4.5 F(1.3) F(-0.35) h 0.2 let 0.0, 1.2 and 2.23 linear f (-0.35) quadratic f ( 0.35) trem Newton interpolation formula r f ( 0.35) Note:- Newton interpolation formula can be used only when points are equally spaced ( h constant) Lagrange Interpolation Formula where j k for example when N2 f(x)

8 Note:- Lagrange interpolation formula can be used for equally or non-equally spaced points. Ex:-for the same data in the last example find f(0.25) using 3-trem Lagrange interpolation formula f(0.25) Hw. Complete the example and find f(1.3) and f(-0.35) Finite Difference, Interpolation and Extrapolation 1- Finite Difference a- Forward Finite Difference. first forward difference ) ). second forward difference. third forward difference Ex:- construct the forward finite difference for the following data x F Sol:- n x b- Backward Finite Difference. first backward difference ) ). second backward difference. third forward difference Ex:- construct the backward finite difference for the same data in the last example

9 Sol:- x F n x c- Central Finite Difference (first central difference) (second central difference) Ex:- construct the central finite difference for the same data in the last example Sol:- x F n x Interpolation and Extrapolation 1- Linear interpolation F 1 F F o x o x x 1 let h (step) or let r

10 2- Quadratic interpolation Solution of Ordinary Differential of Equation 1- Euler Methods Ex:- solve the equation for from 0 to 1 given that Let n Modified Euler Method Ex:- re-solve last example using modify Euler methods Let

11 n Numerical Analysis Numerical Integration and Differential Integration 1- Trapezoidal Method N number of division (strip)

12 Ex:- evaluated the following integral using trapezoidal method Sol:- x F I Simpson's Rule N number of division (must be even) Ex:- :- evaluated the last integral using Simpson's rule Sol:- x F

13 I Gauss Quadrature method m number of term Ex:- evaluated the last integral using 4- term Gauss Quadrature methods Sol : k I Differentiation F 1 F F o

14 r Solution of Linear Simultaneous Equation b b b n Where m number of variables n number of equations If n m; then there is one exact solution If n > m; then there is no solution If n < m; then there are many solution 1- Iteration (Gauss-Siedel) Method Extract the value of each variable from one of equation and substituted the obtained values in the next iteration process till we obtain convergence i j To guarantee convergence Ex:- solve the following set equations (1) (2) (3) + 2 (1) (2)

15 + 5..(3) Where is very small j 1,2,,m i column of iteration Note: Gauss Elimination Methods(Forward Elimination & Backward Substitution) For example Step1:-eliminate coefficient of from equations (2) and (3), multiplying equation (1) by and add it to equation (2) then multiplying equation (1) by and add it to equation (3). Step2:- eliminate by multiplying equation (2) by and add it to equation (3). Step 3:- back substitution

16 Ex:- Resolve the last example using Gauss Elimination Methods + 2 (1) (2) + 5..(3) Step1:-eliminate coeff. of from equ. (2) and (3), multiplying equ. (1) by and add it to equ. (2) then multiplying equ. (1) by and add it to equ. (3). + 2 (1) (2) (3) Step2:-eliminate coeff. of from equ. (3), multiplying equ. (2) by and add it to equ. (3). + 2 (1) (2) (3) Back substitution Gauss-Jordon Methods (Forward &Backward Elimination) For example Step1 and step2 same as in Gauss Elimination method

17 Step3:- eliminate coefficient of from equations (1) and (2), multiplying equation (3) by and add it to equation (1) then multiplying equation (3) by and add it to equation (2). Step4:- eliminate coefficient of and add it to equation (1) from equations (1), multiplying equation (2) by Ex:- Ex:- Resolve the last example using Gauss- Jordon Methods + 2 (1) (2) + 5..(3) Step1:-eliminate coeff. of from equ. (2) and (3), multiplying equ. (1) by and add it to equ. (2) then multiplying equ. (1) by and add it to equ. (3). + 2 (1) (2) (3) Step2:-eliminate coeff. of from equ. (3), multiplying equ. (2) by and add it to equ. (3). + 2 (1) (2) (3) Step3 Multiplying equ. (3) by and add it to equ. (2) and add it to equ. (1), and then multiplying equ. (3) by

18 (1) (2) (3) Step4:- Multiplying equ. (2) by and add it to equ. (1) (1) (2) (3) So

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

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

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY Code No: R007/R0 Set No. I B.Tech I Semester Supplementary Examinations, Feb/Mar 04 MATHEMATICAL METHODS ( Common to Civil Engineering, Electrical & Electronics Engineering, Computer Science & Engineering,

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

MATHEMATICAL METHODS INTERPOLATION

MATHEMATICAL METHODS INTERPOLATION MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU

More information

PARTIAL DIFFERENTIAL EQUATIONS

PARTIAL DIFFERENTIAL EQUATIONS MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL

More information

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010 Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression

More information

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

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

NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A)

NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A) NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A) Unit - 1 Errors & Their Accuracy Solutions of Algebraic and Transcendental Equations Bisection Method The method of false position The iteration method

More information

Then, Lagrange s interpolation formula is. 2. What is the Lagrange s interpolation formula to find, if three sets of values. are given.

Then, Lagrange s interpolation formula is. 2. What is the Lagrange s interpolation formula to find, if three sets of values. are given. SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY, COIMBATORE- 10 DEPARTMENT OF SCIENCE AND HUMANITIES SUBJECT NUMERICAL METHODS & LINEAR PROGRAMMING ( SEMESTER IV ) IV- INTERPOLATION, NUMERICAL DIFFERENTIATION

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

M.SC. PHYSICS - II YEAR

M.SC. PHYSICS - II YEAR MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student

More information

Numerical Methods. Scientists. Engineers

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

Subbalakshmi Lakshmipathy College of Science. Department of Mathematics

Subbalakshmi Lakshmipathy College of Science. Department of Mathematics ॐ Subbalakshmi Lakshmipathy College of Science Department of Mathematics As are the crests on the hoods of peacocks, As are the gems on the heads of cobras, So is Mathematics, at the top of all Sciences.

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

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

Unit I (Testing of Hypothesis)

Unit I (Testing of Hypothesis) SUBJECT NAME : Statistics and Numerical Methods SUBJECT CODE : MA645 MATERIAL NAME : Part A questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) Unit I (Testing of Hypothesis). State level

More information

MA1023-Methods of Mathematics-15S2 Tutorial 1

MA1023-Methods of Mathematics-15S2 Tutorial 1 Tutorial 1 the week starting from 19/09/2016. Q1. Consider the function = 1. Write down the nth degree Taylor Polynomial near > 0. 2. Show that the remainder satisfies, < if > > 0 if > > 0 3. Show that

More information

Numerical Methods in Physics and Astrophysics

Numerical Methods in Physics and Astrophysics Kostas Kokkotas 2 October 17, 2017 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 information

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS

More information

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding

More information

Name of the Student: Unit I (Solution of Equations and Eigenvalue Problems)

Name of the Student: Unit I (Solution of Equations and Eigenvalue Problems) Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for

More information

School of Sciences Indira Gandhi National Open University Maidan Garhi, New Delhi (For January 2012 cycle)

School of Sciences Indira Gandhi National Open University Maidan Garhi, New Delhi (For January 2012 cycle) MTE-0 ASSIGNMENT BOOKLET Bachelor's Degree Programme Numerical Analysis (MTE-0) (Valid from st January, 0 to st December, 0) School of Sciences Indira Gandhi National Open University Maidan Garhi, New

More information

Numerical Analysis & Computer Programming

Numerical Analysis & Computer Programming ++++++++++ Numerical Analysis & Computer Programming Previous year Questions from 07 to 99 Ramanasri Institute W E B S I T E : M A T H E M A T I C S O P T I O N A L. C O M C O N T A C T : 8 7 5 0 7 0 6

More information

Preliminary Examination in Numerical Analysis

Preliminary Examination in Numerical Analysis Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify

More information

Numerical Integra/on

Numerical Integra/on Numerical Integra/on Applica/ons The Trapezoidal Rule is a technique to approximate the definite integral where For 1 st order: f(a) f(b) a b Error Es/mate of Trapezoidal Rule Truncation error: From Newton-Gregory

More information

Numerical Methods in Physics and Astrophysics

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

Exam 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: 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 information

NUMERICAL METHODS FOR ENGINEERING APPLICATION

NUMERICAL METHODS FOR ENGINEERING APPLICATION NUMERICAL METHODS FOR ENGINEERING APPLICATION Second Edition JOEL H. FERZIGER A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Weinheim / Brisbane / Singapore / Toronto

More information

UNIT-II INTERPOLATION & APPROXIMATION

UNIT-II INTERPOLATION & APPROXIMATION UNIT-II INTERPOLATION & APPROXIMATION LAGRANGE POLYNAMIAL 1. Find the polynomial by using Lagrange s formula and hence find for : 0 1 2 5 : 2 3 12 147 : 0 1 2 5 : 0 3 12 147 Lagrange s interpolation formula,

More information

SOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS)

SOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS) CHENDU COLLEGE OF ENGINEERING AND TECHNOLOGY (Approved by AICTE New Delhi, Affiliated to Anna University Chennai. Zamin Endathur Village, Madurntakam Taluk, Kancheepuram Dist.-603311.) MA6459 - NUMERICAL

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

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

Newton's forward interpolation formula

Newton's forward interpolation formula Newton's Interpolation Formulae Interpolation is the process of approximating a given function, whose values are known at N + 1 tabular points, by a suitable polynomial, P N (x) of degree N which takes

More information

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ). 1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x

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

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

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

CS 323: Numerical Analysis and Computing

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

CS 323: Numerical Analysis and Computing

CS 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 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

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

Introduction Linear system Nonlinear equation Interpolation

Introduction Linear system Nonlinear equation Interpolation Interpolation Interpolation is the process of estimating an intermediate value from a set of discrete or tabulated values. Suppose we have the following tabulated values: y y 0 y 1 y 2?? y 3 y 4 y 5 x

More information

CS 257: Numerical Methods

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

Mathematical Focus 1 Complex numbers adhere to certain arithmetic properties for which they and their complex conjugates are defined.

Mathematical Focus 1 Complex numbers adhere to certain arithmetic properties for which they and their complex conjugates are defined. Situation: Complex Roots in Conjugate Pairs Prepared at University of Georgia Center for Proficiency in Teaching Mathematics June 30, 2013 Sarah Major Prompt: A teacher in a high school Algebra class has

More information

Engg. Math. II (Unit-IV) Numerical Analysis

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

Previous Year Questions & Detailed Solutions

Previous Year Questions & Detailed Solutions Previous Year Questions & Detailed Solutions. The rate of convergence in the Gauss-Seidal method is as fast as in Gauss Jacobi smethod ) thrice ) half-times ) twice 4) three by two times. In application

More information

Differential Equations

Differential Equations Differential Equations Definitions Finite Differences Taylor Series based Methods: Euler Method Runge-Kutta Methods Improved Euler, Midpoint methods Runge Kutta (2nd, 4th order) methods Predictor-Corrector

More information

Numerical Analysis. Introduction to. Rostam K. Saeed Karwan H.F. Jwamer Faraidun K. Hamasalh

Numerical Analysis. Introduction to. Rostam K. Saeed Karwan H.F. Jwamer Faraidun K. Hamasalh Iraq Kurdistan Region Ministry of Higher Education and Scientific Research University of Sulaimani Faculty of Science and Science Education School of Science Education-Mathematics Department Introduction

More information

Learning Module 1 - Basic Algebra Review (Appendix A)

Learning Module 1 - Basic Algebra Review (Appendix A) Learning Module 1 - Basic Algebra Review (Appendix A) Element 1 Real Numbers and Operations on Polynomials (A.1, A.2) Use the properties of real numbers and work with subsets of the real numbers Determine

More information

MA6452 STATISTICS AND NUMERICAL METHODS UNIT IV NUMERICAL DIFFERENTIATION AND INTEGRATION

MA6452 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 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

Exam in TMA4215 December 7th 2012

Exam in TMA4215 December 7th 2012 Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed

More information

FINITE-DIMENSIONAL LINEAR ALGEBRA

FINITE-DIMENSIONAL LINEAR ALGEBRA DISCRETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H ROSEN FINITE-DIMENSIONAL LINEAR ALGEBRA Mark S Gockenbach Michigan Technological University Houghton, USA CRC Press Taylor & Francis Croup

More information

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF SCIENCE & HUMANITIES STATISTICS & NUMERICAL METHODS TWO MARKS

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF SCIENCE & HUMANITIES STATISTICS & NUMERICAL METHODS TWO MARKS SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF SCIENCE & HUMANITIES STATISTICS & NUMERICAL METHODS TWO MARKS UNIT-I HYPOTHESIS TESTING 1. What are the applications of distributions? * Test the hypothesis

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

Chapter 5: Numerical Integration and Differentiation

Chapter 5: Numerical Integration and Differentiation Chapter 5: Numerical Integration and Differentiation PART I: Numerical Integration Newton-Cotes Integration Formulas The idea of Newton-Cotes formulas is to replace a complicated function or tabulated

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

Curve Fitting and Interpolation

Curve Fitting and Interpolation Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical

More information

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science ANSWERS OF THE TEST NUMERICAL METHODS FOR DIFFERENTIAL EQUATIONS (WI097 TU) Thursday January 014, 18:0-1:0

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad Course Title Course Code INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 CIVIL ENGINEERING COURSE DESCRIPTION MATHEMATICS-II A30006 Course Structure Lectures Tutorials

More information

Integration, differentiation, and root finding. Phys 420/580 Lecture 7

Integration, 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 information

CHAPTER 2 POLYNOMIALS KEY POINTS

CHAPTER 2 POLYNOMIALS KEY POINTS CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x

More information

Section 3.6 Complex Zeros

Section 3.6 Complex Zeros 04 Chapter Section 6 Complex Zeros When finding the zeros of polynomials, at some point you're faced with the problem x = While there are clearly no real numbers that are solutions to this equation, leaving

More information

F I F T H E D I T I O N. Introductory Methods of Numerical Analysis. S.S. Sastry

F I F T H E D I T I O N. Introductory Methods of Numerical Analysis. S.S. Sastry F I F T H E D I T I O N Introductory Methods of Numerical Analysis S.S. Sastry Introductory Methods of Numerical Analysis Introductory Methods of Numerical Analysis Fifth Edition S.S. SASTRY Formerly,

More information

Engineering. Mathematics. GATE 2019 and ESE 2019 Prelims. For. Comprehensive Theory with Solved Examples

Engineering. Mathematics. GATE 2019 and ESE 2019 Prelims. For. Comprehensive Theory with Solved Examples Thoroughly Revised and Updated Engineering Mathematics For GATE 2019 and ESE 2019 Prelims Comprehensive Theory with Solved Examples Including Previous Solved Questions of GATE (2003-2018) and ESE-Prelims

More information

Solution of Nonlinear Equations

Solution of Nonlinear Equations Solution of Nonlinear Equations In many engineering applications, there are cases when one needs to solve nonlinear algebraic or trigonometric equations or set of equations. These are also common in Civil

More information

Applied Numerical Analysis

Applied Numerical Analysis Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory

More information

COURSE Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method

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

Numerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.

Numerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat. Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley

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

Week 1 Factor & Remainder Past Paper Questions - SOLUTIONS

Week 1 Factor & Remainder Past Paper Questions - SOLUTIONS Question Solution Marks C2 JUNE 2010 Q2 f(3) = 3(3) 3 5(3) 2 58(3) + 40 f(3) = 98 So, the remainder is 98 Substitute x = 3 into 98 (If it is not stated that 98 is the remainder, do not give this C2 JUNE

More information

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

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

Computational Methods

Computational Methods Numerical Computational Methods Revised Edition P. B. Patil U. P. Verma Alpha Science International Ltd. Oxford, U.K. CONTENTS Preface List ofprograms v vii 1. NUMER1CAL METHOD, ERROR AND ALGORITHM 1 1.1

More 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

Integration. Topic: Trapezoidal Rule. Major: General Engineering. Author: Autar Kaw, Charlie Barker.

Integration. Topic: Trapezoidal Rule. Major: General Engineering. Author: Autar Kaw, Charlie Barker. Integration Topic: Trapezoidal Rule Major: General Engineering Author: Autar Kaw, Charlie Barker 1 What is Integration Integration: The process of measuring the area under a function plotted on a graph.

More information

CHAPTER 5: Linear Multistep Methods

CHAPTER 5: Linear Multistep Methods CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order

More information

Equations and Inequalities

Equations and Inequalities Chapter 3 Equations and Inequalities Josef Leydold Bridging Course Mathematics WS 2018/19 3 Equations and Inequalities 1 / 61 Equation We get an equation by equating two terms. l.h.s. = r.h.s. Domain:

More information

B.Sc. (Second Year)(Third Semester)(Mathematics)

B.Sc. (Second Year)(Third Semester)(Mathematics) B.Sc. Mathematics II Semester III - 1 - B.Sc. (Second Year)(Third Semester)(Mathematics) Paper No. MAT 301: (Number Theory) 1. Divisibility Theory in the integers: The Division Algorithm, The greatest

More information

Algebra II. A2.1.1 Recognize and graph various types of functions, including polynomial, rational, and algebraic functions.

Algebra II. A2.1.1 Recognize and graph various types of functions, including polynomial, rational, and algebraic functions. Standard 1: Relations and Functions Students graph relations and functions and find zeros. They use function notation and combine functions by composition. They interpret functions in given situations.

More information

Final Exam C Name i D) 2. Solve the equation by factoring. 4) x2 = x + 72 A) {1, 72} B) {-8, 9} C) {-8, -9} D) {8, 9} 9 ± i

Final Exam C Name i D) 2. Solve the equation by factoring. 4) x2 = x + 72 A) {1, 72} B) {-8, 9} C) {-8, -9} D) {8, 9} 9 ± i Final Exam C Name First, write the value(s) that make the denominator(s) zero. Then solve the equation. 7 ) x + + 3 x - = 6 (x + )(x - ) ) A) No restrictions; {} B) x -, ; C) x -; {} D) x -, ; {2} Add

More information

Do not turn over until you are told to do so by the Invigilator.

Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

Foundations of Math II Unit 5: Solving Equations

Foundations of Math II Unit 5: Solving Equations Foundations of Math II Unit 5: Solving Equations Academics High School Mathematics 5.1 Warm Up Solving Linear Equations Using Graphing, Tables, and Algebraic Properties On the graph below, graph the following

More information

Math 107H Fall 2008 Course Log and Cumulative Homework List

Math 107H Fall 2008 Course Log and Cumulative Homework List Date: 8/25 Sections: 5.4 Math 107H Fall 2008 Course Log and Cumulative Homework List Log: Course policies. Review of Intermediate Value Theorem. The Mean Value Theorem for the Definite Integral and 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

1. to apply Simpson s 1/3 rule, the number of intervals in the following must be Answer: (select your correct answer)

1. to apply Simpson s 1/3 rule, the number of intervals in the following must be Answer: (select your correct answer) 1. to apply Simpson s 1/3 rule, the number of intervals in the following must be Answer: (select your correct answer) 6 7 9 11 2. In integrating by dividing the interval into eight equal parts, width of

More information

Fundamental Numerical Methods for Electrical Engineering

Fundamental Numerical Methods for Electrical Engineering Stanislaw Rosloniec Fundamental Numerical Methods for Electrical Engineering 4y Springei Contents Introduction xi 1 Methods for Numerical Solution of Linear Equations 1 1.1 Direct Methods 5 1.1.1 The Gauss

More information

Mechanical department. Statistics and Numerical methods (MA42)

Mechanical department. Statistics and Numerical methods (MA42) Mechanical department Statistics and Numerical methods (MA4) 1.Define analysis of variance? Analysis of variance (ANOUA) is a technique that will enable to test for the significance of difference among

More information

Numerical Integration (Quadrature) Another application for our interpolation tools!

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

8.3 Numerical Quadrature, Continued

8.3 Numerical Quadrature, Continued 8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes

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

BSM510 Numerical Analysis

BSM510 Numerical Analysis BSM510 Numerical Analysis Polynomial Interpolation Prof. Manar Mohaisen Department of EEC Engineering Review of Precedent Lecture Polynomial Regression Multiple Linear Regression Nonlinear Regression Lecture

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

Numerical Integra/on

Numerical Integra/on Numerical Integra/on The Trapezoidal Rule is a technique to approximate the definite integral where For 1 st order: f(a) f(b) a b Error Es/mate of Trapezoidal Rule Truncation error: From Newton-Gregory

More information

ENGINEERING MATHEMATICS I. CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 PART-A

ENGINEERING MATHEMATICS I. CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 PART-A ENGINEERING MATHEMATICS I CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 Total Hrs: 52 Exam Marks:100 PART-A Unit-I: DIFFERENTIAL CALCULUS - 1 Determination of n th derivative of standard functions-illustrative

More information

Function approximation

Function approximation Week 9: Monday, Mar 26 Function approximation A common task in scientific computing is to approximate a function. The approximated function might be available only through tabulated data, or it may be

More information

Contents. I Basic Methods 13

Contents. I Basic Methods 13 Preface xiii 1 Introduction 1 I Basic Methods 13 2 Convergent and Divergent Series 15 2.1 Introduction... 15 2.1.1 Power series: First steps... 15 2.1.2 Further practical aspects... 17 2.2 Differential

More information

Multiplication of Polynomials

Multiplication of Polynomials Summary 391 Chapter 5 SUMMARY Section 5.1 A polynomial in x is defined by a finite sum of terms of the form ax n, where a is a real number and n is a whole number. a is the coefficient of the term. n is

More information

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn Today s class Linear Algebraic Equations LU Decomposition 1 Linear Algebraic Equations Gaussian Elimination works well for solving linear systems of the form: AX = B What if you have to solve the linear

More information