Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Solving eigenvalue response matrix equations with nonlinear techniques

Solving eigenvalue response matrix equations with nonlinear techniques

Thumbnail Image
Download
Name

ANUCENE-D-13-00770R1-1.pdf

Size

431.92 KB

Format

Adobe PDF

Checksum (MD5)

c178ea982a0c5644d9c8c6459f442da1

Author(s)
Roberts, Jeremy Alyn
•
Forget, Benoit Robert Yves
Date Issued
February 2014
Journal
Annals of Nuclear Energy
Publisher
Elsevier
Citation
Roberts, Jeremy A., and Benoit Forget. “Solving Eigenvalue Response Matrix Equations with Nonlinear Techniques.” Annals of Nuclear Energy 69 (July 2014): 97–107.
Version
Author's final manuscript
Abstract
This paper presents new algorithms for use in the eigenvalue response matrix method (ERMM) for reactor eigenvalue problems. ERMM spatially decomposes a domain into independent nodes linked via boundary conditions approximated as truncated orthogonal expansions, the coefficients of which are response functions. In its simplest form, ERMM consists of a two-level eigenproblem: an outer Picard iteration updates the k -eigenvalue via balance, while the inner λλ-eigenproblem imposes neutron balance between nodes. Efficient methods are developed for solving the inner λλ-eigenvalue problem within the outer Picard iteration. Based on results from several diffusion and transport benchmark models, it was found that the Krylov–Schur method applied to the λλ-eigenvalue problem reduces Picard solver times (excluding response generation) by a factor of 2–5. Furthermore, alternative methods, including Picard acceleration schemes, Steffensen’s method, and Newton’s method, are developed in this paper. These approaches often yield faster k-convergence and a need for fewer k-dependent response function evaluations, which is important because response generation is often the primary cost for problems using responses computed online (i.e., not from a precomputed database). Accelerated Picard iteration was found to reduce total computational times by 2–3 compared to the unaccelerated case for problems dominated by response generation. In addition, Newton’s method was found to provide nearly the same performance with improved robustness.
MIT Department
Massachusetts Institute of Technology. Department of Nuclear Science and Engineering
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/108255
DOI of Published Version
https://doi.org/10.1016/j.anucene.2014.02.002
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.