SEARCH · Engineering Papers
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.
Not Available
The windowed multipole (WMP) formalism was introduced as a way to calculate Doppler broadened cross sections on the fly during Monte Carlo simulations. While more arithmetic is needed compared to point-wise cross section look-ups, performance remained competitive from the large memory reductions and sequential data access. The single most expensive function call in a depleted fuel assembly problem using WMP comes from the evaluation of the Faddeeva function, which previously relied on a highly accurate, highly-branching algorithm. This paper explores the use of rational fraction approximations tailored to the domain interest of reactor physics applications and the development of lower accuracy approximations sufficient for our application. The rational approximations were implemented and tested in OpenMC on an infinite medium problem to stress the cross section calculation routine and a PWR assembly problem. In both cases, the rational approximation nearly eliminated the ∼ 20% penalty previously observed when comparing to point-wise libraries. (authors)
Modeling of power distribution system components that are valid for a wide range of frequencies are crucial for highly accurate modeling of electromagnetic transient (EMT) events. This has recently become of interest due to the improvements needed for the resilient operation of distribution systems. Vector fitting (VF) is a very popular and commonly used algorithm for wide band representations of power system components in EMT simulations. In this research, we present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages with respect to VF using examples of approximations of admittance matrices discussed in the literature. We show that MIAAA not only outperforms VF in terms of achieving better accuracy using lesser number of poles, but also has no numerical issues achieving convergence. In contrast to VF, MIAAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles. The novelty of this research work is the use of recent mathematical results to solve existing challenges in distribution system modeling and to develop rational approximations for power system models that intend to be optimal in terms of accuracy and performance.
This paper presents an extension of the Adaptive-Antoulas-Anderson (AAA) algorithm for rational modelling. Specifically, our new stable multi-input multi-output AAA (smiAAA) algorithm builds rational approximations of multi-input signals with a common set of stable poles. A new methodology is presented for iteratively enforcing stability constraints on the poles. We demonstrate the strengths of this approach compared to the stability enforcement in the FastAAA algorithm. Results using the smiAAA algorithm are compared with the commonly used Vector Fitting algorithm and the more recently published RKFIT algorithm. Vector Fitting and RKFIT both require the user to input the number of poles to use in the approximations. If the final approximation is not accurate enough, the user must re-start Vector Fitting or RKFIT with a larger number of poles and/or a new starting location for the poles. In contrast, the smiAAA algorithm is designed to allow the user to simply input the desired accuracy of the approximations, and the necessary number of poles is detected automatically. This permits users to produce approximations of a desired accuracy with no knowledge about the underlying order of the system being approximated, preventing the algorithm from ever needing to be rerun. An additional feature for preventing extraneous poles from being returned by AAA is also discussed. The cause of these extraneous poles is efficiently detected and removed by our presented methodology. In conclusion, the examples presented demonstrate that smiAAA can efficiently produce approximations of similar or better accuracy than Vector Fitting and RKFIT while requiring less input from the user.
This paper introduces and evaluates the Adding and Doubling Method (ADM) for solving the Bateman equations for depletion systems with varying numbers of nuclides and compares it to the Chebyshev Rational Approximation Method (CRAM), both implemented in the reactor physics analysis application Griffin. ADM, when applied to the Crank-Nicolson Finite Difference method, can produce results comparable in accuracy and precision to CRAM with comparable run times for systems with 35 or 297 nuclides. For systems with more than 300 nuclides, the matrix-matrix operations required by ADM are significantly more costly than the matrix-vector operations required by CRAM, making CRAM the more efficient method for systems with large numbers of nuclides. ADM is an accurate method that maintains other advantages over CRAM in that it does not depend on pre-generated coefficients or require complex number operations. ADM also manages to outperform CRAM by a factor of more than 250 in terms of run time for depletion systems that require multiple Bateman solves while the depletion matrix and time step size remain constant over all depletion intervals.
The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.
Here, this Letter introduces a unified emulation framework for studying continuum physics in finite quantum systems. Using a reduced basis method, we construct powerful emulators for the inhomogeneous Schrödinger equation that operate in a combined parameter space of complex energy (𝐸) and other inputs (𝜽). Within the space, the emulators simultaneously perform analytical continuation in 𝐸—extracting continuum physics from numerically simpler bound-state-like calculations—and interpolate this entire process across 𝜽. This yields a small, non-Hermitian system whose properties (e.g., resonances and scattering observables) can be rapidly predicted for any 𝜽. Crucially, the complex-𝐸 emulation provides a pathway to compute continuum observables for complex systems where advanced bound-state methods exist but direct continuum calculations are yet to be developed, while the 𝜽 emulation enables rapid parameter-space exploration and can be adapted to accelerate other existing continuum calculations. Demonstrations with two- and three-body systems highlight the method’s effectiveness and suggest its connection to (near-)optimal rational approximation. This Letter presents the key results, with further details reserved for a companion paper.
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 rational function approximation provides a natural and interpretable representation of response functions such as the many-body spectral functions. We apply the vector fitting (VFIT) algorithm to fit a variety of spectral functions calculated from the Holstein model of electron-phonon interactions. We show that the resulting rational functions are highly efficient in their fitting of sharp features in the spectral functions, and could provide a means to infer physically relevant information from a spectral data set. The position of the peaks in the approximated spectral function are determined by the location of poles in the complex plane. Additionally, we developed a variant of VFIT that incorporates regularization to improve the quality of fits. With this procedure, we demonstrate it is possible to achieve accurate spectral function fits that vary smoothly as a function of physical conditions.
Not Available
Here, we study the energetics of quasiparticle excitations in CsPbBr 3 perovskite nanocrystals using path integral molecular dynamics simulations. Employing detailed molecular models, we elucidate the interplay of anharmonic lattice degrees of freedom, dielectric confinement, and electronic correlation on exciton and biexciton binding energies of a range of nanocrystal sizes. We find generally good agreement with some experimental observations of binding energies and additionally explain the observed size-dependent Stokes shift. The explicit model calculations are compared with simplified approximations to rationalize the lattice contributions to binding. We find that polaron formation significantly reduces exciton binding energies, whereas these effects are negligible for biexciton interactions. While experimentally the binding energy of biexcitons is uncertain, based on our study, we conclude that biexcitons are bound in CsPbBr 3 .
Cutting edge computational mathematics are ubiquitous in renewable energy research. Problems in resilient and reliable electric grid operations, infrastructure planning, wind farm yaw control, and more demand sophisticated and scalable computational tools that enable the transition of renewable energy technologies from proof of concept to deployment into our energy system. The mission of the Computational Science Center at NREL is to lead the lab's efforts to solve energy challenges using high-performance computing (HPC), computational science, applied mathematics, scientific data management, visualization, and informatics. In this poster, we provide a short overview of three areas of computational mathematics research at NREL: wind power scenario generation for stochastic grid operations and infrastructure planning, improved rational function approximations for electromagnetic transients codes, and wind farm yaw control using a combination of the Alternating Direction Method of Multipliers (ADMM) and reinforcement learning (RL). Increasing penetrations of renewable energy into power grids motivate the investigation of new approaches to characterizing uncertainty for five-minute economic dispatch problems. Similarly, as the penetration of distributed energy resources on power grids increases, it becomes important to revisit our methods of modelling transient phenomena, i.e. electromagnetic transients programs. Finally, the combination of ADMM and RL for wind farm yaw control presented here can potentially increase the efficiency of the deployed distributed controllers by orders of magnitude.
To fully leverage the power of image simulation to corroborate and explain patterns and structures in atomic resolution microscopy, an initial correspondence between the simulation and experimental image must be established at the outset of further high accuracy simulations or calculations. Furthermore, if simulation is to be used in context of highly automated processes or high-throughput optimization, the process of finding this correspondence itself must be automated. In this work, "ingrained," an open-source automation framework which solves for this correspondence and fuses atomic resolution image simulations into the experimental images to which they correspond, is introduced. Here, the overall "ingrained" workflow, focusing on its application to interface structure approximations, and the development of an experimentally rationalized forward model for scanning tunneling microscopy simulation are described.
The Jordan-Wigner transformation establishes a duality between $su(2)$ and fermionic algebras. We present qualitative arguments and numerical evidence that when mapping spins to fermions, the transformation makes strong correlation weaker, as demonstrated by the Hartree-Fock approximation to the transformed Hamiltonian. This result can be rationalized in terms of rank reduction of spin shift terms when transformed to fermions. Conversely, the mapping of fermions to qubits makes strong correlation stronger, complicating its solution when one uses qubit-based correlators. The presence of string operators poses challenges to the implementation of quantum chemistry methods on classical computers, but these can be dealt with using established techniques of low computational cost. Here, our proof of principle results for XXZ and J1-J2 Heisenberg (in 1D and 2D) indicate that the JW transformed fermionic Hamiltonian has reduced complexity in key regions of their phase diagrams, and provides a better starting point for addressing challenging spin problems.
In recent years, isogeometric analysis (IGA) has attracted significant attention from the computational mechanics community due to its ability to integrate design and analysis. Besides, IGA is also a higher-order discretization technique for solving partial differential equations, showing high approximation capability per degree of freedom. In this paper, we extend the application realm of IGA to particle-laden flows based on Eulerian–Eulerian description that couples Navier–Stokes equations with a density transport equation through a Boussinesq approximation. The coupled systems are solved by using quadratic non-uniform rational B-spline (NURBS) functions and a recently developed residual-based variational multiscale (VMS) formulation, which introduces coupling between the fine velocity scales and density equation residuals. We deploy the proposed approach to perform large-eddy simulations (LES) of dilute particle-laden flows over a flat surface at Reynolds number = 10,000. We compare the simulation results against direct numerical simulation (DNS) results from the literature. We find that combining VMS and IGA, the proposed approach enables accurate prediction of a wide range of flow/particle statistics with a relatively lower mesh resolution.
In many thin film materials, nuanced interplays of interfacial energies control the surface morphology and rearrangement. This work evaluates polymer−solvent interactions and solvent-driven surface reconstructions via ex situ and in situ fluid cell Atomic Force Microscopy (fc-AFM) analysis of amphiphilic block copolymer (BCP) thin films upon exposure to deionized (DI) water. We examine the differences in surface morphology, whole-film swelling, and force response in thin films of polystyrene-block-poly(ethylene oxide) (PS-b-PEO) and polystyrene- block-poly[(allyl glycidyl ether)-co-(ethylene oxide)] (PS-b- P[AGE-co-EO]) processed into standing-up cylinder morphologies perpendicular to a silicon substrate (⊥C). Using Amplitude Modulation AFM (AM-AFM) and Amplitude-Phase Distance (APD) force spectroscopy, this work probes the mechanoresponsive nature of the dynamic surface layers of these films, unveiling surface layer stratification and surface chain rearrangement via minimal tip−sample stimulation. To help rationalize the observed reconfigurations, the energetic driving forces were estimated using the harmonic mean approximations of interfacial energies. Given the nonionizable nature of the minority P(AGE-co-EO) block and the energetic driving forces for chain mobility, this work shows how the elimination of unfavorable PS−water interfaces drives chain rearrangement and coverage of the PS surface by chains of the hydrophilic block. This work highlights considerations for increasing the heterogeneity and complexity of BCP thin films via random blocks and how those changes to local interfacial energies may drive larger scale film morphology reconstructions, with broader implications for tuning interface hydrophilicity.
The novel concept of entanglement renormalization and its corresponding tensor network renormalization technique have been highly successful in developing a controlled real-space renormalization group (RG) scheme. Numerically approximate fixed-point (FP) tensors are widely used to extract the conformal data of the underlying conformal field theory (CFT) describing critical phenomena. In this paper, we present an explicit analytical construction of the FP tensor for 2D rational CFT. We define it as a correlation function between the “boundary-changing operators” (BCO) on triangles. Our construction fully captures all the real-space RG conditions. We also provide concrete examples, such as Ising, Yang-Lee, and tricritical Ising models, to compute the scaling dimensions explicitly based on the corresponding FP tensor. The BCO descendants turn out to be an optimal basis such that truncation in bond dimensions naturally produces comparable accuracies with the leading existing FP algorithms. Interestingly, our construction of FP tensors is closely related to a strange correlator, where the holographic picture naturally emerges. Our results also open a new door toward understanding CFT in higher dimensions. Published by the American Physical Society 2025