V-Lab @ ANDC

Iterative Method

For finding the roots of linear, quadratic and third degree polynomial.

For finding the roots of transcendental equation.

Suppose we have an equation f(x) = 0, for which we have to find the solution. The equation can be expressed as x = g(x). Choose g(x) such that |g'(x)| < 1 at x = xo where xo,is some initial guess called fixed point iterative scheme. Then the iterative method is applied by successive approximations given by xn = g(xn - 1), that is, x1 = g(xo), x2 = g(x1) and so on.

f(x)= a x3 +b x2+c x1 + d :

Enter the coefficients of the equation:

x3+ x2+ x+
x =
Result:

Suppose we have an equation f(x) = 0, for which we have to find the solution. The equation can be expressed as x = g(x). Choose g(x) such that |g'(x)| < 1 at x = xo where xo,is some initial guess called fixed point iterative scheme. Then the iterative method is applied by successive approximations given by xn = g(xn - 1), that is, x1 = g(xo), x2 = g(x1) and so on.

Make sure to add space after typing every variable in the function.
example. x2 + x - cos(x).



Result: