Previous Year Questions & Detailed Solutions
|
|
- Moses Terry
- 5 years ago
- Views:
Transcription
1 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 of Simpsons rd rule, theinterval h for closer approximation should be ) small ) odd and large ) large 4) even and small. Which of the following is a step by step method? ) Taylor s method ) Picards method ) Adams Bashforth method 4) Eulers method 4. The interpolation polynomial from the data x f(x) ) x x + 5 ) x + x +5 ) x x + 5 4) x 5x +5 a+h a 5. The value of the integration f x is approximately equal to ) h [f(a)+f(a+h)+f(a+h)] ) h [f(a)+4f(a+h)+f(a+h)] ) h [f(a)+f(a+h)+f(a+h)] 4) h [f(a)+4f(a+h)+f(a+h)] 6. The finite difference approximation for d y at x = x is ) h (y(x -h)-y(x )+y(x +h)] ) h [y(x -h)+y(x )+y(x +h)] ) h [y(x -h)-y(x )+y(x +h)] 4) h [y(x -h)+y(x )+y(x +h) 7. For the following data X 4 6 Y - 7 the straight line y=mx+c by the method of least square is ) y=-x-l ) y=x-l ) y=l-x 4) y=x-l 8. The velocity v (km/min) of a train which starts from rest, is given at fixed intervals of time t(min) as follows: t v The approximate distance covered by Simpson's rule is ) 6. ) 9. ). 4) Find the cubic polynomial by Newton s forward difference which takes the following: X f(x) then f(4) is ) 4 ) 4 ) 9 4) 4. The first derivative dy at x= for the given data X f(x) 5
2 ) ) - ) - 4). Error in Simpson s rule is of the order ) h ) h ) h 4 4) h. If α, β and γ are the roots of x + px + qx+ =, then the equation whose roots are,, is α β γ ) x + qx px l= ) x +qx -px+= ) x -qx +px-l = 4) x - qx +px+l=. In Jacobi s iteration method to get the (r+ ) th iterates, we use the ) values of the r th iterates ) values of the (r -) th iterates ) values of the (r+ ) th iterates 4) latest available values 4. If h is the length of the intervals, then the error in the trapezoidal rule is of order ) h ) h ) h 4) h 4 5. If E is the translation operator, then the central difference operator δ is ) E / + E -/ ) E / - E -/ ) (E/ + E -/ ) 4) - (E/ + E -/ ) 6. If Δf(x) = f(x + h)-f(x), E f(x) =f(x + h) and δf(x)= x + h f x h then Δ is ) δ ) δ ) δ / 4 δ / + δ- / 7. Expression for backward interpolation d y x= using Newton s ) h f n + f n + 4 f n + ) h Δ Δ 4 f n ) h Δ + Δ + Δ 4 + f n 4) h Δ Δ Δ4 f n 8. By Taylor s series method solution of y'=x + y ; y() = is ) y=l+x x ) y = -x+x ) y=x+ x +x 4) y=l+x+x + 4 x 9. Error in the Trapezoidal rule is of the order ) -h ) h ) h 4 4) h. A river is 8 ft wide, the depth d in feet at a distance x ft. from one bank is given by the following table: x y Approximately the area of cross section by Simpson s / rule is ) 7 sq.ft. ) 68 sq.ft. ) 7 sq.ft. 4) 6 sq.ft.. The first derivative dy at x= 4 for the data. X 4 f(x) ) -4 ) 4 ) 6 4) 6. If x and x are two points, f(x ) and f(x ) are of opposite signs, then the root x by regular falsi method is equal to ) x f x x f x f x f x ) x f x x f x f x f x ) x f x x f x f x f x 4) x f x x f x f x f x. The Newton-Raphson iteration scheme to find an approximate real root of the equationf(x) = is ) + = + f ) + = - f
3 ) + = + f 4) + = - f 4. Power method is used to find ) all eigen values only ) all eigen vectors only ) all eigen values and eigen vectors 4) numerically largest eigen value and the corresponding eigen vector 5. Lagrangean interpolation polynomial which passes through the points (, ), (, ), (, ) is ) x + l ) x - ) x +l 4) x - 6. d y is approximately equal to ) y i+ y i h ) y i++ y i h ) y i y i +y i+ 4) y i +y i +y i+ h h 7. The scheme a+h a f(x) = h [f(a) + 4f(a + h)+f(a + h) is called ) Trapezoidal rule ) Simpson s / rule ) Simpson s /8 rule 4) Weddle s rule 8. The Lagrange s interpolation polynomial curve passing through the points (, ) (, ) and (, ) is ) x -x+l ) -4x + x + ) x x + 4) x x + 9. Which of the following formulas is a particular case of Runge-Kutta formula of second order? ) Taylar series formula ) Picard s formula ) Euler s modified formula 4) Milne s predictor formula. What is the highest degree of a polynomial whose definite integration using Simpson s rule gives the exact value? ) ) ) 4) 4. The global error arising in using Runge - Kutta method of fourth order to solve an ordinary differential equation is of ) (h ) ) (h ) ) (h 4 ) 4) (h 5 ). Simpson s one-thid rule integration is exact for all polynomial of degree not exceeding ) ) ) 4 4) 5. With usual notations, the value of (+Δ) (- ) is ) ) ) 4) 4 4. The modified Newton-Raphson formula of finding the root of the equation f(x)= is ) + = f ) + = ) + = f 4) + = + 5. The value of f fn f f f f +x Trapezoidal rule with h =. is ).687 ).877 ).77 4) Simpson s one-third rule of integration is exact for all polynomial of degree not exceeding ) ) ) 4 4) 5
4 7. Which of the following formula is a particular case of Runge - Kutta formula of the second order? ) Taylor series formula ) Picard s formula ) Euler s modified formula 4) Milne s predictor formula 8. The Newton Raphson method of finding the root of the equation f(x)= is by using the formula ) + = f ) + = f ) + = + f 4) + = + f 9. The value of +x by Trapezoidal Ruletaking n= is ).645 ).64 ).58 4).6 4. Trapezoidal rule for the evaluation of the integral b a f x requires the Interval to be divided into ) only an even number of intervals ) only an odd number of intervals ) any number of intervals 4) a minimum of ten intervals.6 4. If f(x) - k[f() + 4f(.)+f(.6)] then thevalue of k when Simpson s rule is applied is ). ). ). 4).4 4. The Newton - Raphson formula to find an approximate value of a is ) + = + a ) + = a 4 ) + = + a 4) + = a 4. The iteration formula given by Newton- Raphson method to find to root of the equation x sin x+cos x= is )+ = sin +cos cos )+ = cos sin +cos )+ = sin +cos cos +sin 4)+ = cos + sin 44. The interpolating polynomial for the data x - f -5 ) + x x ) + x + x ) + x x 4) x + x + x 45. Given that f(l) = l, f(.5) =.875, f() = 7, f(.5) = 4.5 and f() = 5, the value of f(x) obtained by Simpson s rule is ) 7.5 ) 8.5 ) 8. 4) A root of x - 4x -9 = using bisection method in two stages is ).75 ).56 ) ) The lagrange s interpolation polynomial curve passing through the points (, ) (, ) and (, ) is ) x - x + ) -4x + x + ) x -x + 4) x x+ 48. What is the highest degree polynomial whose definite integration using Simpson s rule gives the exact value? ) ) ) 4) 4
5 49. Milne s predictor value of y(, 4) given thaty'= y- x y, y() = y'(.)=.9. y'(.) =.8, y'(.) =.7 is ) 5 ) 6 5 ) 5 4) The recurrence formula for finding the reciprocal of the n th root of M, by Newton's method is ) x k+ = n x k n +M nx k n ) x k+ = k n+ Mx k n ) x k+ = k n + Mx k 4) x k+ = n n x k + Mx k 5. The value of ( + x ) by simpson s one-third rule with two strips is ) 6 ) 4 ) 47 4) Which of the following formulas is a particular case of Runge - Kutta formula of second order? ) Taylor series formula ) Picard's formula ) Euler s modified formula 4) Milne's predictor formula DETAILED SOLUTIONS. () The rate of convergence of Gauss - Seidel method is roughly twice that of Gauss - Jacobi.. (4) In application of Simpsons rd rule, the intervalh for closer approximation should be even and small.. (4) 5 Euler s method is a step by step method. 4. () Consider f(x) = x -x+5 then f() = -()+5 = 5 f(l) = l -(l)+5 = 4 f() = -()+5 = 8 f(x) = x -x+5 is the requiredpolynomial. 5. () 6. () a+h a f(x) = h [f(a) + 4f(a + h) + f(a + h)] d y (x = x ) = f f +f h h [y(x h) -y (x ) + y (x + h)] 7. (4) x 4 6 y -l 7 Consider y = x-l x = y = ()- = - x = y=()-l = x = 4 y=(4)-l = 7 x = 6 y= (6)- = y=x-l is the required straight line. 8. (*) y = h [(y +y n ) + 4 (y +y +...+y n )+ (y +y 4 + y n- )] = [(+)+4(8+9++5)+(5+ + +)] = 9 9. () f(x) = y + pδf x + p p Δ f(x ) + p p (p )! where p = x x h Δf x = Δ f(x ) = - Δ f(x )!
6 Δ f(x ) = p = x f(x) = + x + x(x ) (-)! x x x () +! = + x x (x - )+x(x-) (x-) f(4) = = = 4. () x f(x) Δy Δ y Δ y - Δy Δ y Δ y α, β, γ are root ofx + px + qx + = x + px +qx+,, are roots of α β γ + p + q x x x + = x + qx + px + =,, are roots of α β γ x - qx +px-l =. () For the system of equations a x + b y + c z = d a x + b y+c z = d a x +b y+c z = d Then the (r+ ) th iteration in Jacobi s method is x r+ = a d b y r c z r y r+ = b z r+ = c d a x r c z r d a x r b y r 5 First derivative by Newton s forward difference formula y = h Δy Δ y + Δ y = + () = --=-. () Error in Simpson s rule is of order h4. () Results: Let a, a,..., a n be the roots of the equation +p - + p p n = than the roots of -p - +p (-) n P n = are a, -a,... -a n Given 6 To find (r+) th iteration we use r iterations. 4. () Error in the trapezoidal rule is of the order h. 5. () δ f(x) = (E / E -/ ) f(x) 6. () δ = E ½ - E -/ e Δ = E ; Δ = E - where E = f(x+h) E - = f(x-h) E / = f(x+ h/); E -/ = f(x - h/) Δ = (E - ) (- E - ) = E + E - = E + E () dδ = (E / E -/ ) = E-E / E -/ + E - = E - + E -...()
7 () = () Δ = δ 7. (4) Standard formula d y x= h Δ Δ + Δ4 f n 8. (4) Taylor s series y = y + h! y + h! y + h! y +... Given y() = y = ; x = y' = x + y (Given) y '= + = y'' = x+ yy' y " = ()+.. = y'" = + (yy'' + (y')) = + (. + ) = +( + l) = 8 putting h - x then y = + x! + x! + x! 8 = l + x + x + 4 x 9. (4)Error in thetrapezoidal rule is of the order h.. () Simpson s rule x = +nh f x x = h y + 4 y + y + + y + y 4 + +yn = h [y +y n +4(sum of odd ordinates) +sum of even ordinates)] Cross Section Area 7 = [(++4( )+(7++4)] = [+44+66] = 7 sq.ft.. () x y=f(x) First difference Second difference - Third difference - 4 Fourth difference y = ; y = y = 4 y = = Newtons formula for Backward difference f'(x) = h [ y + y + y...] = + = 4. () By regular - falsi method the root is given by x f x x f(x ) f(x ) f(x ). () The Newton - Rapson Iteration scheme to find an approximate real root of the equation f(x)= is
8 + = f( ) 4. (4) Power method is used to determine numerically largest eigen value and the corresponding eigen vector of a matrix A. 5. () Let x = ; y = x = ; y = x = ; y = x x y = x x y x x (x x ) + x x (x x ) y x x (x x ) + = + 6. () x x (x x ) y x x (x x ) x (x )_ x (x ) + x 4x + x (x ) = x 4x+ x +9x+5x 5x = x + = x + + x x + 5x 5x d y = h y i + r + y i + = h y approximately = y h i+ y i = y h i+ y i+ (y i+ y i ) = y h i+ y i+ + y i which is also equal to d y = y h i+ y i + yi 7. () 8. () a+h a is called f(x) = h [f(a) + 4f(a + h) + f(a + h)] Simpson s rule. 8 Since only values of x are given. Assume y = f(x) = a + a x+a x(x-l) put x=, y= = a +a ()+a () a = put x -, y= = a + a +a () = a + a = l+ a a=- put x=, y= = a + a +6a f(x) = l x+x(x-l) = l x+ x -x = x -x+ 9. () Paricular case of R.K. formula of second order is Euler s modified formula.. () Simpson s one-third rule is x +nh x y = h y + y n + 4 y + y + y n + y + y 4 + y n In this case we reglect all differences above the second. So y will be a polynomial of second degree only, i.e., y = ax +bx+c. () The error in R.K. method of fourth order to solve an ordinary differential equation is of (h 4 ).. () Required degree =. () Formula ( + Δ) (- ) =
9 4. () Newton Rapson formula 5. (4) X + = f y = + x y..965 y.4.86 y.6.75 y y 4.5 y 5 By Trapezoidal Rule, + x = h [(y + y 5 ) + (y + y + y + y 4 )] =. [.5+(.687)] = () Simpsons rule of Integration is exact for allpolynomial of degree not exceeding. 7. () Particular case of Runge Kutta formula of second order is Euler s modified formula. 8. () Newton Raphson formula of finding the root of f(x)= is + = - f 9. () 9 h = = x = y = +x + x y - =.5 + x y -. + By Trapezoidal rule = +x = h y + y + y [ + (.5)+.] = () Any number of intervals. 4. () h = interval length =. By Simpsons rule k = h =. =. 4. () Let x = a x -a = Let f(x) = x -a thenf'(x) = x + = - f = - a = +a = + a 4. () Newton Raphson Method + = - f f(x) = x sin x+ cos x
10 f'(x) = x cosx+sin x-sinx = x cos x By Newton Raphson method + = - sin +cos cos 44. () Since only 4 values of x are given assume f(x) to be a polynomial of degree Let f(x) = a + a x + a x (x-) + a x (x-) (x-) put x = -, f(x) = = a a + a 6a... () x = then f(x) = = a + a +a +a a =... () put x = then f(x) = l = a + a a i =... () put x = then -5 = a + a + a l++ a = -5 a = -6 a = -... (4) put the values of a, a, a in () l 6-6a = 6a = -6 a = - f(x) = + x + (-) x (x-) + x(x-) (x-) = - x + x x (x - x +) = - x + x - x + x - x = +x-x f(x) = +x-x 45. () x = ; y = x =.5 ; y =.875 x = ; y = 7 x =.4 ; y = 4.5 x 4 = ; y 4 = 5 Simpson s formula = h [y +y n +4(y +y +...)+(y +y )] =.5 [+5+4( )+(7)] = () If a function f(x) is continuous between a and b and f(a) and f(b) are of opposite sign then there exists atleast one root between a and b. f(x) = x - 4x -9 f() = = -9 = -ve f() = 7-9 = 6 = +ve Hence, the root lies between and By first approximation x = + =.5 Again f(.5) = = -ve Hence, the root lies between.5 and Second approximation.5 + = () Since only values of x are given assume f(x) be a polynomial of degree Let f(x) = a + a x+ a x (x-l) when x= f(x) = = a + a +a a = when x=l ; f(x) = = a + a a = - when x=, f(x)= = a + a +6a a = Nowf(x) = l x+x(x-l) = l x+ x -x = x -x+ Required polynomial
11 = x -x+ 48. () Required degree = 49. () y n+,p = y n- + 4h put n = y 4,p = y + 4h [y - y +y ] y n y n + y n = + 4 (.) ( ) = +.4 ( ) = +.4 (.4) = +.. = () n x = M = M Let f(x) = M f (x) = n- By Newtons formula = x k x k n M nx k n x k+ = x k f x k f x k = nx k x k n xk n +M nx k n = x k n n +M nx k n 5. (4) h=/ X y = +x 4 5 +x = = 6 = h y + y + 4y +5+ = 6 47 = () Euler s modified formula is the particular case of Runge - Kutta formula. English Examsdaily Join Us on FB : Tamil Examsdaily Tamil Whatsapp Group English - Click Here Tamil - Click Here
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationUNIT II SOLUTION OF NON-LINEAR AND SIMULTANEOUS LINEAR EQUATION
UNIT II SOLUTION OF NON-LINEAR AND SIMULTANEOUS LINEAR EQUATION. If g x is continuous in a, b, then under what condition the iterative method x = g x has a unique solution in a, b? g x < in a, b. State
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 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 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 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 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 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 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 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 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 informationNumerical methods. Examples with solution
Numerical methods Examples with solution CONTENTS Contents. Nonlinear Equations 3 The bisection method............................ 4 Newton s method.............................. 8. Linear Systems LU-factorization..............................
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 informationEngg. 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 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 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 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 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 informationMTH603 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 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 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 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 informationPreface. 2 Linear Equations and Eigenvalue Problem 22
Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits
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 informationProgram : M.A./M.Sc. (Mathematics) M.A./M.Sc. (Final) Paper Code:MT-08 Numerical Analysis Section A (Very Short Answers Questions)
Program : M../M.Sc. (Mathematics) M../M.Sc. (Final) Paper Code:MT-08 Numerical nalysis Section (Very Short nswers Questions) 1. Write two examples of transcendental equations. (i) x 3 + sin x = 0 (ii)
More informationV.S.B. ENGINEERING COLLEGE, KARUR. Department of Electrical and Electronics Engineering
V.S.B. ENGINEERING COLLEGE, KARUR Department of Electrical and Electronics Engineering II YEAR/IV SEMESTER MARKS & 6 MARKS QUESTION BANK S.NO SUBJECT SUBJECT NAME PAGE NO. CODE MA6459 Numerical Methods
More informationSolution 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 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 informationFundamental 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 informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
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 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 informationApplied 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 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 informationSAZ3C NUMERICAL AND STATISTICAL METHODS Unit : I -V
SAZ3C NUMERICAL AND STATISTICAL METHODS Unit : I -V UNIT-I Introduction Mathematical Preliminaries Errors: Computations, Formula Errors in a Series Approximation Roots of Equations Linear Equations Bisection
More informationQuestion Bank (I scheme )
Question Bank (I scheme ) Name of subject: Applied Mathematics Subject code: 22206/22224/22210/22201 Course : CH/CM/CE/EJ/IF/EE/ME Semester: II UNIT-3 (CO3) Unit Test : II (APPLICATION OF INTEGRATION)
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 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 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 informationLö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 informationMechanical 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 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 informationNumerical 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 informationIntroduction 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 informationMTH603 - 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(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 informationNUMERICAL 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 informationNumerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by
Numerical Analysis A Comprehensive Introduction H. R. Schwarz University of Zürich Switzerland with a contribution by J. Waldvogel Swiss Federal Institute of Technology, Zürich JOHN WILEY & SONS Chichester
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 informationEngineering Mathematics through Applications
89 80 Engineering Mathematics through Applications Finite Differences, Numerical Differentiations and Integrations 8 8 Engineering Mathematics through Applications Finite Differences, Numerical Differentiations
More informationApplied Math for Engineers
Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method
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 informationMALLA REDDY ENGINEERING COLLEGE
MODULE I MALLA REDDY ENGINEERING COLLEGE (Autonomous) I B.Tech II Semester (MR15) I- Mid Question Bank Subject: Computational Mathematics (Common for CE, ME, CSE and Min.E) 1. If f(x) is continuous in
More 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 informationNumerical 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 informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More informationSKP Engineering College
S.K.P. Engineering College, Tiruvannamalai SKP Engineering College Tiruvannamalai 666 A Course Material on By S.Danasekar Assistant Professor Department of Matematics S.K.P. Engineering College, Tiruvannamalai
More informationBHARATHIAR UNIVERSITY, COIMBATORE. B.Sc. Mathematics CA (Revised papers with effect from onwards)
Page 1 of 7 SCAA Dt. 06-02-2014 BHARATHIAR UNIVERSITY, COIMBATORE. B.Sc. Mathematics CA (Revised papers with effect from 2014-15 onwards) Note : The revised syllabi for the following papers furnished below
More informationCOSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods
COSC 336 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods Fall 2005 Repetition from the last lecture (I) Initial value problems: dy = f ( t, y) dt y ( a) = y 0 a t b Goal:
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
NUMERICAL ANALYSIS PRACTICE 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
More informationChapter 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 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 informationMathematics for chemical engineers. Numerical solution of ordinary differential equations
Mathematics for chemical engineers Drahoslava Janovská Numerical solution of ordinary differential equations Initial value problem Winter Semester 2015-2016 Outline 1 Introduction 2 One step methods Euler
More information1. 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 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 informationINSTITUTE 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 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 informationNumerical Analysis MTH603. Virtual University of Pakistan Knowledge beyond the boundaries
Numerical Analysis MTH6 Virtual University of Pakistan Knowledge beyond the boundaries Table of Contents Lecture # Topics Page # Lecture Introduction Lecture Errors in Computations 6 Lecture Solution of
More 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 informationExamination paper for TMA4125 Matematikk 4N
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 4N Academic contact during examination: Anne Kværnø a, Louis-Philippe Thibault b Phone: a 9 66 38 4, b 9 3 0 95 Examination date:
More informationNumerical 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 informationMath 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.
Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.8: 1b, 3b, 4 Burden & Faires 5.6. Multistep Methods 1. Use all the Adams-Bashforth
More informationTwo 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 informationCO-ORDINATE GEOMETRY
CO-ORDINATE GEOMETRY 1 To change from Cartesian coordinates to polar coordinates, for X write r cos θ and for y write r sin θ. 2 To change from polar coordinates to cartesian coordinates, for r 2 write
More information9.6 Predictor-Corrector Methods
SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use
More informationNumerical 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 informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationFinal Year M.Sc., Degree Examinations
QP CODE 569 Page No Final Year MSc, Degree Examinations September / October 5 (Directorate of Distance Education) MATHEMATICS Paper PM 5: DPB 5: COMPLEX ANALYSIS Time: 3hrs] [Max Marks: 7/8 Instructions
More informationSTATISTICS AND NUMERICAL METHODS QUESTION I APRIL / MAY 2010
STATISTICS AND NUMERICAL METHODS QUESTION I APRIL / MAY 2010 1. Mention various steps involved in testing of hypothesis. (i). Set up the null hypothesis. (ii). Choose the appropriate level of significance
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 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 information2.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS. differential equations with the initial values y(x 0. ; l.
Numerical Methods II UNIT.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS.1.1 Runge-Kutta Method of Fourth Order 1. Let = f x,y,z, = gx,y,z be the simultaneous first order
More informationLecture Notes on Introduction to Numerical Computation 1
Lecture Notes on Introduction to Numerical Computation 1 Wen Shen Fall 2012 1 These notes are provided to students as a supplement to the textbook. They contain mainly examples that we cover in class.
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 information