差分微积分used to anticipate and respond to the uncertain future.

非线性方程类，封装了有关解非线性方程的算法-nonlinear equations, the solution package, the algorithm of nonlinear equations

应用背景 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS"" AND  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF  * SUCH DAMAGE.关键技术 * Redistribution and use in source

一个C++实现的SVD程序，可用于数值分析或潜在语义索引，在矩阵分解完成后有对右奇异矩阵的列向量进行相似度计算。

Finding Generalized Projected Clusters in High Dimensional Spaces - ORCLUS - A subspace clustering algorithm.-Finding Generalized Projected Clusters in High Dimensional Spaces- ORCLUS- A subspace clustering algorithm.

北大ACM试题poj 第3068题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3068 question Question poj source code, good code, and want to help students engage in ACM

A*（A-Star)算法是一种静态路网中求解最短路最有有效的方法： 公式表示为： f(n)=g(n)+h(n), 其中f(n) 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

挺好的用于计算年利率和月利率的vb程序-Holbrook used in the calculation of annual and monthly interest rates vb procedures

介绍了GS算法的核心内容，为想学习GS算法的人士提供很好的参考-Introduction of the GS algorithm is the core content for the GS algorithm to learn to provide good reference

一些自己做的关于图象处理的程序（如傅立叶变换，区域生长等），希望对人有帮助！-doing some of the image-processing procedures (such as Fourier transform, regional growth), people want to help!

螺旋矩阵 以前觉得蛮难写的 这个好象还是抄的 反正留到了-Spiral matrix used to think pretty hard to write this as if copied in anyway or left to the