# ISRO2009-44

2k views

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

1. $f(x_0) > 0$
2. $f (x_0) f''(x_0) > 0$
3. $f(x_0) f'' (x_0) < 0$
4. $f''(x_0) >0$
2
No answer and myself also no idea. Please provide a solution to this.

F(x)>0
0
Answer is A since in numerical methods, any law of differentiation is not used and also in numerical methods f(x) converges to 0 and A satisfies this condition.

## Related questions

1
1.2k views
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 $\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
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
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$