Search NASA⌕ Search

SEARCH · Search NASA

Results for “rational approximations”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Global error analysis of the Chebyshev rational approximation method

The Chebyshev rational approximation method (CRAM) has become a widely adopted method for solving nuclear depletion problems. Therefore, understanding CRAM’s accuracy is important for the safe operation of nuclear power plants. This article performs a global error analysis of CRAM and finds that, as the length of the time step approaches zero, the relative error measured between the exact and CRAM solutions at a fixed end time approaches one and infinity for even and odd orders, respectively; for intermediate time step sizes, a minimum in relative error is observed. Finally, we show that the reason for CRAM’s behavior is that the method is inconsistent. Two best practices for using CRAM, derived from these results, are: (1) use CRAM order 16 or higher, (2) if necessary, increase the CRAM order when multiphysics coupling requires smaller time steps.

97 MATHEMATICS AND COMPUTING↗

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗

An efficient implementation of the Chebyshev Rational Approximation Method (CRAM) for solving the burnup equations

The Chebyshev Rational Approximation Method (CRAM) has been recently introduced by the authors for solving the burnup equations with excellent results. 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 only requires 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 considering 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 over 1600 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Monte Carlo turbulence simulation using rational approximations to von Karman spectra

Turbulence simulation is computationally much simpler using rational spectra, but turbulence falls off as f exp -5/3 in frequency ranges of interest to aircraft response and as predicted by von Karman's model. Rational approximations to von Karman spectra should satisfy three requirements: (1) the rational spectra should provide a good approximation to the von Karman spectra in the frequency range of interest; (2) for stability, the resulting rational transfer function should have all its poles in the left half-plane; and (3) at high frequencies, the rational spectra must fall off as an integer power of frequency, and since the -2 power is closest to the -5/3 power, the rational approximation should roll off as the -2 power at high frequencies. Rational approximations to von Karman spectra that satisfy these three criteria are presented, along with spectra from simulated turbulence. Agreement between the spectra of the simulated turbulence and von Karman spectra is excellent.

Campbell, C. W.↗

Direct and inverse theorems of rational approximation in the Bergman space

For positive numbers p and {mu} let A{sub p,{mu}} denote the Bergman space of analytic functions in the half-plane {Pi}:={l_brace}z element of C:Imz>0{r_brace}. For f element of A{sub p,{mu}} let R{sub n} (f){sub p,{mu}} be the best approximation by rational functions of degree at most n. Also let {alpha} element of R and {tau}>0 be numbers such that {alpha}+{mu}=1/{tau}-1/p and 1/p+{mu} not element of N. Then the main result of the paper claims that the set of functions f element of A{sub p,{mu}} such that {Sigma}{sub n=1}{sup {infinity}} 1/n (n{sup {alpha}}+{mu}R{sub n} (f){sub p,{mu}}){sup {tau}}<{infinity} is precisely the Besov space B{sub {tau}}{sup {alpha}} of analytic functions in {Pi}. Bibliography: 23 titles.

97 MATHEMATICS AND COMPUTING↗

Improving the Accuracy of the Chebyshev Rational Approximation Method Using Substeps

The Chebyshev Rational Approximation Method (CRAM) for solving the decay and depletion of nuclides is shown to have a remarkable decrease in error when advancing the system with the same time step and microscopic reaction rates as the previous step. This property is exploited here to achieve high accuracy in any end-of-step solution by dividing a step into equidistant sub-steps. The computational cost of identical substeps can be reduced significantly below that of an equal number of regular steps, as the LU decompositions for the linear solves required in CRAM only need to be formed on the first substep. The improved accuracy provided by substeps is most relevant in decay calculations, where there have previously been concerns about the accuracy and generality of CRAM. Lastly, with substeps, CRAM can solve any decay or depletion problem with constant microscopic reaction rates to an extremely high accuracy for all nuclides with concentrations above an arbitrary limit.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Minimax rational approximation of the Fermi-Dirac distribution

Accurate rational approximations of the Fermi-Dirac distribution are a useful component in many numerical algorithms for electronic structure calculations. The best known approximations use O(log(βΔ)log(ϵ –1 )) poles to achieve an error tolerance ϵ at temperature β –1 over an energy interval Δ. We apply minimax approximation to reduce the number of poles by a factor of four and replace Δ with Δ occ , the occupied energy interval. Furthermore, this is particularly beneficial when Δ >> Δ occ , such as in electronic structure calculations that use a large basis set.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rational approximations from power series of vector-valued meromorphic functions

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Sidi, Avram↗

Accuracy considerations for Chebyshev rational approximation method (CRAM) in Burnup calculations

The burnup equations can in principle be solved by computing the exponential of the burnup matrix. However, due to the difficult numerical characteristics of burnup matrices, the problem is extremely stiff and the matrix exponential solution has previously been considered infeasible for an entire burnup system containing over a thousand nuclides. It was recently discovered by the author that the eigenvalues of burnup matrices are generally located near the negative real axis, which prompted introducing the Chebyshev rational approximation method (CRAM) for solving the burnup equations. CRAM can be characterized as the best rational approximation on the negative real axis and it has been shown to be capable of simultaneously solving an entire burnup system both accurately and efficiently. In this paper, the accuracy of CRAM is further studied in the context of burnup equations. The approximation error is analyzed based on the eigenvalue decomposition of the burnup matrix. It is deduced that the relative accuracy of CRAM may be compromised if a nuclide concentration diminishes significantly during the considered time step. Numerical results are presented for two test cases, the first one representing a small burnup system with 36 nuclides and the second one a full a decay system with 1531 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗