Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “COMPUTER METHOD”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quantum Orbital Minimization Method for Excited States Calculation on a Quantum Computer

Herein we propose a quantum-classical hybrid variational algorithm, the quantum orbital minimization method (qOMM), for obtaining the ground state and low-lying excited states of a Hermitian operator. Given parametrized ansatz circuits representing eigenstates, qOMM implements quantum circuits to represent the objective function in the orbital minimization method and adopts a classical optimizer to minimize the objective function with respect to the parameters in ansatz circuits. The objective function has an orthogonality constraint implicitly embedded, which allows qOMM to apply a different ansatz circuit to each input reference state. We carry out numerical simulations that seek to find excited states of H 2 , LiH, and a toy model consisting of four hydrogen atoms arranged in a square lattice in the STO-3G basis with UCCSD ansatz circuits. Comparing the numerical results with existing excited states methods, qOMM is less prone to getting stuck in local minima and can achieve convergence with more shallow ansatz circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Toward reducing uncertainty quantification costs in DEM models of particulate flow: Testing simple, sensitivity-based, forward uncertainty propagation techniques

The performance of two conceptually-simple uncertainty quantification techniques are tested against the rigorous nested-loop sampling technique of Roy and Oberkampf (Comput Methods Appl Mech Eng, 200: 2131–2144, 2011) (herein called full-sampling) using two very small-scale DEM-based models of particulate flow (one gas-solid flow and one granular flow). The first simplified forward uncertainty propagation technique, reduced-sampling, uses a sensitivity analysis to eliminate uncertain inputs that have little impact on the model output prior to nested-loop sampling. The second technique, boundary-sampling, uses a sensitivity analysis to inform the selection of two bounding cases for each key model output. In conclusion, the uncertainties in the model outputs obtained via the reduced- and boundary-sampling methods agree well with those from full-sampling for both the gas-solid and granular flow models while yielding computational savings of 65–75% (reduced sampling) and 94–97% (boundary sampling).

42 ENGINEERING↗
DOE OSTI2026

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗
DOE OSTI2022

On the characterization of biases arising from methods and approximations used for sensitivity analyses

The preliminary assessment of the performance and safety of advanced reactors, as well as the identification of research and development needs, rely on computer simulations due to the lack of operational experience. Those simulations should be based on verified and validated computational tools, calculation schemes, and nuclear data libraries, and should be accompanied of a proper characterization of the involved uncertainties, providing confidence in the computational-based predictions. Thus, sensitivity and uncertainty studies, together with integral experiments, play an essential role in that process. Sensitivities are then a critical element and guidelines about how to produce accurate enough sensitivities depending on the subsequent analyses to be performed are of interest. The present study addresses the sensitivities biases arising from the use of different nuclear data libraries, computational methods and the assumption of modelling simplifications. Not only sensitivities for multiplication factor but also for safety-relevant reactivity responses have been analyzed. In the study, propagated uncertainties are also included for the considered parameters to illustrate the impact of the sensitivity profiles obtained for each case on the final uncertainty. Then, relevant recommendations are given for sensitivity analyses of highly complex systems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2026

Computational Science at the National Laboratory of the Rockies

Computational methods underpin advancing the science and engineering of energy technologies and developing a knowledge base to optimize energy systems. NLR's Computational Science Center (CSC) proudly focuses on providing the service of computing, advancing the science of computing, and enabling DOE missions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Leveraging Artificial Intelligence to Expedite Antibody Design and Enhance Antibody–Antigen Interactions

This perspective sheds light on the transformative impact of recent computational advancements in the field of protein therapeutics, with a particular focus on the design and development of antibodies. Cutting-edge computational methods have revolutionized our understanding of protein–protein interactions (PPIs), enhancing the efficacy of protein therapeutics in preclinical and clinical settings. Central to these advancements is the application of machine learning and deep learning, which offers unprecedented insights into the intricate mechanisms of PPIs and facilitates precise control over protein functions. Despite these advancements, the complex structural nuances of antibodies pose ongoing challenges in their design and optimization. Our review provides a comprehensive exploration of the latest deep learning approaches, including language models and diffusion techniques, and their role in surmounting these challenges. We also present a critical analysis of these methods, offering insights to drive further progress in this rapidly evolving field. The paper includes practical recommendations for the application of these computational techniques, supplemented with independent benchmark studies. These studies focus on key performance metrics such as accuracy and the ease of program execution, providing a valuable resource for researchers engaged in antibody design and development. Through this detailed perspective, we aim to contribute to the advancement of antibody design, equipping researchers with the tools and knowledge to navigate the complexities of this field.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Sweep-tracing algorithm: in silico slip crystallography and tension-compression asymmetry in BCC metals

Abstract Direct Molecular Dynamics (MD) simulations are being increasingly employed to model dislocation-mediated crystal plasticity with atomic resolution. Thanks to the dislocation extraction algorithm (DXA), dislocation lines can be now accurately detected and positioned in space and their Burgers vector unambiguously identified in silico, while the simulation is being performed. However, DXA extracts static snapshots of dislocation configurations that by themselves present no information on dislocation motion. Referred to as a sweep-tracing algorithm (STA), here we introduce a practical computational method to observe dislocation motion and to accurately quantify its important characteristics such as preferential slip planes (slip crystallography). STA reconnects pairs of successive snapshots extracted by DXA and computes elementary slip facets thus precisely tracing the motion of dislocation segments from one snapshot to the next. As a testbed for our new method, we apply STA to the analysis of dislocation motion in large-scale MD simulations of single crystal plasticity in BCC metals. We observe that, when the crystal is subjected to uniaxial deformation along its [001] axis, dislocation slip predominantly occurs on the {112} maximum resolved shear stress plane under tension, while in compression slip is non-crystallographic (pencil) resulting in asymmetric mechanical response. The marked contrast in the observed slip crystallography is attributed to the twinning/anti-twinning asymmetry of shears in the {112} planes relatively favoring dislocation motion in the twinning sense while hindering dislocations from moving in the anti-twinning directions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data

The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Finding the perfect imperfection: Accelerated, computationally driven discovery and design of quantum defects

Optically addressable spin defects have emerged as the leading platforms for quantum sensing and communication in solid-state systems. While traditional efforts have concentrated on a focused set of well-studied defects, recent advances in high-throughput computational methods have shown promise for large-scale exploration of defects across diverse semiconductor hosts. By cataloging key properties of quantum defects in computational databases, high-throughput screening techniques can systematically suggest and design novel candidates. In this article, we highlight recent advances in data-driven quantum defect design aimed at addressing critical materials science challenges such as host materials selection, defect stability, and desirable electronic and optical properties. Here, we emphasize the importance of electronic-structure-guided searches across various materials and illustrate how high-throughput computations contribute to our understanding of design principles for quantum defects. Additionally, we outline ongoing challenges and emerging opportunities in this rapidly developing field.

Xiong, Yihuang [Dartmouth College, Hanover, NH (Un↗
DOE OSTI2022

Methods, systems, and computer readable media for protecting and controlling a microgrid with a dynamic boundary

Methods, systems, and computer readable mediums for protecting and controlling a microgrid with a dynamic boundary are disclosed. One method includes detecting a fault in a microgrid that includes a dynamic point-of-common-coupling (PCC), in response to determining that the microgrid is operating in a grid-connected mode, isolating the fault by tripping a microgrid side smart switch and a grid side smart switch that are located immediately adjacent to the fault, initiating the reclosing of the grid side smart switch, and initiating the reclosing for the microgrid side smart switch via resynchronization if the grid side smart switch is successfully reclosed, and in response to determining that the microgrid is operating in an islanded mode, isolating the fault by tripping a microgrid side smart switch that is located immediately adjacent to the fault, and initiating the reclosing of the microgrid side smart switch.

Wang, Fei↗
DOE OSTI2020

Metadata compression

A computer-executable method, system, and computer program product for managing a Parallel-Logged File System (PLFS) on a data storage system, wherein the data storage system is in communication with an application that updates the data storage system with checkpoint data, the computer-executable method, system, and computer program product comprising receiving a first checkpoint including data from the application; analyzing the data in the first checkpoint to determine whether a pattern exists in the checkpoint data; and upon a positive determination, adding the pattern into PLFS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An ensemble method for nuclei detection of overlapping cervical cells

The Pap test is a preventive approach that requires specialized and labor-intensive examination of cytological preparations to track potentially cancerous cells from the internal and external cervix surface. A cytopathologist must analyze many microscopic fields while screening for abnormal cells. Therefore the expectation is that a support decision system could assist with screening the most relevant cells, for example, by identifying sub-cellular abnormalities, such as changes in the nuclei features. Here, this work proposes a computational method for cervical nuclei detection aimed to reduce the workload of cytopathologists.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Divergent Bimetallic Mechanisms in Copper(II)-Mediated C–C, N–N, and O–O Oxidative Coupling Reactions

Copper-catalyzed aerobic oxidative coupling of diaryl imines provides a route for conversion of ammonia to hydrazine. Here the present study uses experimental and density functional theory computational methods to investigate the mechanism of N–N bond formation, and the data support a mechanism involving bimolecular coupling of Cu-coordinated iminyl radicals. Computational analysis is extended to Cu II -mediated C–C, N–N, and O–O coupling reactions involved in the formation of cyanogen (NC–CN) from HCN, 1,3-butadiyne from ethyne (i.e., Glaser coupling), hydrazine from ammonia, and hydrogen peroxide from water. The results reveal two different mechanistic pathways. Heteroatom ligands with an uncoordinated lone pair (iminyl, NH 2 , OH) undergo charge transfer to Cu II , generating ligand-centered radicals that undergo facile bimolecular radical–radical coupling. Ligands lacking a lone pair (CN and CCH) form bridged binuclear diamond-core structures that undergo C–C coupling. This mechanistic bifurcation is rationalized by analysis of spin densities in key intermediates and transition states, as well as multiconfigurational calculations. Radical–radical coupling is especially favorable for N–N coupling owing to energetically favorable charge transfer in the intermediate and thermodynamically favorable product formation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Quantum Thermodynamics of Nonequilibrium Processes in Lattice Gauge Theories

A key objective in nuclear and high-energy physics is to describe nonequilibrium dynamics of matter, e.g., in the early Universe and in particle colliders, starting from the standard model of particle physics. Classical computing methods, via the framework of lattice gauge theory, have experienced limited success in this mission. Quantum simulation of lattice gauge theories holds promise for overcoming computational limitations. Because of local constraints (Gauss’s laws), lattice gauge theories have an intricate Hilbert-space structure. This structure complicates the definition of thermodynamic properties of systems coupled to reservoirs during equilibrium and nonequilibrium processes. We show how to define thermodynamic quantities such as work and heat using strong-coupling thermodynamics, a framework that has recently burgeoned within the field of quantum thermodynamics. Our definitions suit instantaneous quenches, simple nonequilibrium processes undertaken in quantum simulators. To illustrate our framework, we compute the work and heat exchanged during a quench in a Z 2 lattice gauge theory coupled to matter in 1+1 dimensions. Here, the thermodynamic quantities, as functions of the quench parameter, evidence a phase transition. For general thermal states, we derive a simple relation between a quantum many-body system’s entanglement Hamiltonian, measurable with quantum-information-processing tools, and the Hamiltonian of mean force, used to define strong-coupling thermodynamic quantities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2026

Mechanism of Catechol Oxidation by the Coupled Bicupric Active Site of Tyrosinase: Completion of the Oxygenase/Oxidase Reaction Cycle

Tyrosinase contains a coupled binuclear copper (CBC) active site, which in its bicuprous form (deoxy-Ty) binds O 2 to form a side-on peroxide [Cu(II) 2 O 2 ] 2+ intermediate (oxy-Ty) that performs the regioselective monooxygenation of monophenols to catechols and their subsequent 2e − oxidation to quinones. Previously, we used spectroscopic, kinetic, and computational methods to elucidate the mechanism of the initial steps in the monooxygenation reaction. Herein, we investigated the final step in catecholate formation and provide experimental and computational results elucidating the catechol oxidation reaction, formally a proton-coupled 2e − process. We employed single-turnover stoppedflow absorption to observe the elusive catecholate-Cu(II) 2 OH intermediate via the anaerobic reaction of resting Cu(II) 2 OH Ty (met-Ty) with the catecholate substrate. This intermediate was cryo-trapped and characterized by electron paramagnetic resonance and X-ray absorption spectroscopies. These experimental results were correlated to quantum mechanics/molecular mechanics (QM/MM) and QM calculations to describe the complete catalytic cycle of tyrosinase, revealing that the 2e − oxidation of catechol to quinone involves two steps: (i) coupled 1H + /1e − transfer from the bound monoanionic catecholate to the bridged hydroxide of the met-Ty active site, followed by (ii) the second 1e − transfer. The latter is calculated to be the rate-limiting step in catechol oxidation, confirmed by experimental solvent kinetic isotope effect studies. Our computational data suggest that quinone release from the protein provides the necessary driving force for this reaction. These results establish a detailed description of this oxidase cycle of the tyrosinase mechanism and more broadly provide molecular-level insights into the diverse reactivity of CBC sites in biology.

QM/MM modeling↗
DOE OSTI2024

Transforming Energy Through Computational Excellence: NREL's Computational Science Center

Computational methods underpin advancing the science and engineering of energy efficiency, sustainable transportation, renewable power technologies, and developing a knowledge base to optimize energy systems. NREL's Computational Science Center (CSC) proudly focuses on providing the service of computing, advancing the science of computing, and enabling NREL's clean energy mission.

applied mathematics↗