2013
DOI: 10.1016/j.jcp.2012.12.024
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear Krylov acceleration applied to a discrete ordinates formulation of the k-eigenvalue problem

Abstract: We compare a variant of Anderson Mixing with the Jacobian-Free Newton-Krylov and Broyden methods applied to an instance of the k-eigenvalue formulation of the linear Boltzmann transport equation. We present evidence that one variant of Anderson Mixing finds solutions in the fewest number of iterations. We examine and strengthen theoretical results of Anderson Mixing applied to linear problems. * Corresponding authorEmail addresses: mcalef@lanl.gov (Matthew T. Calef), efichtl@lanl.gov (Erin D. Fichtl), warsa@la… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 45 publications
(27 citation statements)
references
References 30 publications
(81 reference statements)
0
27
0
Order By: Relevance
“…We use a two-point flux discretization for both the surface and subsurface equations; this choice, while less accurate than some, is strictly monotonicity-preserving, which is critical for accurate and efficient solution of freezing soil dynamics. A Nonlinear Krylov Acceleration method (Calef et al 2013), modified to include significant globalization including backtracking and physics-based strategies, was used to solve the resulting globally-implicit coupled system of equations.…”
Section: Ats Modelmentioning
confidence: 99%
“…We use a two-point flux discretization for both the surface and subsurface equations; this choice, while less accurate than some, is strictly monotonicity-preserving, which is critical for accurate and efficient solution of freezing soil dynamics. A Nonlinear Krylov Acceleration method (Calef et al 2013), modified to include significant globalization including backtracking and physics-based strategies, was used to solve the resulting globally-implicit coupled system of equations.…”
Section: Ats Modelmentioning
confidence: 99%
“…In choosing coefficients ξ j to give the exact solution if the underlying problem were linear, Anderson acceleration functions somewhat like Newton's method, which can jump di-rectly to the solution in a single iteration when applied to a linear problem. 2 While rigorous theoretical results regarding the convergence rate of Anderson acceleration at finite M have not been derived, practical tests shows that the method achieves convergence rates competitive with other Newton-like methods, which are generally super-linear (Calef et al, 2013;Willert et al, 2014).…”
Section: Anderson Accelerationmentioning
confidence: 99%
“…Moreover, for every A, the compatibility inequality is sharp (satisfied as an equality for some x), which characterizes a subordinate matrix norm induced by a compatible vector norm. We shall later encounter compatible vector and matrix norms satisfying (1) - (5) for which (5) may be sharp for some A, but not all A, so the matrix norm is not induced by and subordinate to the vector norm. Finally, we observe the normalization property of a subordinate matrix norm…”
Section: Normsmentioning
confidence: 99%