• Title/Summary/Keyword: numerical algorithm

Search Result 4,119, Processing Time 0.033 seconds

A Numerical Algorithm for Fault Location Estimation Considering Long-Transmission Line (장거리 송전선로를 고려한 사고거리추정 수치해석 알고리즘)

  • Kim, Byeong-Man;Chae, Myeong-Suk;Kang, Yong-Cheol
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.12
    • /
    • pp.2139-2146
    • /
    • 2008
  • This paper presents a numerical algorithm for fault location estimation which used to data from both end of the transmission line. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the PMUs(Phasor Measurement Units) in the time-domain. This paper has separated from two part of with/without shunt capacitance(short/long distance). Most fault was arc one-ground fault which is 75% over [1]. so most study focused with it. In this paper, the numerical algorithm has calculated to distance for ground fault and line-line fault. In this paper, the algorithm is given with/without shunt capacitance using II parameter line model, simple impedance model and estimated using DFT(Discrete Fourier Transform) and the LES(Least Error Squares Method). To verify the validity of the proposed algorithm, the EMTP(Electro- Magnetic Transient Program) and MATLAB did used.

A NUMERICAL ALGORITHM FOR SINGULAR MULTI-POINT BVPS USING THE REPRODUCING KERNEL METHOD

  • Jia, Yuntao;Lin, Yingzhen
    • The Pure and Applied Mathematics
    • /
    • v.21 no.1
    • /
    • pp.51-60
    • /
    • 2014
  • In this paper, we construct a complex reproducing kernel space for singular multi-point BVPs, and skillfully obtain reproducing kernel expressions. Then, we transform the problem into an equivalent operator equation, and give a numerical algorithm to provide the approximate solution. The uniform convergence of this algorithm is proved, and complexity analysis is done. Lastly, we show the validity and feasibility of the numerical algorithm by two numerical examples.

2-D Consolidation Numerical Analysis of Multi_Layered Soils (II) (다층 지반의 2차원 압밀 수치해석 II)

  • 류권일;김팔규;구기욱;남상규
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2000.11a
    • /
    • pp.665-672
    • /
    • 2000
  • The problems of discontinuous layer interface are very important in the algorithm and programming for the analysis of multi-layered consolidation using a numerical analysis, finite difference method(F.D,M.). Better results can be obtained by the process for discontinuous layer interface, since it can help consolidation analysis to model the actual ground Explicit method is simple for analysis algorithm and convenient for use except for applying the operator Crank-Nicolson method represents implicit method, which have different analysis method according to weighting factor. This method uses different algorithm according to dimension. And, this paper uses alternative direction implicit method. The purpose of this paper provides an efficient computer algorithm based on numerical analysis using finite difference method which account for multi-layered soils with confined aquifer to determine the degree of consolidation and excess pore pressures relative to time and positions more realistically.

  • PDF

Extension of Incompressible Flow Solver Algorithm to Analyze Compressible Flowfield (비압축성 유동해석 알고리듬 확장을 통한 압축성 유동장 해석)

  • Lim, Yeong-Taek;Kim, Moon-Sang
    • Journal of Aerospace System Engineering
    • /
    • v.2 no.2
    • /
    • pp.20-27
    • /
    • 2008
  • The characteristics of compressible flow are different from those of incompressible flow from the mathematical and physical point of view. Therefore, the way to solve the flowfield is different between compressible flow and incompressible flow. In general, density-based numerical algorithm is mainly used for compressible flow solver development. On the other hand, incompressible flow solver prefers to use pressure-based numerical algorithm. In this research, a compressible Navier-Stokes flow solver is developed by means of extending from pressure-based incompressible numerical algorithm to handle both compressible and incompressible flows using the same flow solver. The present flow solver is tested at various speed ranges and compared with the solutions of density-based compressible flow solver. Numerical results show a good agreement between two flow solvers.

  • PDF

Numerical Algorithm for Distance Protection and Arcing Fault Recognitior (고장거리계산과 아크고장 판별 알고리즘)

  • Radojevic, Zoran;Park, K.W.;Park, J.S.
    • Proceedings of the KIEE Conference
    • /
    • 2002.07a
    • /
    • pp.163-165
    • /
    • 2002
  • In this paper a new numerical algorithm for fault distance calculation and arcing fault recognition based on one terminal data and derived in lime domain is presented. The algorithm is derived for the case of most frequent single-phase line to ground fault. The faulted phase voltage at the fault place is modeled as a serial connection of fault resistance and arc voltage. The fault distance and arc voltage amplitude are estimated using Least Error Squares Technique. The algorithm can be applied for distance protection, intelligent autoreclosure and for fault location. The results of algorithm tested through computer simulation are given.

  • PDF

Numerical Algorithm for Power Transformer Protection

  • Park, Chul-Won;Suh, Hee-Seok;Shin, Myong-Chul
    • KIEE International Transactions on Power Engineering
    • /
    • v.4A no.3
    • /
    • pp.146-151
    • /
    • 2004
  • The most widely used primary protection for the internal fault detection of the power transformer is current ratio differential relaying (CRDR) with harmonic restraint. However, the second harmonic component could be decreased by magnetizing inrush when there have been changes to the material of the iron core or its design methodology. The higher the capacitance of the high voltage status and underground distribution, the more the differential current includes the second harmonic during the occurrence of an internal fault. Therefore, the conventional second harmonic restraint CRDR must be modified. This paper proposes a numerical algorithm for enhanced power transformer protection. This algorithm enables a clear distinction regarding internal faults as well as magnetizing inrush and steady state. It does this by analyzing the RMS fluctuation of terminal voltage, instantaneous value of the differential current, RMS changes, harmonic component analysis of differential current, and analysis of flux-differential slope characteristics. Based on the results of testing with WatATP99 simulation data, the proposed algorithm demonstrated more rapid and reliable performance.

Comprehensive studies of Grassmann manifold optimization and sequential candidate set algorithm in a principal fitted component model

  • Chaeyoung, Lee;Jae Keun, Yoo
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.6
    • /
    • pp.721-733
    • /
    • 2022
  • In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

A Numerical Algorithm for Fault Location Estimation and Arc Faults Detection for Auto-Reclosure (자동 재폐로기의 동작책무를 위한 아크전압 판정 및 사고거리 표정 알고리즘)

  • Kim, Byeong-Man;Chae, Myeong-Suk;Zheng, Tai-Ying;Kang, Yong-Cheol
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.7
    • /
    • pp.1294-1303
    • /
    • 2009
  • This paper presents a new numerical algorithm for fault discrimination and fault location estimation when occur to arcing ground and arcing line to line on transmission lines. The object of this paper is developed from new numerical algorithm to calculate the fault distance and simultaneously to make a distinction between transient and permanent faults. so the first of object for propose algorithm would be distinguish the permanent from the transient faults. This arcing fault discrimination algorithm is used if calculated value of arc voltage amplitude is greater than product of arc voltage gradient and the length of the arc path, which is equal or greater than the flashover length of a suspension insulator string[1-3]. Also, each algorithm is separated from short distance and long distance. This is difference to with/without capacitance between short to long distance. To test the validity of the proposed algorithms, the results of algorithm testing through various computer simulations are given. The test was simulated in EMTP/ATP simulator under a number of scenarios and calculate of algorithm was used to MATLAB.

A SELF SCALING MULTI-STEP RANK ONE PATTERN SEARCH ALGORITHM

  • Moghrabi, Issam A.R.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.15 no.4
    • /
    • pp.267-275
    • /
    • 2011
  • This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.

Optimization for PSC Box Girder Bridges Using Design Sensitivity Analysis (설계 민감도 해석을 이용한 PSC 박스거더교의 최적설계)

  • 조선규;조효남;민대홍;이광민;김환기
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2000.10a
    • /
    • pp.205-210
    • /
    • 2000
  • An optimum design algorithm of PSC box girder bridges using design sensitivity analysis is proposed in this paper. For the efficiency of the proposed algorithm, approximated reanalysis techniques using design sensitivity analysis are introduced. And also to save the numerical efforts, an efficient reanalysis technique through approximated structural responses is proposed. A design sensitivity analysis of structural response is executed by automatic differentiation(AD). The efficiency and robustness of the proposed algorithm, compared with conventional algorithm, is successfully demonstrated in the numerical example.

  • PDF