ROMBERG加速算法的实现，同时包含梯形方法等，通过比较可以明显看出加速效果。...

Clustering objects on subsets of attributes - COSA - a subspace clustering algorithm.-Clustering objects on subsets of attributes- COSA- a subspace clustering algorithm.

fourier transform and MATLAB

一维搜索程序――黄金分割点方法，我自己编的！大家多多下载，多多支持啊！-one-dimensional search procedures-- Golden Section point, I developed! Members can download the generous support ah!

Standard Grammar Toolkit

使用分布傅立叶法计算非线性薛定谔方程。可以得到光纤非线性传输特性。-Fourier method using the distribution of nonlinear Schr枚dinger equation. Can be non-linear optical transmission characteristics.

! 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

商品库存管理系统，C 语言，具有完整的系统设计

#include < iostream > #include < 矢量 > #include < math.h > #include"BezierPoint.h" 使用命名空间 std ； BezierPoint 贝塞尔 (方法 < BezierPoint > & pts，双 t) ； 双选择 （双 a，双 b） ； 双 factorial(double num) ； int main(void) { 方法 < < BezierPoint >> 方法警校 ； char endPointCount = 0; 双 inx ； 双 iny ； int ptCount = 0; int 终结点 ； 双 deltaT ； cin >> ptCount >> deltaT ； 为 (int 我 = 0 ； 我 < ptCount; i + +) { cin >> inx >> iny >> 终结点 ； BezierPoint p iny inx） ； 如果 (endPointCount = = 0 & & 终结点 = = 1) { pts.push_back (方法 < BezierPoint > ()) ； pts[pts.size()-1].push_back(p) ； endPointCount + +; 继续 ； } pts[pts.size()-1].push_back(p) ； 如果 (endPointCount! = 0 & & 终结点 = = 1 & & 我! = ptCount-1) { pts.push_back (方法 < BezierPoint > ()) ； pts[pts.size()-1].push_back(p) ； endPointCount + +; } } 为 (std::s

追赶法求解三对角矩阵是数值算法中重要的一种,这个利用了求借热传导方程-chased solve three-diagonal matrix numerical algorithm is an important, the use of the demand by heat conduction equation

跳房子游戏-Rainy Game