Search NASA⌕ Search

SEARCH · Search NASA

Results for “Split representation”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Split representation of adaptively compressed polarizability operator

The polarizability operator plays a central role in density functional perturbation theory and other perturbative treatment of first principle electronic structure theories. The cost of computing the polarizability operator generally scales as O(Ne4) where Ne is the number of electrons in the system. The recently developed adaptively compressed polarizability operator (ACP) formulation [L. Lin, Z. Xu and L. Ying, Multiscale Model. Simul. 2017] reduces such complexity to O(Ne 3 ) in the context of phonon calculations with a large basis set for the first time, and demonstrates its effectiveness for model problems. In this paper, we improve the performance of the ACP formulation by splitting the polarizability into a near singular component that is statically compressed, and a smooth component that is adaptively compressed. The new split representation maintains the O(Ne 3 ) complexity, and accelerates nearly all components of the ACP formulation, including Chebyshev interpolation of energy levels, iterative solution of Sternheimer equations, and convergence of the Dyson equations. For simulation of real materials, we discuss how to incorporate nonlocal pseudopotentials and finite temperature effects. In this work, we demonstrate the effectiveness of our method using one-dimensional model problem in insulating and metallic regimes, as well as its accuracy for real molecules and solids.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

Magnetic Photon Splitting: The S-Matrix Formulation in the Landau Representation

Calculations of reaction rates for the third-order QED process of photon splitting gamma yields gamma.gamma in strong magnetic fields traditionally have employed either the effective Lagrangian method or variants of Schwinger's proper-time technique. Recently, Mentzel, Berg and Wunner [1] presented an alternative derivation via an S-matrix formulation in the Landau representation. Advantages of such a formulation include the ability to compute rates near pair resonances above pair threshold. This paper presents new developments of the Landau representation formalism as applied to photon splitting, providing significant, advances beyond the work of [1] by summing over the spin quantum numbers of the electron propagators, and analytically integrating over the component of momentum of the intermediate states that is parallel to field. The ensuing tractable expressions for the scattering amplitudes are satisfyingly compact, and of an appearance familiar to S-matrix theory applications. Such developments can facilitate numerical computations of splitting considerably both below and above pair threshold. Specializations to two regimes of interest are obtained, namely the limit of highly supercritical fields and the domain where photon energies are far inferior to that for the threshold of single-photon pair creation. In particular, for the first time the low-frequency amplitudes are simply expressed in terms of the Gamma function, its integral and its derivatives. In addition, the equivalence of the asymptotic forms in these two domains to extant results from effective Lagrangian/proper- time formulations is demonstrated.

Baring, Matthew G.↗
DOE OSTI2025

MaTableGPT: GPT‐Based Table Data Extractor from Materials Science Literature

Abstract Efficiently extracting data from tables in the scientific literature is pivotal for building large‐scale databases. However, the tables reported in materials science papers exist in highly diverse forms; thus, rule‐based extractions are an ineffective approach. To overcome this challenge, the study presents MaTableGPT, which is a GPT‐based table data extractor from the materials science literature. MaTableGPT features key strategies of table data representation and table splitting for better GPT comprehension and filtering hallucinated information through follow‐up questions. When applied to a vast volume of water splitting catalysis literature, MaTableGPT achieves an extraction accuracy (total F1 score) of up to 96.8%. Through comprehensive evaluations of the GPT usage cost, labeling cost, and extraction accuracy for the learning methods of zero‐shot, few‐shot, and fine‐tuning, the study presents a Pareto‐front mapping where the few‐shot learning method is found to be the most balanced solution owing to both its high extraction accuracy (total F1 score >95%) and low cost (GPT usage cost of 5.97 US dollars and labeling cost of 10 I/O paired examples). The statistical analyses conducted on the database generated by MaTableGPT revealed valuable insights into the distribution of the overpotential and elemental utilization across the reported catalysts in the water splitting literature.

Yi, Gyeong Hoon [Computational Science Research Ce↗
NASA NTRS2016

An Enriched Shell Finite Element for Progressive Damage Simulation in Composite Laminates

A formulation is presented for an enriched shell nite element capable of progressive damage simulation in composite laminates. The element uses a discrete adaptive splitting approach for damage representation that allows for a straightforward model creation procedure based on an initially low delity mesh. The enriched element is veri ed for Mode I, Mode II, and mixed Mode I/II delamination simulation using numerical benchmark data. Experimental validation is performed using test data from a delamination-migration experiment. Good correlation was found between the enriched shell element model results and the numerical and experimental data sets. The work presented in this paper is meant to serve as a rst milestone in the enriched element's development with an ultimate goal of simulating three-dimensional progressive damage processes in multidirectional laminates.

McElroy, Mark W.↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Machine Learning Emulators and Empirical Models Combining Climate and Global Crop Models for Seasonal Agricultural Production

We present results from several connected efforts to apply machine learning methods to estimates of seasonal agricultural production anomalies around the world. First, we apply the XGBoost Random Forest method to fit emulators that mimic global crop models participating in the Agricultural Model Intercomparison and Improvement Project (AgMIP) Global Gridded Crop Model Intercomparison (GGCMI). These are the same models used in the agricultural sector simulations of the Inter-Sectoral Impacts Model Intercomparison Project (ISIMIP). These emulators use 8 climate variables split across 5 sub-seasonal representations of the growing season for each ½ degree grid cell around the world for maize, wheat, rice and soybeans. Emulators are useful for estimating conditions that have not already been simulated by GGCMI (e.g., in a seasonal prediction model) and also to diagnose model differences and capabilities. For example, emulators of the pDSSAT maize model tend to be more reliant on mean temperatures than the LPJmL model, and few models have strong responses to cold extremes. Second, we use a similar XGBoost approach to fit empirical models for national production data for the top 20 producing countries according to the United Nations Food and Agricultural Organization (FAO). Models utilize both climate observations and the GGCM models as predictors, resulting in skillful models for many (but not all) top producing-countries. The patterns of climate and crop model features selected indicate regions and systems that are better or worse simulated by the GGCMs. For example, information in cold extreme predictors is often combined with GGCM output predictors to provide sensitivity that models may underrepresent.

machine learning↗
NASA NTRS1994

A New Global Potential Energy Surface for the Hydroperoxyl Radical, HO2: Reaction Coefficients for H + O2 and Vibrational Splittings for H Atom Transfer

A new analytic global potential energy surface describing the hydroperoxyl radical system H((sup 2)S) + O2(X (sup 3)Sigma((sup -)(sub g))) (reversible reaction) HO2 ((X-tilde) (sup 2)A'') (reversible reaction) O((sup 3)P) + O H (X (sup 2)Pi) has been fitted using the ab initio complete active space SCF (self-consistent-field)/externally contracted configuration interaction (CASSCF/CCI) energy calculations of Walch and Duchovic. Results of quasiclassical trajectory studies to determine the rate coefficients of the forward and reverse reactions at combustion temperatures will be presented. In addition, vibrational energy levels were calculated using the quantum DVR-DGB (discrete variable representation-distributed Gaussian basis) method and the splitting due to H atom migration is investigated. The material of the proposed presentation was reviewed and the technical content will not reveal any information not already in the public domain and will not give any foreign industry or government a competitive advantage.

Dateo, Christopher E.↗
DOE OSTI2026

thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae

We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.

Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗
DOE OSTI2024

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗
NASA NTRS2006

Anisotropic Developments for Homogeneous Shear Flows

The general decomposition of the spectral correlation tensor R(sub ij)(k) by Cambon et al. (J. Fluid Mech., 202, 295; J. Fluid Mech., 337, 303) into directional and polarization components is applied to the representation of R(sub ij)(k) by spherically averaged quantities. The decomposition splits the deviatoric part H(sub ij)(k) of the spherical average of R(sub ij)(k) into directional and polarization components H(sub ij)(sup e)(k) and H(sub ij)(sup z)(k). A self-consistent representation of the spectral tensor in the limit of weak anisotropy is constructed in terms of these spherically averaged quantities. The directional polarization components must be treated independently: models that attempt the same representation of the spectral tensor using the spherical average H(sub ij)(k) alone prove to be inconsistent with Navier-Stokes dynamics. In particular, a spectral tensor consistent with a prescribed Reynolds stress is not unique. The degree of anisotropy permitted by this theory is restricted by realizability requirements. Since these requirements will be less severe in a more accurate theory, a preliminary account is given of how to generalize the formalism of spherical averages to higher expansion of the spectral tensor. Directionality is described by a conventional expansion in spherical harmonics, but polarization requires an expansion in tensorial spherical harmonics generated by irreducible representations of the spatial rotation group SO(exp 3). These expansions are considered in more detail in the special case of axial symmetry.

Cambon, Claude↗
NASA NTRS1985

A comparison of finite volume flux vector splittings for the Euler equations

A comparison is made between the computational results of the Steger-Warming (1981) and van Leer (1982) flux splitting methods, which have been applied in generalized coordinates to quasi-one-dimensional transonic flow in a nozzle and two-dimensional subsonic, transonic, and supersonic flow over airfoils. The latter splitting method leads to higher convergence rates and a sharper representation of shocks in the transition region. The second-order accurate, one-sided-difference model is extended to a third-order, upwind-biased model with only small additional computational effort.

Anderson, W. K.↗
NASA NTRS1990

Low-frequency spectral representation of Space Shuttle flight data

The present digital processing of 18 accelerograms associated with Space Shuttle liftoffs splits each of the accelerograms into three time-slices, respectively representing (1) SSME thrust buildup, (2) the period immediately following the SRBs' ignition, and (3) the subsequent period of intense acoustical activity due to the exhaust plume's interactions with the launch pad. The spectral treatment of these data involve the use of autoregressive and autoregressive-moving-average filters that furnish analytical representations of the spectra for all three time-slices in terms of a set of coefficients; these coefficients are applicable to the synthesis of artificial acceleration time-histories.

Spanos, Pol D.↗
DOE OSTI2026

PRIME: An evaluation framework for protein representation inference and generalization in viral mutation space

Background Protein language models (PLMs) have revolutionized protein fitness prediction, yet their application to rapidly evolving viral pathogens is often confounded by extreme sequence homology. This homology leads to “data leakage” in standard random validation splits, yielding inflated performance metrics that fail to translate into real-world biosurveillance utility. Results We present Protein Representation Inference for Mutation Evaluation (PRIME), a framework that integrates domain-specific fine-tuning with a rigorous position-stratified validation protocol to evaluate viral threats. Using a dataset of 347,432 SARS-CoV-2 receptor binding domain (RBD) sequences, we demonstrate that while random training data split yields deceptive R 2 values (> 0.90), they fail to generalize to novel mutational sites. By benchmarking models up to 650 M parameters, we show that domain-specific fine-tuning of the ESM-C 600 M model with correctly stratified data provides an initial demonstration of predictive signal for binding affinity and expression at unseen mutational sites of binding affinity and expression on unseen sites (R 2 ~0.23), a significant advancement over base foundation models which exhibit no predictive power (R 2 <0). PRIME’s embedding-based clustering identified 3.03% of bat coronavirus sequences as candidates for further experimental prioritization based on their functional similarity to human-infective strains in embedding space, offering a perspective complementary to traditional phylogenetic methods. Conclusion PRIME establishes a new benchmark for the application of PLMs in pathogen surveillance. Our findings demonstrate that state-of-the-art models and fine-tuning, when paired with stratified validation, provide biologically meaningful insights into pathogen evolution and zoonotic risk.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Graviton topology

Over the past three decades, it has been shown that discrete and continuous media can support topologically nontrivial waves. Recently, it was shown that the same is true of the vacuum, in particular, right (R) and left (L) circularly polarized photons are topologically nontrivial. Here, we study the topology of another class of massless particles, namely gravitons. We show that the collection of all gravitons forms a topologically trivial vector bundle over the lightcone, allowing us to construct a globally smooth basis for gravitons. The graviton bundle also has a natural geometric splitting into two topologically nontrivial subbundles, consisting of the R and L gravitons. The R and L gravitons are unitary irreducible bundle representations of the Poincaré group, and are thus elementary particles; their topology is characterized by the Chern numbers ∓4. This nontrivial topology obstructs the splitting of graviton angular momentum into spin and orbital angular momentum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1987

An analysis of flux-split algorithms for Euler's equations with real gases

An analysis of flux-splitting procedures for the solution of Euler's equations with real gas effects is presented. An alternative real-gas flux-splitting is derived which can easily be implemented into existing codes. This approach, which takes the form of an 'equivalent' gamma representation is not an ad hoc model, but is based on theoretical considerations. Details of this method with the Steger-Warming and Van Leer flux vector splittings and the Roe flux-difference splitting are given. Applications of the method to several high Mach number, high temperature flows are presented for one and two space dimensions.

Grossman, B.↗
DOE OSTI2024

Hybrid particle-spectral method for kinetic plasma simulations

A hybrid model for numerical solutions of the Vlasov–Poisson equations is presented, which blends spectral and particle approaches. The model splits the distribution function for plasma species into both spectral and particle representations in the velocity space to combine the advantages of each approach. The spectral representation leverages asymmetrically weighted Hermite basis, whereas the particle representation leverages the particle-in-cell method. Configuration phase space is decomposed with the Fourier method, which is well suited for periodic problems. We derive conservation equations for mass, momentum, and energy for the proposed combined method. It is shown that the coupling error between the two methods is absent in the semi-discrete setting (not taking into account time discretization). Finally, numerical test cases are presented simulating a weak electron beam interaction with plasma, leading to beam–plasma instability. The initially localized electron beam evolved into a highly non-equilibrium distribution function in the velocity space. A small growth rate and the resonance nature of instability make it difficult to obtain accurate solutions for purely particle methods due to noise, which falls as ∼1/Np with a number of particles. At the same time, purely spectral methods may require a large number of modes to capture the highly non-equilibrium state of the evolved beam. We show that the hybrid method is well suited for such problems: it reproduces the linear stage as well as nonlinear dynamics with sufficient accuracy using a highly non-equilibrium distribution function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Transient cycling of nitrogen, organic carbon and oxygen within the free-flowing Columbia River corridor: Linking exposure time dependent biogeochemical reactions to river stage fluctuations (Final project report)

The objective of this project was to develop next-generation techniques for representing the transformations of complex reaction networks like those impacting transient river-corridors, then apply them to develop upscaling tools. The project contributed significantly to the development of Lagrangian “mass transfer particle tracking” (MTPT) tools that are the first numerical framework that explicitly separates mixing and spreading processes; a crucial distinction for accurate representations of reaction rates across scales. The MTPT approach uses an operator splitting scheme where physical transport processes are simulated using classical random walk methods and each particle is treated as a “container” that carries with it any number of chemical species. Mixing between particles is simulated using a colocation-probability based mass transfer kernel and reactions are evaluated on each particle after mixing. The method is stable, accurate, and also allows the explicit modeling of residence time distributions of the individual containers of mass. The MTPT scheme allowed us to explore several research questions related to reactive transport in river corridors and complex reaction networks. We found that it is possible to quantify the exposure time distributions (ETDs) of reactants and that this does suggest some pathways to upscaling. However, comparable approximations can be obtained using simplified (reduced dimensionality) MTPT simulations in less time with similar uncertainty, so development of extensive ETD-based methods was not productive. The major findings are that i) the MTPT schemes are robust and highly accurate across a range of arbitrarily complex reactions, ii) the methods can be efficiently parallelized and the parallel performance characteristics of MTPT are predictable, and iii) the MTPT tools allow simultaneous tracking of residence time. The development of these research tools into efficient software packages continues. The methods are already available to the community because open-source, working examples have been included with all publications.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Hybrid particle-spectral method for kinetic plasma simulations

A hybrid model for numerical solutions of the Vlasov–Poisson equations is presented, which blends spectral and particle approaches. The model splits the distribution function for plasma species into both spectral and particle representations in the velocity space to combine the advantages of each approach. The spectral representation leverages asymmetrically weighted Hermite basis, whereas the particle representation leverages the particle-in-cell method. Configuration phase space is decomposed with the Fourier method, which is well suited for periodic problems. We derive conservation equations for mass, momentum, and energy for the proposed combined method. It is shown that the coupling error between the two methods is absent in the semi-discrete setting (not taking into account time discretization). Finally, numerical test cases are presented simulating a weak electron beam interaction with plasma, leading to beam–plasma instability. The initially localized electron beam evolved into a highly non-equilibrium distribution function in the velocity space. A small growth rate and the resonance nature of instability make it difficult to obtain accurate solutions for purely particle methods due to noise, which falls as ~1/$\sqrt{N_p}$ with a number of particles. At the same time, purely spectral methods may require a large number of modes to capture the highly nonequilibrium state of the evolved beam. We show that the hybrid method is well suited for such problems: it reproduces the linear stage as well as nonlinear dynamics with sufficient accuracy using a highly non-equilibrium distribution function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗