Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICS - MATRICES”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Frameworks, Algorithms, and Scalable Technologies for Mathematics (FASTMath) SciDAC Institute

As computational models scale to larger computers, the rate at which they produce data has far outstripped the same computers ability to write that data and further the file systems ability to store that data. Almost all of the SciDAC applications, but especially those related to fusion solve very large scale PDEs whose scientific output his impacted by this problem. To gain access to dynamics in an exascale simulation that are not identifiable a priori and to make that dynamical data available to machine learning requires fundamental research in the area of in situ data data analytics. Here data analytics includes compression, visualization, uncertainty quantification, and machine learning. This in situ data analytics will enable on-the-fly spatial and temporal compression of solution dynamics, expose that space-time compressed field to machine learning algorithms that have been specialized to work with dynamically evolving data (existing machine learning algorithms treat data sets as static), greatly improving the opportunity for machine learning to provide feedback to the compression, all within an ongoing simulation, without the need to write data to files. The same concepts are also being applied to uncertainty quantification and multi-fidelity modeling which have similar needs for spatial and temporal compression of the ongoing exascale simulation to perform either without the typical, unacceptable writing of data to files.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A mathematical design framework for membrane pre-concentration in energy-efficient recovery of fermentation products

Due to the dilute nature of products manufactured via fermentation and cell-free bioprocessing, dewatering is a common unit operation in downstream processing (DSP) for bioproduct recovery, but it is typically energy intensive. To improve DSP energy efficiency for bio-based small molecules, integrating high-pressure membrane pre-concentration is a promising process option. However, this approach is typically constrained by a tradeoff between concentration factor (CF) and product recovery (PR), namely increasing the CF typically results in greater product loss, and vice versa. Here we developed a model that enables process design guidelines to: (i) identify scenarios in which the additional energy consumption and product loss from membrane pre-concentration are justified for use in DSP, and (ii) determine the optimal CF that minimizes process specific energy consumption. We compared the energy consumption of high-pressure membrane-integrated processes to evaporation-only processes and applied the model to an experimental case study for the separation and purification of butyric acid from Clostridium tyrobutyricum fermentation using an in situ product recovery (ISPR) process. The model estimated that integrating a tangential-flow reverse osmosis (RO) pre-concentration unit could reduce process energy consumption up to 45%. The use of advanced membrane pre-concentration technologies, such as negative rejection membranes and organic solvent reverse osmosis (OSRO), have the potential to further reduce the overall process specific energy consumption up to 96%, projected based on modeling. Overall, membrane pre-concentration, especially when strategically integrated prior to an evaporation step with optimized process conditions, holds significant potential for improving DSP energy efficiency, particularly in applications requiring substantial solvent removal for product recovery from dilute mixtures.

09 BIOMASS FUELS↗
DOE OSTI2024

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Modern chemical graph theory

Abstract Graph theory has a long history in chemistry. Yet as the breadth and variety of chemical data is rapidly changing, so too do graph encoding methods and analyses that yield qualitative and quantitative insights. Using illustrative cases within a basic mathematical framework, we showcase modern chemical graph theory's utility in Chemists' analysis and model development toolkit. The encoding of both experimental and simulation data is discussed at various levels of granularity of information. This is followed by a discussion of the two major classes of graph theoretical analyses: identifying connectivity patterns and partitioning methods. Measures, metrics, descriptors, and topological indices are then introduced with an emphasis upon enhancing interpretability and incorporation into physical models. Challenging data cases are described that include strategies for studying time dependence. Throughout, we incorporate recent advancements in computer science and applied mathematics that are propelling chemical graph theory into new domains of chemical study. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Structure and Mechanism > Computational Materials Science Structure and Mechanism > Molecular Structures

Leite, Leonardo S. G.↗
DOE OSTI2025

Reliable and Efficient Machine Learning (Final Technical Report)

Modern scientific experiments generate massive amounts of data at a pace much faster than humans can manually analyze. While machine learning has revolutionized commercial data analysis (such as recommending movies or recognizing faces), applying these tools to complex scientific discovery is challenging because scientific answers must be precise, interpretable, and adhere to physical laws. The research under this project aims to develop new mathematical tools and computer algorithms specifically designed for scientific applications. Major progress has been made in automatically cleaning and deconstructing messy experimental data, analyzing the visual information of physical phenomena, determining the underlying physical variables, and providing rig orous mathematical analysis of interesting algorithms and concepts widely used in machine learning. This project addressed the critical gap between our ability to generate massive scientific data and our ability to extract interpretable information from it. We established mathematical foundations for Scientific Machine Learning (SciML) aimed at effective data analytics and automated discovery. Our work focused on three core objectives: (1) developing reliable feature extraction methods for dynamic high-dimensional data, (2) establishing mathematical foundations for discovering dynamics via neural networks, and (3) creating rigorous optimization techniques for these models. Key outcomes come from two fronts. On the practical side, they include the development of algorithms that significantly enhance the extraction of signals from field data, as well as the capability to handle situations that exhibit smooth variations or physical stretching due to temperature changes. They also include the creation of an automated framework for discovering fundamental state variables from raw experimental data, demonstrating the ability to identify intrinsic physical dimensions without prior knowledge of the governing laws. On the theoretical front, the research results in theoretical advances in Optimal Transport, a widely used notion in SciML, specifically regarding functions with fixed-size nodal sets, provide sharp bounds relevant to uncertainty quantification. Meanwhile, the outcomes also include the establishment of convergence theories for nonlocal gradient descent methods, enabling robust optimization with noisy data in high-dimensional settings commonly encountered in scientific modeling. The project also helps creating opportunities to train the next generation of researchers, equipping them with the necessary technical skills for today’s workplace and preparing them for future advances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Regional Earthquake Ground Motion Simulations for Southern California With EQSIM: Insights From the 2008 Chino Hills, 2024 Highland Park, and 2021 Carson Earthquakes

This study presents physics-based, 3D simulations using the EQSIM framework for several earthquakes in the Los Angeles region. The primary objective was to assess the ability of deterministic physics-based ground motion simulations to reproduce the observed motions from historical events. The selected events included the mathematical equation M w 5.4 2008 Chino Hills, the mathematical equation M w 4.4 2024 Highland Park, and the mathematical equation M w 4.3 2021 Carson events. The simulated motions were evaluated by comparing the recorded and simulated seismograms, as well as the Fourier amplitude spectra, across multiple seismic stations. The SCEC 3D velocity model, CVM-S4.26.M01, was used to represent the regional geology, and ground motion simulations were carried out with a resolution of up to 5 Hz. The results indicate that the simulated motions captured the recorded motions up to approximately 4 Hz. While careful iterations regarding source parameters and corner frequencies were required, and, for the case of the Highland Park event, some of the near-source stations had relatively low accuracy, the present study established a positive step toward the utilization of physics-based simulations in practical applications. The computational efficiencies exhibited by EQSIM, especially on GPU clusters, further supported this assertion, as wall-clock times of simulations involving more than 10 billion grid points were as low as mathematical equation minutes. This permits ensemble simulations for a considered scenario event so that modeling uncertainties (e.g., source and geology) can be bracketed.

EQSIM↗
DOE OSTI2026

NLML: A Deep Neural Network Emulator for the Exact Nonlinear Interactions in a Wind Wave Model

Nonlinear wave interactions describe the resonant energy transfer between wave components, playing a fundamental role in the evolution of ocean wave spectra. Nonlinear wave interactions significantly influence wave growth and development, making them essential for accurate wave modeling. However, resolving the full six-dimensional Boltzmann integral of the exact nonlinear wave interactions (Webb-Resio-Tracy method, WRT) is computationally expensive, limiting its application in real-time operational wave forecasting and for research purposes. Current approximations, such as the Discrete Interaction Approximation (DIA), prioritize computational speed over accuracy, resulting in significant errors in wave mean parameters. Here, we introduce NLML, a machine learning (ML) emulator designed to approximate the exact nonlinear wave interactions within WAVEWATCH III (WW3), with the goal of achieving the accuracy of WRT while maintaining the stability and computational speed of DIA. By leveraging GPU capabilities such as half precision inference, we achieved substantial speedups, up to 136x mathematical equation faster than the WRT and only a modest 1.04x mathematical equation slowdown relative to DIA, while achieving 2x mathematical equation the accuracy of DIA in global wave spectral energy and mean wave parameters, with up to 7x mathematical equation higher accuracy in some regions. Unlike previous ML approaches, NLML maintained inherent stability throughout model integration in a standalone, year-long WW3 simulation, without requiring additional constraints. Our new ML parameterization bridges the gap between accuracy and efficiency, offering a promising alternative for improving wave modeling in operational settings and research purposes.

16 TIDAL AND WAVE POWER↗
DOE OSTI2024

Classifying photonic topology using the spectral localizer and numerical K -theory

Recently, the spectral localizer framework has emerged as an efficient approach for classifying topology in photonic systems featuring local nonlinearities and radiative environments. In nonlinear systems, this framework provides rigorous definitions for concepts such as topological solitons and topological dynamics, where a system’s occupation induces a local change in its topology due to nonlinearity. For systems embedded in radiative environments that do not possess a shared bulk spectral gap, this framework enables the identification of local topology and shows that local topological protection is preserved despite the lack of a common gap. However, as the spectral localizer framework is rooted in the mathematics of C*-algebras, and not vector bundles, understanding and using this framework requires developing intuition for a somewhat different set of underlying concepts than those that appear in traditional approaches for classifying material topology. In this tutorial, we introduce the spectral localizer framework from a ground-up perspective and provide physically motivated arguments for understanding its local topological markers and associated local measure of topological protection. In doing so, we provide numerous examples of the framework’s application to a variety of topological classes, including crystalline and higher-order topology. We then show how Maxwell’s equations can be reformulated to be compatible with the spectral localizer framework, including the possibility of radiative boundary conditions. To aid in this introduction, we also provide a physics-oriented introduction to multi-operator pseudospectral methods and numerical K-theory, two mathematical concepts that form the foundation for the spectral localizer framework. Finally, we provide some mathematically oriented comments on the C*-algebraic origins of this framework, including a discussion of real C*-algebras and graded C*-algebras that are necessary for incorporating physical symmetries. Looking forward, we hope that this tutorial will serve as an approachable starting point for learning the foundations of the spectral localizer framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

PCET‐Driven Reactivity of Neptunyl(VI) Yields Oxo‐Bridged Np(V) and Np(IV) Species

Two unconventional polynuclear complexes of neptunium (Np) featuring mono-mathematical equation -oxo motifs have been accessed by proton-coupled electron transfer (PCET) reactivity involving the dissolution of neptunyl(VI) diacetate dihydrate (NpO 2 (OAc) 2 (H 2 O) 2 ∙ HOAc) in methanol followed by addition of a pentadentate Schiff-base ligand. One complex is a mixed-valent [Np V ,Np IV , Np V ] trimer with two bridging mathematical equation μ 2 -oxos and the other is a [Np V , Np V ] dimer featuring a single mathematical equation μ 2 -oxo. In both complexes the outer Np centers are capped with terminal oxo ligands. Spectroscopic and spectrokinetic studies aimed at elucidating mechanistic details of complex formation in this system show that intermediate multinuclear [Np V O 2 (OAc)] n species form prior to metal chelation by the ligand; electrolysis experiments demonstrate that production of Np(V) gives rise to asynchronous proton transfer that does not occur otherwise (in the Np(VI) state) as well as condensation with loss of H 2 O and formation of the polynuclear complexes. We attribute the oxo-deficient nature of these products, with respect to conventional actinyl ([AnO 2 ] m+ ) species, to the reduction/condensation reaction sequence of PCET.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗