• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.497-504
• /
• 2002

In meshless methods, the moving least squares approximation technique is widely used to approximate a solution space because of its useful numerical characters such as non-element approximation, easily controllable smoothness, and others. In this work, a generalized version of the moving least squares method Is introduced to enhance the approximation performance through the Information converning to the derivative of the field variable. The results of numerical tests for approximation verify the improved accuracy of the generalized meshless approximation procedure compared to the conventional moving least squares method. By using this generalized moving least squares method, meshless analysis of thin beam is carried out, and its performance is investigated.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1233-1245
• /
• 2008

In this paper, an iterative method is proposed to solve the least-squares problem of matrix equation AXB+CYD=E over unknown matrix pair [X, Y]. By this iterative method, for any initial matrix pair [$X_1,\;Y_1$], a solution pair or the least-norm least-squares solution pair of which can be obtained within finite iterative steps in the absence of roundoff errors. In addition, we also consider the optimal approximation problem for the given matrix pair [$X_0,\;Y_0$] in Frobenius norm. Given numerical examples show that the algorithm is efficient.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1998.10a
• /
• pp.300-305
• /
• 1998

A method of calculating wear amount which is based on digitally measured surface profile was suggested. The original profile of worn out profile was estimated from its adjacent surface profile by using least squares curve fitting with Fourier series. The approximated curve was well fitted to original surface profile. With this approach, more accurate calculation of the wear amount will be possible.

• Interaction and multiscale mechanics
• /
• v.3 no.2
• /
• pp.123-143
• /
• 2010

The essential idea of the element-free Galerkin method (EFG) is that moving least-squares (MLS) approximation are used for the trial and test functions with the variational principle (weak form). By using the weighted orthogonal basis function to construct the MLS interpolants, we derive the formulae for an improved element-free Galerkin (IEFG) method for solving three-dimensional problems in linear elasticity. There are fewer coefficients in improved moving least-squares (IMLS) approximation than in MLS approximation. Also fewer nodes are selected in the entire domain with the IEFG method than is the case with the conventional EFG method. In this paper, we selected a few example problems to demonstrate the applicability of the method.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.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.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1882-1887
• /
• 2003

The response surface method (RSM) became one of famous meta modeling techniques, however its approximation errors give designers several restrictions. Classical RSM uses the least squares method (LSM) to find the best fitting approximation models from the all given data. This paper discusses how to construct RSM efficiently and accurately using moving least squares method (MLSM) with sensitivity information. In this method, several parameters should be determined during the construction of RSM. Parametric study and optimization for these parameters are performed. Several difficulties during approximation processes are described and numerical examples are demonstrated to verify the efficiency of this method.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.23 no.1
• /
• pp.72-75
• /
• 2018

An initial rotor position estimation method is proposed in this study for an interior permanent-magnet synchronous motor without a resolver or an absolute encoder. This method uses least squares approximation to estimate the initial rotor position. The magnetic polarity is identified by injection of short pulses. The proposed estimation process is robust because it does not require complex signal processing that depends on the performance of a digital filter. In addition, it can be applied to various servo systems because it does not require additional hardware. Experimental results validate the effectiveness of the proposed method using a standard industrial servomotor with interior-permanent magnets.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.12
• /
• pp.2019-2031
• /
• 2004

The least-squares formulation for rigid-plasticity based on J$_2$-flow rule and infinitesimal theory and its meshfree implementation using moving least-squares approximation are proposed. In the least-squares formulation the squared residuals of the constitutive and equilibrium equations are minimized. Those residuals are represented in a form of first-order differential system using the velocity and stress components as independent variables. For the enforcement of the boundary and frictional contact conditions, penalty scheme is employed. Also the reshaping of nodal supports is introduced to avoid the difficulties due to the severe local deformation near the contact interface. The proposed least-squares meshfree method does not require any structure of extrinsic cells during the whole process of analysis. Through some numerical examples of metal forming processes, the validity and effectiveness of the method are investigated.

• Honam Mathematical Journal
• /
• v.37 no.3
• /
• pp.299-315
• /
• 2015

In this paper, we study the first-order system least-squares (FOSLS) spectral method for parabolic partial differential equations. There were lots of least-squares approaches to solve elliptic partial differential equations using finite element approximation. Also, some approaches using spectral methods have been studied in recent. In order to solve the parabolic partial differential equations in parallel, we consider a parallel numerical method based on a hybrid method of the frequency-domain method and first-order system least-squares method. First, we transform the parabolic problem in the space-time domain to the elliptic problems in the space-frequency domain. Second, we solve each elliptic problem in parallel for some frequencies using the first-order system least-squares method. And then we take the discrete inverse Fourier transforms in order to obtain the approximate solution in the space-time domain. We will introduce such a hybrid method and then present a numerical experiment.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1061-1071
• /
• 2009

For real generalized reflexive matrices R, S, i.e., $R^T$ = R, $R^2$ = I, $S^T$ = S, $S^2$ = I, we say that real matrix X is (R,S)-symmetric, if RXS = X. In this paper, an iterative algorithm is proposed to solve the least-squares problem of matrix equation AXB = C with (R,S)-symmetric X. Furthermore, the optimal approximation solution to given matrix $X_0$ is also derived by this iterative algorithm. Finally, given numerical example and its convergent curve show that this method is feasible and efficient.