登录
首页 » Visual C++ » cddbn__Y1020918

cddbn__Y1020918

于 2008-05-06 发布 文件大小:1519KB
0 255
下载积分: 1 下载次数: 49

代码说明:

  研究典型相关分析的各种线性算法和非线性算法,并通过实验数据的比较说明了它们各自的特点(Canonical Correlation Analysis Study of the various linear and nonlinear algorithms algorithms, and through comparison of experimental data shows the characteristics of their respective)

文件列表:

cddbn__Y1020918.PDF

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

发表评论

0 个回复

  • 3107002005_5th_spline
    说明:  曲线的三次样条插值,在非首尾节点处具有三次光滑性质(Curve cubic spline interpolation, in both nodes with non-smooth nature of the three)
    2008-10-27 11:07:08下载
    积分:1
  • PE
    说明:  计算潜在蒸发,方法为彭曼法,需要气温、日照、风速等资料,具体详见程序界面(Pe calculation)
    2011-12-02 11:51:02下载
    积分:1
  • Euler_DG_Quadrilateral_2D
    自己写了一个二维Euler方程的间断有限元程序 上次发了一个三角形单元的程序 因为不是曲边单元 所以在圆柱后面容易形成涡 现在把程序改为曲边四边形单元了 没有涡出现 单元是8节点四边形单元 节点编号顺序是 1 5 2 6 3 7 4 8 也就是四个角点依次 是1 2 3 4 然后是边的中点编号 5 6 7 8. 时间推进采用 Runge-Kutta 方法 数值通量采用全局Lax-Friedrichs通量 仍然不能捕捉激波 因为没有做重构或者加人工粘性 等这个做出来了 再发一次。 程序没有进行优化 比如说内存的消耗没有优化 比如直边单元的边界积分仍然采 用了曲边的积分方法 增加了计算量 比如面积分、线积分都是采用的是Gauss- Legendre-Lobatto积分 积分精度会比一般的Gauss-Legendre积分精度低一阶 等 等问题。 二维的 纯属交流性质 就没有考虑这些问题 ^_^ 如果物面全部是直边 那么只要改变一个参数N 就可以获得不同的计算精度 且具 有谱精度 因为单元的节点是Gauss-Legendre-Lobatto积分点。 其实就是谱元法 (物面是曲边的情况我不清楚是不是也可以通过提高基函数的阶数 也就是增加N 来提高计算精度)(Wrote a two-dimensional Euler equations with discontinuous finite element program Last made ​ ​ a triangular element of the program, not curved edge unit is so easy to form a vortex in the cylinder behind the Program to curved edge quadrilateral element vortices appear Unit is the order of 8-node quadrilateral element node number is 15,263,748 which is the four corners of the points in turn Is 1234 and then the side of the midpoint of the number 5678. Time promote the use of Runge-Kutta method Numerical flux of the overall situation of Lax-Friedrichs, flux Still can not capture the shock wave did not do the reconstruction or artificial viscosity do it Zaifayici. The program is not optimized for example, memory consumption is not optimized such as straight-edge boundary integral of the unit is still mining Integral method to increase the amount of computation such as surface integral with a curved edge, the line integral using the Gauss- The Legendr)
    2021-01-29 12:58:40下载
    积分:1
  • fft
    FFT快速傅里叶变换,用于数字信号处理,大大提高了运行速度,节省内存开销。C语言实现(FFT fast Fourier transform for digital signal processing, greatly improving the speed and save memory overhead. C language)
    2011-05-30 00:54:58下载
    积分:1
  • DK
    说明:  邓肯张在ansys中的二次开发,适合于土体有限元分析(second development of duncan-zhang in ansys,it s be used to ansys)
    2015-01-09 09:27:07下载
    积分:1
  • calrescapind
    this source code is use to calculate resister capacitor and inductor
    2009-09-29 18:26:22下载
    积分:1
  • zjbhydm
    正交变换源程序,带vc工程。 学习正交变换算法的有力工具。(Orthogonal transformation source code, with vc works. Orthogonal transformation algorithm to learn a powerful tool.)
    2008-04-01 22:53:07下载
    积分:1
  • R-K
    四阶龙格库塔法,用C++编写,很有参考价值(Fourth-order Runge-Kutta method, written in C, a good reference)
    2011-12-29 20:44:34下载
    积分:1
  • BICG
    BICG算法,是Krylov子空间的迭代方法之一(The BICG algorithm is one of the Krylov subspace iteration method)
    2012-07-09 21:57:18下载
    积分:1
  • KMEANS
    This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )
    2013-01-05 23:11:23下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载