登录
首页 » Visual C++ » shuang-tuo-qiu-re-yuan

shuang-tuo-qiu-re-yuan

于 2020-10-13 发布 文件大小:1KB
0 356
下载积分: 1 下载次数: 18

代码说明:

  fluent软件的UDF程序,是焊接过程的热源,热源类型为双椭球空间热源。(fluent udf heat source)

文件列表:

Text1.txt,1280,2015-10-20

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • mathmatics_of_computer
    C++实现的数值分析算法包括: 二分法.cpp 复化辛卜生公式.cpp 改进欧拉法.cpp 高斯-赛德尔迭代法.cpp 拉格郎日插值多项式.c(C achieve the numerical analysis algorithms include : dichotomy. cpp Minute of Oracle Health formula. cpp Improved Euler method. cpp Gauss- Seidel iterative method. cpp Lagrange polynomial interpolation. c)
    2006-11-18 17:20:47下载
    积分:1
  • fdtd_2D_TE_PML
    fdtd的2d算法,pml边界条件,二维TE波(fdtd the 2d algorithm, pml boundary conditions, 2D TE wave)
    2007-02-02 16:43:27下载
    积分:1
  • kalman
    实现卡尔曼滤波算法,可以进行参数估计、插值、滤波和预报(The Kalman filter algorithm, parameter estimation, interpolation, filtering and prediction)
    2012-12-27 19:24:51下载
    积分:1
  • generalized-Stransform
    基于改进的广义S变换,能更好的对数据进行时频分析。(Modified S-transform and its application in data analysis)
    2017-01-03 16:06:17下载
    积分:1
  • INORDER_PRE_POST_TRAVERSE
    PRE IN POST OREDER TRAVERSAL C++ CODE VISUAL
    2016-05-11 20:58:00下载
    积分:1
  • Program
    矩阵转换问题 行与列的个数均为n 的矩阵称为n 阶方阵。假定矩阵中的每个元素的值在0到9之间,则可以将矩阵中的所有元素按行依次排列得到一个“单行矩阵字符串”。(Matrix conversion, the number of rows and columns of the matrix n are called n-order square. Assume that each element of matrix value in the 0 to 9, you can press all the elements of the matrix rows in order of priority for a " single matrix string." )
    2010-12-28 11:42:08下载
    积分:1
  • fdtd
    三维的FDTD实现,采用CPML边界,较为详细的注释(Three-dimensional FDTD using CPML border, more detailed notes)
    2013-04-18 14:35:55下载
    积分:1
  • matrix_transpose.c
    适用于大型稀疏矩阵 矩阵转置 c语言 来自于有限元方法编程(From the finite element method suitable for large-scale sparse matrix matrix transpose c language programming)
    2013-05-20 10:43:20下载
    积分:1
  • brick
    有限元n维实体材料单元,仅供科研用途,拒绝商业使用(N-dimensional finite element solid material element, for scientific purposes, refusing commercial use)
    2013-10-23 14:32:13下载
    积分:1
  • na7
    Orthogonal Polynomials Approximation 数值分析,计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
    2011-11-27 11:47:21下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载