linear-equations

bellman-ford算法，典型最短路算法，用于计算一个节点到其他所有节点的最短路径(bellman-ford algorithm, a typical shortest path algorithm for computing a node to all other nodes of the shortest path)

开发环境没有可选项，fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90 )

hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2. Start with zero clusters 3. Add each item to be clustered to: * Closest cluster if distance <= r * New cluster if distance to closest cluster > r 4. Compute new center from members in cluster 5. Empty the clusters (keeping the centers) 6. Return to step 3 (until no changes are made)

FFT/IFFT 变换程序----------------(FFT/IFFT transformation process----------------)

自己实现的一个简单的计算器，支持大数的加减乘除、开平方等操作，不适用库函数。(Themselves to achieve a simple calculator, to support the addition and subtraction, multiplication and division of large numbers, such as square root operations, library functions do not apply.)

用C++编写的一维和二维快速傅里叶变换程序(Prepared with C++ one-dimensional and two-dimensional fast Fourier transform procedure)

用来计算航天器再入质点弹道，其中包括插值算法，龙格库塔法以及大气模型(Used to calculate the particle trajectory of spacecraft re-entry, including the interpolation algorithm, Runge-Kutta method as well as atmospheric model)

说明：  fast fourier transformation

说明：  运用数组，指针，通过最简单的c语言完成矩阵的转置计算。(Using array, pointer, through the simplest c language to complete the matrix transpose calculation)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)