A JACOBIAN-FREE NEWTON-KRYLOV ITERATIVE SCHEME FOR CRITICALITY CALCULATIONS BASED ON THE NEUTRON DIFFUSION EQUATION

Newton-Krylov methods, primarily using the Jacobian-Free Newton-Krylov (JFNK) approximation, are examined as an alternative to the traditional power iteration method for the calculation of the fundamental eigenmode in reactor analysis applications based on diffusion theory. One JFNK approach can be considered an acceleration technique for the standard power iteration as it is “wrapped around” the power method, allowing for simplified implementation in preexisting codes. Since the Jacobian is not formed the only extra storage required is associated with the workspace of the Krylov solver used at every Newton step. Another Newton-based method is developed which solves the generalized eigenvalue problem formulation of the k-eigenvalue problem, both using the JFNK approximation and utilizing the action of the true Jacobian matrix. These Newton-based methods were compared to the unaccelerated and Chebyshev-accelerated power method for a number of reactor models. Results show calculation of the fundamental mode using JFNK acceleration of the power method generally results in fewer iterations and shorter run times than when using the unaccelerated and Chebyshev-accelerated power methods. The Newton-based approaches implemented for the solution of the generalized eigenvalue problem formulation of the k-eigenvalue problem are shown to exhibit poor convergence properties for the iterations associated with the linearized Newton step, highlighting the need for an effective preconditioner.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  D. F. Gill,et al.  Jacobian-Free Newton-Krylov as an Alternative to Power Iterations for the k-Eigenvalue Transport Problem , 2009 .

[3]  Gumersindo Verdú,et al.  Variational acceleration for Subspace Iteration Method. Application to nuclear power reactors , 1998 .

[4]  David M. Young,et al.  Applied Iterative Methods , 2004 .

[5]  D. Sorensen The Implicitly Restarted Arnoldi Method , 2006 .

[6]  G. W. Stewart,et al.  Matrix algorithms , 1998 .

[7]  K. L. Derstine,et al.  Optimized iteration strategies and data management considerations for fast reactor finite difference diffusion theory codes , 1977 .

[8]  Richard B. Lehoucq,et al.  Krylov Subspace Iterations for Deterministic k-Eigenvalue Calculations , 2004 .

[9]  J. Duderstadt,et al.  Nuclear reactor analysis , 1976 .

[10]  Harold Greenspan,et al.  Iterative Solution of Elliptic Systems and Application to the Neutron Diffusion Equations of Reactor Physics , 1966 .

[11]  Homer F. Walker,et al.  Choosing the Forcing Terms in an Inexact Newton Method , 1996, SIAM J. Sci. Comput..

[12]  Yousef Saad,et al.  Convergence Theory of Nonlinear Newton-Krylov Algorithms , 1994, SIAM J. Optim..

[13]  Hengbin An,et al.  A choice of forcing terms in inexact Newton method , 2007 .

[14]  D. Keyes,et al.  Jacobian-free Newton-Krylov methods: a survey of approaches and applications , 2004 .

[15]  Gumersindo Verdú,et al.  The implicit restarted Arnoldi method, an efficient alternative to solve the neutron diffusion equation , 1999 .

[16]  Alain Hébert,et al.  Application of the Hermite Method for Finite Element Reactor Calculations , 1985 .

[17]  Mark K. Segar A SLAP for the masses , 1989 .

[18]  Optimal perturbation size for matrix free Newton/Krylov methods , 2007 .