Solving linear systems with sparse Gaussian elimination in the chebyshev rational approximation method

Maria Pusa, Jaakko Leppänen

    Research output: Contribution to journalArticleScientificpeer-review

    15 Citations (Scopus)

    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 the proposed Gaussian elimination method is discussed based on consideration of the numerical properties of burnup matrices. Suitable algorithms are presented for computing the symbolic factorization and numerical elimination in order to facilitate the implementation of CRAM and its adoption into routine use. The accuracy and efficiency of the described technique are demonstrated by computing the CRAM approximations for a large test case with 1606 nuclides.
    Original languageEnglish
    Pages (from-to)250-258
    Number of pages8
    JournalNuclear Science and Engineering
    Volume175
    Issue number3
    DOIs
    Publication statusPublished - 2013
    MoE publication typeA1 Journal article-refereed

      Fingerprint

    Cite this