• 전기학회논문지P
• /
• 제62권4호
• /
• pp.186-191
• /
• 2013

Earth equipments are essential to protect ITS facilities from abnormal situation. In this research, an estimation algorithm of earth parameters and equivalent resistivity is introduced. Traditional estimation methods can be divided into graphic method and numerical method. The result of graphic method is varied by the ability of expert or repeated calculation and it is hard to estimate the parameters precisely. The numerical method requires special techniques such as optimizing theory, and numerous calculations, whose results can be varied with initial values. The proposed algorithm is based on the relationship between apparent resistances and earth parameters and approximates the nonlinear characteristics of earth using ANN(artificial neural networks). The effectiveness of proposed method is verified in case studies.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제23권1호
• /
• pp.31-38
• /
• 2019

We present an explicit numerical algorithm for surface reconstruction from unorganized points using the Gaussian filter. We construct a surface from unorganized points and solve the modified heat equation coupled with a fidelity term which keeps the given points. We apply the operator splitting method. First, instead of solving the diffusion term, we use the Gaussian filter which has the effect of diffusion. Next, we solve the fidelity term by using the fully implicit scheme. To investigate the proposed algorithm, we perform computational experiments and observe good results.

• Journal of applied mathematics & informatics
• /
• 제40권1_2호
• /
• pp.267-281
• /
• 2022

Herein, an algorithm for efficient evaluation of oscillatory Fourier-integrals with Jacobi-Cauchy type singularities is suggested. This method is based on the use of the traditional Clenshaw-Curtis (CC) algorithms in which the given function is approximated by the truncated Chebyshev series, term by term, and the oscillatory factor is approximated by using Bessel function of the first kind. Subsequently, the modified moments are computed efficiently using the numerical steepest descent method or special functions. Furthermore, Algorithm and programming code in MATHEMATICA^® 9.0 are provided for the implementation of the method for automatic computation on a computer. Finally, selected numerical examples are given in support of our theoretical analysis.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.401-418
• /
• 2005

In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Thcker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.444-447
• /
• 2004

A new approach to compute the control moves in Extended Dynamic Matrix Control (EDMC) is presented. In this approach, the number of variables, determined in the inner loop of the control algorithm using iterative methods, is reduced from P , the prediction horizon to M , the control horizon. Since M is usually much smaller than P , this modifies the control algorithm from computational point of view. To justify the modification, the computational requirements are compared to those of the existing EDMC algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 V
• /
• pp.2787-2790
• /
• 2003

In this paper, we predict tracking performance of the multiple hypothesis tracking (MHT) algorithm. The MHT algorithm is known to be an optimal Bayesian approach and is superior to asly other tracking filters because it takes into account the events that the measurements can be originated from new targets and false alarms 3s well as interesting targets. In the MHT algorithm, a number of candidate hypotheses are generated and evaluated later as more data are received. The probability of each candidate hypotheses is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.487-500
• /
• 1997

In this paper we introduce a multigrid method for solving the nonliear Urysohn integral equation. The algorithm is derived from a discrete resolvent equation which approximates the continuous resolvent equation of the nonlinear Urysohn integral equa-tion. The algorithm is mathematically equivalent to Atkinson's adap-tive twogrid iteration. But the two are different computationally. We show the convergence of the algorithm and its equivalence to Atkinson's adaptive twogrid iteration. in our numerical example we compare our algorithm to other multigrid methods for solving the nonliear Urysohn integral equation including the nonlinear multigrid nethod introduced by hackbush.

• 경영과학
• /
• 제8권1호
• /
• pp.91-108
• /
• 1991

This paper presents an efficient optimization algorithm for the crude oil tanker scheduling problem. The algorithm consists of two stages. In stage one, all the potentially optimal schedules (called 'candidate schedules') are generated from feasible schedules for each ship. In the second stage, a multiple ship scheduling problem is formulated as 0-1 integer programming problem considering only the those candidate schedules. The efficiency of the suggested algorithm was improved by exploiting the special structure of the formulation. The algorithm was illustrated by a numerical example and tested on practical ship scheduling problems.

• 한국경영과학회지
• /
• 제22권1호
• /
• pp.1-24
• /
• 1997

In this paper, we have proposed new solution methods to solve TSLP (two-stage stochastic linear programming) problems. One solution method is to combine the analytic center concept with Benders' decomposition strategy to solve TSLP problems. Another method is to apply an idea proposed by Geoffrion and Graves to modify the L-shaped algorithm and the analytic center algorithm. We have compared the numerical performance of the proposed algorithms to that of the existing algorithm, the L-shaped algorithm. To effectively compare those algorithms, we have had computational experiments for seven test problems.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.823-835
• /
• 2010

In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.