• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1081-1087
• /
• 1999

Load Flow calulation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning. operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to slove load flow equation and to modify above defects. And it preserve P-Q bus part of Jacobian matrix to shorten computing time. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical results and the same numbers of iteration obtained by Newton-Raphson method. The effect of computing time reduction showed about 28% , 30% , at each case of 39 bus, 118 bus system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1402-1413
• /
• 2004

In non-rigid image registration, the Jacobian determinant of the estimated deformation should be positive everywhere since physical deformations are always invertible. We propose a constrained optimization technique at ensures the positiveness of Jacobian determinant for cubic B-spline based deformation. We derived sufficient conditions for positive Jacobian determinant by bounding the differences of consecutive coefficients. The parameter set that satisfies the conditions is convex; it is the intersection of simple half spaces. We solve the optimization problem using a gradient projection method with Dykstra's cyclic projection algorithm. Analytical results, simulations and experimental results with inhale/exhale CT images with comparison to other methods are presented.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.11a
• /
• pp.115-119
• /
• 2009

We numerically investigated propagation of various waves in the two-phase flows such as sound wave, shock wave, rarefaction wave, and contact discontinuity in terms of pressure, void fraction, velocity and density of the two phases. The waves have been generated by a hydrodynamic shock tube, a pair of symmetric impulsive expansion, impulsive pressure and impulsive void waves. The six compressible two-fluid two-phase conservation laws with interfacial friction terms have been solved in two fractional steps. The first PDE Operator is solved by the HLL scheme and the second Source Operator by the semi-implicit stiff ODE solver. In the HLL scheme, the fastest wave speeds were estimated by the analytic eigenvalues of an approximate Jacobian matrix. We have discussed how the interfacial friction terms affect the wave structures in the numerical solution.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.183-186
• /
• 2005

We developed an upwind numerical formulation based on the eigenvalues of the approximate Jacobian matrix in order to solve the hyperbolic conservation laws governing the two-fluid two-phase flow models. We obtained eight analytic eigenvalues in the two dimensions that can be used for estimate of the wave speeds essential in constructing an upwind numerical method. Two-dimensional underwater cavitation in a flow past structural shapes or by underwater explosion can be solved using this method. We present quantitative prediction of cavitation for the water tunnel wall and airfoils that has both experimental data as well as numerical results by other numerical methods and models.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.248-250
• /
• 1999

본 논문에서 제안된 조류계산 알고리즘은 Jacobian의 off-diagonal 부 행렬을 완전히 무시하는 Decoupled Load Flow(DCL) 알고리즘들의 유연한 대안으로 반복(iteration)당 최소한의 추가 계산 부담으로 Jacobian의 off-diagonal 부분의 효과를 부분적으로 반영함에 의해 수렴 특성을 향상시킬 수 있다. 제안된 방법들은 특히 Fast Decoupled Load Flow(FDL)로 대표되는 DCL들의 수렴특성이 불안정해질 경우, 효과적으로 수렴특성을 향상시킬 수 있다. 제안된 알고리즘들은 Newton-Raphson Load Flow(NRL) 방법에서 Jacobian의 off-diagonal 부분의 효과를 점진적으로 제거하는 방법으로 유도하였고, 간략화 과정에서는 Neuman series expansion을 사용하였다. 실험결과 제안된 알고리즘들은 반복횟수와 전반적인 수렴 속도에서 확실한 성능향상을 보여주었다. 제안된 알고리즘들은 특히 DCL의 수렴성능이 문제가 있을 시 full NRL 대신에 적용할 수 있는 가능성이 있어 조류계산 시간을 단축해 줄 수 있을 것으로 기대된다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.2
• /
• pp.189-196
• /
• 1994

This paper describes a parallel computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method develops the parallelism in the Gauss elimination by using ND(nested dissection) ordering. In this procedure the level structure of the power system network is transformed to be long and narrow by using end buses which results in balance of computing load among processes and maximization of parallel computation. Each processor uses the sequential computation method to preserve the sqarsity of matrix.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.163-166
• /
• 1993

This paper describes an parallell computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method using ND(nested dissection) ordering develops the parallelism in the Gauss elimination to have balance of computing load among processes and each processor uses the sequential computation method to preserve the sparsity of matrix.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.343-345
• /
• 2002

본 논문은 차원이 큰 행렬 연산 때문에 많은 계산 시간을 필요로 하는 ET 영상 복원 응용의 속도를 개선하기 위하여 3 대의 PC로 구성된 클러스터를 구축하고 복원 과정 중 가장 많은 시간을 차지하는 자코비언 행렬 계산에 대해 병렬 계산 기법을 제시한다. 각 노드는 리눅스 운영체제, MPI, 산술 계산 라이브러리 등을 탑재하여 C 언어로 옹용이 작성될 수 있으며 자코비언 행렬은 각 계산 루프의 데이터 독립성이 강하므로 병렬 계산의 장점을 최대화 할 수 있다. 구현된 클러스터 자코비언 프로그램은 주어진 인자를 분석하여 MPI 프리미티브에 의해 각각의 노드에 분배시키고 각 노드들로 하여금 자신의 계산 라이브러리를 이용하여 계산하게 한 다음 이 부분 결과를 모아 최종적인 자코비언 행렬을 생성한다. 이 프로그램을 클러스터에서 수행시키고 그 수행시간을 측정한 결과 기존의 자코비언 프로그램에 비해 최대 40% 까지 수행시간을 단축시킬 수 있었으며 추후 행렬의 차원이 증가할 경우 클러스터 컴퓨팅에 의한 성능 개선을 기할 수 있다.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.311-315
• /
• 1998

Load Flow calculation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning, operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to solve load flow equation and to modify above defects. And it preserve certain part of Jacobian matrix to shorten the time of calculation. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical result and the number of iteration got by Newton-Raphson method. The effect of time reduction showed about 28%, 30%, at each case of 39 bus, 118 bus system.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.170-176
• /
• 1998

In this paper, the column space and null space of the Jacobian matrix were obtained by using the pseudo-inverse method and projection matrix. The equations of motion of the system were replaced by independent acceleration components using the null space matrix. The proposed method has the following advantages. (1) It is simple to derive the null space. (2) The efficiency is improved by getting rid of constrained force terms. (3) Neither null space updating nor coordinate partitioning method is required. The suggested algorithm is applied to a three-dimensional vehicle model to show the efficiency.