1 compiler environment for the realization of graphics vb6.02 need to install Au...

等值线生成算法，用C编写的，用趋势面加权最小二乘法计算网格点高程。-Contour generation algorithm, written using C, using trend surface weighted least squares method to calculate grid point elevation.

资源描述这个应用解决了弗洛依德warshal算法。

本程序通过两种算法对二维非稳态导热进行计算，第一种为逐点迭代求解，第二种为逐行迭代TDMA求解。大家可以根据自己的需求在No1 No2处进行切换。新人第一次发程序，求各路大神能多多指点！谢谢！

use c code function in matlab

用C语言实现的二维几何运算源码，包含了常见的二维几何运算，包括： ㈠ 点的基本运算  1. 平面上两点之间距离 1  2. 判断两点是否重合 1  3. 矢量叉乘 1  4. 矢量点乘 2  5. 判断点是否在线段上 2  6. 求一点饶某点旋转后的坐标 2  7. 求矢量夹角 2  ㈡ 线段及直线的基本运算  1. 点与线段的关系 3  2. 求点到线段所在直线垂线的垂足 4  3. 点到线段的最近点 4  4. 点到线段所在直线的距离 4 

多维傅里叶变换，二维DFT快速算法，共分五部--四：三维复序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 4: Three-dimensional complex sequence of 3D-DFT Fast Algorithm

aagadfaadggh nasfajs sfaglasdlkg abnfgaqjg；asjf kafgakgj nklajfga；g kajfgaj；sg nkajfgasl；gf，nkajf；lajds；ghlaksgf ；

此程序用于道路放样的曲线要素的计算简单而方便-This procedure for setting-out the curve of the road element of the calculation is simple and convenient

程序用于产生0到1之间均匀分布的随机数序列，程序例子中产生50个-Procedures used to produce between 0-1 uniformly distributed random number sequence, the program generated 50 examples

! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jacobian. The (driver) subroutines called by the user are given in the 8 ! table below, and are well documented internally. The user need not 9 ! be concerned with any other subroutines in HOMPACK90. -! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jac