• 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.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.213-222
• /
• 2008

Iterative methods are often suitable for solving least squares problems min$||Ax-b||_2$, where A $\epsilon\;\mathbb{R}^{m{\times}n}$ is large and sparse. The well known LSQR algorithm is among the iterative methods for solving these problems. A good preconditioner is often needed to speedup the LSQR convergence. In this paper we present the numerical experiments of applying a well known preconditioner for the LSQR algorithm. The preconditioner is based on the $A^T$ A-orthogonalization process which furnishes an incomplete upper-lower factorization of the inverse of the normal matrix $A^T$ A. The main advantage of this preconditioner is that we apply only one of the factors as a right preconditioner for the LSQR algorithm applied to the least squares problem min$||Ax-b||_2$. The preconditioner needs only the sparse matrix-vector product operations and significantly reduces the solution time compared to the unpreconditioned iteration. Finally, some numerical experiments on test matrices from Harwell-Boeing collection are presented to show the robustness and efficiency of this preconditioner.

• Smart Structures and Systems
• /
• v.3 no.2
• /
• pp.201-217
• /
• 2007

An active damage detection technique is introduced to locate damage in an isotropic plate using Lamb waves. This technique uses a time-domain energy model of Lamb waves in plates that the wave amplitude inversely decays with the propagation distance along a ray direction. Accordingly the damage localization is formulated as a least-squares problem to minimize an error function between the model and the measured data. An active sensing system with integrated actuators/sensors is controlled to excite/receive $A_0$ mode of Lamb waves in the plate. Scattered wave signals from the damage can be obtained by subtracting the baseline signal of the undamaged plate from the recorded signal of the damaged plate. In the experimental study, after collecting the scattered wave signals, a discrete wavelet transform (DWT) is employed to extract the first scattered wave pack from the damage, then an iterative method is derived to solve the least-squares problem for locating the damage. Since this method does not rely on time-of-flight but wave energy measurement, it is more robust, reliable, and noise-tolerant. Both numerical and experimental examples are performed to verify the efficiency and accuracy of the method, and the results demonstrate that the estimated damage position stably converges to the targeted damage.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.5
• /
• pp.439-446
• /
• 2012

This paper presents an implicit moving least squares(MLS) difference method for improving the solution accuracy of 1-D free boundary problems, which implicitly updates the topology change of moving interface. The conventional MLS difference method explicitly updates the moving interface; it requires no iterative solution procedure but results in the loss of accuracy. However, the newly developed implicit scheme makes the total system nonlinear involving iterative solution procedure, but numerical verification show that it dramatically elevates the solution accuracy with moderate computation increase. Through numerical experiments for melting problems having moving singularity, it is verified that the proposed method can achieve the second order accuracy.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.931-939
• /
• 2014

In this paper we propose the iteratively reweighted least squares procedure to solve the quadratic programming problem of support vector expectile regression with an asymmetrically weighted squares loss function. The proposed procedure enables us to select the appropriate hyperparameters easily by using the generalized cross validation function. Through numerical studies on the artificial and the real data sets we show the effectiveness of the proposed method on the estimation performances.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.159-160
• /
• 1989

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.166-172
• /
• 2005

With the development of RAIM techniques for single failure, increasing interest has been shown in the multiple failure problem. As a result, numerous approaches have been used in attempts to tackle this problem. This paper considers the two failure problem with total least squares (TLS) technique, a solution that has rarely been addressed because TLS requires an immense number of computations. In this paper, the special form of the observation matrix H, (that is, one column is exactly known) is exploited so as to develop an algorithm in a sequential form, thereby reducing computational load. The algorithm permits the advantages of TLS without the excessive computational burden. The proposed algorithm is verified through a numerical simulation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.9
• /
• pp.1266-1272
• /
• 2014

We define the mobile robot navigation problem as an optimization problem to minimize the cost function with the pose error between the goal position and the position of a mobile robot. Using Gauss-Newton method for the optimization, the optimal speeds of the left and right wheels can be found as the solution of the optimization problem. Especially, the rotational speed of wheels of a mobile robot can be directly related to the overall speed of a mobile robot using the Jacobian derived from the kinematic model. When the robot detects the obstacle using sensors, the sub-goal switching method is adopted for the efficient obstacle avoidance during the navigation. The performance was evaluated using the simulation and the simulation results show the validity of the proposed method.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.1E
• /
• pp.59-64
• /
• 1996

When the input-output record is available, the identification of a bilinear system is considered. It is assumed that the input is noise free and the output is contaminated by an additive noise. It is further assumed that the covariance matrix of the noise is known up to a factor of proportionality. The extended generalized total least squares (e-GTLS) method is proposed as one of the consistent estimators of the bilinear system parameters. Considering that the input is noise-free and that bilinear system equation is linear with respect to the system parameters, we extend the GTLS problem. The extended GTLS problem is reduced to an unconstrained minimization problem, and is solved by the Newton-Raphson method. We compare the GTLS method and the e-GTLS method in the point of the accuracy of the estimated system parameters.

• Coupled systems mechanics
• /
• v.11 no.1
• /
• pp.33-41
• /
• 2022

Quite often we have a lot of measurement data and would like to find some relation between them. One common task is to see whether some measured data or a curve of known shape fit into the cumulative measured data. The problem can be visualized since data could generally be presented as curves or planes in Cartesian coordinates where each curve could be represented as a vector. In most cases we have measured the cumulative 'curve', we know shapes of other 'curves' and would like to determine unknown coefficients that multiply the known shapes in order to match the measured cumulative 'curve'. This problem could be presented in more complex variants, e.g., a constant could be added, some missing (unknown) data vector could be added to the measured summary vector, and instead of constant factors we could have polynomials, etc. All of them could be solved with slightly extended version of the procedure presented in the sequel. Solution procedure could be devised by reformulating the problem as a measurement problem and applying the generalized inverse of the measurement matrix. Measurement problem often has some errors involved in the measurement data but the least squares method that is comprised in the formulation quite successfully addresses the problem. Numerical examples illustrate the solution procedure.