搜索资源列表
Runge_kutta
- R—K方法的精确度最高，，改进欧拉法的精度比欧拉法的精确度要高。-R-K of the highest accuracy, and improve the accuracy of Eulerian method than Eulerian method to the high precision.
割线法和改进的欧拉法
- 我这是割线法和改进的欧拉法的源代码-This a secant method and improve the Eulerian method of source code!
第五题
- 欧拉方法编程c语言-Eulerian method c programming language
fluent udf
- De-gassing boundary condition for FLUENT6 Eulerian Multiphase (EulerEuler) & Mixture Models
Navier2d.zip
- ZEUS is a family of Eulerian (grid based) Magneto-Hydrodynamic codes (MHD) for use in astrophysics, described in a series of papers by Stone and Norman (1, 2, 3). It may be used in Cartesian (XYZ), cylindrical (ZRP), and spherical (RTP) coordin
particleLevelSet3D
- Level Set方法是20世纪90年代很流行的界面追踪技术,国外已有个别实例将此方法应用于不可压缩流体的计算.但其对界面具有抹圆的作用,造成梯度很大的界面失真.Particle Level Set方法可以弥补这一缺陷.在基于欧拉方法求解区域中安插了一定数量的示踪粒子，可以纠正失真效果，能够更丰富的体现流体表面的细节。-Level Set Methods 20 century 90' s are very popular interface tracking technology, for
oulalujingbianli
- 通过欧拉路径计算非叶子节点的后代数目，并且先序遍历输出构造的二叉树-Eulerian path through the calculation of non-leaf node the number of generations, and output first traversal of the binary tree structure
CoursLevelSets
- The level set method (sometimes abbreviated as LSM) is a numerical technique for tracking interfaces and shapes. The advantage of the level set method is that one can perform numerical computations involving curves and surfaces on a fixed Cartesian g
Euler
- 对欧拉图的判断，判断一个图是否是欧拉图并输出-Judgement of the Euler diagram to determine whether a graph and outputs Eulerian graph
paper
- Euler方式处理多介质问题的算法文章集合-The paper collection of Eulerian method solving multiphase flow
Modeling-Uniform-Fluidization-in-2D-Fluidized-Bed
- Fluent tutorial to simulate a fluidized bed with eulerian model
tut-03-nucleate-boil
- The purpose of this tutorial is to demonstrate the modeling of forced convection subcooled nucleate boiling using the in-built boiling model available under Eulerian multiphase model.
matlab_gp.pdf.tar
- 可以将图论中的很多问题解决，比如说判断是否是连通图，是否是欧拉图等问题。-A lot of problems in graph theory can be resolved, for example, to determine whether it is a connected graph is Eulerian map.
Timus1129
- URAL大学的Online Judge,第1129题Door Painting，用C#实现，用到欧拉图的相关知识。-The the URAL University Online Judge, question 1129 Door Painting with a C# implementation, used Eulerian graph knowledge.
a
- 在数论，对正整数n，欧拉函数是少于或等于n的数中与n互质的数的数目。 φ函数的值 通式：φ(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…..(1-1/pn) 其中p1, p2……pn为x的所有质因数，x是不为0的整数。φ(1)=1（唯一和1互质的数就是1本身）。 (注意：每种质因数只一个。比如12=2*2*3 那么φ（12）=12*（1-1/2）*(1-1/3)=4) 若n是质数p的k次幂，φ(n)=p^k-p^(k-1)=(p-1)p^(k-1)，因为除了
paste
- matlab实现的中国邮路问题，寻找可能的欧拉环游，-matlab realize the Chinese Postman Problem, looking for possible Eulerian tour,
euler-algorithm
- 给定一个无向图，找该图的欧拉环游。算法快可以执行好-Given an undirected graph, find the graph Eulerian tour. Fast algorithm can perform well
eulertour
- Application Console to find an Eulerian Tour in C-Application Console to find an Eulerian Tour in C++
eulerian_granular_heat
- eulerian granular heat transfrer ,problem ,in ansys ,all files try out.
eulerian_multiphase_granular
- eulerian granular heat transfrer ,problem ,in ansys ,all files try out