• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1694-1700
• /
• 2004

In this paper, we propose the AWLS/MFT (Adaptive Weighed Least Squares/ Modulation Function Technique) devised by A. E. Pearson et al. for the transfer function estimation of a modal system and investigate the performance of several algorithms, the Gram matrix method, a Luenberger Observer (LO), Least Squares (LS), and Recursive Least Squares (RLS), for the estimation of initial conditions. With the benefit of the Modulation Function Technique (MFT), we can separate the estimation problem into two phases: the transfer function parameters are estimated in the first phase, and the initial conditions are estimated in the second phase. The LO method produces excellent IC estimates in the noise free case, but the other three methods show better performance in the noisy case. Finally, we compared our result with the Prony based method. In the noisy case, the AWLS and one of the three methods - Gram matrix, LS, and RLS- show better performance in the output Signal to Error Ratio (SER) aspect than the Prony based method under the same simulation conditions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.927-931
• /
• 2003

In this paper, a new Recursive Least-Squares(RLS) algorithm based on matrix pseudo-inverses is presented. The aim is to use the proposed new RLS algorithm for not only the over-determined but also the under-determined estimation problem. Compared with previous results, e.g., Jie Zhou et al., the derivation of the proposed recursive form is much easier, and the recursion form is also much simpler. Furthermore, it is shown by simulations that the proposed RLS algorithm is more efficient and numerically stable than the existing algorithms.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.9
• /
• pp.1021-1030
• /
• 1992

When using a least squares estimator with exponential forgetting factor to identify continuous-time deterministic system, the problem of determining minimum eigenvalue is described in this paper. It is well known fact that the convergence rate of parameter estimates relies on various factors consisting of the estimator and especially, theirproperties can be directly affected by all eigenvalues in the parameter error differential equation. Fortunately, there exists only one adjusting eigenvalue in the given estimator and then, the parameter convergence rates depend on this minimum eigenvalue. In this note, a new result to determine the minimum eigenvalue is proposed. Under the assumption that the input has as many spectral lines as the number of parameter estimates, it can be proven that the minimum eigenvalue converges to a constant value, which is a function of the forgetting factor and the parameter estimates number.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.563-578
• /
• 2005

In [Z. Cai and B. C. Shin, SIAM J. Numer. Anal. 40 (2002), 307-318], we developed the discrete first-order system least squares method for the second-order elliptic boundary value problem by directly approximating $H(div){\cap}H(curl)-type$ space based on the Helmholtz decomposition. Under general assumptions, error estimates were established in the $L^2\;and\;H^1$ norms for the vector and scalar variables, respectively. Such error estimates are optimal with respect to the required regularity of the solution. In this paper, we study solution methods for solving the system of linear equations arising from the discretization of variational formulation which possesses discrete biharmonic term and focus on numerical results including the performances of multigrid preconditioners and the finite element accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.486-490
• /
• 2003

Software qualify models can predict the risk of faults in the software early enough for cost-effective prevention of problems. This paper introduces a least squares support vector machine (LS-SVM) as a fuzzy regression method for predicting fault ranges in the software under development. This LS-SVM deals with the fuzzy data with crisp inputs and fuzzy output. Predicting the exact number of bugs in software is often not necessary. This LS-SVM can predict the interval that the number of faults of the program at each session falls into with a certain possibility. A case study on software reliability problem is used to illustrate the usefulness of this LS -SVM.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.12
• /
• pp.793-798
• /
• 2004

In this paper, the problem of adaptively identifying time-varying nonlinear systems is considered. For that purpose, the discrete time-varying Volterra series is employed as a system model, and the filtered weighted least squares (FWLS) algorithm, developed for adaptive identification of linear time-varying systems, is utilized for the adaptive identification of time-varying quadratic Volterra systems. To demonstrate the performance of the proposed approach, some simulation results are provided. Note that the FWLS algorithm, decomposing the conventional weighted basis function (WBF) algorithm into a cascade of two (i.e., estimation and filtering) procedures, leads to fast parameter tracking with low computational burden, and the proposed approach can be easily extended to the adaptive identification of time-varying higher-order Volterra systems.

• Journal of Mechanical Science and Technology
• /
• v.17 no.5
• /
• pp.698-707
• /
• 2003

A new quadratic response surface modeling method is presented. In this method, the incomplete small composite design (ISCD) is newly proposed to .educe the number of experimental runs than that of the SCD. Unlike the SCD, the proposed ISCD always gives a unique design assessed on the number of factors, although it may induce the rank-deficiency in the normal equation. Thus, the singular value decomposition (SVD) is employed to solve the normal equation. Then, the duality theory is used to newly develop the conservative least squares fitting (CONFIT) method. This can directly control the ever- or the under-estimation behavior of the approximate functions. Finally, the performance of CONFIT is numerically shown by comparing its'conservativeness with that of conventional fitting method. Also, optimizing one practical design problem numerically shows the effectiveness of the sequential approximate optimization (SAO) combined with the proposed ISCD and CONFIT.

• Journal of the Korean Statistical Society
• /
• v.9 no.1
• /
• pp.61-77
• /
• 1980

In response surface experiments, a polynomial model is often used to fit the response surface by the method of least squares. However, if the vectors of predictor variables are multicollinear, least squares estimates of the regression parameters have a high probability of being unsatisfactory. Hoerland Kennard have demonstrated that these undesirable effects of multicollinearity can be reduced by using "ridge" estimates in place of the least squares estimates. Ridge regrssion theory in literature has been mainly concerned with selection of k for the first order polynomial regression model and the precision of $\hat{\beta}(k)$, the ridge estimator of regression parameters. The problem considered in this paper is that of selecting k of ridge regression for a given polynomial regression model with an arbitrary order. A criterion is proposed for selection of k in the context of integrated mean square error of fitted responses, and illustrated with an example. Also, a type of admissibility condition is established and proved for the propose criterion.criterion.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.2
• /
• pp.201-215
• /
• 2000

The classical method for regression analysis is the least squares method. However, if the data contain significant outliers, the least squares estimator can be broken down by outliers. To remedy this problem, the robust methods are important complement to the least squares method. Robust methods down weighs or completely ignore the outliers. This is not always best because the outliers can contain some very important information about the population. If they can be detected, the outliers can be further inspected and appropriate action can be taken based on the results. In this paper, I propose a sequential outlier test to identify outliers. It is based on the nonrobust estimate and the robust estimate of scatter of a robust regression residuals and is applied in forward procedure, removing the most extreme data at each step, until the test fails to detect outliers. Unlike other forward procedures, the present one is unaffected by swamping or masking effects because the statistics is based on the robust regression residuals. I show the asymptotic distribution of the test statistics and apply the test to several real data and simulated data for the test to be shown to perform fairly well.

• Communications for Statistical Applications and Methods
• /
• v.15 no.3
• /
• pp.441-450
• /
• 2008

In this paper we propose a new method for solving multiclass problem with least squares support vector machine(LS-SVM) regression. This method implements one-against-all scheme which is as accurate as any other approach. We also propose cross validation(CV) method to select effectively the optimal values of hyper-parameters which affect the performance of the proposed multiclass method. Experimental results are then presented which indicate the performance of the proposed multiclass method.