• Nuclear Engineering and Technology
• /
• 제54권8호
• /
• pp.3059-3072
• /
• 2022

A Jacobian-Free Newton Krylov Two-Nodal Coarse Mesh Finite Difference algorithm based on Nodal Expansion Method (NEM_TNCMFD_JFNK) is successfully developed and proposed to solve the three-dimensional (3D) and multi-group reactor physics models. In the NEM_TNCMFD_JFNK method, the efficient JFNK method with the Modified Incomplete LU (MILU) preconditioner is integrated and applied into the discrete systems of the NEM-based two-node CMFD method by constructing the residual functions of only the nodal average fluxes and the eigenvalue. All the nonlinear corrective nodal coupling coefficients are updated on the basis of two-nodal NEM formulation including the discontinuity factor in every few newton steps. All the expansion coefficients and interface currents of the two-node NEM need not be chosen as the solution variables to evaluate the residual functions of the NEM_TNCMFD_JFNK method, therefore, the NEM_TNCMFD_JFNK method can greatly reduce the number of solution variables and the computational cost compared with the JFNK based on the conventional NEM. Finally the NEM_TNCMFD_JFNK code is developed and then analyzed by simulating the representative PWR MOX/UO₂ core benchmark, the popular NEACRP 3D core benchmark and the complicated full-core pin-by-pin homogenous core model. Numerical solutions show that the proposed NEM_TNCMFD_JFNK method with the MILU preconditioner has the good numerical accuracy and can obtain higher computational efficiency than the NEM-based two-node CMFD algorithm with the power method in the outer iteration and the Krylov method using the MILU preconditioner in the inner iteration, which indicates the NEM_TNCMFD_JFNK method can serve as a potential and efficient numerical tool for reactor neutron diffusion analysis module in the JFNK-based multiphysics coupling application.

• 한국음향학회지
• /
• 제26권1호
• /
• pp.48-54
• /
• 2007

본 논문에서는 수중에서 이동체의 3차원 위치를 추정하기 위한 위치추적 시스템을 구현하였다. 본 연구에서는 네 개의 초음파 센서를 수중의 서로 다른 위치에 고정시키고, 이동중인 이동체 센서와 서로 다른 신호를 송 수신하게 함으로써 고정체와 이동체 모두에서 이동체의 3차원 위치 추적과 이동체의 원격제어를 가능하게 하였다. 또한 위치 추적 시에 Newton 알고리즘에서 매 iteration 시에 Jacobian 행렬의 norm을 추정하고, 행렬의 norm이 임계값 이상이 되어 역행렬에 의한 해가 불안정해질 때는 또 다른 초기값을 이용하여 해를 구하게 함으로써 이동체의 위치가 보다 신뢰성 있게 추정되게 하였다. 그리고 제안한 알고리즘을 이용하여 실시간 위치 추적이 가능한 위치 추적 DSP 시스템을 구현하였으며, 성능 검증을 위한 수조 실험을 수행하였다. 성능 검증결과 본 연구에서 구현한 위치 추적 시스템은 1초에 2회 이상의 속도로 오차율 5cm 이내에서 이동체의 위치를 추적함을 알 수 있었다.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권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.

• 대한전자공학회논문지
• /
• 제26권1호
• /
• pp.122-128
• /
• 1989

본 논문에서는 회로해석 중에서 DC및 과도(transient)해석에 필요한 비선형 대수 방정식을 풀기 위한 새로운 방법으로서 Quadratic Newton Raphson Method(QNRM)을 제안한다. QNRM은 Newtok-Raphson method(NRM)에 기본을 두고 있지만, 비선형 대수 방정식의 Taylor 급수 전개에서 2차 미분항을 포함한다. 각 반복 과정에서 미지수에 관한 2차식이 되는데 해를 예측함으로서 선형화 할 수 있다. QNRM의 수렴속도를 올리기 위해서는 이 해의 정확한 예측이 매우 중요하명 그 한 방법을 제시하였다. QNRM을 DC및 과도해석에 적용한 결과 NRM을 사용한 것보다 계산시간 및 반복횟우에 있어서 25% 이상 감소됨을 보여주었다.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.395-411
• /
• 2012

Several methods with order higher than that of Newton methods which are of order 2 have been reported in literature for solving nonlinear equations. The focus of most of these methods was to economize on/minimize the number of function evaluations per iterations. We have demonstrated here that there are several computational pit-falls, such as the violation of fixed-point theorem, that one could encounter while using these methods. Further it was also shown that the overall computational complexity could be more in these high-order methods than that in the second-order Newton method.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1511-1523
• /
• 2011

In this paper, we consider the smoothing Newton method for the nonlinear complementarity problems with $P_0$-function. The proposed algorithm is based on a new smoothing function and it needs only to solve one linear system of equations and perform one line search per iteration. Under the condition that the solution set is nonempty and bounded, the proposed algorithm is proved to be convergent globally. Furthermore, the local superlinearly(quadratic) convergence is established under suitable conditions. Preliminary numerical results show that the proposed algorithm is very promising.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권1호
• /
• pp.71-79
• /
• 1999

We consider multi-step quasi-Newton methods for unconstrained optimization. These methods were introduced by Ford and Moghrabi [1, 2], who showed how interpolating curves could be used to derive a generalization of the Secant Equation (the relation normally employed in the construction of quasi-Newton methods). One of the most successful of these multi-step methods makes use of the current approximation to the Hessian to determine the parameterization of the interpolating curve in the variable-space and, hence, the generalized updating formula. In this paper, we investigate new parameterization techniques to the approximate Hessian, in an attempt to determine a better Hessian approximation at each iteration and, thus, improve the numerical performance of such algorithms.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2006년도 추계학술대회 논문집
• /
• pp.85-86
• /
• 2006

• KIEE International Transactions on Electrophysics and Applications
• /
• 제3C권5호
• /
• pp.199-206
• /
• 2003

Numerical solutions to complex characteristic equations are quite often required to solve electromagnetic wave problems. In general, two traditional complex root search algorithms, the Newton-Raphson method and the Muller method, are used to produce such solutions. However, when utilizing these two methods, the choice of the initial iteration value is very sensitive, otherwise, the iteration can fail to converge into a solution. Thus, as an alternative approach, where the selection of the initial iteration value is more relaxed and the computation speed is high, Davidenko's method is used to determine accurate complex propagation constants for leaky circular symmetric modes in circular dielectric rod waveguides. Based on a precise determination of the complex propagation constants, the leaky mode characteristics of several lower-order circular symmetric modes are then numerically analyzed. In addition, no modification of the characteristic equation is required for the application of Davidenko's method.

• 대한수학회지
• /
• 제50권5호
• /
• pp.1129-1163
• /
• 2013

Based on finite element discretization, two linearization approaches to the defect-correction method for the steady incompressible Navier-Stokes equations are discussed and investigated. By applying $m$ times of Newton and Picard iterations to solve an artificial viscosity stabilized nonlinear Navier-Stokes problem, respectively, and then correcting the solution by solving a linear problem, two linearized defect-correction algorithms are proposed and analyzed. Error estimates with respect to the mesh size $h$, the kinematic viscosity ${\nu}$, the stability factor ${\alpha}$ and the number of nonlinear iterations $m$ for the discrete solution are derived for the linearized one-step defect-correction algorithms. Efficient stopping criteria for the nonlinear iterations are derived. The influence of the linearizations on the accuracy of the approximate solutions are also investigated. Finally, numerical experiments on a problem with known analytical solution, the lid-driven cavity flow, and the flow over a backward-facing step are performed to verify the theoretical results and demonstrate the effectiveness of the proposed defect-correction algorithms.