MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP)
|
|
- Lee Craig
- 5 years ago
- Views:
Transcription
1 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 70%) Note : Answer any five questions. All computations may be done upto decimal places. Use of calculator is not allowed.. (a) Obtain the 8th Taylor series expansion of the (c) function f (x) = sin x in [-77, 7/] about x0 = 0. Obtain a bound for the error R9 (x). (b) Find the approximate root of the equation x x += 0 upto three decimal places using Newton Raphson's method, starting with x0 = Y. If f (x) = e', show that On f(x), (eah -on ex.. (a) Find the inverse of the matrix _ - using Gauss Jordan method. MTE-0 P.T.O.
2 dy y x (b) Solve -- dx y+x / with y(0) = using Euler's method in the interval [0, 0.0] by dividing the interval into sub intervals. (c) Obtain the Newton's Backward difference polynomial for the following data : x f(x) Also calculate the value of f (0.5).. (a) Determine the constants a, b, c and d such 6 that the interpolating polynomial y, = y(xo+sh) = ayo +byi +h (cyi; +di; ) becomes correct to the highest possible order. (b) Using fourth order classical Runge-kutta method solve y' = xy for x =., y () = and h = 0... (a) The iteration method [ 5N N xn+i = 5xn +, n = 0,,, 9 x X n n where N is a positive constant, converges to N IA. Find the rate of convergence of the method. (b) Perform four iteration of the power method 6 to find the largest Eigen value in magnitude for the matrix Take the initial approximate Eigen vector as [,, ]T. MTE-0
3 5. (a) Solve the system of equations xi. x + x = x + x + x.--.x + 5x x = 7 by Gauss - elimination with partial pivoting. (b) The velocity of a vehicle beginning from rest is given in the following table for part of the first hour. Using Simpson's rule, find the 6 distance travelled by the vehicle in this hour. t = time in minutes V = velocity km/hr (a) From the following table, find the number of students who obtained less than 55 marks, using interpolation. Marks No. of Students MTE-0 P.T.O.
4 MTE-0 (b) Using Gerschgorin bounds, find the 5 estimates of the Eigen values of the matrix Draw a rough sketch of the bounds.. 7. (a) Find the interval of unit length which 6 contains the smallest positive root of the equation x x 0=0. Using the midpoint of this interval as initial approximation, perform two iterations of the Birge-Vieta method. (b) Determine a unique polynomial f (x) of degree 5 such that f(x0) =, f ' (x 0) =, f (x) =, f (x) =, where x xo = h.
5 7-0 tmi I ci et) ZEITFai ch I tich H :A- IT i st) 0 : + Laid 7.t.-0 : ti.tv-0-ich reik)c; u TP,P7 : Efor 7filWUPT iw : 50 (c 70%) TeiTe (95 a-dz. P.9,- 7-firq- (t7 V/Hcfq 70)(di*- TOT ar-jrnw. (a) - -dtm [-7, '/] f (x) = sin x T x = 0 TfSST Zrltfo'ft '7 -tfq-r d R9 (x) wfar I (b) xo= - -9.t wrk c ul x-x+=0 Wft da,.c I -;iche (c) f (x) = eax cktfitrf" An f(x) = (eah )n eax.. (a) +lid--, fqfq T& T - Via WW AR I MTE-0 5 P. T.O.
6 (b) -d-tt [0, 0.0] itzr d-t FaRT gitt dx y+x ' f-d7r y (0) = WE Srlqi Wir-- "R cfatd-tro -Nil-Cm. --r--a-7i (c) FrN t-iq*ck ATcrq qlc x f(x) f (0.5) tf Tfri Trita. (a) --7 a, b, c d i TIT9-0 fql:r ict) 6 f-d--vri ys = y(xo+sh) ay0 +)Yi + (cio±dy; fqw9 wl-rz f-c"r "Tr77Z t I (b) h = 0. -*-7 qi 'WE Rmircirtdd -NDT grt yi = xy, y() = ti x =. t -5q "A"F- 7 I. (a) TiTTIth. -NftT : 5N N Xn+ = 9 -an + 5, 0,,, xn xn ziw\i kj,* 'ER -97 t, NIA - 7*u t I *ki -Nfq ct;) aifirt{t 70 MTE-0 6
7 (b) rcirtt iltuqrrigt t7t _ 7-ffq qc TI 7ich dd TrtfiTW atr7rititvr [,,T. 5. (a) TMT ckcfrl Trfq TTTf rqc-. reirq t7t f- fifty -{TITTu-r fttzi T-t.f 6 xi x + x = x + x + x = x + 5x x =7. (b) fdl5t7t-t t-{ tt ATT t F- irciriad dirri) kir Trzfr #-:(zrff -wr f97- cit sft i grr ffzr Trt quo ----Ri t = frrit v =i fw.t/ea MTE-0 7 P.T.O.
8 MTE (a) -.--d-79. TfMt 55 aft c 5 -grqi -0T5t T f-.. -ur5 - -ibqi (b) q I TTft -g-7 TT& t 5 7THITT9- TTTF--dttr--7 lq-w H clcq7-0-7 rk- Tft9 7. (a) (b) Teb ch -WM.c -i - 0u X x--0=0 7q chl taf-5z -W7 t I 7 at-d-{-r---grr f-s rnl -Trfq Irr9 W-f7-eT rolr c) t T-IlcirTicr car-7 I 5 T c atttizr f (x) oct 'Of-R 6 f7tia. f R f(x0 ) =, f '(x0) = f (xi) =, f ' (x) =, t zi$ x xo = h.,
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 informationBACHELOR 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 informationASSIGNMENT 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 informationBACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017
No. of Printed Pages : 8 MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017 1 E- 27D ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS Time : 2 hours Maximum Marks : 50 (Weightage
More informationBACHELOR'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 informationSchool 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 informationName 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 informationM.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 informationUnit 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 informationKINGS 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 informationSOLUTION 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 informationChapter 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 informationNumerical 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 informationUSHA 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 informationNumerical 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 informationFourth 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 informationTHE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF PHYSICS PHYS2020 COMPUTATIONAL PHYSICS FINAL EXAM SESSION I Answer all questions
THE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF PHYSICS PHYS2020 COMPUTATIONAL PHYSICS FINAL EXAM SESSION I 2007 Answer all questions Time allowed =2 hours Total number of questions =5 Marks =40 The questions
More informationVirtual University of Pakistan
Virtual University of Pakistan File Version v.0.0 Prepared For: Final Term Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format, you can check Bookmarks menu Disclaimer:
More informationBACHELOR'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 informationDo 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 informationSubbalakshmi 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 informationNumerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point
Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error In this method we assume initial value of x, and substitute in the equation. Then modify x and continue till we
More informationNumerical 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 informationDifferential 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 informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationINSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad MECHANICAL ENGINEERING TUTORIAL QUESTION BANK
Course Name Course Code Class Branch INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 Mathematics-II A30006 II-I B. Tech Freshman Engineering Year 016 017 Course Faculty MECHANICAL ENGINEERING
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
1 P a g e INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 04 Name : Mathematics-II Code : A0006 Class : II B. Tech I Semester Branch : CIVIL Year : 016 017 FRESHMAN ENGINEERING
More informationMathematical 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 informationSTATISTICS 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 informationKINGS 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 informationNo. 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 informationBACHELOR'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 informationx 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 informationPrevious 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 informationTutorial 1, B. Tech. Sem III, 24 July, (Root Findings and Linear System of Equations)
Tutorial, B. Tech. Sem III, 24 July, 206 (Root Findings and Linear System of Equations). Find the root of the equation e x = 3x lying in [0,] correct to three decimal places using Bisection, Regula-Falsi
More informationECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations
ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent
More informationBACHELOR'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 informationBACHELOR'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 informationBACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015
No. of Printed Pages : 8 I MTE-13 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 ELECTIVE COURSE : MATHEMATICS MTE-13 : DISCRETE MATHEMATICS Time : 2 hours Maximum Marks : 50 (Weightage
More informationBACHELOR'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 informationComputational 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 informationNumerical 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 informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationELECTIVE 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 informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationMath 175 Common Exam 2A Spring 2018
Math 175 Common Exam 2A Spring 2018 Part I: Short Form The first seven (7) pages are short answer. You don t need to show work. Partial credit will be rare and small. 1. (8 points) Suppose f(x) is a function
More informationMTE-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 informationNUMERICAL 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 informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-71309 email: anita.buie@gmail.com 1 . Chapter 8 Numerical Solution of
More informationMATHEMATICAL 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 informationBACHELOR'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 informationPARTIAL 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 informationExact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
More informationHence 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 informationSRI 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 informationWorksheet 9. Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.
ATH 57H Spring 0 Worksheet 9 Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.. Let f(x) = +x. Find f (00) (0) - the 00th derivative of f at point x = 0.
More informationModule Two: Differential Calculus(continued) synopsis of results and problems (student copy)
Module Two: Differential Calculus(continued) synopsis of results and problems (student copy) Srikanth K S 1 Syllabus Taylor s and Maclaurin s theorems for function of one variable(statement only)- problems.
More informationASSIGNMENT BOOKLET. M.Sc. (Mathematics with Applications in Computer Science) Differential Equations and Numerical Solutions (MMT-007)
ASSIGNMENT BOOKLET MMT-007 M.Sc. (Mathematics with Applications in Computer Science) Differential Equations and Numerical Solutions (MMT-007) School of Sciences Indira Gandhi National Open University Maidan
More informationSRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY, COIMBATORE- 10 DEPARTMENT OF SCIENCE AND HUMANITIES B.E - EEE & CIVIL UNIT I
SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY, COIMBATORE- 10 DEPARTMENT OF SCIENCE AND HUMANITIES B.E - EEE & CIVIL SUBJECT: NUMERICAL METHODS ( SEMESTER VI ) UNIT I SOLUTIONS OF EQUATIONS AND EIGEN VALUE PROBLEMS
More informationSYSTEMS OF ODES. mg sin ( (x)) dx 2 =
SYSTEMS OF ODES Consider the pendulum shown below. Assume the rod is of neglible mass, that the pendulum is of mass m, and that the rod is of length `. Assume the pendulum moves in the plane shown, and
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationSECTION A. f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes.
SECTION A 1. State the maximal domain and range of the function f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes. 2. By evaluating f(0),
More informationSection 4.3 Vector Fields
Section 4.3 Vector Fields DEFINITION: A vector field in R n is a map F : A R n R n that assigns to each point x in its domain A a vector F(x). If n = 2, F is called a vector field in the plane, and if
More informationMath 216 Final Exam 14 December, 2012
Math 216 Final Exam 14 December, 2012 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 21 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University 1 All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationExam 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 informationThe iteration formula for to find the root of the equation
SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY, COIMBATORE- 10 DEPARTMENT OF SCIENCE AND HUMANITIES SUBJECT: NUMERICAL METHODS & LINEAR PROGRAMMING UNIT II SOLUTIONS OF EQUATION 1. If is continuous in then under
More informationTABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1. Chapter Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9
TABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1 Chapter 01.01 Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9 Chapter 01.02 Measuring errors 11 True error 11 Relative
More informationNo. 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 informationReview. 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 informationODE Runge-Kutta methods
ODE Runge-Kutta methods The theory (very short excerpts from lectures) First-order initial value problem We want to approximate the solution Y(x) of a system of first-order ordinary differential equations
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationDo 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 MTHE712B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationNumerical Methods. Scientists. Engineers
Third Edition Numerical Methods for Scientists and Engineers K. Sankara Rao Numerical Methods for Scientists and Engineers Numerical Methods for Scientists and Engineers Third Edition K. SANKARA RAO Formerly,
More informationENGINEERING 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 informationPage 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 informationSBAME 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 informationExam 3 MATH Calculus I
Trinity College December 03, 2015 MATH 131-01 Calculus I By signing below, you attest that you have neither given nor received help of any kind on this exam. Signature: Printed Name: Instructions: Show
More informationChap. 20: Initial-Value Problems
Chap. 20: Initial-Value Problems Ordinary Differential Equations Goal: to solve differential equations of the form: dy dt f t, y The methods in this chapter are all one-step methods and have the general
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationPRE-LEAVING CERTIFICATE EXAMINATION, 2010
L.7 PRE-LEAVING CERTIFICATE EXAMINATION, 00 MATHEMATICS HIGHER LEVEL PAPER (300 marks) TIME : ½ HOURS Attempt SIX QUESTIONS (50 marks each). WARNING: Marks will be lost if all necessary work is not clearly
More informationPaper Reference. Further Pure Mathematics FP1 Advanced/Advanced Subsidiary. Friday 26 January 2007 Afternoon Time: 1 hour 30 minutes
Centre No. Candidate No. Paper Reference(s) 6674/01 Edexcel GCE Further Pure Mathematics FP1 Advanced/Advanced Subsidiary Friday 6 January 007 Afternoon Time: 1 hour 30 minutes Materials required for examination
More information5. 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 informationBACHELOR'S DEGREE PROGRAMME
No. of Printed Pages : 11 MTE-12 BACHELOR'S DEGREE PROGRAMME Term-End Examination C 3 ti June, 2012 0 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING Time : 2 hours Maximum Marks : 50 Note :
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More information8.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 informationAIMS 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 informationNo. of Printed Pages : 12 MTE-11 BACHELOR'S DEGREE PROGRAMME
No. of Printed Pages : 12 MTE-11 BACHELOR'S DEGREE PROGRAMME Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-11 : PROBABILITY AND STATISTICS Time : 2 hours Maximum Marks : 50 Weightage
More informationB.Tech. Theory Examination (Semester IV) Engineering Mathematics III
Solved Question Paper 5-6 B.Tech. Theory Eamination (Semester IV) 5-6 Engineering Mathematics III Time : hours] [Maimum Marks : Section-A. Attempt all questions of this section. Each question carry equal
More informationIntroductory Numerical Analysis
Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection
More informationBEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations
BEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations Ser Lee Loh a, Wei Sen Loi a a Fakulti Kejuruteraan Elektrik Universiti Teknikal Malaysia Melaka Lesson Outcome Upon completion of this lesson,
More informationIntroduction 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 informationMultistage Methods I: Runge-Kutta Methods
Multistage Methods I: Runge-Kutta Methods Varun Shankar January, 0 Introduction Previously, we saw that explicit multistep methods (AB methods) have shrinking stability regions as their orders are increased.
More informationSOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD
BISECTION METHOD If a function f(x) is continuous between a and b, and f(a) and f(b) are of opposite signs, then there exists at least one root between a and b. It is shown graphically as, Let f a be negative
More informationChapter 11 ORDINARY DIFFERENTIAL EQUATIONS
Chapter 11 ORDINARY DIFFERENTIAL EQUATIONS The general form of a first order differential equations is = f(x, y) with initial condition y(a) = y a We seek the solution y = y(x) for x > a This is shown
More informationphysicsandmathstutor.com Paper Reference Core Mathematics C3 Advanced Level Monday 23 January 2006 Afternoon Time: 1 hour 30 minutes
Centre No. Candidate No. Paper Reference(s) 6665/01 Edexcel GCE Core Mathematics C3 Advanced Level Monday 23 January 2006 Afternoon Time: 1 hour 30 minutes Materials required for examination Mathematical
More informationPaper Reference. Paper Reference(s) 6665/01 Edexcel GCE Core Mathematics C3 Advanced Level. Monday 12 June 2006 Afternoon Time: 1 hour 30 minutes
Centre No. Candidate No. Paper Reference(s) 6665/01 Edexcel GCE Core Mathematics C3 Advanced Level Monday 12 June 2006 Afternoon Time: 1 hour 30 minutes Materials required for examination Mathematical
More informationEdexcel 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 informationExamination 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 informationCHAPTER 7. An Introduction to Numerical Methods for. Linear and Nonlinear ODE s
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 1 A COLLECTION OF HANDOUTS ON FIRST ORDER ORDINARY DIFFERENTIAL
More information