menu
search
Log In

RANK Predictor for GATE 2021

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects


Gatecse
Recent questions and answers in Numerical Methods

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions and answers in Numerical Methods

1 vote
2 answers
1
GATE CSE 2008 | Question: 21
The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule is 1000e 1000 100e 100
The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule is 1000e 1000 100e 100
answered Aug 2, 2020 in Numerical Methods Jhaiyam 1.3k views
1 vote
1 answer
2
GATE1988-1i
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
answered Aug 1, 2020 in Numerical Methods Jhaiyam 197 views
2 votes
2 answers
3
UGCNET-June-2019-II: 10
Consider an LPP given as $\text{Max } Z=2x_1-x_2+2x_3$ subject to the constraints $2x_1+x_2 \leq 10 \\ x_1+2x_2-2x_3 \leq 20 \\ x_1 + 2x_3 \leq 5 \\ x_1, \: x_2 \: x_3 \geq 0 $ ... $x_1 = 0, x_2=0, \: x_3=10, \: Z=20$
Consider an LPP given as $\text{Max } Z=2x_1-x_2+2x_3$ subject to the constraints $2x_1+x_2 \leq 10 \\ x_1+2x_2-2x_3 \leq 20 \\ x_1 + 2x_3 \leq 5 \\ x_1, \: x_2 \: x_3 \geq 0 $ ... $x_1 = 0, x_2=\frac{5}{2}, \: x_3=0, \: Z=-\frac{5}{2}$ $x_1 = 0, x_2=0, \: x_3=10, \: Z=20$
answered Jun 9, 2020 in Numerical Methods Tiklu_95 1k views
0 votes
1 answer
4
UGCNET-DEC2018-II: 8
In PERT/CPM, the merge event represents _____ of two or more events. completion beginning splitting joining
In PERT/CPM, the merge event represents _____ of two or more events. completion beginning splitting joining
answered May 14, 2020 in Numerical Methods Nbhardwaj 2k views
1 vote
0 answers
6
NIELIT 2016 MAR Scientist C - Section B: 1
Choose the most appropriate option. The Newton-Raphson iteration $x_{n+1}=\dfrac{x_{n}}{2}+\dfrac{3}{2x_{n}}$ can be used to solve the equation $x^{2}=3$ $x^{3}=3$ $x^{2}=2$ $x^{3}=2$
Choose the most appropriate option. The Newton-Raphson iteration $x_{n+1}=\dfrac{x_{n}}{2}+\dfrac{3}{2x_{n}}$ can be used to solve the equation $x^{2}=3$ $x^{3}=3$ $x^{2}=2$ $x^{3}=2$
asked Apr 2, 2020 in Numerical Methods Lakshman Patel RJIT 120 views
0 votes
0 answers
7
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 17
The convergence of the bisection method is Cubic Quadratic Linear None [closed]
The convergence of the bisection method is Cubic Quadratic Linear None
asked Apr 1, 2020 in Numerical Methods Lakshman Patel RJIT 77 views
0 votes
0 answers
8
NIELIT 2016 MAR Scientist B - Section B: 7
In which of the following methods proper choice of initial value is very important? Bisection method False position Newton-Raphson Bairsto method
In which of the following methods proper choice of initial value is very important? Bisection method False position Newton-Raphson Bairsto method
asked Mar 31, 2020 in Numerical Methods Lakshman Patel RJIT 467 views
0 votes
2 answers
9
NIELIT 2017 DEC Scientist B - Section B: 3
Using bisection method, one root of $x^4-x-1$ lies between $1$ and $2$. After second iteration the root may lie in interval: $(1.25,1.5)$ $(1,1.25)$ $(1,1.5)$ None of the options.
Using bisection method, one root of $x^4-x-1$ lies between $1$ and $2$. After second iteration the root may lie in interval: $(1.25,1.5)$ $(1,1.25)$ $(1,1.5)$ None of the options.
asked Mar 30, 2020 in Numerical Methods Lakshman Patel RJIT 662 views
0 votes
1 answer
10
NIELIT 2017 DEC Scientist B - Section B: 20
Let $u$ and $v$ be two vectors in $R^2$ whose Eucledian norms satisfy $\mid u\mid=2\mid v \mid$. What is the value $\alpha$ such that $w=u+\alpha v$ bisects the angle between $u$ and $v$? $2$ $1$ $\dfrac{1}{2}$ $-2$
Let $u$ and $v$ be two vectors in $R^2$ whose Eucledian norms satisfy $\mid u\mid=2\mid v \mid$. What is the value $\alpha$ such that $w=u+\alpha v$ bisects the angle between $u$ and $v$? $2$ $1$ $\dfrac{1}{2}$ $-2$
asked Mar 30, 2020 in Numerical Methods Lakshman Patel RJIT 159 views
28 votes
3 answers
11
GATE CSE 2006 | Question: 1, ISRO2009-57
Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input $x$ is: 3 4 6 9
Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input $x$ is: 3 4 6 9
answered Mar 17, 2020 in Numerical Methods immanujs 3.9k views
1 vote
1 answer
12
Is reading comprehension asked in IIITH
Does in iiith pgeee exam , does Reading comprehension is being asked. Do we need to prepare for it?
Does in iiith pgeee exam , does Reading comprehension is being asked. Do we need to prepare for it?
answered Mar 29, 2019 in Numerical Methods Winner 182 views
4 votes
2 answers
13
ISRO2009-48
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 -1$ $x^3 +1$ $x^3 -2x^2 +1$
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 -1$ $x^3 +1$ $x^3 -2x^2 +1$
answered Mar 10, 2019 in Numerical Methods Devwritt 1.1k views
1 vote
1 answer
14
UGC NET NOV 2017 PAPER 3 Q-68
68. Consider the following LPP : Max Z=15x1+10x2 Subject to the constraints 4x1+6x2 ≤ 360 3x1+0x2 ≤ 180 0x1+5x2 ≤ 200 x1 , x2> / 0 The solution of the LPP using Graphical solution technique is : (1) x1=60, x2=0 and Z=900 (2) x1=60, x2=20 and Z=1100 (3) x1=60, x2=30 and Z=1200 (4) x1=50, x2=40 and Z=1150
68. Consider the following LPP : Max Z=15x1+10x2 Subject to the constraints 4x1+6x2 ≤ 360 3x1+0x2 ≤ 180 0x1+5x2 ≤ 200 x1 , x2> / 0 The solution of the LPP using Graphical solution technique is : (1) x1=60, x2=0 and Z=900 (2) x1=60, x2=20 and Z=1100 (3) x1=60, x2=30 and Z=1200 (4) x1=50, x2=40 and Z=1150
answered Mar 8, 2019 in Numerical Methods abhinav kumar 1.5k views
0 votes
3 answers
15
GATE1994-3.4
Match the following items (i) Newton-Raphson (a) Integration (ii) Runge-Kutta (b) Root finding (iii) Gauss-Seidel (c) Ordinary Differential Equations (iv) Simpson's Rule (d) Solution of Systems of Linear Equations
Match the following items (i) Newton-Raphson (a) Integration (ii) Runge-Kutta (b) Root finding (iii) Gauss-Seidel (c) Ordinary Differential Equations (iv) Simpson's Rule (d) Solution of Systems of Linear Equations
answered Dec 17, 2018 in Numerical Methods Gurdeep Saini 1.8k views
8 votes
1 answer
16
ISRO2009-44
A root $\alpha$ of equation $f(x)=0$ can be computed to any degree of accuracy if a 'good' initial approximation $x_0$ is chosen for which $f(x_0) > 0$ $f (x_0) f''(x_0) > 0$ $f(x_0) f'' (x_0) < 0$ $f''(x_0) >0$
A root $\alpha$ of equation $f(x)=0$ can be computed to any degree of accuracy if a 'good' initial approximation $x_0$ is chosen for which $f(x_0) > 0$ $f (x_0) f''(x_0) > 0$ $f(x_0) f'' (x_0) < 0$ $f''(x_0) >0$
answered Oct 7, 2018 in Numerical Methods Roman224 2.2k views
1 vote
1 answer
17
UGC NET NOV 2017 PAPER Q-69
69. Consider the following LPP : Min Z=2x1+x2+3x3 Subject to : x1−2x2+x3 / 4 2x1+x2+x3 £ 8 x1−x3 / 0 x1 , x2 , x3 / 0 The solution of this LPP using Dual Simplex Method is : (1) x1=0, x2=0, x3=3 and Z=9 (2) x1=0, x2=6, x3=0 and Z=6 (3) x1=4, x2=0, x3=0 and Z=8 (4) x1=2, xx2=0, x3=2 andZ=10
69. Consider the following LPP : Min Z=2x1+x2+3x3 Subject to : x1−2x2+x3 / 4 2x1+x2+x3 £ 8 x1−x3 / 0 x1 , x2 , x3 / 0 The solution of this LPP using Dual Simplex Method is : (1) x1=0, x2=0, x3=3 and Z=9 (2) x1=0, x2=6, x3=0 and Z=6 (3) x1=4, x2=0, x3=0 and Z=8 (4) x1=2, xx2=0, x3=2 andZ=10
answered May 11, 2018 in Numerical Methods Girjesh Chouhan 2.8k views
1 vote
2 answers
18
Number Theory
A prison houses 100 inmates, one in each of 100 cells, guarded by a total of 100 warders. One evening, all the cells are locked and the keys left in the locks. As the first warder leaves, she turns every key, unlocking all the doors. The second warder ... every third key and so on. Finally the last warder turns the key in just the last cell. Which doors are left unlocked and why?
A prison houses 100 inmates, one in each of 100 cells, guarded by a total of 100 warders. One evening, all the cells are locked and the keys left in the locks. As the first warder leaves, she turns every key, unlocking all the doors. The second warder turns every ... turns every third key and so on. Finally the last warder turns the key in just the last cell. Which doors are left unlocked and why?
answered Apr 19, 2018 in Numerical Methods Subarna Das 245 views
7 votes
4 answers
19
ISRO2017-3
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$ 2.222 2.275 2.279 None of the above
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$ 2.222 2.275 2.279 None of the above
answered Feb 27, 2018 in Numerical Methods stanchion 11.7k views
7 votes
2 answers
20
GATE IT 2006 | Question: 28
The following definite integral evaluates to $\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$ $\frac{1}{2}$ $\pi \sqrt{10}$ $\sqrt{10}$ $\pi$
The following definite integral evaluates to $\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$ $\frac{1}{2}$ $\pi \sqrt{10}$ $\sqrt{10}$ $\pi$
answered Dec 30, 2016 in Numerical Methods Kai 2.1k views
0 votes
0 answers
21
GATE1987-11b
Use Simpson's rule with $h=0.25$ to evaluate $ V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places. [closed]
Use Simpson's rule with $h=0.25$ to evaluate $ V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places.
asked Nov 15, 2016 in Numerical Methods makhdoom ghaya 334 views
0 votes
0 answers
22
GATE1987-11a
Given $f(300)=2,4771; f(304) = 2.4829; f(305) = 2.4843$ and $f(307) = 2.4871$ find $f(301)$ using Lagrange's interpolation formula. [closed]
Given $f(300)=2,4771; f(304) = 2.4829; f(305) = 2.4843$ and $f(307) = 2.4871$ find $f(301)$ using Lagrange's interpolation formula.
asked Nov 15, 2016 in Numerical Methods makhdoom ghaya 236 views
0 votes
0 answers
23
GATE1987-1-xxv
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure? It converges always under all circumstances. It does not converge to a tool where the second differential coefficient changes sign. It does not converge to a root where the second differential coefficient vanishes. None of the above. [closed]
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure? It converges always under all circumstances. It does not converge to a tool where the second differential coefficient changes sign. It does not converge to a root where the second differential coefficient vanishes. None of the above.
asked Nov 9, 2016 in Numerical Methods makhdoom ghaya 351 views
0 votes
0 answers
24
GATE1987-1-xxiv
The simplex method is so named because It is simple. It is based on the theory of algebraic complexes. The simple pendulum works on this method. No one thought of a better name.
The simplex method is so named because It is simple. It is based on the theory of algebraic complexes. The simple pendulum works on this method. No one thought of a better name.
asked Nov 9, 2016 in Numerical Methods makhdoom ghaya 255 views
3 votes
1 answer
25
UGCNET-Dec2014-III: 69
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table : Find out the minimum time required to complete all the jobs. $5$ $11$ $13$ $15$
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table : Find out the minimum time required to complete all the jobs. $5$ $11$ $13$ $15$
answered Aug 2, 2016 in Numerical Methods Sanjay Sharma 3.2k views
3 votes
2 answers
26
ISRO-2013-48
The Guass-Seidal iterative method can be used to solve which of the following sets? Linear algebraic equations Linear and non-linear algebraic equations Linear differential equations Linear and non-linear differential equations
The Guass-Seidal iterative method can be used to solve which of the following sets? Linear algebraic equations Linear and non-linear algebraic equations Linear differential equations Linear and non-linear differential equations
answered Jun 29, 2016 in Numerical Methods kvkumar 2k views
3 votes
2 answers
27
ISRO2009-51
The formula $P_k = y_0 + k \triangledown y_0+ \frac{k(k+1)}{2} \triangledown ^2 y_0 + \dots + \frac{k \dots (k+n-1)}{n!} \triangledown ^n y_0$ is Newton's backward formula Gauss forward formula Gauss backward formula Stirling's formula
The formula $P_k = y_0 + k \triangledown y_0+ \frac{k(k+1)}{2} \triangledown ^2 y_0 + \dots + \frac{k \dots (k+n-1)}{n!} \triangledown ^n y_0$ is Newton's backward formula Gauss forward formula Gauss backward formula Stirling's formula
answered Jun 25, 2016 in Numerical Methods naga praveen 1.3k views
4 votes
2 answers
28
ISRO2011-52
Given X: 0 10 16 Y: 6 16 28 The interpolated value X=4 using piecewise linear interpolation is 11 4 22 10
Given X: 0 10 16 Y: 6 16 28 The interpolated value X=4 using piecewise linear interpolation is 11 4 22 10
answered Jun 24, 2016 in Numerical Methods Kapil 2.2k views
3 votes
1 answer
29
ISRO2009-47
The formula $\int\limits_{x0}^{xa} y(n) dx \simeq h/2 (y_0 + 2y_1 + \dots +2y_{n-1} + y_n) - h/12 (\triangledown y_n - \triangle y_0)$ $- h/24 (\triangledown ^2 y_n + \triangle ^2 y_0) -19h/720 (\triangledown ^3 y_n - \triangle ^3 y_0) \dots $ is called Simpson rule Trapezoidal rule Romberg's rule Gregory's formula
The formula $\int\limits_{x0}^{xa} y(n) dx \simeq h/2 (y_0 + 2y_1 + \dots +2y_{n-1} + y_n) - h/12 (\triangledown y_n - \triangle y_0)$ $- h/24 (\triangledown ^2 y_n + \triangle ^2 y_0) -19h/720 (\triangledown ^3 y_n - \triangle ^3 y_0) \dots $ is called Simpson rule Trapezoidal rule Romberg's rule Gregory's formula
answered Jun 15, 2016 in Numerical Methods ManojK 1.1k views
4 votes
1 answer
30
ISRO2009-46
The shift operator $E$ is defined as $E [f(x_i)] = f (x_i+h)$ and $E'[f(x_i)]=f (x_i -h)$ then $\triangle$ (forward difference) in terms of $E$ is $E-1$ $E$ $1-E^{-1}$ $1-E$
The shift operator $E$ is defined as $E [f(x_i)] = f (x_i+h)$ and $E'[f(x_i)]=f (x_i -h)$ then $\triangle$ (forward difference) in terms of $E$ is $E-1$ $E$ $1-E^{-1}$ $1-E$
answered Jun 15, 2016 in Numerical Methods Kapil 2.3k views
5 votes
2 answers
31
GATE2000-2.1
X, Y and Z are closed intervals of unit length on the real line. The overlap of X and Y is half a unit. The overlap of Y and Z is also half a unit. Let the overlap of X and Z be k units. Which of the following is true? k must be 1 k must be 0 k can take any value between 0 and 1 None of the above
X, Y and Z are closed intervals of unit length on the real line. The overlap of X and Y is half a unit. The overlap of Y and Z is also half a unit. Let the overlap of X and Z be k units. Which of the following is true? k must be 1 k must be 0 k can take any value between 0 and 1 None of the above
answered Jan 14, 2016 in Numerical Methods confused_luck 1.2k views
5 votes
2 answers
32
GATE1999-1.23
The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The method converges always only if $f$ is a polynomial only if $f(x_o) <0$ none of the above
The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The method converges always only if $f$ is a polynomial only if $f(x_o) <0$ none of the above
answered Jun 24, 2015 in Numerical Methods Rajarshi Sarkar 1.1k views
0 votes
1 answer
33
GATE1997-4.10
The trapezoidal method to numerically obtain $\int_a^b f(x) dx$ has an error E bounded by $\frac{b-a}{12} h^2 \max f&rsquo;&rsquo;(x), x \in [a, b]$ where $h$ is the width of the trapezoids. The minimum number of trapezoids guaranteed to ensure $E \leq 10^{-4}$ in computing $\ln 7$ using $f=\frac{1}{x}$ is 60 100 600 10000
The trapezoidal method to numerically obtain $\int_a^b f(x) dx$ has an error E bounded by $\frac{b-a}{12} h^2 \max f&rsquo;&rsquo;(x), x \in [a, b]$ where $h$ is the width of the trapezoids. The minimum number of trapezoids guaranteed to ensure $E \leq 10^{-4}$ in computing $\ln 7$ using $f=\frac{1}{x}$ is 60 100 600 10000
answered Jun 6, 2015 in Numerical Methods Digvijay Pandey 707 views
1 vote
2 answers
34
GATE1997-1.2
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge
answered Jun 5, 2015 in Numerical Methods Rajarshi Sarkar 2.1k views
4 votes
2 answers
35
GATE1996-2.5
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c > 0$ is $x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 + c}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - c}{3x_n^2}$
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c > 0$ is $x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 + c}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - c}{3x_n^2}$
answered Jun 4, 2015 in Numerical Methods Rajarshi Sarkar 831 views
0 votes
3 answers
36
GATE1995-2.15
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is $x_{k+1} = 3(x_k+b)/2x_k$ $x_{k+1} = (x_{k}^2+b)/2x_k$ $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$ None of the above
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is $x_{k+1} = 3(x_k+b)/2x_k$ $x_{k+1} = (x_{k}^2+b)/2x_k$ $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$ None of the above
answered Jun 2, 2015 in Numerical Methods Rajarshi Sarkar 1k views
0 votes
1 answer
37
GATE1993-01.3
In questions 1.1 to 1.7 below, one or more of the alternatives are correct. Write the code letter(s) a, b, c, d corresponding to the correct alternative(s) in the answer book. Marks will be given only if all the correct alternatives have been selected and no incorrect ... is picked up. 1.3 Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree 1 2 3 4
In questions 1.1 to 1.7 below, one or more of the alternatives are correct. Write the code letter(s) a, b, c, d corresponding to the correct alternative(s) in the answer book. Marks will be given only if all the correct alternatives have been selected and no incorrect alternative is picked up. 1.3 Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree 1 2 3 4
answered Apr 26, 2015 in Numerical Methods Rajarshi Sarkar 1.4k views
4 votes
1 answer
38
GATE IT 2007 | Question: 77
Consider the sequence $\left \langle x_n \right \rangle,\; n \geq 0$ defined by the recurrence relation $x_{n + 1} = c \cdot (x_n)^2 - 2$, where $c > 0$. For which of the following values of $c$, does there exist a non-empty open interval $(a, b)$ such that the ... $0.25$ $0.35$ $0.45$ $0.5$ i only i and ii only i, ii and iii only i, ii, iii and iv
Consider the sequence $\left \langle x_n \right \rangle,\; n \geq 0$ defined by the recurrence relation $x_{n + 1} = c \cdot (x_n)^2 - 2$, where $c > 0$. For which of the following values of $c$, does there exist a non-empty open interval $(a, b)$ such that the sequence $x_n$ converges for all ... $a < x_0 < b$? $0.25$ $0.35$ $0.45$ $0.5$ i only i and ii only i, ii and iii only i, ii, iii and iv
answered Apr 13, 2015 in Numerical Methods Rajarshi Sarkar 727 views
0 votes
2 answers
39
GATE IT 2006 | Question: 27
Match the following iterative methods for solving algebraic equations and their orders of convergence. Method Order of Convergence 1. Bisection P. 2 or more 2. Newton-Raphson Q. 1.62 3. Secant R. 1 4. Regula falsi S. 1 bit per iteration I-R, II-S, III-P, IV-Q I-S, II-R, III-Q, IV-P I-S, II-Q, III-R, IV-P I-S, II-P, III-Q, IV-R
Match the following iterative methods for solving algebraic equations and their orders of convergence. Method Order of Convergence 1. Bisection P. 2 or more 2. Newton-Raphson Q. 1.62 3. Secant R. 1 4. Regula falsi S. 1 bit per iteration I-R, II-S, III-P, IV-Q I-S, II-R, III-Q, IV-P I-S, II-Q, III-R, IV-P I-S, II-P, III-Q, IV-R
answered Apr 12, 2015 in Numerical Methods Rajarshi Sarkar 556 views
2 votes
1 answer
40
GATE IT 2004 | Question: 38
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula? 8 8(1/3) 8(2/3) 9
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula? 8 8(1/3) 8(2/3) 9
answered Apr 7, 2015 in Numerical Methods Rajarshi Sarkar 1.1k views
To see more, click for all the questions in this category.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...