• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권2호
• /
• pp.125-140
• /
• 2010

This paper develops a least-squares approach to the solution of the optimal control problem for the Navier-Stokes equations. We recast the optimality system as a first-order system by introducing velocity-flux variables and associated curl and trace equations. We show that a least-squares principle based on $L^2$ norms applied to this system yields optimal discretization error estimates in the $H^1$ norm in each variable.

• 제어로봇시스템학회논문지
• /
• 제18권4호
• /
• pp.314-320
• /
• 2012

This paper proposes a new robust motion deblurring filter using the inertial sensor measurements for strapdown image IR applications. With taking the PSF measurement error into account, the motion blurred image is modeled by the linear uncertain state space equation with the noise corrupted measurement matrix and the stochastic parameter uncertainty. This motivates us to solve the motion deblurring problem based on the recently developed robust least squares estimation theory. In order to suppress the ringing effect on the deblurred image, the robust least squares estimator is slightly modified by adoping the ridge-regression concept. Through the computer simulations using the actual IR scenes, it is demonstrated that the proposed algorithm shows superior and reliable motion deblurring performance even in the presence of time-varying motion artifact.

• 대한기계학회논문집A
• /
• 제26권9호
• /
• pp.1849-1858
• /
• 2002

An h-adaptive scheme of first-order least-squares meshfree method is presented. A posteriori error estimates, which can be readily computed from the residual, are also presented. For elliptic problem the error indicators are further improved by applying the Aubin-Nitsche method. In the proposed refinement scheme, Voronoi cells are utilized to insert nodes at appropriate positions. Through numerical examples, it is demonstrated that the error indicators reveal good correlations with the actual errors and the adaptive first-order least-squares meshfree method is effectively applied to the localized problems such as the shock formation in fluid dynamics.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제11권4호
• /
• pp.55-68
• /
• 2007

First-order least-squares method of a distributed optimal control problem for the incompressible Navier-Stokes equations is considered. An optimality system for the optimal solution are reformulated to the equivalent first-order system by introducing velocity-flux variables and then the least-squares functional corresponding to the system is defined in terms of the sum of the squared $L^2$ norm of the residual equations of the system. The optimal error estimates for least-squares finite element approximations are obtained.

• 대한수학회지
• /
• 제46권5호
• /
• pp.1007-1025
• /
• 2009

First-order least-squares method of a distributed optimal control problem for the incompressible Stokes equations is considered. An optimality system for the optimal solution are reformulated to the equivalent first-order system by introducing the vorticity and then the least-squares functional corresponding to the system is defined in terms of the sum of the squared $H^{-1}$ and $L^2$ norms of the residual equations of the system. Finite element approximations are studied and optimal error estimates are obtained. Resulting linear system of the optimality system is symmetric and positive definite. The V-cycle multigrid method is applied to the system to test computational efficiency.

• Interaction and multiscale mechanics
• /
• 제1권2호
• /
• pp.251-278
• /
• 2008

In this study, we investigate the discontinuous-derivative treatment at the gas-liquid interface in underwater explosion (UNDEX) problems by using the Moving Least Squares-Smoothed Particle Hydrodynamics (MLS-SPH) method, which is known as one of the particle methods suitable for problems where large deformation and inhomogeneity occur in the whole domain. Because the numerical oscillation of pressure arises from derivative discontinuity in the UNDEX analysis using the standard SPH method, the MLS shape function with Discontinuous-derivative Basis Function (DBF) that is able to represent the derivative discontinuity of field function is utilized in the MLS-SPH formulation in order to suppress the nonphysical pressure oscillation. The effectiveness of the MLS-SPH with DBF is demonstrated in comparison with the standard SPH and conventional MLS-SPH though a shock tube problem and benchmark standard problems of UNDEX of a trinitrotoluene (TNT) charge.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권4호
• /
• pp.267-274
• /
• 2011

Recently, actor-critic methods have drawn significant interests in the area of reinforcement learning, and several algorithms have been studied along the line of the actor-critic strategy. In this paper, we consider a new type of actor-critic algorithms employing the kernel methods, which have recently shown to be very effective tools in the various fields of machine learning, and have performed investigations on combining the actor-critic strategy together with kernel methods. More specifically, this paper studies actor-critic algorithms utilizing the kernel-based least-squares estimation and policy gradient, and in its critic's part, the study uses a sliding-window-based kernel least-squares method, which leads to a fast and efficient value-function-estimation in a nonparametric setting. The applicability of the considered algorithms is illustrated via a robot locomotion problem and a tunnel ventilation control problem.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.9-26
• /
• 2001

In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

• Journal of the Korean Statistical Society
• /
• 제14권2호
• /
• pp.63-75
• /
• 1985

This paper considers a statistical calibration problem in which the standard as wel as the nonstandard measurement is subject to error. Since the classicla approach cannot handle this situation properly, a functional relationship model with additional feature of prediction is proposed. For the analysis of the problem four different approaches-two estimation techniques (ordinary and grouping least squares) combined with two prediction methods (classical and inverse prediction)-are considered. By Monte Carlo simulation the perromance of each approach is assessed in term of the probability of concentration. The simulation results indicate that the ordinary least squares with inverse prediction is generally preferred in interpolation while the grouping least squares with classical prediction turns out to be better in extrapolation.

• 한국CDE학회논문집
• /
• 제17권4호
• /
• pp.282-293
• /
• 2012

This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.