• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제27권1호
• /
• pp.61-70
• /
• 2020

In this paper, we introduce a new concept of stability of coincidence iterative algorithm for three mappings and derive a new three-step Jungck-type iterative algorithm. And, we prove a stability result and a strong convergence result for the Jungck-type algorithm using the M_J-contractive condition. Our results extend and unify the corresponding ones in [3, 6, 7, 13].

• Journal of Electrical Engineering and Technology
• /
• 제10권3호
• /
• pp.877-887
• /
• 2015

Rapid development of cities with constant increasing load and deregulation in electricity market had forced the transmission lines to operate near their threshold capacity and can easily lead to voltage instability and caused system breakdown. To prevent such catastrophe from happening, accurate readings of voltage stability condition is required so that preventive equipment and operators can execute security procedures to restore system condition to normal. This paper introduced Enhanced Hybrid Particle Swarm Optimization algorithm to estimate the voltage stability condition which utilized Fast Voltage Stability Index (FVSI) to indicate how far or close is the power system network to the collapse point when the reactive load in the system increases because reactive load gives the highest impact to the stability of the system as it varies. Particle Swarm Optimization (PSO) had been combined with the ANN to form the Enhanced Hybrid PSO-ANN (EHPSO-ANN) algorithm that worked accurately as a prediction algorithm. The proposed algorithm reduced serious local minima convergence of ANN but also maintaining the fast convergence speed of PSO. The results show that the hybrid algorithm has greater prediction accuracy than those comparing algorithms. High generalization ability was found in the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제1권1호
• /
• pp.8-15
• /
• 2006

Since the power swing depends on the operating time of the relay, the swing's magnitude can be reduced by an autoreclosure relaying system with an optimal reclosing algorithm. This paper proposes a method for stability improvement using optimal reclosure relaying. An optimal reclosure algorithm is applied to identify both temporary and permanent faults, and to predict system stability by applying WAM and high speed communication technology. It provides optimal control by predicting and determining the degree of stability, considering the real time transient stability using EEEAC. For temporary faults, the algorithm determines the system's stability and either recloses optimally for stable systems, or inserts series capacitance before optimal reclosure for unstable systems. It also applies an optimal reclosure algorithm to minimize shock and damage to the power system when reclosure fails due to permanent faults.

• Journal of Electrical Engineering and Technology
• /
• 제10권3호
• /
• pp.795-803
• /
• 2015

Autoreclosure provides a means of improving power transmitting ability and system stability. Conventional reclosure adopts the fixed dead time interval strategy, where the reclosure is activated after a time delay to restore the system to normal as quickly as possible without regard to the system conditions. However, these simple techniques cannot provide optimal operating performance. This paper presents an adaptive autoreclosure algorithm including variable dead time, optimal reclosure, phase-by-phase reclosure and emergency extended equal-area criterion (EEEAC) algorithm in order to improve system stability. The reclosure algorithm performs the operations that are attuned to the power system conditions. The proposed adaptive reclosure algorithm is verified and tested using ATP/EMTP MODELS, and the simulation results show that the system oscillations are reduced and the transient stability is enhanced by employing the proposed adaptive reclosure algorithm.

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

Autoreclosure provides a mean of improving power transmitting ability and system stability. The conventional reclosure adopts the fixed dead time interval strategy, that is, the reclosure is activated after a time delay to restore the system to normal as quickly as possible without regard to the system conditions, however, these simple techniques cannot give the optimal operating performance. For this reason, various adaptive reclosure algorithms have been proposed recently, This paper presents an adaptive autoreclosure algorithm including the variable dead time, optimal reclosure, sequential reclosure and emergency extended equal-area criterion (EEAC) algorithm in order to improve the system stability. The reclosure algorithm performs out the operations that are attuned to the power system conditions. The proposed adaptive reclosure algorithm is verified and tested by using EMTP MODELS, and the simulation results show that the system oscillations are reduced and the transient stability is enhanced by employing the proposed adaptive reclosure algorithm.

• 대한전기학회논문지
• /
• 제34권11호
• /
• pp.430-435
• /
• 1985

Using the constructive algorithm proposed by Brayton and Tong, we analyze the stability of a modified coupled-form digital filter with quantization and overflow nonlinearities, and find the regions in the parameter plane where the filter is globally asymptotically stable. In these regions, the absence of zero-input limit cycles is ensured. This constructive algorithm gives less conservative stability results than the application of Jury-Lee stability criterion does.

• 한국통신학회논문지
• /
• 제36권4B호
• /
• pp.305-313
• /
• 2011

본 논문은 인터넷상에서 안정적인 멀티미디어 서비스를 제공하기 위한 P2P (Peer-to-Peer) 오버레이 멀티캐스트 트리 구성 알고리즘을 제안한다. 제안하는 알고리즘은 멀티캐스트 트리를 구성 할 때 링크의 지연뿐만 아니라 피어의 안정성 (Peer Stability)까지 고려한다. 실제로 피어는 매우 동적이고 불안정한 행동을 하기 때문에 안정적인 서비스를 제공하기 위해서 피어의 안정성은 필수적으로 고려해야한다. 그리고 제안하는 알고리즘에서는 멀티캐스트 트리의 상태에 따라서 링크의 지연과 피어의 안정성 사이의 가중치를 적응적으로 조절한다. 기본적으로 낮은 계산 복잡도로 근사해를 구하기 위해서 유전자 알고리즘 (Genetic Algorithm)을 이용한다. 마지막으로 실험 결과에서는 제안하는 알고리즘의 성능을 보인다.

• KIEE International Transactions on Power Engineering
• /
• 제4A권2호
• /
• pp.58-68
• /
• 2004

This paper presents an optimal routing algorithm (ORA) for maximizing voltage stability as well as for minimizing power loss in radial power systems. In the proposed ORA, a novel voltage stability index (VSI) for real-time assessment is newly introduced based on the conventional critical transmission path framework. In addition, the suggested algorithm can automatically detect the critical transmission paths resulting in voltage collapse when additional real or reactive loads are added. To implement an effective ORA, we have developed an improved branch exchange (IBE) method based on a loss calculation index and tie-branch power flow equations, which are suggested for real-time applications. The proposed algorithm has been tested with IEEE test systems as well as a large-scale power system in Korea to demonstrate its effectiveness and efficiency.

• 한국전자파학회논문지
• /
• 제22권4호
• /
• pp.407-415
• /
• 2011

본 논문에서는 등방성(isotropic) 특성과 작은 분산 오차(low dispersion error)를 갖는 3차원 등방성 시간 영역 유한 차분법(ID-FDTD: Isotropic Dispersion Finite Difference Time Domain) 방법의 stability condition과 광대역 해석 특성에 대해 논의하였다. 3차원 ID-FDTD 방법은 기존의 Yee FDTD 방법의 비등방성 특성과 큰 분산 오차를 개선하기 위해 제안되었다. 기존 연구에서는 3차원 ID-FDTD 방법의 stability condition을 수치적으로 계산하였지만, 이에 대한 검증이 충분히 이뤄지지 않은 상태이다. 이에 본 논문에서는 단일 주파수와 광대역 주파수 신호를 입력원으로 한 모의 실험 환경에서 3차원 ID-FDTD 방법의 stability condition 검증을 수행하였다. 또한 광대역 특성에 대해 3차원 ID-FDTD 방법과 유사한 알고리즘들을 비교 분석해 해보았고, 마지막으로 3D ID-FDTD을 적용하여 대형 크기 구 모델에 대해 radar cross section(RCS) 해석을 수행함으로써, 실질적 해석을 통한 알고리즘 검증 및 분석을 마무리 하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권1호
• /
• pp.25-31
• /
• 2003

The concepts of stability of algorithms for solving the symmetric and generalized symmetric-definite eigenproblems are discussed. An algorithm for solving the symmetric eigenproblem $Ax={\lambda}x$ is stable if the computed solution z is the exact solution of some slightly perturbed system $(A+E)z={\lambda}z$. We use both normwise approach and componentwise way of measuring the size of the perturbations in data. If E preserves symmetry we say that an algorithm is strongly stable (in a normwise or componentwise sense, respectively). The relations between the stability and strong stability are investigated for some classes of matrices.