《CMOS模拟系统设计》课程教学资源（教案）基于下极板采样和噪声抵消结构的低功耗逐次逼近模数转换器设计

欧拉方法 – 雷诺时均方程：各种紊流模型 – 大涡模拟（LES） – 直接数值模拟（DNS） 拉格朗日方法 – 连续相 离散涡方法（DVM） – 离散相 颗粒运动方程 界面追踪 – 欧拉型（Capturing） VOF、Levelset – 拉格朗日型（Tracking） Front Tracking

3.1 概述 3.2 速度边界条件 3.3 应力边界条件 3.4 相变对界面应力的影响 3.5 界面的热力学和统计力学 3.6 表面浸润及浸润相变 3.7 气液两相流界面浓度研究

《制冷低温技术最新进展》课程教学课件（讲稿）低温气体液化与分离技术

4.1 概述 4.2 滑速比模型 4.3 变密度模型 4.4 漂移流模型 4.5 动量交换模型 4.6 环状流 α 解析计算法 4.7 最小熵增模型 4.8 混合箱-单相并流模型 4.9 α其他计算方法 4.10 欠热沸腾α计算

2.1 概述 2.2 两相流型分类、流型图与转变准则 2.3 两相流型测量方法 2.4 小结

1.1 基本概念 1.2 基本分析方法 1.3 基本宏观物理量

7.3 Conservation of Discretized Equations 7.4 Transportive Property of Discretized 7.5 Sign-preservation Principle for Analyzing 7.3.1 Definition and analyzing model 7.3.2 Direct summation method 7.3.3 Conditions for guaranteeing conservation 7.3.4 Discussion－expected but not necessary 7.3.2 Direct summation method (直接求和法) 7.3.4 Discussion－Conservation is expected but not 7.4.1 Essential (基本的) difference between 7.4 Transportive (迁移)Character of Discretized 7.4.2 CD of diffusion term can propagate(传播) 7.4.3 Analysis of transport character of 7.4.4 Upwind scheme of convection term 7.4.5 Discussion on transport character of 7.4.1 Essential difference between convection 7.4 Transportive Property of Discretized Equations 7.4.3 Analysis of transport character (迁移特性) of 7.4.4 Upwind scheme (迎风格式) of convective 7.4.5 Discussion on transportive character of 7.5 Stability analysis of discretized diffusion￾convection equation

8.1 Introduction to turbulence 8.2 Time-averaged governing equation for incompressible convective heat transfer 8.3 Zero-equation and one-equation model 8.4 Two-equation model 8.5 Wall function method 8.6 Low-Reynolds number k-epsilon model 8.7 Brief introduction to recent developments

6.4.1 Calculation procedure of SIMPLE algorithm 6.4.2 Approximations in SIMPLE algorithm 6.4.3 Numerical example 6.4 Approximations in SIMPLE algorithm 6.4 Approximations in SIMPLE Algorithm 6.5 Discussion on SIMPLE and Convergence Criteria 6.5.1 Discussion on SIMPLE algorithm 6.5.2 Convergence criteria of flow field iteration 6.6 Developments of SIMPLE algorithm 6.6.1 SIMPLER－Overcoming 1st assumption of 6.6.2 SIMPLEC－Partially overcoming 2nd assumption 6.6.3 SIMPLEX－ Partially overcoming 2nd 6.6.4 Comparisons of algorithms 6.6.2 SIMPLEC－Partially overcoming the 2nd 6.6.3 SIMPLEX algorithm 6.6.5 IDEAL algorithms