Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematics and computing”

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 325 records · Page 18

Data Remapping Between One-Dimensional Meshes [Slides]

Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.

97 MATHEMATICS AND COMPUTING↗

Single-molecule Real-time (SMRT) Isoform Sequencing (Iso-Seq) in Plants: The Status of the Bioinformatics Tools to Unravel the Transcriptome Complexity

Background: The advent of the Single-Molecule Real-time (SMRT) Isoform Sequencing(Iso-Seq) has paved the way to obtain longer full-length transcripts. This method was found tobe much superior in identifying full-length splice variants and other post-transcriptional events ascompared to the Next Generation Sequencing (NGS)-based short read sequencing (RNA-Seq).Several different bioinformatics tools to analyze the Iso-Seq data have been developed and someof them are still being refined to address different aspects of transcriptome complexity. However, acomprehensive summary of the available tools and their utility is still lacking. Objective: Here, we summarized the existing Iso-Seq analysis tools and presented an integratedbioinformatics pipeline for Iso-Seq analysis, which overcomes the limitations of NGS and generateslong contiguous Full-Length Non-Chimeric (FLNC) reads for the analysis of posttranscriptionalevents. Results: In this review, we summarized recent applications of Iso-Seq in plants, which include improvedgenome annotations, identification of novel genes and lncRNAs, identification of fulllengthsplice isoforms, detection of novel Alternative Splicing (AS) and Alternative Polyadenylation(APA) events. In addition, we also discussed the bioinformatics pipeline for comprehensiveIso-Seq data analysis, including how to reduce the error rate in the reads and how to identify andquantify post-transcriptional events. Furthermore, the visualization approach of Iso-Seq was discussedas well. Finally, we discussed methods to combine Iso-Seq data with RNA-Seq for transcriptomequantification. Conclusion: Overall, this review demonstrates that the Iso-Seq is pivotal for analyzing transcriptomecomplexity and this new method offers unprecedented opportunities to comprehensively understandtranscripts diversity.

Biochemistry & Molecular Biology↗

Probabilistic Evaluation of Geomechanical Risks in CO2 Storage: An Exploration of Caprock Integrity Metrics Using a Multilaminate Model

The probabilistic uncertainty assessment of geomechanical risk—specifically, caprock failure—attributable to CO2 injection, as presented in a simplified hypothetical geological model, was the focus of this study. Our approach amalgamates the implementation of a multilaminate model, the creation of a response surface model in conjunction with the Box–Behnken sampling design, the execution of associated numerical modeling experiments, and the utilization of Monte Carlo simulations. Probability distributions to encapsulate the inherent variability (elastic and mechanical properties of the caprock and reservoir) and uncertainty in prediction estimates (vertical displacement, total strain, and F value) were employed. Our findings reveal that the Young modulus of the caprock is a key factor controlling equivalent total strain but is insufficient as a stand-alone indicator of caprock integrity. It is confirmed that the caprock can accommodate significant deformation without failure, if it possesses a low Young’s modulus and high mechanical strength properties, such as the friction angle and uniaxial compressive strength. Similarly, vertical displacement was found to be an unreliable indicator for caprock integrity, as caprock failure can occur across a broad spectrum of vertical displacements, particularly when both the Young modulus and mechanical strength properties have wide ranges. This study introduces the F value as the most dependable indicator for caprock failure, although it is a theoretical attribute (the shortest distance between the Mohr circle and the nearest failure envelope used to measure the sensitivity to failure) and not physically measurable in the field. Deviatoric stress levels were found to vary based on stress regimes, with the maximum levels observed under extensive and compressive stress regimes. In conjunction with the use of the response surface method, this study demonstrates the efficacy of the multilaminate framework and the Mohr–Coulomb constitutive model in providing a simplified, yet effective, probabilistic model of the mechanical behavior of caprock failure, reducing mathematical and computational complexities.

Energy & Fuels↗

Algebraic Theory of Patterns as Generalized Symmetries

We generalize the exact predictive regularity of symmetry groups to give an algebraic theory of patterns, building from a core principle of future equivalence. For topological patterns in fully-discrete one-dimensional systems, future equivalence uniquely specifies a minimal semiautomaton. We demonstrate how the latter and its semigroup algebra generalizes translation symmetry to partial and hidden symmetries. This generalization is not as straightforward as previously considered. Here, though, we clarify the underlying challenges. A stochastic form of future equivalence, known as predictive equivalence, captures distinct statistical patterns supported on topological patterns. Finally, we show how local versions of future equivalence can be used to capture patterns in spacetime. As common when moving to higher dimensions, there is not a unique local approach, and we detail two local representations that capture different aspects of spacetime patterns. A previously developed local spacetime variant of future equivalence captures patterns as generalized symmetries in higher dimensions, but we show that this representation is not a faithful generator of its spacetime patterns. This motivates us to introduce a local representation that is a faithful generator, but we demonstrate that it no longer captures generalized spacetime symmetries. Taken altogether, building on future equivalence, the theory defines and quantifies patterns present in a wide range of classical field theories.

97 MATHEMATICS AND COMPUTING↗

Limits on Mode Coherence in Pulsating DA White Dwarfs Due to a Nonstatic Convection Zone

The standard theory of pulsations deals with the frequencies and growth rates of infinitesimal perturbations in a stellar model. Modes which are calculated to be linearly driven should increase their amplitudes exponentially with time; the fact that nearly constant amplitudes are usually observed is evidence that nonlinear mechanisms inhibit the growth of finite amplitude pulsations. Models predict that the mass of convection zones in pulsating hydrogen-atmosphere (DAV) white dwarfs is very sensitive to temperature (i.e., M CZ α T –90 eff ), leading to the possibility that even low-amplitude pulsators may experience significant nonlinear effects. In particular, the outer turning point of finite-amplitude g-mode pulsations can vary with the local surface temperature, producing a reflected wave that is out of phase with what is required for a standing wave. This can lead to a lack of coherence of the mode and a reduction in its global amplitude. In this paper we show that: (1) whether a mode is calculated to propagate to the base of the convection zone is an accurate predictor of its width in the Fourier spectrum, (2) the phase shifts produced by reflection from the outer turning point are large enough to produce significant damping, and (3) amplitudes and periods are predicted to increase from the blue edge to the middle of the instability strip, and subsequently decrease as the red edge is approached. Furthermore, this amplitude decrease is in agreement with the observational data while the period decrease has not yet been systematically studied.

79 ASTRONOMY AND ASTROPHYSICS↗

Data from: Coupled machine learning-ecosystem ensemble models substantially improve predictions of nitrous oxide (N 2 O) fluxes from US croplands

Nitrous oxide (N₂O) is a potent and persistent greenhouse gas, with rising atmospheric concentrations driven in part by inefficient use of synthetic nitrogen (N) fertilizers in agriculture. Predicting soil N₂O emissions is challenging due to high spatial and temporal variability arising from complex soil biogeochemical processes. Process-based ecosystem models and standalone machine learning (ML) approaches without extensive site-specific calibration often miss high emission episodes. Here, we show how an Ensemble Modeling System (EMS) based on outputs from an ensemble of ecosystem models coupled to an ensemble of ML models can improve predictions and understanding of N2O fluxes from US cropland. Trained and validated on approximately 12,000 N2O chamber measurements at 17 U.S. Midwest sites (six crops, 35 management practices), the EMS accurately predicted daily fluxes of N2O at both training (R² = 0.84, RMSE = 16.4 g N ha⁻¹ d⁻¹) and held-out testing sites (R² = 0.84, RMSE = 6.2 g N ha⁻¹ d⁻¹). Analyses identified six dominant N₂O drivers: soil organic carbon (SOC), NH₄⁺, NO₃⁻, water-filled pore space (WFPS), soil temperature, and biomass production. Wet, warm soils produced large N₂O peaks only with sufficient SOC and mineral N; in low-SOC soils, fluxes remained low. Incorporating these drivers into process-based models might significantly improve their predictive capacity. The EMS demonstrates a strong potential to predict N₂O fluxes at unseen sites, enabling more reliable regional inventories, improved gap-filling where measurements are sparse, and enhanced understanding of mechanisms to advance targeted mitigation strategies in food, feed, and bioenergy crops.

agricultural sciences↗

Scalable Stochastic Transmission Expansion: A Use Case for ExaSGD

The intermittent nature of renewable energy poses new challenges for power grids due to its variable and un- certain power output. These features of renewable generation are becoming more relevant to transmission planning as grids reach higher penetration levels of renewable energy. In this paper we present an approach for transmission planning based on scalable computational approaches which enable the explicit consideration of operational uncertainties in the planning process. Using three-stage stochastic programming and the progressive hedging algorithm, we compute transmission expansion decisions on a modified RTS-GMLC test system. We augment the grid with large amounts of wind generation and consider many operational scenarios subject to wind uncertainty. This is an example of a possible use of the ExaSGD security constrained AC optimal power flow solver.

Exascale Computing Project↗

Summary Report on Synthetic Time History Development and Deployment

This report summarizes research work performed at the Colorado School of Mines (CSM) and George Washington University (GWU) in support of the DOE Office of Nuclear Energy Integrated Energy Systems (IES) program. In particular, the work focuses on improving and strengthening two fundamental steps in the mathematical and computational framework that is currently being developed to optimize the economic performance of Integrated Energy Systems. One of the innovative approaches taken by the IES program is that, rather than optimizing the system for a specific year or week or day, the optimization is performed using stochastic synthetic data. Synthetic data is generated by training artificial intelligence (AI) using available but limited data sets. The synthetic data should possess the same patterns as the original set and the same statistical properties, but never repeat the same set of values exactly. The work from CSM focuses on this first step; namely, investigating a methodology to determine the quality of the synthetic data and the right settings for properly training the AI. Once a large set of trustworthy data can be generated the problem of stochastic optimization can be tackled. The optimal IES configuration is highly dependent on the rare high peaks or deep depths of the net demand (grid electricity demand less variable renewable energy [VRE] production). Using an unbiased random sampling of the synthetic data, these extremes are very difficult to generate and therefore the optimization can be unrepresentative and inaccurate. GWU has started an approach to increase the likelihood of generating these rare events with the proper associated probabilistic weight. Both of these projects represent a step forward in achieving the capability to properly size the IESs and to properly capture the value that these systems can provide to the grid by absorbing volatility of net demand without disproportionately increasing the cost of maintaining grid reliability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Transforming Energy Through Computational Excellence: Advanced Scientific Visualization Reveals Energy Insights

The National Renewable Energy Laboratory's world-class researchers and analysts, along with the Insight Center (our state-of-the-art scientific visualization facility) make data immersion a reality, allowing users to step into and explore their data. With the rise of large, diverse, and distributed data sets, scientific visualization is now critical to the process of scientific discovery and to managing and analyzing data and extracting insights. NREL provides visualization capabilities and facilities that are supported by state-of-the-art equipment, leading-edge techniques, and expert staff.

data science↗

Architecture for Web-Based Visualization of Large-Scale Energy Domains: Preprint

With the growing penetration of inverter-based distributed energy resources and increased loads through electrification, power systems analyses are becoming more important and more complex. Moreover, these analyses increasingly involve the combination of interconnected energy domains with data that are spatially and temporally increasing in scale by orders of magnitude, surpassing the capabilities of many existing analysis and decision-support systems. We present the architectural design, development, and application of a high-resolution web-based visualization environment capable of cross-domain analysis of tens of millions of energy assets, focusing on scalability and performance. Our system supports the exploration, navigation, and analysis of large data from diverse domains such as electrical transmission and distribution systems, mobility and electric vehicle charging networks, communications networks, cyber assets, and other supporting infrastructure. We evaluate this system across multiple use cases, describing the capabilities and limitations of a web-based approach for high-resolution energy system visualizations.

grid modernization↗

Transforming Energy Through Computational Excellence: NREL HPC Resources for High Performance Computing for Energy Innovation (HPC4EI) Program

NREL hosts computing facilities for the U.S. Department of Energy's Office of Energy Efficiency and Renewable Energy (EERE). In 2024, NREL introduced Kestrel, the 3rd generation, EERE-sponsored supercomputer dedicated to renewable energy and energy efficiency research. Kestrel has already been used for hundreds of research projects by NREL, other national laboratories, and university partners. This includes HPC4EI-sponsored industrial partnerships.

high-performance computing↗

On fast simulation of dynamical system with neural vector enhanced numerical solver

The large-scale simulation of dynamical systems is critical in numerous scientific and engineering disciplines. However, traditional numerical solvers are limited by the choice of step sizes when estimating integration, resulting in a trade-off between accuracy and computational efficiency. To address this challenge, we introduce a deep learning-based corrector called Neural Vector (NeurVec), which can compensate for integration errors and enable larger time step sizes in simulations. Our extensive experiments on a variety of complex dynamical system benchmarks demonstrate that NeurVec exhibits remarkable generalization capability on a continuous phase space, even when trained using limited and discrete data. NeurVec significantly accelerates traditional solvers, achieving speeds tens to hundreds of times faster while maintaining high levels of accuracy and stability. Moreover, NeurVec’s simple-yet-effective design, combined with its ease of implementation, has the potential to establish a new paradigm for fast-solving differential equations based on deep learning.

97 MATHEMATICS AND COMPUTING↗

A fast quantum route to random numbers

Here, using a quantum computer to speed up one step in a textbook approach to generating random numbers proves to be a savvy strategy, and one that could make good use of quantum computers that will be available in the near future.

97 MATHEMATICS AND COMPUTING↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗