matlab--basic-study

Wigner-Ville Distribuition - WVD

运用TSAi方法对相机标定程序，有详细说明，可读性强(TSAi_calibrition)

it involves the concept of a simple adaptive filter

it is matlab source code implemeted in Matlab 7.6. this is utilized in matlab.

基于simulink的APF仿真，纯理论仿真，用电池来代替电容，方便学习。(Based on the APF simulink simulation, purely theoretical simulation, using capacitors instead of batteries, easy to learn.)

本matlab程序用乘子法求解多元模型的最小值（给出初始点和精度要求条件）。(The matlab program for solving the minimum multivariate model using multiplier method (given initial point and precision conditions).)

genetic algoritm for the newton raphson and other model

整理了MATLAB、lingo、lindo的经典运用，使得新手能够更好的入门学习。(Compiled MATLAB, lingo, lindo classic use, so novices can learn a better entry.)

迭代自适应Simpson，Lobatto积分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)

随机采用一致性算法确定模型参数，此处采用的是最简单的直线模型(The RANdom SAmple Consensus algorithm to determine the model parameters used here is the most simple linear model)