ImageVerifierCode 换一换
格式:DOCX , 页数:37 ,大小:583.60KB ,
资源ID:7323485      下载积分:3 金币
快捷下载
登录下载
邮箱/手机:
温馨提示:
快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。 如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝    微信支付   
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【https://www.bdocx.com/down/7323485.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录   QQ登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(一维对流扩散问题求解.docx)为本站会员(b****6)主动上传,冰豆网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知冰豆网(发送邮件至service@bdocx.com或直接QQ联系客服),我们立即给予删除!

一维对流扩散问题求解.docx

1、一维对流扩散问题求解Subjects:A property is transported by means of convection and diffusion through the one-dimensional domain. The governing equation is; boundary conditions are at x=0 and at x=L. Using five equally spaced cells and the central differencing scheme for convection and diffusion calculate the d

2、istribution of as a function of x for(i)Case 1: u=0.1 m/s, (ii) Case2: Case 1: u=2.5 m/s, and compare the results with the analytical solution.(iii)Case 3: recalculate the solution for u=2.5m/s with 20 grid nodes and compare the results with the analytical solution, the following date apply: length

3、L=1.0 m,.Solution:Programming language:File name:二维稳态导热模拟.cppCompile software: Microsoft Visual C+ 6.0Code:#include #include#includeusing namespace std;#define Gn1 5 /网格节点数.#define Gn2 20 /网格节点数.#define P 1 /流体密度,单位:kg/m/m/m.#define ProA 1 /A端传递特性.#define ProB 0 /B端传递特性./FDD/追赶法过程void TDMA1(double a

4、,double b, double c ,double f,double *p) /矩阵形式 /b0 c0 0 0 /=f0 /a0 b1 c1 0 /=f1 /. . . . . /0 0 . b(N-1) c(N-2) /=f(N-1) double dGn1-1,uGn1,llGn1-1, yGn1,XGn1; int i; for(i=0; i=Gn1-2;i+) di = ci; u0 = b0; for(i=1; i=Gn1-1;i+) lli-1=ai-1/ui-1; ui=bi-lli-1*ci-1; y0=f0; for(i=1; i=0;i-) Xi=(yi-ci*Xi+1

5、)/ui; for (i=0; i=Gn1-1;i+) *(p+i)=Xi; void TDMA2(double a,double b, double c ,double f,double *p) double dGn2-1,uGn2,llGn2-1, yGn2,XGn2; int i; for(i=0;i=Gn2-2;i+) di=ci; u0 = b0; for(i=1;i=Gn2-1;i+) lli-1=ai-1/ui-1; ui=bi-lli-1*ci-1; y0 = f0; for(i=1;i=0;i-) Xi=(yi-ci*Xi+1)/ui; for (i=0;i=Gn2-1;i+

6、) *(p+i)=Xi; void main() double u,L=1,T=0.1,min_x,F,D,aW,aE,m,n; double aGn2,bGn2,cGn2,fGn2,XGn2; int serial_number1, serial_number2,i; printf(There are four methods to solve these cases:n); printf(1.The central differencing scheme.n); printf(2.The upwind differencing scheme.n); printf(3.The hybrid

7、differencing scheme.n); printf(4.The power-law scheme.n); printf(Please input the serial number of the method which you want to use:); scanf(%d,&serial_number1); printf(There are three cases in this subject:n); printf(1. u=0.1m/s with 5 grid nodes.n); printf(2. u=2.5m/s with 5 grid nodes.n); printf(

8、3. u=2.5m/s with 20 grid nodes.n); printf(Please input the serial number of the case which you want to solve:); scanf(%d,&serial_number2); if (serial_number1=1)/中心差分法 if (serial_number2=1)/第一题开始 u=0.1; min_x=L/Gn1; F=P*u; D=T/min_x; aW=D+F/2; aE=D-F/2; m=2*D+F; n=2*D-F; for(i=0;iGn1-1;i+) ai=-aW; ci

9、=-aE; for(i=0;iGn1;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn1-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; void TDMA1(double a,double b, double c ,double f,double *p); TDMA1(a,b,c,f,X); printf(Result:X); printf(%d,Gn1); printf(=n); for (i=0;i=Gn1-1;i+) printf( ); printf(%lfn,Xi); else if(se

10、rial_number2=2)/第二题开始 u=2.5; min_x=L/Gn1; F=P*u; D=T/min_x; aW=D+F/2; aE=D-F/2; m=2*D+F; n=2*D-F; for(i=0;iGn1-1;i+) ai=-aW, ci=-aE; for(i=0;iGn1;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn1-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA1(a,b,c,f,X); printf(Result:X); printf(%d,Gn1); print

11、f(=n); for (i=0;i=Gn1-1;i+) printf( ); printf(%lfn,Xi); else if(serial_number2=3)/第三题开始 u=2.5; min_x=L/Gn2; F=P*u; D=T/min_x; aW=D+F/2; aE=D-F/2; m=2*D+F; n=2*D-F; for(i=0;iGn2-1;i+) ai=0; ci=0; for(i=0;iGn2;i+) bi=0; fi=0; for(i=0;iGn2-1;i+) ai=-aW; ci=-aE; for(i=0;iGn2;i+) if(i=0) bi=-ci+m; fi=m*P

12、roA; else if(i=Gn2-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA2(a,b,c,f,X); printf(Result:X); printf(%d,Gn2); printf(=n); for (i=0;i=Gn2-1;i+) printf( ); printf(%lfn,Xi); else printf(NO case is selected,please check out the input serial number.); else if(serial_number1=2)/一阶迎风方法 if(serial

13、_number2=1)/第一题开始 u=0.1; min_x=L/Gn1; F=P*u; D=T/min_x; aW=D+F; aE=D; m=2*D+F; n=2*D; for(i=0;iGn1-1;i+) ai=0; ci=0; for(i=0;iGn1;i+) bi=0; fi=0; for(i=0;iGn1-1;i+) ai=-aW; ci=-aE; for(i=0;iGn1;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn1-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA1(a,b

14、,c,f,X); printf(Result:X); printf(%d,Gn1); printf(=n); for (i=0;i=Gn1-1;i+) printf( ); printf(%lfn,Xi); else if(serial_number2=2)/第二题开始 u=2.5; min_x=L/Gn1; F=P*u; D=T/min_x; aW=D+F; aE=D; m=2*D+F; n=2*D; for(i=0;iGn1-1;i+) ai=-aW; ci=-aE; for(i=0;iGn1;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn1-1

15、) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA1(a,b,c,f,X); printf(Result:X); printf(%d,Gn1); printf(=n); for (i=0;i=Gn1-1;i+) printf( ); printf(%lfn,Xi); else if(serial_number2=3)/第三题开始 u=2.5; min_x=L/Gn2; F=P*u; D=T/min_x; aW=D+F; aE=D; m=2*D+F; n=2*D; for(i=0;iGn2;i+) ai=0; ci=0; for(i=0;i

16、Gn2+1;i+) bi=0; fi=0; for(i=0;iGn2-1;i+) ai=-aW; ci=-aE; for(i=0;iGn2;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn2-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA2(a,b,c,f,X); printf(Result:X); printf(%d,Gn2); printf(=n); for (i=0;i=Gn2-1;i+) printf( ); printf(%lfn,Xi); else printf(No case

17、is selected,please check out the input serial number.n); else if(serial_number1=3)/混合方法 if(serial_number2=1)/第一题开始 u=0.1; min_x=L/Gn1; F=P*u; D=T/min_x; aW=F; aE=0; m=2*D+F; n=2*D; for(i=0;iGn1-1;i+) ai=-aW; ci=-aE; for(i=0;iGn1;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn1-1) bi=-ai-1+n; fi=n*ProB

18、; else bi=-ci-ai-1; fi=0; TDMA1(a,b,c,f,X); printf(Result:X); printf(%d,Gn1); printf(=n); for (i=0;i=Gn1-1;i+) printf( ); printf(%lfn,Xi); else if(serial_number2=2)/第二题开始 u=2.5; min_x=L/Gn1; F=P*u; D=T/min_x; aW=F; aE=0; m=2*D+F; n=2*D; for(i=0;iGn1-1;i+) ai=-aW; ci=-aE; for(i=0;iGn1;i+) if(i=0) bi=

19、-ci+m; fi=m*ProA; else if(i=Gn1-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA1(a,b,c,f,X); printf(Result:X); printf(%d,Gn1); printf(=n); for (i=0;i=Gn1-1;i+) printf( ); printf(%lfn,Xi); else if (serial_number2=3)/第三题开始 u=2.5; min_x=L/Gn2; F=P*u; D=T/min_x; aW=F; aE=0; m=2*D+F; n=2*D; for(i=

20、0;iGn2-1;i+) ai=-aW; ci=-aE; for(i=0;iGn2;i+) if(i=0) bi=-ci+m; fi=m*ProA; else if(i=Gn2-1) bi=-ai-1+n; fi=n*ProB; else bi=-ci-ai-1; fi=0; TDMA2(a,b,c,f,X); printf(Result:X); printf(%d,Gn2); printf(=n); for (i=0;i=Gn2-1;i+) printf( ); printf(%lfn,Xi); else printf(No case is selected,please check out the input serial number.n); else if(serial_number1=4)/指数方法 if(serial_number2=1)/第一题开始 u=0.1; min_x=L/Gn1; F=P*u; D=T/min_x; aW=0.03125*D+F;

copyright@ 2008-2022 冰豆网网站版权所有

经营许可证编号:鄂ICP备2022015515号-1