Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “97 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Summary of Responses to the Request for Information (RFI) on Partnerships for Transformational Artificial Intelligence Models

The Department of Energy (DOE) issued a Request for Information (RFI) in December 2025 inviting public comments regarding partnerships for transformational Artificial Intelligence (AI) models for the Genesis Mission Consortium, a public-private partnership platform. This RFI solicited feedback from industry, nonprofit organizations, universities, independent research organizations and other stakeholders. Specifically, the RFI asked three questions on (1) mobilizing DOE National Laboratories to curate the scientific data in a responsible and privacy-preserving manner, (2) the extent to which existing general-purpose AI models can be leveraged and which scientific disciplines are priorities for such model development, and (3) mechanisms by which these AI models can be provided to scientific communities. This document summarizes the input from 194 unique nonproprietary responses from businesses, universities, nonprofit organizations, research institutes and laboratories as well as a variety of other contributors, including individual contributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient Application of the Factorized form of the Unitary Coupled-Cluster Ansatz for the Variational Quantum Eigensolver Algorithm by Using Linear Combination of Unitaries

The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select (U) scheme uses O(n) Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n 3 , a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Generation of the TSL for Zirconium Hydrides from Ab Initio Methods

Zirconium hydride (ZrHx) is a moderator material used in TRIGA and other reactors that may exist in multiple phases with varying stoichiometry, which include the δ phase and the ϵ phase. Current ENDF/B-VIII.0 ZrHx thermal scattering law (TSL) evaluations do not distinguish between phases. These sub-libraries were generated with the LEAPR module of NJOY using historic phonon spectra derived from a central force model and assume incoherent elastic scattering for both bound hydrogen and zirconium, which neglects the effects of crystal structures important for scattering from zirconium bound in ZrHx. In this work, the TSLs for hydrogen and zirconium bound in δ-ZrHx and ϵ-ZrH2 were generated from phonon spectra derived from modern ab initio lattice dynamics methods and ab initio molecular dynamics. Subsequently, TSLs for hydrogen and zirconium in ZrHx and ZrH2 were generated using the Full Law Analysis Scattering System Hub (FLASSH) code. The built-in generalized coherent elastic routine was used to generate the previously neglected elastic contribution from zirconium for this material. The present TSLs provide both a re-evaluation of the current ZrH sub-libraries and expansion of the set of TSLs available for the examination of neutrons in systems with zirconium hydride, permitting explicit treatment of δ and ϵ phases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Machine Learning Reduced Order Model for Cost and Emission Assessment of a Pyrolysis System

Biomass pyrolysis is a promising approach for producing economic and environmentally-friendly fuels and bioproducts. Biomass pyrolysis experiments show that feedstock properties have a significant impact on product yields and composition. Scientists are developing detailed chemical reaction mechanisms to capture the relationships between biomass composition and pyrolysis yields. These mechanisms can be computationally intensive. In this study, we investigate the use of a machine learning reduced order model (ROM) for assessing the costs and emissions of a pyrolysis biorefinery. Here, we developed a Kriging-based ROM to predict pyrolysis yields of 314 feedstock samples based on the results of a detailed chemical kinetic pyrolysis mechanism. The ROM is integrated into a chemical process model for calculating mass and energy yields in a commercial-scale (2000 tonne/day) biorefinery. The ROM estimated biofuel yields of 65 to 130 gallons per ton of dry biomass. This results in biofuel minimum fuel-selling prices of $2.62 to $5.43 per gallon and emissions of -13.62 to 145 kg of CO 2 per MJ. The ROM achieved an average mean square error of 1.8e-20 and a mean absolute error of 0.53%. These results suggest that ROMs can facilitate rapid feedstock screening for biorefinery systems.

09 BIOMASS FUELS↗
DOE OSTI2021

ExaWorks: Workflows for Exascale

Exascale computers will offer transformative capabilities to combine data-driven and learning-based approaches with traditional simulation applications to accelerate scientific discovery and insight. These software combinations and integrations, however, are difficult to achieve due to challenges of coordination and deployment of heterogeneous software components on diverse and massive platforms. We present the ExaWorks project, which can address many of these challenges: ExaWorks is leading a co-design process to create a workflow Software Development Toolkit (SDK) consisting of a wide range of workflow management tools that can be composed and interoperate through common interfaces. We describe the initial set of tools and interfaces supported by the SDK, efforts to make them easier to apply to complex science challenges, and examples of their application to exemplar cases. Furthermore, we discuss how our project is working with the workflows community, large computing facilities as well as HPC platform vendors to sustainably address the requirements of workflows at the exascale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A terminology for in situ visualization and analysis systems

The term "in situ processing" has evolved over the last decade to mean both a specific strategy for visualizing and analyzing data and an umbrella term for a processing paradigm. The resulting confusion makes it difficult for visualization and analysis scientists to communicate with each other and with their stakeholders. To address this problem, a group of over 50 experts convened with the goal of standardizing terminology. This paper summarizes their findings and proposes a new terminology for describing in situ systems. An important finding from this group was that in situ systems are best described via multiple, distinct axes: integration type, proximity, access, division of execution, operation controls, and output type. This paper discusses these axes, evaluates existing systems within the axes, and explores how currently used terms relate to the axes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Additive Polynomial Time Integrators, Part I: Framework and Fully Implicit-Explicit Collocation Methods

In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with arbitrary order-of-accuracy and varying degree of implicitness. In this first work, we focus on a new class of implicit-explicit polynomial block methods that are based on fully implicit Runge–Kutta methods with Radau nodes and that possess high stage order. Here, we show that the new fully implicit-explicit (FIMEX) integrators have improved stability compared to existing IMEX Runge–Kutta methods, while also being more computationally efficient due to recent developments in preconditioning techniques for solving the associated systems of nonlinear equations. For PDEs on periodic domains where the implicit component is trivial to invert, we will show how parallelization of the right-hand side evaluations can be exploited to obtain significant speedup compared to existing serial IMEX Runge–Kutta methods. For parallel (in space) finite element discretizations, the new methods can achieve orders of magnitude better accuracy than existing IMEX Runge–Kutta methods and/or achieve a given accuracy several times times faster in terms of computational runtime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Current possibilities and future opportunities for erasure coded computations

The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Arianna Wright Rosenbluth

Brief article discussing the contributions of Dr. Arianna Wright Rosenbluth to work done at Los Alamos and to computer science in general.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Variable Precision Computing (VPC) (Final Report)

The overall goal of the Variable Precision Computing project is exploring and identifying ways to reduce internodal communication cost in production physics simulation experiments running on a distributed-memory systems by compressing data, either in a lossy or lossless way, thus resulting in a significant computational performance increase. Among the several approaches proposed, the one discussed here has been proposed, designed and implemented by me. It concerns the application of information theory-derived metrics to classical molecular dynamics and computational fluid dynamics simulation experiments.

97 MATHEMATICS AND COMPUTING↗