BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017

Size: px
Start display at page:

Download "BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017"

Transcription

1 No. of Printed Pages : 8 MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, E- 27D ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS Time : 2 hours Maximum Marks : 50 (Weightage : 70%) Note : Answer any five questions. All computations may be done up to 3 decimal places. Use of calculators is not allowed. Symbols have their usual meanings. 1. (a) Perform two iterations of the Birge-Vietta method to find a root of the polynomial P(x) = 2x3 - x2 + 2x - 2 = 0. Take the initial approximation p c, = (b) Solve the system of equations x x x3 6 using LU factorisation method. Us eu11= u22 =u33 = 1. 5 MTE-10 1 P.T.O.

2 2. (a) Use Lagrange interpolation method to find the value of y, where x = 6, from the following table : 3 x y (b) Prove that : ,8 = (A + V) 2 (c) Solve the initial value problem y,_ y + 2x, y(1) = 2 y + 3x using third order classical Runge-Kutta method. Find y(1.2) taking h = (a) Determine the spacing h in a table of equally spaced values of the function f(x) = between 1 and 2, so that interpolation with a second degree polynomial in this table yields accuracy 5 x (b) Evaluate 2 X dx 1 x 2 + x + 1 using trapezoidal rule with 2 and 3 nodal points. Obtain the improved value using Romberg integration. 5 MTE-10 2

3 4. (a) The population of a town in the decennial census is given below. Estimate the population for the year 1915 : Year : x Population : y (in thousands) (b) Using three iterations of the inverse power method, find the eigenvalue nearest to 5.5, [1 5 of the matrix. Also, find the 2 4 corresponding eigenvectors. Assume the initial approximation to the eigenvector as v( ) = [ T. 5. (a) Perform two iterations of the Newton-Raphson method to obtain the approximate value ofṭ8. Assume the initial approximation to the root as 4. 4 (b) From the data x f(x) interpolate the value for f(3.2) using the Newton's backward difference formula. 6 MTE-10 3 P.T.O. F

4 6. (a) Find the solution of the system of equations 6x1 + 2x2 - x3 = 3 x1 + 3x2 + 2x3 = 3 x1-3x2 + 5x3 = 0 using three iterations of Gauss-Seidel method. Assume the initial approximation as x (o) 0.3, x ) = 0-6, x ( ) = 0-3. Find 2 3 the iteration matrix and hence, find the rate of convergence of the method. (b) Construct a fixed point iteration form x = g(x) for the equation x 3 + x2-1 = 0, so that the method converges in the interval 10, (a) Determine the constants a, 13, y in the differentiation formula y"(x0) = a y(x0 - h) + R y(x0) + y y(xo + h) so that the method is of the highest possible order. Find the order and the error term of the method (b) The iteration method xn+1 1 [5x 5N N2 + - n = 0, 1, 2,... 9 xn xn where N is a positive constant, converges to N1/3. Find the rate of convergence of the method. 4 MTE-10 4

5 chitisto4 -T4, 2017 trntig Li cr 9 04 : 1 1 ICI 71:r.tt -10 : 9t4 qui HAN : 2.1t 12 3TrEIWTA. 3 : 50 (Fff : 70%) 41? 47e- ev 517 -j drflef-47 / Fift arrtiw-e7 3 cwsirict F-2TRY rich uw-d- f cl,(-35c.?ej ht q 375T6- Tif 37E74 Hisifrq 3121ff / 1. () --N- r-d-r f4rt -4-Trq (IN) P(x) = 2x3 x2 + 2x 2 = 700 4rFq I 31TR t411c4 4.1 pc, = 0.5 #11-A7 (Pii),TH) faf x x2 4 qi0 W-fichtut -WM x3_ 6 EM Arr-4 I ull = u22 = u33 = 1 Mq 11 A117. I 5 MTE-10 5 P.T.O.

6 2. () ( R fart g RI i-11-iicirgi fftf-0-*1 y TIR Vc-I W-47, x = 6 t: 3 x y (IN) FITZ : 2 1 (A + V) = 2 (IT) ORE FIU rclfdd *4-111 fak A Y = y + 3x, y(1) = 2 3.T1t ITR 1=P11:41 -Q* A t* h = 0.2 c. ct-) y(1.2) Vci AtN7 I 5 3. () 1 2* 1:FO 1 f(x) = fr-dwf.) 3i-dT h 711c1 A177 -N1:114 TP- fez' 41c1T alca 3rq 5 x ff- ftwe tl \IR I 5 (1: f) 23 3 *TR Pie414 A 2 x dx itedch-1 W-A7 I 1 x 2 + x + 1 W-11chd-E Itl RIJII4-I TTIT I 5 MTE-10 6

7 4. (Ti) t zi-wseu *r -f1-415if4 Tf I ai 1915 : 4-44 : x \TH(4{Sel I : y (311t. 11) (t f) felt T1tI1 31T T 5.5* Pichdoil tiilh alr&4ffrqr ift ;Ho W4 3Tr04Titz* 37T tiro te.-1 = [ T cM -r d-ri 6 5. (T)k--e4-11:1TE4 fea TRifieit,is TfrqT 3Trif *rr--a-r al-r 4 HI-Ichk 4 ( -u) &go 31TT0 x f(x) - FO tv TT -5RTiTT TTT f(3.2) ITT 1TF *a -47R *t-r-4t I 6 MTE-10 7 P.T.O.

8 :11fai 1 tq. - ~ti~r~~~ fir 6x1 + 2x2 - x3 = 3 x 1 + 3x 2 + 2x 3 = 3 x1 3x2 + 5x3 = 0 fir.1wm. * I x (i. ) = 0.3, x( ) = x ( ) = r r ici a did atfirr-or Tim*'i -r--a-r I (t i) iv-fit:mu! x3 + X2 1 = 0 X = g(x) vcr ff % [0, 1] i 3Triwit-ff 4,1 7. () y"(x0) = a y(xso h) + y(x0) + y y(x,0 + h) R.K atw y X11 d*1-rqr aftr*--d-r Trnra I re. trq 311 ;11(1 *IF-4R I TTF1 14.N xn+1 1 5N N 2 9 5xn ± 2 5 x n x n n = 0, 1, 2, N 1/3 * rilTatd *th t, N.) tratt-it- t I MT -*t atnr:ruf 7 old I 4 MTE ,000

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS No. of Printed Pages : 11 MTE-10 L. BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS Time : 2 hours Maximum Marks : 50 (Weightage

More information

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, Time : 2 hours Maximum Marks : 50 (Weightage : 70%)

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, Time : 2 hours Maximum Marks : 50 (Weightage : 70%) 01287 No. of Printed Pages : 12 MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS Time : 2 hours Maximum Marks : 50

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

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

MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP)

MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP) CO No. of Printed Pages : 8 MTE-0 BACHELOR'S DEGREE PROGRAMME (BDP) CO Term-End Examination CV CD December, 0 ELECTIVE COURSE : MATHEMATICS MTE-0 : NUMERICAL ANALYSIS Time : hours Maximum Marks : 50 (Weightage

More information

ASSIGNMENT BOOKLET. Numerical Analysis (MTE-10) (Valid from 1 st July, 2011 to 31 st March, 2012)

ASSIGNMENT BOOKLET. Numerical Analysis (MTE-10) (Valid from 1 st July, 2011 to 31 st March, 2012) ASSIGNMENT BOOKLET MTE-0 Numerical Analysis (MTE-0) (Valid from st July, 0 to st March, 0) It is compulsory to submit the assignment before filling in the exam form. School of Sciences Indira Gandhi National

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

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA No. of Printed Pages : 8 MTE-021 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination 01-2. 0 6 June, 2016 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA Time : 2 hours Maximum Marks : 50 (Weightage

More information

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING No. of Printed Pages : 12 MTE-12 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 50 Weightage

More information

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination No. of Printed Pages : 12 MTE-03 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination 1,4* :ert June, 2015 ELECTIVE COURSE : MATHEMATICS MTE-03 : MATHEMATICAL METHODS Time : 2 hours Maximum Marks : 50

More information

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination. June, 2018 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination. June, 2018 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA No. of Printed Pages : 8 1MTE-021 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination 046OB June, 2018 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA Time : 2 hours Maximum Marks : 50 (Weightage

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

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

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

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

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-06 : ABSTRACT ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-06 : ABSTRACT ALGEBRA 072 A0.2 No. of Printed Pages : 8 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-06 : ABSTRACT ALGEBRA MTE-06 Time : 2 hours Maximum Marks : 50

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

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

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

MTE-04 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-04 : ELEMENTARY ALGEBRA

MTE-04 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-04 : ELEMENTARY ALGEBRA No. of Printed Pages : 15 MTE-04 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-04 : ELEMENTARY ALGEBRA Time : 11/2 hours Maximum Marks : 25 Instructions

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

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS No. of Printed Pages : 1 MTE-08 BACHELOR'S DEGREE PROGRAMME (BDP) DI -7E37 Term-End Examination December, 015 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS Time : hours Maximum Marks: 50

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

(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

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

No. of Printed Pages : 8

No. of Printed Pages : 8 No. of Printed Pages : 8 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination ---E - December, 2016 I MTE-08 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS - Time : 2 hours Maximum Marks

More information

AIMS Exercise Set # 1

AIMS Exercise Set # 1 AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest

More information

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017 No. of Printed Pages : 12 MTE-121 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 0 (Weightage

More information

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b) Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)

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

PHYSICS PHE-14 : MATHEMATICAL METHODS IN PHYSICS-III

PHYSICS PHE-14 : MATHEMATICAL METHODS IN PHYSICS-III 00 74 3 No. of Printed Pages : 8 I PHE-14 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2014 PHYSICS PHE-14 : MATHEMATICAL METHODS IN PHYSICS-III Time : 2 hours Maximum Marks : 50 Note : All

More information

No. of Printed Pages : 8

No. of Printed Pages : 8 No. of Printed Pages : 8 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2017 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA mte-02 Time : 2 hours Maximum Marks : 50 (Weightage

More information

~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..

~,. :'lr. H ~ j. l' , ...,~l. 0 ' ~ bl '!; 1'1. :<! f'~.., I,, r: t,... r':l G. t r,. 1'1 [<, . f' 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'.. ,, 'l t (.) :;,/.I I n ri' ' r l ' rt ( n :' (I : d! n t, :?rj I),.. fl.),. f!..,,., til, ID f-i... j I. 't' r' t II!:t () (l r El,, (fl lj J4 ([) f., () :. -,,.,.I :i l:'!, :I J.A.. t,.. p, - ' I I I

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

Mathematical Methods for Numerical Analysis and Optimization

Mathematical Methods for Numerical Analysis and Optimization Biyani's Think Tank Concept based notes Mathematical Methods for Numerical Analysis and Optimization (MCA) Varsha Gupta Poonam Fatehpuria M.Sc. (Maths) Lecturer Deptt. of Information Technology Biyani

More 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

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

NUMERICAL ANALYSIS PROBLEMS

NUMERICAL ANALYSIS PROBLEMS NUMERICAL ANALYSIS PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations Problem.

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

MASTER OF ARTS (ECONOMICS) Term-End Examination December, 2012 MECE-001 : ECONOMETRIC METHODS

MASTER OF ARTS (ECONOMICS) Term-End Examination December, 2012 MECE-001 : ECONOMETRIC METHODS No. of Printed Pages : 11 MECE-001 pr MASTER OF ARTS (ECONOMICS) Term-End Examination December, 2012 MECE-001 : ECONOMETRIC METHODS Time : 3 hours Maximum Marks : 100 Note : Answer any two questions from

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

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

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

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45 Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more

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

Fourth Order RK-Method

Fourth Order RK-Method Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)

More information

Suggested solutions, TMA4125 Calculus 4N

Suggested solutions, TMA4125 Calculus 4N Suggested solutions, TMA5 Calculus N Charles Curry May 9th 07. The graph of g(x) is displayed below. We have b n = = = 0 [ nπ = nπ ( x) nπx dx nπx dx cos nπx ] x nπx dx [ nπx x cos nπ ] ( cos nπ + cos

More information

MTH603 - Numerical Analysis Solved final Term Papers For Final Term Exam

MTH603 - Numerical Analysis Solved final Term Papers For Final Term Exam MTH603 - Numerical Analysis Solved final Term Papers For Final Term Exam Exact solution of 2/3 is not exists. The Jacobi s method is A method of solving a matrix equation on a matrix that has zeros along

More information

Examination paper for TMA4130 Matematikk 4N

Examination paper for TMA4130 Matematikk 4N Department of Mathematical Sciences Examination paper for TMA4130 Matematikk 4N Academic contact during examination: Morten Nome Phone: 90 84 97 83 Examination date: 13 December 2017 Examination time (from

More information

Numerical Methods for Ordinary Differential Equations

Numerical Methods for Ordinary Differential Equations Numerical Methods for Ordinary Differential Equations Answers of the exercises C Vuik, S van Veldhuizen and S van Loenhout 08 Delft University of Technology Faculty Electrical Engineering, Mathematics

More information

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2016

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2016 No. of Printed Pages : 8 I PHE-13 I BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2016 01 165 PHYSICS PHE-13 : PHYSICS OF SOLIDS Time : 2 hours Maximum Marks : 50 Note : Attempt all questions.

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

Chapter 4: Numerical Methods for Common Mathematical Problems

Chapter 4: Numerical Methods for Common Mathematical Problems 1 Capter 4: Numerical Metods for Common Matematical Problems Interpolation Problem: Suppose we ave data defined at a discrete set of points (x i, y i ), i = 0, 1,..., N. Often it is useful to ave a smoot

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

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

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 SCIENCE (B.Sc.) Term-End Examination June, B.Sc. EXAMINATION CHE-1 : ATOMS AND MOLECULES AND CHE-2 : INORGANIC CHEMISTRY

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination June, B.Sc. EXAMINATION CHE-1 : ATOMS AND MOLECULES AND CHE-2 : INORGANIC CHEMISTRY No. of Printed Pages : 15 00881 CHE-1 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination June, 2010 CHEMISTRY CHE-1 : ATOMS AND MOLECULES Time : 1 hour Maximum Marks : 25 B.Sc. EXAMINATION Instructions :

More information

Page No.1. MTH603-Numerical Analysis_ Muhammad Ishfaq

Page No.1. MTH603-Numerical Analysis_ Muhammad Ishfaq Page No.1 File Version v1.5.3 Update: (Dated: 3-May-011) This version of file contains: Content of the Course (Done) FAQ updated version.(these must be read once because some very basic definition and

More 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

L..4 BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY

L..4 BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY 1 1... L..4 No. of Printed Pages : 11 I MTE-04/MTE-05 BACHELOR'S DEGREE PROGRAMME MTE-04 : ELEMENTARY ALGEBRA Instructions : MTE-05 : ANALYTICAL GEOMETRY 1. Students registered for both MTE-04 & MTE-05

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

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

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

Fixed Points and Contractive Transformations. Ron Goldman Department of Computer Science Rice University

Fixed Points and Contractive Transformations. Ron Goldman Department of Computer Science Rice University Fixed Points and Contractive Transformations Ron Goldman Department of Computer Science Rice University Applications Computer Graphics Fractals Bezier and B-Spline Curves and Surfaces Root Finding Newton

More information

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination -June, 2012 MATHEMATICS MTE-3 : MATHEMATICAL METHODS

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination -June, 2012 MATHEMATICS MTE-3 : MATHEMATICAL METHODS No. of Printed Pages : MTE-3 co cp BACHELOR OF SCIENCE (B.Sc.) Term-End Examination -June, 202 MATHEMATICS MTE-3 : MATHEMATICAL METHODS Time : 2 hours Maximum Marks : 50 Note : Question no. 7 is compulsory.

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

, -,."-~,.,,.._..Numerical Analysis: Midterm Exam. SoL.,---~~-,

, -,.-~,.,,.._..Numerical Analysis: Midterm Exam. SoL.,---~~-, , -,."-,.,,.._..:. SoL.,----, StudentID: Name: JE7]7} 1li :?df- 15: 5:"T-{:l 37.}Cil}}7.] 7-1] {}-cr}a].2.. %:d- 1i:!-7-1] lia]}7.] '{,},c: 7clf- 7-1j{!-7]9l.Jl-if 7] 'o ).}- - Q. z!-?ir}o'j o'j @ g. 1.

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

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

KINGS COLLEGE OF ENGINEERING

KINGS COLLEGE OF ENGINEERING MA54 STATISTICS AND NUMERICAL METHODS KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR - / EVEN SEMESTER QUESTION BANK SUBJECT NAME: STATISTICS AND NUMERICAL METHODS YEAR/SEM: II/IV

More information

ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS No. of Printed Pages : 8 MTE-08 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS Time : 2 hours Maximum Marks : 50 (Weightage

More information

Examination paper for TMA4130 Matematikk 4N: SOLUTION

Examination paper for TMA4130 Matematikk 4N: SOLUTION Department of Mathematical Sciences Examination paper for TMA4 Matematikk 4N: SOLUTION Academic contact during examination: Morten Nome Phone: 9 84 97 8 Examination date: December 7 Examination time (from

More information

APPH 4200 Physics of Fluids

APPH 4200 Physics of Fluids APPH 42 Physics of Fluids Problem Solving and Vorticity (Ch. 5) 1.!! Quick Review 2.! Vorticity 3.! Kelvin s Theorem 4.! Examples 1 How to solve fluid problems? (Like those in textbook) Ç"Tt=l I $T1P#(

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

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

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

BACHELOR OP SCIENCE (B.Sc.) Term-End Examination June, 2018

BACHELOR OP SCIENCE (B.Sc.) Term-End Examination June, 2018 No. of Printed Pages : 8 I CHE-06 01006 BACHELOR OP SCIENCE (B.Sc.) Term-End Examination June, 2018 CHEMISTRY CHE-06 : ORGANIC REACTION MECHANISM Time : 2 hours Maximum Marks : 50 Note : Answer any five

More information

A L A BA M A L A W R E V IE W

A L A BA M A L A W R E V IE W A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N

More information

LECTURE 14 NUMERICAL INTEGRATION. Find

LECTURE 14 NUMERICAL INTEGRATION. Find LECTURE 14 NUMERCAL NTEGRATON Find b a fxdx or b a vx ux fx ydy dx Often integration is required. However te form of fx may be suc tat analytical integration would be very difficult or impossible. Use

More information

RESEARCH ARTICLE. Spectral Method for Solving The General Form Linear Fredholm Volterra Integro Differential Equations Based on Chebyshev Polynomials

RESEARCH ARTICLE. Spectral Method for Solving The General Form Linear Fredholm Volterra Integro Differential Equations Based on Chebyshev Polynomials Journal of Modern Methods in Numerical Mathematics ISSN: 29-477 online Vol, No, 2, c 2 Modern Science Publishers wwwm-sciencescom RESEARCH ARTICLE Spectral Method for Solving The General Form Linear Fredholm

More information

Scot Siegel, Planning and Building Services Director Leslie Hamilton, Senior Planner

Scot Siegel, Planning and Building Services Director Leslie Hamilton, Senior Planner T: :, v, UJET: #2 ( -) TE: 22, 2 EETI TE: 2, 2 2, 2, () f v ( ),. T f 2 vf f f, f ff q J, f f q v f f f v f f (). T q, f. T z f f ff q f.. f v ; Ex f : -. v,, v. I f - f f. I, v f. (, f,.) I,,, f v v f

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

9.9 L1N1F_JL 19bo. G)&) art9lej11 b&bo 51JY1511JEJ11141N0fM1NW15tIr1

9.9 L1N1F_JL 19bo. G)&) art9lej11 b&bo 51JY1511JEJ11141N0fM1NW15tIr1 thunyitmn tn1 zni f1117n.nllfmztri Lrs v wu 4 t t701 f 171/ ti 141 o&oiv,3 if 042 9.9 L1N1F_JL 19bo vitioluutul fly11.1.g)onoo b5 et Nn`15fiwnwiymri1 nrikl5fini1nvi Ltol : Aeniln,flvnu 6m,wiutrmntn15Y

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

Introduction to Numerical Analysis

Introduction to Numerical Analysis Introduction to Numerical Analysis S. Baskar and S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Powai, Mumbai 400 076. Introduction to Numerical Analysis Lecture Notes

More information

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018 Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start

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

STATISTICS AND NUMERICAL METHODS

STATISTICS AND NUMERICAL METHODS STATISTICS AND NUMERICAL METHODS Question IV November / December 2011 Part-A 1. The heights of college students in Chennai are normally distributed with standard deviation 6 cm and sample of 100 students

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

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

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

Lecture 10 Polynomial interpolation

Lecture 10 Polynomial interpolation Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn

More information

Applied Differential Equation. November 30, 2012

Applied Differential Equation. November 30, 2012 Applied Differential Equation November 3, Contents 5 System of First Order Linear Equations 5 Introduction and Review of matrices 5 Systems of Linear Algebraic Equations, Linear Independence, Eigenvalues,

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

No. of Printed Pages : 7 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2013 PHYSICS

No. of Printed Pages : 7 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2013 PHYSICS No. of Printed Pages : 7 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2013 PHYSICS PHE-09 PHE-09 : OPTICS Time : 2 hours Maximum Marks : 50 Note : All questions are compulsory but there are

More information