自动生成文件MD5

常用的矩阵计算，包括求行列式、求逆矩阵等等，类容较全-common matrix, which includes seeking determinant, matrix inversion, etc., over all types of capacity

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

有n个人，求这n个人排名的可能总数算法,排名统计.-n the total number of individuals the possibility of ranking algorithms, ranking statistics.

应用背景主要运用在图像的几何变换方面，可以打开BMP格式的图像，对图像进行各种几何变换，如图像的平移，图像的垂直和水平镜像，图像的转置以及图像的缩放，旋转等。这些是进行图像预处理的关键步骤。关键技术采用MFC设计界面，运用C++编程实现图像的几何变换，打开一幅MFC图像，可以运用相应的按钮进行相应的几何变换，输出变换后的图像，界面简单，输出图像正确。

基于RFID的考勤系统设计的源代码，C代码，内容详细，包含考勤最基本的功能，对于初学者而言是很好的参考资料，值得参考。

NVIDIA 的数学运算库,包括快速开方,浮点转整数等-NVIDIA mathematical libraries, including rapid evolution, floating point to integer, etc.

数字积分插补算法, 用C 语言描述的，并且在VC++环境下调试通过，支持直线与圆的插补运算，

此程序为数值算法分析里的跳马算法演示程序-procedure for numerical algorithm analysis of the algorithm vault Demonstration Program

数据结构与算法练习，经典数据结构与算法的C语言实现，有高精度运算、排序、动态规划、海量数据处理、回溯、递归、搜索、图论 链表、操作系统相关等算法与数据机构实现。

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozdagi. Digital computation of the fractional Fourier transform. IEEE Trans. Signal Process., 44:2141{2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C . Candan. The discrete fractional Fourier transform, Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform base