3,597 views
8 8 votes

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$

1 Answer

0 0 votes
F(x)>0
Answer:
Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
2.5k
2.5k views
go_editor asked Jun 15, 2016
2,539 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$ isNewton's backward formula...
3 3 votes
1 answers 1 answer
2.1k
2.1k views
go_editor asked Jun 15, 2016
2,147 views
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 + \tri...
4 4 votes
1 answers 1 answer
8.7k
8.7k views
go_editor asked Jun 15, 2016
8,658 views
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$
35 35 votes
4 answers 4 answers
16.4k
16.4k views
gatecse asked Sep 15, 2014
16,393 views
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 ...