• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.683-687
• /
• 2007

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and Closed-Form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-Form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a Self-Tuning Weighted Least Square AOA algorithm that is a modified version of the conventional Closed-Form solution. In order to estimate the error covariance matrix as a weight, a two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.565-567
• /
• 2008

In the present study, a least square/level set based two-phase flow code has been developed using finite element discretization, which can be utilized for the analysis of a free surface flow problem in a complex geometry. Since the finite element method is employed for the spatial discretization of governing equations, an unstructured mesh can be naturally adopted for the level set simulation of a bubble-in-liquid flow without an additional load for the code development except that solution methods of the hyperbolic type redistancing and advection equations of the level set function should be devised in order to give a bounded solution on the unstructured mesh. For the discretization of hyperbolic type redistancing and advection equations, least square method is adopted. From the numerical experiments of the present study, it is shown that the proposed method is both robust and accurate.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.2E
• /
• pp.43-48
• /
• 2006

Abstract-Using the recursive generalized eigendecomposition method, we develop a recursive form solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. Simulations demonstrate that DLS outperforms ordinary least square for certain types of deconvolution problems.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.2E
• /
• pp.63-68
• /
• 2007

Using the neural network model for oriented principal component analysis (OPCA), we propose a solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. In this paper, we applied this neural network model to channel equalization. Simulations show that the neural network based DLS outperforms ordinary least squares in channel equalization problems.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2401-2405
• /
• 2008

In the present study, a three-dimensional least square/level set based two-phase flow code was developed for the simulation of three-dimensional sloshing problems using finite element discretization. The present method can be utilized for the analysis of a free surface flow problem in a complex geometry due to the feature of FEM. Since the finite element method is employed for the spatial discretization of governing equations, an unstructured mesh can be naturally adopted for the level set simulation of a free surface flow without an additional load for the code development except that solution methods of the hyperbolic type redistancing and advection equations of the level set function should be devised in order to give a bounded solution on the unstructured mesh. From the numerical experiments of the present study, it is shown that the proposed method is both robust and accurate for the simulation of three-dimensional sloshing problems.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.757-770
• /
• 1999

We analyse in this paper the possibility of using preconditioning techniques as for square non-singular systems, also in the case of inconsistent least-squares problems. We find conditions in which the minimal norm solution of the preconditioned least-wquares problem equals that of the original prblem. We also find conditions such that thd Kaczmarz-Extendid algorithm with relaxation parameters (analysed by the author in [4]), cna be adapted to the preconditioned least-squares problem. In the last section of the paper we present numerical experiments, with two variants of preconditioning, applied to an inconsistent linear least-squares model probelm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.485-489
• /
• 2006

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and closed-form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a self-tuning weighted least square AOA algorithm that is a modified version of the conventional closed-form solution. In order to estimate the error covariance matrix as a weight, two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• Journal of Satellite, Information and Communications
• /
• v.3 no.2
• /
• pp.32-37
• /
• 2008

Global Navigation Satellite System (GNSS) is been developing in many countries. The satellite navigation system has the importance in economic and military fields. For utilizing satellite navigation system properly, the technology of GNSS Ground Station is needed. GNSS Ground Station monitors the signal of navigation satellite and analyzes navigation solution. This study deals with the navigation software for GNSS Ground Station. This paper will introduce the navigation solution algorithm for GNSS Ground Station. The navigation solution can be calculated by the code-carrier smoothing method, the Kalman-filter method, the least-square method, and the weight least square method. The performance of each navigation algorithm in this paper is presented.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.274-279
• /
• 1998

For the accurate generation of DEMs, the determination of match quality in adaptive least square matching algorithm is significantly important. Traditionally, only the degree of convergence of a solution matrix in least squares estimation has been considered for the determination of match quality. It is, however, not enough to determine the true match quality. This paper reports two approaches of match quality determination based on adaptive least square correlation : the conventional if-then logic approaches with scene geometry and correlation as additional quality measures; and, the fuzzy logic approaches. Through these, accurate decision of match quality will minimize the number of blunder and maximize the number of exact match. The proposed methods have been tested on JERS and SPOT images and the results show good performance.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.124-126
• /
• 2000

The Minimum-Norm Least-Square(MNLS) approach based on lead field theory is an useful method to find an unique inverse solution for the measured magnetic field. The lead field depends on head geometry and location of sources and sensors. So, optimization of sensor array location is important issue for MNLS estimation. In this paper, we present an investigation for the optimization of sensor array location in computer simulation.