youxianyuanfachenyong

利用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)

C++实现的FFT，详细，简单，内含多个测试类(using C++ implements fft，including serials class)

高斯-塞德尔迭代、拉格朗日差值、牛顿法、四阶龙格库塔 与数值分析有关的公式(Gauss- Seidel iteration)

说明：  距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引(matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker)

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)

电磁场与微波技术下的射线追踪技术。应用c语言编程(Electromagnetic Field and Microwave Technology under the ray tracing technique. Application c programming language)

关于走迷宫算法的实现程序，完全采用C++语言实现，可以运行(Maze algorithm program, fully C++ language, you can run)

几种计算阶乘、阶乘之和的算法，由于计算机存储问题，一般阶乘不可能算得太大，只是一种方法。(Several computing factorial, factorial, and the algorithm, due to computer storage problems, the general factorial can not be considered too great, is only a way.)

天线组阵中相位差的递推最小二乘估计与滤波(Phase array antenna group recursive least squares estimation and filtering)

六轴工业机器人的逆运动学,采用VC++进行编程自动求解(inverse of 6-dof industrial robot)