• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.607-614
• /
• 2002

For the accurate analysis of crack problems, considerable nodal refinement near the crack tip to capture singular stress field with sufficient accuracy to provide a useful computation of stress intensity factor is required. So, in this paper, adaptive nodal refinement scheme is proposed where nodes in restricted cell regions centered at crack tip are arranged in array for enhanced spatial resolution and adaptivity. With only cell-wise adaptive refinement scheme around crack tip fields, singularity of crack tip is sufficiently described to expect a successive crack propagate direction. Through numerical tests, accuracy of the proposed adaptive scheme is investigated and compared with the finite element and experimental results. By this implementation, it is shown that high accuracy is achieved by using iterative cell-wise solution method fur analyzing crack propagation problems.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.595-619
• /
• 2022

The purpose of this paper is to introduce an iterative algorithm for approximating a solution of split equality variational inequality problem for pseudomonotone mappings in the setting of Banach spaces. Under certain conditions, we prove a strong convergence theorem for the iterative scheme produced by the method in real reflexive Banach spaces. The assumption that the mappings are uniformly continuous and sequentially weakly continuous on bounded subsets of Banach spaces are dispensed with. In addition, we present an application of our main results to find solutions of split equality minimum point problems for convex functions in real reflexive Banach spaces. Finally, we provide a numerical example which supports our main result. Our results improve and generalize many of the results in the literature.

• Journal of the Korean Statistical Society
• /
• v.16 no.1
• /
• pp.1-9
• /
• 1987

Recently a new form of the extended Yule-Walker equations for a mixed autoregressive moving-average process of orders p and q has been proposed. It can be used to obtain p+q+1 parameter values from the first p+q+1 autocovariance terms. The autoregressive part of the equations is linear and can be easily solved. In contrast the moving-average part is composed of nonlinear simultaneous equations. Thus some iterative algorithms are necessary to solve them. The iterative algorithm presented by Choi(1986) is very simple but its convergence has not been proved yet. In this paper a Newton-Raphson solution for the moving-average parameters is presented and its convergence is shown. Also numerical example illustrate the performance of the algorithm.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.2
• /
• pp.43.2-43.2
• /
• 2019

Tomography is a method to reconstruct three-dimensional structure of an optically thin object. We can obtain the three-dimensional information by combining a number of projected images at different angles. Solar rotational tomography (SRT) is the tomographic method to estimate the coronal structures using the solar rotation. There are a few practical difficulties in solar coronal observation. One of the most crucial difficulty is handling the blocking area by the occulter or the Sun itself. So we have to use the iterative reconstruction for the SRT which can resolve that problem by using the forward modeling. In this study, we propose an alternative method to reconstruct the solar coronal structure: the filtered backprojection (FBP) algorithm. The FBP algorithm is based on the simple analytic solution. Thus it is easy to understand, and the computing cost is much cheaper than that of the iterative reconstruction. Recently we found a solution for the FBP algorithm to the problem of the blocking area in the solar EUV observations. We introduce how to apply the FBP algorithm to the SRT, and show the initial results of the performance test.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2001.10a
• /
• pp.61-61
• /
• 2001

• Journal of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.279-298
• /
• 2022

In this paper, the existence and uniqueness for the global solution of neutral stochastic functional differential equation is investigated under the locally Lipschitz condition and the contractive condition. The implicit iterative methodology and the Lyapunov-Razumikhin theorem are used. The stability analysis for such equations is also applied. One numerical example is provided to illustrate the effectiveness of the theoretical results obtained.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.171-183
• /
• 2005

In this paper, we introduce and study a class of general strongly nonlinear quasivariational inequalities in Hilbert spaces. We prove the existence and uniqueness of solution and convergence of the perturbed the three-step iterative sequences with errors for this kind of general strongly nonlinear quasivariational inquality problems involving relaxed Lipschitz, relaxed monotone, and strongly monotone mappings. Our results extend, improve, and unify many known results due to Liu-Ume-Kang, Kim-Kyung, Zeng and others.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.14-30
• /
• 1985

Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools with satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design as interactive software package for microcomputers based on this method. From some computational experiences, we can state that the revised iterative goal simplex method using the sparsity technique is the most efficient one for microcomputer for solving goal programming problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.314-317
• /
• 1993

In this paper, the IPE(Iterative Parameter Estimation) methods for the nonlinear measurements are proposed. The IPE methods convert the problems of the parameter estimation for the nonlinear measurements to that of the solution of the nonlinear equations approximately and use several iterative numerical solutions, such as fixed points theory, Newton's methods, quasi-Newton's methods and steepest descent techniques. the IPE methods for the nonlinear measurements-in the case of the error estimation for the inertial navigation systems are simulated, and it is found that the estimation errors for the nonlinear measurements decrease rapidly and converge to almost that of the linear LSE(Least Squares Estimation) when the IPE methods are applied.