<center id="g4q4q"></center>
This directory contains utility for implementing generic Reqursive Least Squares (RLS) algorithm. The example shows how one can use the utility to estamate the parameters of a simple linear discrete time system.
標簽： implementing Reqursive directory algorithm
上傳時間： 2014-01-06
上傳用戶：gtf1207
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
最小平方近似法 (least-Squares approximation) 是用來求出一組離散 (discrete) 數據點的近似函數 (approximating function)，作實驗所得的數據亦常使用最小平方近似法來達成曲線密合 (curve fitting)。以下所介紹的最小平方近似法是使用多項式作為近似函數，除了多項式之外，指數、對數方程式亦可作為近似函數。關於最小平方近似法的計算原理，請參閱市面上的數值分析書籍
標簽： least-Squares approximation approximating discrete
上傳時間： 2015-06-21
上傳用戶：SimonQQ
通過奇異值分解實現的最小二乘擬合算法 inear least-Squares fit by singular value decomposition
標簽： decomposition least-Squares singular inear
上傳時間： 2015-07-26
上傳用戶：bibirnovis
有監督自組織映射-偏最小二乘算法(A supervised self-organising map–partial least Squares algorithm),可以用語多變量數據的回歸分析
標簽： self-organising supervised algorithm partial
上傳時間： 2015-10-22
上傳用戶：hfmm633
Partial Least Squares regression bilinear factor model 的輸出源碼
標簽： regression bilinear Partial Squares
上傳時間： 2013-12-03
上傳用戶：familiarsmile
多項式曲線擬合 任意介數 Purpose - Least-Squares curve fit of arbitrary order working in C++ Builder 2007 as a template class, using vector<FloatType> parameters. Added a method to handle some EMathError exceptions. If do NOT want to use this just call PolyFit2 directly. usage: Call PolyFit by something like this. CPolyFit<double> PolyFitObj double correlation_coefficiant = PolyFitObj.PolyFit(X, Y, A) where X and Y are vectors of doubles which must have the same size and A is a vector of doubles which must be the same size as the number of coefficients required. returns: The correlation coefficient or -1 on failure. produces: A vector (A) which holds the coefficients.
標簽： Least-Squares arbitrary Purpose Builder
上傳時間： 2013-12-18
上傳用戶：宋桃子
北京大學ACM題 Here is a geometric problem. You have an angle and some Squares in the first quadrant of the plane rectangular coordinates. The vertex of the angle is fixed on the origin O of the coordinates, and both of its radial lines are specified by the input. The sizes of the Squares are also specified by the input, and the Squares can shift vertically and horizontally. Now your job is to use the Squares and the radial lines of the angle to enclose the maximum area, which excludes the area of the Squares (see Figure 1). You should note that the edges of the Squares must be parallel to the axes.
標簽： geometric quadrant problem Squares
上傳時間： 2013-12-25
上傳用戶：ynzfm
計算最小二乘法ordinary least Squares
上傳時間： 2013-12-15
上傳用戶：dongqiangqiang
SOStools is a toolbox dedicated for positive polynomial programming, especially for Sums of Squares (S0S). A lot of chinese researchers have carried it out as a main tool in this area.
標簽： programming especially polynomial dedicated
上傳時間： 2016-06-05
上傳用戶：pompey
