• 한국지능시스템학회논문지
• /
• 제13권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
• /
• 제29권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.

• 한국군사과학기술학회지
• /
• 제14권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
• /
• 제21권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
• /
• 제26권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.

• 한국전산구조공학회논문집
• /
• 제25권5호
• /
• pp.439-446
• /
• 2012

본 논문은 1차원 자유경계문제 해석의 정확도 향상을 위해 이동최소제곱 차분법을 이용하여 이동경계의 위상변화를 implicit하게 추적하는 기법을 제시한다. 기존의 이동최소제곱 차분법은 이동경계의 위치를 explicit하게 진전시켜 반복계산은 필요없지만 해의 정확도 감소를 피할 수 없었다. 그러나 본 연구에서 제시한 implicit 기법은 전체 계방정식이 비선형 시스템이 되어 반복계산 과정이 필요하지만, 실제로 수치예제를 통해 검증해 본 결과 계산량의 큰 증가없이 해석의 정확도를 획기적으로 향상시켰다. 이동하는 미분불연속 특이성을 갖는 융해(melting)문제를 수치계산한 결과, implicit 이동최소제곱 차분법을 통해 2차정확도를 얻을 수 있음을 보였다.

• Journal of applied mathematics & informatics
• /
• 제38권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.

• 한국전산구조공학회논문집
• /
• 제20권4호
• /
• pp.501-507
• /
• 2007

본 연구의 전편에서는 이동최소제곱 유한차분법을 이용한 고체역학문제의 정식화 과정이 소개되었다. 후편에서는 수치예제를 통해 이동최소제곱 유한차분법의 정확성, 강건성, 효율성을 검증했다. 탄성론 문제의 해석을 통해 개발된 해석기법의 우수한 수렴률을 확인했다. 탄성균열문제에 적용하여 간편한 불연속면 모델링이 가능하고, 적응적 절점배치를 통해 특이 응력해를 정확하고 효율적으로 계산할 수 있음을 보였다. 국소화 밴드문제 해석결과를 통해 변위나 응력이 급격하게 변화하는 특수문제에 대한 정확성과 효율성을 확인했으며, 본 해석기법이 다양한 특수 공학적 문제로 확장될 수 있을 것으로 기대된다.

• 한국국방경영분석학회지
• /
• 제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.

• 한국전산구조공학회논문집
• /
• 제20권6호
• /
• pp.779-787
• /
• 2007

본 연구는 계면경계에서 특이성을 갖는 이종재료 열전달문제를 효율적으로 해석할 수 있는 이동최소제곱 유한차분법을 제시한다 이동최소제곱 유한차분법은 격자망(grid)없이 절점만으로 이동최소제곱법을 이용하여 Taylor 다항식을 구성하고 차분식을 만들어 미분방정식을 직접 푼다. 초평면함수 개념에 근거한 쐐기함수를 이동최소제곱 센스(sense)로 근사식에 매입하여 쐐기거동과 미분 점프에 따른 계면경계 특성을 효과적으로 묘사하고 고속으로 미분을 근사하는 이동최소제곱 유한차분법의 강점을 발휘하도록 했다. 서로 다른 열전달계수를 갖는 이종재료 열전도문제 해석을 통해 이동최소제곱 유한차분법이 계면경계문제에서도 뛰어난 계산효율성과 해의 정확성을 확보할 수 있음을 보였다.