absolutely wonderful, for beginners

辛普森方法，样条插值，高斯迭代，啦格朗日差值，牛顿迭代，超加速收敛，龙贝格方法等等，数值计算必备！-Simpson method, spline interpolation, Gaussian iteration, you granges margin, Newton iteration, super speed up convergence, Romberg methods, numerical computation must!

资源描述 ,opencv实例源代码里面包含的基于opencv的光流法程序和实现功能为图像平滑、图像缩小与Canny 边缘检测。三、用 DirectShow 编制的视频采集程序 。

c/c++爱好者学习的一个很好的例子。对于提高初学者的水平，开拓思维有很大的帮助-c/c++ enthusiasts to learn a good example. For beginners improve the level of development thinking has a great help

曼彻斯特编解码 Xilinx提供 Verilog代曼曼彻斯特编解码 Xilinx提供 Verilog代码manchester_verilog彻斯特编解码 Xilinx提供 Verilog代码manchester_verilog码manchester_verilog

基于CNN的手写数字训练源代码可用于训练各种手写字体提供源代码，主要内容在CNN那个cpp当中，其余大部分为界面设计。有问题可以联系我，一起讨论学习。

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

一个计算圆周率的自编程序（带原码）。可以计算40000位以内的圆周率。经过充分优化，速度非常快。 开发平台：turbo-pascal 7.0， 嵌入汇编。-a calculation of the ratio of circumference wrote (with the original code). 40,000 can be calculated within the pi. After full optimization, speed very quickly. Platform : turbo-pascal 7.0, embedded in the compilation.

有限元的分析程序，对于初学有限元在结构中的应用很好用-Finite element analysis program for learning the structure of finite element in the application of good use

本例子演示了如何利用f90接口来读取已经创建的3维变量，并检查读写正确与否 -This example shows how to use the f90 interface to read the already created three-dimensional variable, and check whether or not to read and write properly

This code is used to find shortest path by using dijkstra algorithm