• 대한수학회논문집
• /
• 제12권1호
• /
• pp.165-176
• /
• 1997

In order to overcome computational ill-posedness which arises when we solve the least square problems, nonlinear smoothing splines are used. The existence and the convergence on nonlinear smoothing spline are shown with numerical experiments.

• The Journal of the Acoustical Society of Korea
• /
• 제25권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.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2002년도 가을 학술발표회 논문집
• /
• pp.599-603
• /
• 2002

We propose a new meshfree method to be called the fast moving least square reproducing kernel collocation method(FCM). This methodology is composed of the fast moving least square reproducing kernel(FMLSRK) approximation and the point collocation scheme. Using point collocation makes the meshfree method really come true. In this paper, FCM Is shown to be a good method at least to calculate the numerical solutions governed by second order elliptic partial differential equations with geometric singularity or geometric multi-scales. To treat such problems, we use the concept of variable dilation parameter.

• The Journal of the Acoustical Society of Korea
• /
• 제26권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.

• 한국국방경영분석학회지
• /
• 제13권1호
• /
• pp.91-100
• /
• 1987

This paper deals with an algorithm for solving nonlinear programming problems with equality constraints. Nonlinear programming problems are transformed into a square sums of nonlinear functions by the Lagrangian multiplier method. And an iteration method minimizing this square sums is suggested and then an algorithm is proposed. Also theoretical basis of the algorithm is presented.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회B
• /
• 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
• /
• 제6권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.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2006년도 정기 학술대회 논문집
• /
• pp.567-574
• /
• 2006

We present applications of MLS-based finite elements, which enable us to easily treat highly complex nonmatching finite element meshes and discontinuities. The shape functions of MLS-based finite element can be easily generated with the aid of Moving Least Square approximation on the parental domain. The major advantage includes that the position of element nodes as well as the number of the element nodes can be conveniently adjusted according to the nature of the problems under consideration, so that finite-element mesh is straightforwardly adapted to evolving discontinuities and. interfaces. Furthermore, we show that the present MLS-based finite elements are efficiently applied for elastic-plastic deformations, wherein the implicit constraint of incompressibility should be properly handled.

• 한국전산유체공학회지
• /
• 제14권4호
• /
• pp.93-100
• /
• 2009

The gridless (or meshfree) methods, such as MPS, SPH, FPM an so forth, are feasible and robust for the problems with moving boundary and/or complicated boundary shapes, because these methods do not need to generate a grid system. In this study, a gridless solver, which is based on the combination of moving least square interpolations on a cloud of points with point collocation for evaluating the derivatives of governing equations, is presented for two-dimensional unsteady incompressible Navier-Stokes problem in the low Reynolds number. A MAC-type algorithm was adopted and the Poission equation for the pressure was solved successively in the moving least square sense. Some typical problems were solved by the presented solver for the validation and the results obtained were compared with analytic solutions and the numerical results by conventional CFD methods, such as a FVM.

• Structural Engineering and Mechanics
• /
• 제17권5호
• /
• pp.671-690
• /
• 2004

A meshless method with novel variation of point collocation by finite mixture approximation is developed in this paper, termed the meshless finite mixture (MFM) method. It is based on the finite mixture theorem and consists of two or more existing meshless techniques for exploitation of their respective merits for the numerical solution of partial differential boundary value (PDBV) problems. In this representation, the classical reproducing kernel particle and differential quadrature techniques are mixed in a point collocation framework. The least-square method is used to optimize the value of the weight coefficient to construct the final finite mixture approximation with higher accuracy and numerical stability. In order to validate the developed MFM method, several one- and two-dimensional PDBV problems are studied with different mixed boundary conditions. From the numerical results, it is observed that the optimized MFM weight coefficient can improve significantly the numerical stability and accuracy of the newly developed MFM method for the various PDBV problems.