2015
DOI: 10.1016/j.anucene.2015.02.015
|View full text |Cite
|
Sign up to set email alerts
|

Numerical solution of matrix exponential in burn-up equation using mini-max polynomial approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
8
1

Relationship

4
5

Authors

Journals

citations
Cited by 30 publications
(9 citation statements)
references
References 7 publications
0
9
0
Order By: Relevance
“…Nuclides transmutation calculations are carried out with the reference detail chain model or the simplified chain model as mentioned above. Nuclides transmutation equations including adjoint problems in DPT are solved by the matrix exponential method with the mini-max polynomial approximation method [18,19]. For LWR assembly calculations, the predictor-corrector method is employed.…”
Section: Sensitivity Calculations With the Depletion Perturbation Theorymentioning
confidence: 99%
“…Nuclides transmutation calculations are carried out with the reference detail chain model or the simplified chain model as mentioned above. Nuclides transmutation equations including adjoint problems in DPT are solved by the matrix exponential method with the mini-max polynomial approximation method [18,19]. For LWR assembly calculations, the predictor-corrector method is employed.…”
Section: Sensitivity Calculations With the Depletion Perturbation Theorymentioning
confidence: 99%
“…Nuclides depletion equation is solved by the matrix exponential method, and the minimax polynomial approximation method is used to calculate the matrix exponential [11].…”
Section: Numerical Proceduresmentioning
confidence: 99%
“…The Mini-Max Polynomial Approximation (MMPA) method was developed by Yosuke Kawamoto [12] as an alternative to CRAM for solving the Bateman equations. While this method is not as widely adopted as CRAM, it was also implemented in MAMMOTH to serve as a way to verify the results of CRAM.…”
Section: Mini-max Polynomial Approximation Methodsmentioning
confidence: 99%