Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<math.h>
- using namespace std;
- void main ()
- {
- int i,n=10;
- double x[11],y[11],m[11],h=3.1416/60,al[11],bet[11],a[11],b[11],c[11],d[11],d1,k=1.77,s;
- double a1=h/6.,b1=h/6.,c1=-2/3.*h;
- al[1]=0; bet[1]=0; m[0]=0; m[10]=0; a[0]=0; b[0]=0; c[0]=0; d[0]=0;
- for(i=0;i<=n;i++)
- {
- x[i]=3.1416/3+i*h;
- y[i]=5.+1./(sin(x[i])+cos(x[i]));
- }
- for(i=1;i<n;i++)
- {
- d1=(y[i+1]-2*y[i]+y[i-1])*1./h;
- al[i+1]=b1/(c1-a1*al[i]);
- bet[i+1]=(a1*bet[i]-d1)/(c1-a1*al[i]);
- cout<<al[i+1]<<" "<<bet[i+1]<<endl;
- }
- for(i=9;i>0;i--)
- {
- m[i]=m[i+1]*al[i+1]+bet[i+1];
- }
- for(i=0;i<n;i++)
- {
- a[i]=y[i];
- b[i]=(y[i+1]-y[i])/h-h*(2*m[i]+m[i+1])/6.;
- c[i]=m[i]/2.;
- d[i]=(m[i+1]-m[i])/(6*h);
- }
- a[n]=y[n];
- b[n]=b[n-1]+h*(m[n]+m[n-1]);
- c[n]=m[n]/2.;
- for(i=0;i<n;i++)
- if((k>x[i])&&(k<x[i+1]))
- break; cout<<i<<endl;
- s=a[i]+b[i]*(k-x[i])+c[i]*(k-x[i])+d[i]*pow(k-x[i],3.);
- cout<<s-5.-1./(sin(x[i])+cos(x[i]));
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement