• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.763-771
• /
• 2009

T.H. Kim, H.K. Xu, [Convergence of the modified Mann's iteration method for asymptotically strict pseudo-contractions, Nonlinear Anal.(2007),doi:l0.l016/j.na.2007.02.029.] proved the strong convergence for asymptotically strict pseudo-contractions by the classical CQ iterative method. In this paper, we apply the monotone CQ iterative method to modify the classical CQ iterative method of T.H. Kim, H.K. Xu, and to obtain the strong convergence theorems for asymptotically strict pseudo-contractions. In the proved process of this paper, Cauchy sequences method is used, so we complete the proof without using the demi-closedness principle, Opial's condition or others about weak topological technologies. In addition, we use a ingenious technology to avoid defining that F(T) is bounded. On the other hand, we relax the restriction on the control sequence of iterative scheme.

• 대한수학회논문집
• /
• 제11권2호
• /
• pp.495-501
• /
• 1996

There is currently a regain of interest in ADI (Alternating Direction Implicit) method as a preconditioner for iterative Method for solving large sparse linear systems, because of its suitability for parallel computation. However the classical ADI is not applicable to FE(Finite Element) matrices. In this paper wer propose a Block-ADI method, which is applicable to Finite Element metrices. The new approach is a combination of classical ADI method and domain decompositi on. Also, we provide a partial proof of the convergence based on the results from the regular splittings, in case the discretization metrix is symmetric positive definite.

• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권7호
• /
• pp.355-362
• /
• 2003

The fault analysis problem of a distribution network has many difficulties comes from the unbalance of loads or networks and the lacks of load information. The unbalance of loads or networks make the fault location difficult when it use the classical sequence transformation. Moreover the amount of load in the distribution networks fluctuates with time. This paper introduces a recent fault location algorithm using iterative method which handle the unbalance of the problem. But, the fault location errors comes from the load fluctuations still left. For the real application of the new fault location algorithm in distribution networks, this paper studied the effect of the load fluctuations in the algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.179-181
• /
• 1996

In conventional hydrothermal coordination problem, the lambda-gamma iteration method is generally used for generation schedule. The procedure of classical lambda-gamma iteration method consists of 3 main loops and it is very complex. Therefore, it needs many iterative calculations. This paper proposes an advanced hydrothermal algorithm based on newly developed lambda-gamma iteration method. As lambda calculation loop is removed in the newly developed iteration method, iterative calculations are reduced and whole procedure is simplified. The proposed algorithm is verified on simple system.

• 한국공간구조학회논문집
• /
• 제14권1호
• /
• pp.101-108
• /
• 2014

In order to overcome the key shortcoming of Hamilton's principle, recently, the extended framework of Hamilton's principle was developed. To investigate its potential in further applications especially for material non-linearity problems, the focus is initially on a classical single-degree-of-freedom elasto-viscoplastic model. More specifically, the extended framework is applied to the single-degree-of-freedom elasto-viscoplastic model, and a corresponding weak form is numerically implemented through a temporal finite element approach. The method provides a non-iterative algorithm along with unconditional stability with respect to the time step, while yielding whole information to investigate the further dynamics of the considered system.

• 대한수학회지
• /
• 제57권5호
• /
• pp.1079-1101
• /
• 2020

This work is concerned with a geometric inverse problem in fluid mechanics. The aim is to reconstruct an unknown obstacle immersed in a Newtonian and incompressible fluid flow from internal data. We assume that the fluid motion is governed by the Stokes-Brinkmann equations in the two dimensional case. We propose a simple and efficient reconstruction method based on the topological sensitivity concept. The geometric inverse problem is reformulated as a topology optimization one minimizing a least-square functional. The existence and stability of the optimization problem solution are discussed. A topological sensitivity analysis is derived with the help of a straightforward approach based on a penalization technique without using the classical truncation method. The theoretical results are exploited for building a non-iterative reconstruction algorithm. The unknown obstacle is reconstructed using a levelset curve of the topological gradient. The accuracy and the robustness of the proposed method are justified by some numerical examples.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회A
• /
• pp.1198-1203
• /
• 2008

An efficient sequential optimization approach for metamodel was presented by Choi et al [6]. This paper describes a new approach of the multilevel optimization method studied in Refs. [5] and [21-25]. The basic idea is concerned with multilevel iterative methods which combine a descent scheme with a hierarchy of auxiliary problems in lower dimensional subspaces. After fitting a metamodel based on an initial space filling design, this model is sequentially refined by the expected improvement criterion. The advantages of the method are that it does not require optimum sensitivities, nonlinear equality constraints are not needed, and the method is relatively easy to understand and use. As a check on effectiveness, the proposed method is applied to a classical cantilever beam.

• Interaction and multiscale mechanics
• /
• 제1권2호
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1762-1765
• /
• 1997

Some ill-conditioned processes are very sensitive to small element-wise uncertainties arising in classical element-by-element model identifications. For such processes, accurate identification of simgular values and right singular vectors are more important than theose of the elements themselves. Singular values and right singular vectors can be found by iteraive identification methods which implement the input and output transformations iteratively. Methods based on SVD decomposition, QR decomposition and LU decomposition are proposed and compared with the Kuong and Mac Gregor's method. Convergence proofs are given. These SVD and QR mehtods use normal matrices for the transformations which cannot be calculated analytically in general and so they are hoard to apply to dynamic processes, whereas the LU method used simple analyitc transformations and can be directly applied to dynamic processes.