Experiment No:1
Algorithm for Birge-Vieta Method:
1. Take degree of polynomial as input from user.
2. Take coefficient of polynomial according to degree of polynomial and store in p(i).
3. Enter initial guess.
4. Obtain the first remainder bn after synthetic division.
5. Store coefficient of equation p(i).
6. Obtain the first remainder after synthetic division.
7. Use Birge-Vieta formula to next iteration.
8. Check the accuracy.
9. Repeat the process until accuracy.
10. Store original coefficient in P[i].
11. Print the root of equation.
Experiment No: 2
Algorithm of Bisection method:
1. Take the given function f(x).
2. Then put the initial guesses x1 and x2 in f(x).
3. Find the value of y1 and y2.
4. Find the value of y1 and y2 till the y1y2<0.
5. If y1 * y2<0 then x3=x1+x2/2 ,y3=f(x3).
6. Repeat this process till final root.
7. Print the root of equation x3.
Experiment No:3
Algorithm for Newton-Raphson method for two variables
1. Start.
2. Functions and their derivatives are defined.
3. Initial approximations are given as input.
4. Numbers of iterations are entered.
5. The new values are obtained due to the functions
defined and the equations .Then these are added in
initial values.
6. This cycle is repeated in each iteration to get more
accurate value.
7. End.
Experiment No:4
ALGORITHM OF CURVE FITTING:
[Link] inputs for x and y.
[Link] tabular form by using for loop.
[Link] all value in tabular form.
[Link] the equation in a+bx by using above data.
EXPERIMENT NO:5
Lagrange's Interpolation Method
1. Enter the value of y and x with respective to each other.
2. enter the value of x at which we have to calculate y.
3. calculate numerator and denominator term of Langrage's coefficient
w.r.t. data point and x and y value.
4. calculate all the Lagrange’s coefficient using Lagrange's interpolation
with help of loop.
[Link]'s interpolation formula to find the values of y at the given
data point value of x.
[Link].
EXPERIMENT NO:6
Algorithm for Runge Kutta Method
[Link] initial value x0,y0.
[Link] the values of x at which y is to be found.
[Link] step size.
[Link]
K1=f(xn,yn)
K2=f(xn+h/2, yn=hk/2)
K3=f(xn+h/2 ,yn=hk2/2)
K4=f(xn+h ,yn=hk3)
[Link] Yn+1=yn+h / 6(k1+2K2+2k3+k4)
[Link] value of xn by one step.
[Link] step 4 to 6 till xn<x.
[Link] the values of x and y in tabular format.
EXPERIMENT NO:7
SIMPSON’S RULE
Read the lower and upper limits of integration
1) Read the value of spacing “n” or read number of
intervals to be taken i.e.”n”
h= (xn-x0)/n
2) Calculate
y0= f(x)|x=x0, y1=f(x)|x=x1
y2=f(x2)|x=x2 & so on ..
3) Calculate
i=h/3[(y0+yn)+(y1+y2+y5+..)+2(y2+y4+y6+....)]
4) Display the value of result of integration “i” on
the screen.
5) Stop.
EXPERIMENT NO:8
GAUSS SEIDEL METHOD
ALGORITHM
1. Read the number of variable in system of equation.
2. Read the coefficient of equation i.e read aij for i=1 to j=1 to n
3. Rearrange the equation so that method coverage problem will not arise.
4. Represent the system of euation in their iterative form as
xi = [1/aij-{(aj1)(x1)} + {(aj2)(x2) + {(aj3)(x3)} +..................(ajx)(xn)]
i=1 to n
j=1 to n
i!=j
5. Take initial guess of x,i,j=1 to be zero.
6. Execute iterative equation in step 4 to obtain x1;i=1 to n and use latest value
of x1, x2, x3..................... xn
7. Repeat step 6 until required no of iteration or required accuracy is achieved in value of variable.
8. Display the value of variable xi; i=1 to n on the screen
9. Stop
