SEARCH · Search NASA
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.
Here, the Chebyshev Rational Approximation Method (CRAM) algorithm has become the method of choice for modern nuclear depletion calculations. A simple modification of the CRAM yields not only depleted nuclide amounts but also time-averaged nuclide amounts, with little additional calculation cost.
In this study, we present a spectral scheme for atomic structure calculations in pseudopotential Kohn-Sham density functional theory. In particular, after applying an exponential transformation of the radial coordinates, we employ global polynomial interpolation on a Chebyshev grid, with derivative operators approximated using the Chebyshev differentiation matrix, and integrations using Clenshaw-Curtis quadrature. We demonstrate the accuracy and efficiency of the scheme through spin-polarized and unpolarized calculations for representative atoms, while considering local, semilocal, and hybrid exchange-correlation functionals. In particular, we find that $\mathcal{O}$(200) grid points are sufficient to achieve an accuracy of 1 microhartree in the eigenvalues for optimized norm conserving Vanderbilt pseudopotentials spanning the periodic table from atomic number Ζ = 1 to 83.
This module (pyDecay) implements a Chebyshev Rational Approximation Method (CRAM) for solving isotope decay equations, based on the work of M. Pusa. It provides a numerically stable and efficient method for evaluating the matrix exponential involved in nuclear decay calculations. This implementation of CRAM relies on the incomplete partial factorization (IPF) algorithm published by Pusa [3], with corrections noted by Romano et al.
The mixed boundary value problem of a tubular conductor is solved using an approximate representation of its Fourier coefficients. A two term solution is derived, which represents the solution over an extremely broad range of aspect ratios. This representation is used to find the electrostatic solution and capacitance of a charged tube as well as the solution of a tube in a uniform field and its dipole moment. This second case is directly useful as a model for a monopole electric field probe. This approximation is a special case of a representation using a combination of Chebyshev and Legendre polynomials. Combining the charged tube and tube in a uniform field allows the solution of voltage driven tubular antennas. Comparisons are made with numerical solutions using piecewise sinusoidal representations of the current. The results are also generalized to the dynamic case and up to and beyond the first resonance. Simple corrections for finite gap and delta gap drives to magnetic frill drives are examined using infinite tube integral transform representations. Corrections between magnetic frill drives and coaxial drives are also given. Approximate drive corrections using conformal mapping and an effective radius are also discussed. Finally, this efficient current representation is applied to the magnetic problem involving simple tubular solenoids.
The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.
The increasing penetration of distributed energy resources (DERs) is significantly reshaping the role of distribution systems under active energy management. To aggregate the active-reactive power flexibility of DERs dispersed at the feeder and provide capacity support to the transmission system, it is essential to efficiently identify feasible substation power injection trajectories. This paper introduces a novel ahead-of-time flexibility characterization method to address it. First, a polyhedral non-feeder-level power flexibility region (PFR) is constructed, accounting for various time-dependent, power-coupled, and forecast error uncertainties. Then, a polyhedral feeder-level PFR is analytically derived through a coordinate transformation, which can reveal the uncertainty propagation path, i.e., how uncertainty applies to the feeder-level PFR. To facilitate the high-level application, a tractable chance-constrained Chebyshev centering optimization model is further developed to find a ball-shaped inner approximation of the feeder-level PFR. Finally, the proposed method is validated on a modified IEEE 123-bus test system. Here, both theoretical and experimental results show that, with appropriate robustness parameter settings, the proposed method can make the approximated PFR less conservative with abundant robustness against forecast error uncertainty.
Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .
Uncertainty quantification (UQ) plays a pivotal role in scientific machine learning, especially when surrogate models are used to approximate complex systems. Although multilayer perceptions (MLPs) are commonly employed as surrogates, they often suffer from overfitting due to their large number of parameters. Kolmogorov-Arnold networks (KANs) offer an alternative solution with fewer parameters. However, gradient-based inference methods, such as Hamiltonian Monte Carlo (HMC), may result in computational inefficiency when applied to KANs, especially for large-scale datasets, due to the high cost of back-propagation. To address these challenges, we propose a novel approach, combining the dropout Tikhonov ensemble Kalman inversion (DTEKI) with Chebyshev KANs. This gradient-free method effectively mitigates overfitting and enhances numerical stability. In addition, we incorporate the active subspace method to reduce the parameter-space dimensionality, allowing us to improve the accuracy of predictions and obtain more reliable uncertainty estimates. Extensive experiments demonstrate the efficacy of our approach in various test cases, including scenarios with large datasets and high noise levels. Our results show that the new method achieves comparable or better accuracy, much higher efficiency as well as stability compared to HMC, in addition to scalability. Moreover, by leveraging the low-dimensional parameter subspace, our method preserves prediction accuracy while substantially reducing further the computational cost.