Question:medium

The iterative formula for finding the approximate root of $f(x) = 0$ using Newton-Raphson method is:

Show Hint

The Newton-Raphson method features a quadratic rate of convergence ($\text{order of convergence } p = 2$), meaning that the number of correct decimal places roughly doubles with each successive iteration step, provided the initial guess is close enough to a simple root.

Updated On: Jun 25, 2026

\(x_n = x_{n-1} - \frac{f(x_{n-1})}{f'(x_{n-1})}\)
\(x_n = x_{n+1} + h f(x_n, y_n)\)
\(x_n = \frac{x_{n-1} + x_{n-2}}{f(x_{n-1})}\)
\(x_n = \frac{x_{n-1}f(x_{n-2}) - x_{n-2}f(x_{n-1})}{f(x_{n-1}) - f(x_{n-2})}\)

Show Solution

The Correct Option is A

Solution and Explanation

Was this answer helpful?

0

Top Questions on Numerical Methods

Questions Asked in TS PGECET exam

The Eigenvalues of \(3\times 3\) real matrix A are 1, 2, 3 then \(A^{-1} =\)

TS PGECET - 2026
Linear Algebra

Let \(A=\begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}\). If \(u_1\) and \(u_2\) are column matrices such that \(Au_1 = \begin{bmatrix} 2 \\ 1 \\ 0 \end{bmatrix}\) and \(Au_2 = \begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}\), then \(u_1 - u_2\) is

TS PGECET - 2026
Matrices

Let \(a,b\) and \(c\) be real numbers. Suppose there exist real numbers \(x,y,z\) which are not all zero such that the system of equations \(x = cy + bz\), \(y = cx + az\) and \(z = bx + ay\) has a non-zero solution then \(\left(a+b+c\right)^2 =\)

TS PGECET - 2026
Determinants

For the function \(f(x)=\log x\), the number \(c\) strictly between \(e^2\) and \(e^3\) that satisfies \(f'(c)=\dfrac{f(e^3)-f(e^2)}{e^3-e^2}\) is

TS PGECET - 2026
Calculus