mpu6050程序

广义矩阵求逆相关资料，矩阵运算，矩阵概念。-Generalized information matrix inversion, matrix operations, matrix concept.

运筹学之模式搜索法及游泳问题！-tacticians search patterns and swimming!

傅立叶分解M文件，一直在用，非常好用，很经典-Fourier decomposition of M documents, has been in use, very easy to use, it is a classic

机器人足球游戏算法，控制机器人进行足球比赛，可作出各种动作，移动，射门等。

基于Householder transformation的QR分解。 其使用需要调用Householder transformation程序。-Householder transformation based on the QR decomposition. The use of Householder transformation procedures need to call.

! 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

first come first serve

文件中包含一篇关于Levenberg-Marquardt算法的详细介绍，和一个关于LM算法的简单实现

1005: 最邻近点对 时间限制: 1 Sec 内存限制: 8 MB 提交次数: 6024 通过次数: 1804 提交 题目描述 要求用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出最邻近距离的平方。其中0