File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이덕중

Lee, Deokjung
Computational Reactor physics & Experiment Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Convergence analysis of two-node CMFD method for two-group neutron diffusion eigenvalue problem

Author(s)
Jeong, YongjinPark, JinsuLee, Hyun ChulLee, Deokjung
Issued Date
2015-12
DOI
10.1016/j.jcp.2015.09.004
URI
https://scholarworks.unist.ac.kr/handle/201301/17642
Fulltext
http://www.sciencedirect.com/science/article/pii/S0021999115005847
Citation
JOURNAL OF COMPUTATIONAL PHYSICS, v.302, pp.239 - 250
Abstract
In this paper, the nonlinear coarse-mesh finite difference method with two-node local problem (CMFD2N) is proven to be unconditionally stable for neutron diffusion eigenvalue problems. The explicit current correction factor (CCF) is derived based on the two-node analytic nodal method (ANM2N), and a Fourier stability analysis is applied to the linearized algorithm. It is shown that the analytic convergence rate obtained by the Fourier analysis compares very well with the numerically measured convergence rate. It is also shown that the theoretical convergence rate is only governed by the converged second harmonic buckling and the mesh size. It is also noted that the convergence rate of the CCF of the CMFD2N algorithm is dependent on the mesh size, but not on the total problem size. This is contrary to expectation for eigenvalue problem. The novel points of this paper are the analytical derivation of the convergence rate of the CMFD2N algorithm for eigenvalue problem, and the convergence analysis based on the analytic derivations.
Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
ISSN
0021-9991
Keyword (Author)
Two-node CMFDTwo-node ANMConvergence analysis
Keyword
FINITE-DIFFERENCE METHODNODAL METHOD

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.