• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.486-490
• /
• 2003

Software qualify models can predict the risk of faults in the software early enough for cost-effective prevention of problems. This paper introduces a least squares support vector machine (LS-SVM) as a fuzzy regression method for predicting fault ranges in the software under development. This LS-SVM deals with the fuzzy data with crisp inputs and fuzzy output. Predicting the exact number of bugs in software is often not necessary. This LS-SVM can predict the interval that the number of faults of the program at each session falls into with a certain possibility. A case study on software reliability problem is used to illustrate the usefulness of this LS -SVM.

• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.361-373
• /
• 2000

A simple and efficient algorithm is introduced for generalized least squares estimation under nonnegativity constraints in the components of the parameter vector. This algorithm gives the exact solution to the estimation problem within a finite number of pivot operations. Besides an illustrative example, an empirical study is conducted for investigating the performance of the proposed algorithm. This study indicates that most of problems are solved in a few iterations, and the number of iterations required for optimal solution increases linearly to the size of the problem. Finally, we will discuss the applicability of the proposed algorithm extensively to the estimation problem having a more general set of linear inequality constraints.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.957-964
• /
• 2011

New time schemes based on the FEM were developed and their performances were tested with 2D wave equation. The least-squares and weighted residual methods are used to construct new time schemes based on traditional residual minimization method. To overcome some drawbacks that time schemes based on the least-squares and weighted residual methods have, ad-hoc method is considered to minimize residuals multiplied by others residuals as a new approach. And variational method is used to get necessary conditions of ad-hoc minimization. A-stability was chosen to check the stability of newly developed time schemes. Specific values of new time schemes are presented along with their numerical solutions which were compared with analytic solution.

• Structural Engineering and Mechanics
• /
• v.21 no.3
• /
• pp.315-332
• /
• 2005

The Element-free Galerkin Method has become a very popular tool for the simulation of mechanical problems with moving boundaries. The internally applied Moving Least Squares interpolation uses in general Gaussian or cubic weighting functions and has compact support. Due to the approximative character of this interpolation the obtained shape functions do not fulfill the interpolation conditions, which causes additional numerical effort for the application of the boundary conditions. In this paper a new weighting function is presented, which was designed for meshless shape functions to fulfill these essential conditions with very high accuracy without any additional effort. Furthermore this interpolation gives much more stable results for varying size of the influence radius and for strongly distorted nodal arrangements than existing weighting function types.

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

• 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 applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.311-334
• /
• 2020

The solution of the elliptic partial differential equation has interface singularity at the points which are either the intersections of interfaces or the intersections of interfaces with the boundary of the domain. The singularities that arises in the elliptic interface problems are very complex. In this article we propose an exponentially accurate nonconforming spectral element method for these problems based on [7, 18]. A geometric mesh is used in the neighbourhood of the singularities and the auxiliary map of the form z = ln ξ is introduced to remove the singularities. The method is essentially a least-squares method and the solution can be obtained by solving the normal equations using the preconditioned conjugate gradient method (PCGM) without computing the mass and stiffness matrices. Numerical examples are presented to show the exponential accuracy of the method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.4
• /
• pp.501-507
• /
• 2007

In the first part of this study, the moving least squares finite difference method for solving solid mechanics problems was formulated. This second part verified the accuracy, robustness and effectiveness of the developed method through several numerical examples. It was shown that the method gives excellent convergence rate for elasticity problem. The solution process of elastic crack problems showed the easiness in discontinuity modeling and demonstrates the accuracy and efficiency in finding singular stress solution based on adaptive node distribution. The applicability to the engineering problem with abrupt change in displacement and stresses gradient fields is verified through a localization band problem. The developed method is expected to be extended to the various special engineering problems.

• Journal of the military operations research society of Korea
• /
• v.13 no.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.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.6
• /
• pp.779-787
• /
• 2007

This paper presents a highly efficient moving least squares finite difference method (MLS FDM) for a heat transfer problem of bi-material with interfacial boundary. The MLS FDM directly discretizes governing differential equations based on a node set without a grid structure. In the method, difference equations are constructed by the Taylor polynomial expanded by moving least squares method. The wedge function is designed on the concept of hyperplane function and is embedded in the derivative approximation formula on the moving least squares sense. Thus interfacial singular behavior like normal derivative jump is naturally modeled and the merit of MLS FDM in fast derivative computation is assured. Numerical experiments for heat transfer problem of bi-material with different heat conductivities show that the developed method achieves high efficiency as well as good accuracy in interface problems.