1,915 views
3 votes
3 votes

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

  1. Newton's backward formula
  2. Gauss forward formula
  3. Gauss backward formula
  4. Stirling's formula

2 Answers

Answer:

Related questions

1.6k
views
1 answers
3 votes
go_editor asked Jun 15, 2016
1,583 views
The formula ... is calledSimpson ruleTrapezoidal ruleRomberg's ruleGregory's formula
2.9k
views
1 answers
8 votes
Desert_Warrior asked Jun 3, 2016
2,939 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$f(x_0) > 0$f (x_0) f''(x_0) > 0$f(x_0) f'' (x_0) < 0$f''(x_0) >0$
11.8k
views
3 answers
30 votes
gatecse asked Sep 15, 2014
11,817 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 $x$ is:3469
2.0k
views
2 answers
4 votes
go_editor asked Jun 15, 2016
1,964 views
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$