The module LSQ is for unconstrained linear least-Squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar-rotation algorithm is used to update the QR- factorization. This makes it suitable for updating regressions as more data become available. The module contains a test for singularities which is simpler and quicker than calculating the singular-value decomposition. An important feature of the algorithm is that it does not Square the condition number. The matrix X X is not formed. Hence it is suitable for ill- conditioned problems, such as fitting polynomials. By taking advantage of the MODULE facility, it has been possible to remove many of the arguments to routines. Apart from the new function VARPRD, and a back-substitution routine BKSUB2 which it calls, the routines behave as in AS 274.
标签： least-Squares unconstrained Statisti Applied
上传时间： 2015-05-14
上传用户：aig85
利用多态性编程，创建一个Square类，实现求三角形、正方形和圆形面积。方法 //抽象出一个共享的类，定义一个函数求面积的公共界面。再重新定义各面积的求面积 //函数，在主类中创建不同类的对象，并求不同形状的面积
标签： 编程
上传时间： 2013-12-16
上传用户：athjac
声明一个基类Shape（点）, 在此基础上派生出Rectangle（长方形）和Circle（圆）,这三个类都有GetArea()函数计算对象的面积,构造函数，析构函数等有关函数。再使用Rectangle类创建一个派生类Square(正方形)。并设计创建各种类的对象，调用所有函数。设计函数f(Shape &a)能对不同对象的实参调用计算打印出对象的面积。
标签： Rectangle GetArea Circle Shape
上传时间： 2015-07-07
上传用户：netwolf
平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite Square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the Square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition.
标签： 分解
上传时间： 2013-12-24
上传用户：啊飒飒大师的
Chessboard Cover,On a chessboard，only one Square is different, called specific.Use the Divide-and-Conquer methods to solve the Chessboard Cover Problem.
标签： Chessboard chessboard Cover On
上传时间： 2015-10-05
上传用户：zuozuo1215
By building a nonlinear function relationship between an d the error signal，this paper presents a no— vel variable step size LMS(Least Mean Square)adaptive filtering algorithm．
标签： relationship nonlinear building function
上传时间： 2015-10-22
上传用户：hzy5825468
Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of options unavailable in Windows s version, such as allowing more than one mines in a Square.
标签： game implementation Minesweeper addictive
上传时间： 2014-01-06
上传用户：zhaiyanzhong
We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude modulation, phase-shift keying, and pulse amplitude modulation communications systems.We study the performance of a standard CFO estimate, which consists of first raising the received signal to the Mth power, where M is an integer depending on the type and size of the symbol constellation, and then applying the nonlinear least Squares (NLLS) estimation approach. At low signal-to noise ratio (SNR), the NLLS method fails to provide an accurate CFO estimate because of the presence of outliers. In this letter, we derive an approximate closed-form expression for the outlier probability. This enables us to predict the mean-Square error (MSE) on CFO estimation for all SNR values. For a given SNR, the new results also give insight into the minimum number of samples required in the CFO estimation procedure, in order to ensure that the MSE on estimation is not significantly affected by the outliers.
标签： frequency-offset estimation quadrature amplitude
上传时间： 2014-01-22
上传用户：牛布牛
Comparison of the performances of the LS and the MMSE channel estimators for a 64 sub carrier OFDM system based on the parameter of Mean Square error
标签： the performances Comparison estimators
上传时间： 2016-02-01
上传用户：hgy9473
Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting Square is marked with the number ‘1’. All free, valid Squares north, south, east and west around the number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid Squares around the two are marked with a ‘3’ and the process is repeated iteratively until : The exit is found (a free Square other than the starting position is reached on the very edge of the maze), or, No more free Squares are available, and hence no exit is possible.
标签： method ink-blotting Blotting escaping
上传时间： 2014-12-03
上传用户：123啊
