Solving Linear Systems with Sparse Gaussian Elimination in the Chebyshev Rational Approximation Method
Authors:
- 1 November 2013
- journal article
- research article
- Published by Taylor & Francis in Nuclear Science and Engineering
- Vol. 175 (3) , 250-258
Abstract
The Chebyshev Rational Approximation Method (CRAM) has recently been introduced by the authors to solve burnup equations, and the results have been excellent. This method has been shown to be capable of simultaneously solving an entire burnup system with thousands of nuclides both accurately and efficiently. The method was prompted by an analysis of the spectral properties of burnup matrices, and it can be characterized as the best rational approximation on the negative real axis. The coefficients of the rational approximation are fixed and have been reported for various approximation orders. In addition to these coefficients, implementing the method requires only a linear solver. This paper describes an efficient method for solving the linear systems associated with the CRAM approximation. The introduced direct method is based on sparse Gaussian elimination, where the sparsity pattern of the resulting upper triangular matrix is determined before the numerical elimination phase. The stability of t...Keywords
This publication has 5 references indexed in Scilit:
- Rational Approximations to the Matrix Exponential in Burnup CalculationsNuclear Science and Engineering, 2011
- Comparison of depletion algorithms for large systems of nuclidesAnnals of Nuclear Energy, 2011
- Computing the Matrix Exponential in Burnup CalculationsNuclear Science and Engineering, 2010
- Numerical Linear Algebra1997
- Algorithmic Aspects of Vertex Elimination on Directed GraphsSIAM Journal on Applied Mathematics, 1978