Write a C program to implement Trapezoidal method
.
Algorithm:
Step 1. Read x1, x2, e {x1 and x2 are the two end points of the internal the allowed error in integral is e} Step 2. h = x2  x1 Step 3. SI = (f(x1) + f(x2))/2; Step 4. I = h  si Step 5. i = 1 Repeat Step 6. x = x1 + h/2 Step 7. for J= 1 to I do Step 8. SI = SI + f(x) Step 9. x = x + h End for Step 10. i = 21 Step 11. h = h/2 {Note that the internal has been halved above and the number of points where the function has to be computed is doubled} Step 12. i0 = i1 Step 13. i1 = h.si Step 14. until / I1  i0 / <= c./i1/ Step 15. Write I1, h, i Step 16. Stop.
Flowchart:
Program:
#include<stdio.h> #include<math.h> main() { float h, a, b, n, x[20], y[20], sum = 0, integral; int i; clrscr(); printf("enter the value of a, b, n:"); scanf("%f %f %f", &a, &b, &n); printf("enter the values of x:"); for(i = 0; i <= (n1); i++) { scanf("%f", &x[i]); } printf("\n enter the values of y:"); for(i = 0; i <= (n1); i++) { scanf("%f", &y[i]); } h = (ba)/n; x[0] = a; for(i = 1; i <= n1; i++) { x[i] = x[i1] + h; sum = sum + 2 * y[i]; } sum = sum + y[b]; integral = sum * (h/2); printf("approximate integral value is: %f", integral); getch(); }
Input & Output:
enter the values of a, b, n
123
enter the values of x:
123
enter the values of y:
123
approximate integral value is 2.166667

CreatedOct 11, 2014

UpdatedOct 21, 2014

Views17,142
You May Like
Write a C program to count the lines, words and characters in a given text.
Write a C program to find the roots of a quadratic equation
.
Write a C program to find the sum of individual digits of a positive integer.
Write a C program to generate all the prime numbers
between 1 and n, where n is a value supplied by the user.
Write a C program, which takes two integer operands and one operator from the user, performs the operation and then prints the result. (Consider the operators +,,*, /, % and use switch statement
)
Write C programs that use both recursive
and nonrecursive functions
 To find the
factorial
of a given integer.  To find the
GCD
(greatest common divisor) of two given integers.