用于计算G－P关联维；和一些相关参数。并能确定最佳的嵌入维数；不是很成熟；希望各位指正；...

应用背景 Remove Duplicates from Sorted Array  Total Accepted: 69756 Total Submissions: 223981 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论 0 粉丝 0 发布 0 获赞 关注 查看主页 c++ 相关源码推荐 qt tcp客户端 0 0 暂无评分KC注释的源码 0 0 暂无评分Q4SDKSRC 0 0 暂无评分快速排序算法 0 0 暂无评分贪吃蛇游戏 0 0 暂无评分 介绍信息预览(0条)评论打分

它是包括矢量和矩阵加，减，乘，转置和逆一个简单的矩阵操作包。

数值比较 判断两个数是否相等 大于 或 小于-numerical comparison to judge whether two equal number greater than or less than

编一些基础的C有限元程序，效率高，

原题：编写一个子程序NewTon（float x0，float eps，float x1）。它的功能是用牛顿迭代法求f（x）=x*x*x-2x*x+4x+1在x=0附近的一个实根。若迭代成功，则返回费0值；否则，返回0。-original title : the preparation of a subroutine NewTon (x0 float, float eps, float x1). Its function is to use Newton"s iterative method for f (x) = x* x* x-2x 4x* x 1 x = 0 in the vicinity of a real roots. If successful iteration, the returned value fees 0; Otherwise, the return 0.

平均因子分解法，适用于正定矩阵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

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

资源描述%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%；&；&；&；&；；；；；；；；；；；；；；；；；；；

数值计算算法：方法错误的定位写帕斯卡尔要找到一个解决方案，以F（X）=0给出的连续函数   f。关于区间[P0，P1]，其中f（P0）和f（p1）为必须   相反的迹象：   输入：端点P0，P1;公差TOL;            迭代N 0的最大数目。   输出：近似解p或            该算法失败的消息。

层次分析法，用于综合决策。附有方法说明。程序是自己写的，已验证，可用-Analytic Hierarchy Process for integrated decision-making. With a description. Procedure is to write their own, and has been verified, can be used