资源列表
ttt
- 对矩阵进行雅阁比分解，实现线性方程组的迭代求解-Accord than the decomposition of the matrix
path
- c++语言，用分指定结算发计算有向图或无向图中任意两点的距离-c++ language, specify the settlement made with the calculation of sub-digraph or undirected graph, the distance between any two points
celiang
- 测量中得计算包括坐标正反算，角度弧度转换，交会计算，水准计算-Including coordinate measuring positive and negative count was calculated, the angle in radians conversion, intersection calculations, the standard calculation
fiifteen_puzzle
- Program implements graphs algorihtms to solve fifteen puzzle problem (http://en.wikipedia.org/wiki/Fifteen_puzzle). There are few methods BFS - Hamming and Manhattan heuristics, Breadth-first search and Depth-first search. You can implement A* algori
comm
- 曲线拟合算法，牛顿迭代算法，等差拟合算法。-Curve fitting algorithm, Newton algorithm, arithmetic fitting algorithm.
isvd-0.1
- QR分解用于矩阵的分解，矩阵可以是任意位数的矩阵-QR decomposition for matrix decomposition, matrix, the matrix can be any digit
Decomposition_QR
- QR分解法是三种将矩阵分解的方式之一。这种方式，把矩阵分解成一个正交矩阵与一个上三角矩阵的积。QR 分解经常用来解线性最小二乘法问题。QR 分解也是特定特征值算法即QR算法的基础。-QR decomposition are the three ways of decomposition of the matrix. In this way, the matrix decomposition into an orthogonal matrix and an upper triangular mat
82859165cifa
- 编程序，按如下要求来求解n元一次线性方程组（假设方程组具有唯一解）。 （1）方程个数n之值由用户通过键盘输入； （2）方程组存放在“增广矩阵”A之中，而n行n+1列的A存储空间通过new来动态分配，且A的各元素值也由用户通过键盘输入 -Allocation procedures, the following requirements to solve the n-a system of linear equations (assuming a unique solution of equat
anneal
- 规范的模拟退火算法代码，广大的学习者都在用的代码-Standard simulated annealing algorithm code, the majority of learners are using the code
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
satu
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&
konversi-bilangan
- int i, j, k,b,n,s,t,r=1 float sum, c float a[12][12] //pengisian matrix printf("Masukkan ordo matriks : ") scanf(" d",&n) printf("masukkan banyak persamaan : ") scanf(" d",&b) for(i=0 i<n i++){ for(j=0 j&