登录
首页 » Visual C++ » iypeHhe

iypeHhe

于 2018-11-24 发布 文件大小:5KB
0 277
下载积分: 1 下载次数: 1

代码说明:

  矩阵,复数自定义数据类型的C++实现,矩阵求逆采用牛顿法,(The matrix, complex number custom data type C realization, the matrix inverse uses the Newton method,)

文件列表:

MyComplex.h, 2890 , 2006-03-09
MyMatrix.h, 17811 , 2006-03-10
cMyComplex.cxx, 5606 , 2006-03-10
MyMatrix.cxx, 33 , 2006-02-08

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • DLT057
    利用PHOTOSHOP软件可以量测出左右像片各控制点的像素坐标,通过公式可以计算出其像点坐标。再根据给定的控制点的空间坐标,利用直线线性变换解法计算出11个DLT参数即l的系数值以及内方位元素然后解算出外方位元素。另外一种方式是用单像空间后方交会的公式计算出外方位元素。利用单像空间后方交会的来结算影像的外方位元素的基本思想是:以单幅影像为基础,从该影像所覆盖地面范围内若干控制点的已知地面坐标和相应点的像坐标量测值出发,根据共线条件方程,解求该影像在航空摄影时刻的外方位元素。首先建立单文档的程序,建立一个对话框类,在这个类中进行像素坐标、控制点坐标文件的打开与读取,然后利用DLT公式进行外方位元素的解算。 数据检核部分用前方交会算法来进行,首先根据ID找到左右片的像点的同名点,然后计算变换矩阵及系数,根据给定的内方位元素,利用公式解算出像点的控制点坐标,然后和给定的控制点坐标相比较即可进行精度评定。 (PHOTOSHOP software can be measured using a photo of the control points around the pixel coordinates can be calculated by the formula sit out the image point Standard. According to the given coordinates of control points, the use of straight-line method to calculate the linear transformation of 11 DLT parameters that the coefficient l Value and calculate the orientation elements of exterior orientation elements and solutions. Another way is to use a single formula as the calculation of space resection Orientation elements out. Use as space resection alone to settle the image exterior orientation is the basic idea: to single video As the basis of images from the ground covered by a number of control points within the known ground coordinates and image coordinates of corresponding points in the measured values , The realities of collinearity equation, find the image in the time of aerial photography exterior orientation elements. First, the process to establish a single document)
    2011-05-19 10:18:50下载
    积分:1
  • NEWTONDIEDAI
    用C++来实现NEWTON迭代法解非线性方程算法数值分析,是数值分析里典型的一个算法。(In C++ to achieve NEWTON iterative numerical algorithm for solving nonlinear equations, numerical analysis is in a typical algorithm.)
    2011-10-09 21:58:54下载
    积分:1
  • lbm
    格子玻尔兹曼模型DnQm系列模型中应用较为广泛的D2Q7模型源代码,用于模拟流体的流动。(The D2Q7 model source code of the the Lattice Boltzmann the model DnQm series model is widely used to simulate fluid flow.)
    2012-10-27 00:03:05下载
    积分:1
  • SerieAritmetica
    Una serie aritmetica en visual basic!!
    2011-09-09 06:49:44下载
    积分:1
  • LU
    说明:  用Doolittle式的LU分解来求解线性方程组。(Solve the linear equations using Doolittle LU Decomposition!)
    2009-04-07 23:38:19下载
    积分:1
  • iteration-method
    解线性方程组的迭代法 雅可比迭代、高斯—赛德尔迭代、超松弛迭代法 (Solving linear equations iterative method Jacobi iteration, Gauss- Seidel iteration SOR method)
    2013-07-05 20:15:05下载
    积分:1
  • PSO
    针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足,本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化,并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率,提高解的精确,同时还保持了较低的计算复杂度,具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)
    2013-01-07 18:05:35下载
    积分:1
  • fft
    对机械中的振动信号进行傅立叶变换,作出频谱图进行分析。(Fourier transform of the vibration signal)
    2009-10-19 19:01:34下载
    积分:1
  • r2fft
    用一个N点复序列的FFT同时计算两个N点实序列离散傅里叶变换(With an N-point complex sequence of N-point FFT calculate two real sequences discrete Fourier transform)
    2013-05-23 20:11:50下载
    积分:1
  • CPPsimplex
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)
    2011-09-18 22:57:30下载
    积分:1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载