The Complete Codes

Laplace Algorithm Laplace’s approximation is one of the most fundamental asymptotic techniques for the estimation of integrals containing a large parameter or variable. For integrals of the form

C Programming | C Program to find the value using poison algorithm #include<stdio.h> #include<conio.h> #include<math.h> #define g(x,y) 2*(x)*(x)*(y)*(y) int main(){ int n,i,j,k; float sum,error,E[10],a[10][10],b[10],new_x[10],old_x[10],tl,tr,tu,tb,h,buffer; printf("\nPoision's' \n"); printf("Enter the dimension of plate\n"); scanf("%d",&n); printf("\nEnter the dimension of grid\n"); scanf("%f",&h); printf("\nEnter the temperatures at left, right, bottom and top of the plate \n"); scanf("%f%f%f%f",&tl,&tr,&tb,&tu); //construction of coefficient matrix for(i=0;i<=n;i++) a[i][i]=-4; for(i=0;i<=n;i++) a[i][n-i]=0; for(i=0;i<=n;i++) for(j=0;j<=n;j++){ if(i!=j && j!=(n-i)) a[i][j]=1; } //Construction of RHS vector k=0; for(i=1;i<n;i++) for(j=1;j<n;j++) b[k++]=h*h*g(i,j); k=0; for(i=1;i<n;i++){ for(j=1;j&l

C program for Simpson's 1/3 Rule  Before Starting the program let us know about the Simpson's 1/3 rule and How it works? Simpson’s 1/3 Rule The trapezoidal rule was based on approximating the integrand by a first-order polynomial and then integrating the polynomial over an interval of integration. Simpson’s 1/3 rule is an extension of the Trapezoidal rule where the integrand is approximated by a second-order polynomial.

C programming to calculate value using composite trapezoidal rule #include<stdio.h> #include<conio.h> #include<math.h> #define F(x) 2*x int main() { int n,i; float a,b,h,x,sum=0,integral; printf("Enter the two limits:\n"); scanf("%f%f",&a,&b); printf("Enter the difference n:\n"); scanf("%d",&n); h=(b-a)/n; for(i=1;i<n;i++) { x=a+i*h; sum=sum+F(x); } integral=(h/2)*(F(a)+F(b)+2*sum); printf("\nThe integral is: %f\n",integral); return 0; }

C Programming Codes To Compute Value Using Trapezoidal Rule #include<stdio.h> #include<conio.h> #include<math.h> #define F(x) exp(-(x/2)) int main() { int a,b,h; float i,x,y; printf("Enter the value for lower and upper limit\n"); scanf("%d%d",&a,&b); h=b-a;//Calculating height x=F(a);//Calculation Function and storing in x and y. y=F(b); i=h*((x+y)/2); printf("The Intregrated Value is %.3f",i); }

C Program To Calculate Values Using Fixed Point Iteration Method Algorithm Start Read values of x0 and e. *Here x0 is the initial approximation e is the absolute error or the desired degree of accuracy, also the stopping criteria* Calculate x1 = g(x0) If [x1 – x0] <= e, goto step 6. *Here [ ] refers to the modulus sign* Else, assign x0 = x1 and goto step 3. Display x1 as the root. Stop #include<stdio.h> #include<math.h> #include<conio.h> #define EST 0.05 #define F(x) exp(-x)-x #define G(x) exp(-x) int main() { int i=1; float error,x0,x1,temp; printf("Enter the initial guess x0:\n"); scanf("%f",&x0); printf("Iteration x0\t\t x1\t Error\n"); x1=G(x0); error=fabs((x1-x0)/x1); printf("%d\t %.4f\t%.4f\t %.4f\n",i,x0,x1,error); do { i++; temp=x1; x0=temp; x1=G(x0); error=fabs((x1-x0)/x1); printf("%d\t %.4f\t%.4f\t %.4f\n",i,x0,x1,error); }while (error>EST); } C Program To Calculate Values Using Ho

C program to find value using Bisection Method | C Programming #include<stdio.h> #include<conio.h> #include<math.h> #define EST 0.05 #define F(x) pow(x,3)-x-3 int main() { int i=1; float xl,xu,xm,f1,f2,f3,error; printf("Enter the values for xl and xu respectively\n"); scanf("%f%f",&xl,&xu); printf("Iteration\tXl\t Xu\t f(Xm)\t Error\n"); do { xm=(xl+xu)/2; f1=F(xl); f2=F(xu); f3=F(xm); error=fabs((xl-xu)/xu); if((f1*f3)<0) { xu=xm; } else { xl=xm; } f3=F(xm); error=fabs((xl-xu)/xu); printf("%d\t %.4f\t %.4f\t%.4f\t %.4f\n",i,xl,xu,xm,error); i++; }while (error>=EST); }