Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex 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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Posterior Covariance Matrix Approximations

Here, the Davis equation of state (EOS) is commonly used to model thermodynamic relationships for high explosive (HE) reactants. Typically, the parameters in the EOS are calibrated, with uncertainty, using a Bayesian framework and Markov Chain Monte Carlo (MCMC) methods. However, MCMC methods are computationally expensive, especially for complex models with many parameters. This paper provides a comparison between MCMC and less computationally expensive Variational methods (Variational Bayesian and Hessian Variational Bayesian) for computing the posterior distribution and approximating the posterior covariance matrix based on heterogeneous experimental data. All three methods recover similar posterior distributions and posterior covariance matrices. This study demonstrates that for this EOS parameter calibration application, the assumptions made in the two Variational methods significantly reduce the computational cost but do not substantially change the results compared to MCMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Experimental test of model predictive control in a variable air volume system

Model predictive control (MPC) has been widely studied as a promising approach for improving energy efficiency and operational flexibility in buildings, yet its real-world performance for commercial variable air volume (VAV) systems remains insufficiently characterized. In particular, the impacts of model mismatch on control robustness, real-time computational burden, and device-level operation are rarely evaluated using long-term field data. Here, this study presents a comprehensive experimental evaluation of MPC applied to a full-scale VAV system in Oak Ridge National Laboratory’s Flexible Research Platform-2 building with constant cooling/heating temperature setpoints and no occupancy. The study offers three key advantages over existing work: (1) it uses a representative building in a full-scale experimental test, capturing realistic system dynamics and complexity; (2) it evaluates a relatively sophisticated MPC formulation using two different optimization solvers (Gurobi and PSO), fully accounting for computational complexity and methodological diversity; and (3) it systematically assesses potential negative impacts on various building devices, benchmark against a well-established baseline, ASHRAE Guideline 36 (G36). To isolate zone- and air-handling-unit–level supervisory control effects, the supply fan was operated with a fixed static pressure setpoint under all strategies, and the trim-and-response static pressure reset in G36 was not enabled. Results show that MPC maintained thermal comfort while improving energy efficiency. Abrupt solar radiation variations degraded performance. Computation times ranged from ∼1 s (Gurobi) to ∼ 70 s (PSO). Compared with G36, MPC achieves 33% energy savings and reduces median reheat coil output by approximately a factor of 5–10 for a representative cooling day under matched weather conditions. However, it increases the maximum discomfort deviation from 0.5 to 1°C and results in a 32% increase in staging frequency. In addition, PSO-based MPC introduced damper oscillations, also affecting actuator longevity.

ASHRAE guideline 36↗
DOE OSTI2024

Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems

The rapid integration of renewable energy resources presents formidable challenges in managing power grids. While advanced computing and machine learning techniques offer some solutions for accelerating grid modeling and simulation, there remain complex problems that classical computers cannot effectively address. Quantum computing, a promising technology, has the potential to fundamentally transform how we manage power systems, especially in scenarios with a higher proportion of renewable energy sources. One critical aspect is solving linear systems of equations, crucial for power system applications like power flow analysis, for which the Harrow-Hassidim-Lloyd (HHL) algorithm is a well-known quantum solution. However, HHL quantum circuits often exhibit excessive depth, making them impractical for current Noisy-Intermediate-Scale-Quantum (NISQ) devices. In this paper, we introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. This framework empowers researchers to efficiently explore power system applications using quantum linear solvers. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency. Power flow case studies have demonstrated up to a eight-fold speedup compared to Qiskit Aer, all while maintaining comparable levels of accuracy.

quantum computing, Harrow-Hassidim-Lloyd, high-per↗
DOE OSTI2022

Chemical bonding in actinyl( V / VI ) dipyriamethyrin complexes for the actinide series from americium to californium: a computational investigation

The separation of minor actinides in their dioxocation (i.e., actinyl) form in high-valence oxidation states requires efficient ligands for their complexation. Here, in this work, we evaluate the complexation properties of actinyls including americyl, curyl, berkelyl, and californyl in their pentavalent and hexavalent oxidation states with the dipyriamethyrin ligand (L) using density functional theory calculations. The calculated bond parameters show shorter An&#x2550O yl bonds with covalent character and longer An–N bonds with ionic character. The bonding between the actinyl cation and the ligand anion shows a flow of charges from the ligand to actinyl in all [An V/VI O 2 –L] 1–/0 complexes. However, across the series, backdonation of charges from the metal to the ligand becomes prominent and stabilizes the complexes. The thermodynamic parameters in the gas phase and solution suggest that the complex formation reaction is spontaneous for [Cf V/VI O 2 –L] 1–/0 complexes and spontaneous at elevated temperatures (>298.15 K) for all other complexes. Spin–orbit corrections have a quantitative impact while the overall trend remains the same. Energy decomposition analysis (EDA) reveals that the interaction between actinyl and the ligand is mainly due to electrostatic contributions that decrease from Am to Cf along with an increase in orbital contributions due to the backdonation of charges from the actinyl metal center to the ligand that greatly stabilizes the Cf complex. The repulsive Pauli energy contribution is observed to increase in the case of [An V O 2 –L] 1– complexes from Am to Cf while a decrease is observed among [An VI O 2 –L] 0 complexes, showing minimum repulsion in [Cf VI O 2 –L] 0 complex formation. Overall, the hexavalent actinyl complexes show greater stability (increasing from Am to Cf) than their pentavalent counterparts.

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

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

A Minkowski difference-based advancing front packing technique for generating convex noncircular particles in complex domains

In this work, a Minkowski difference-based advancing front approach is proposed to generate convex and non-circular particles in a predefined computational domain. Two specific algorithms are developed to handle the contact conformity of generated particles with the boundaries of the computational domain. The first, called the open form, is used to handle the smooth contact of generated particles with (external) boundaries, while the other, called the closed form, is proposed to handle the internal boundaries of a computational domain with a complex cavity. The Gilbert-Johnson-Keerthi (GJK) method is used to efficiently solve the contact detection between the newly generated particle at the front and existing particles. Furthermore, the problem of one-sided particle lifting, which can cause some defects in the packing structure in existing advancing front methods during packing generation, is highlighted and an effective solution is developed. Several examples of increasing complexity are used to demonstrate the efficiency and applicability of the proposed packing generation approach. The numerical results show that the generated packing is not only more uniform, but also achieves a higher packing density than existing advancing front methods.

42 ENGINEERING↗
DOE OSTI2025

Sparse measurement medical CT reconstruction using multi-fused block matching denoising priors

A major challenge for medical X-ray CT imaging is reducing the number of X-ray projections to lower radiation dosage and reduce scan times without compromising image quality. However these under-determined inverse imaging problems rely on the formulation of an expressive prior model to constrain the solution space while remaining computationally tractable. Traditional analytical reconstruction methods like Filtered Back Projection (FBP) often fail with sparse measurements, producing artifacts due to their reliance on the Shannon-Nyquist Sampling Theorem. Consensus Equilibrium, which is a generalization of Plug and Play, is a recent advancement in Model-Based Iterative Reconstruction (MBIR), has facilitated the use of multiple denoisers are prior models in an optimization free framework to capture complex, non-linear prior information. However, 3D prior modelling in a Plug and Play approach for volumetric image reconstruction requires long processing time due to high computing requirement. Instead of directly using a 3D prior, this work proposes a BM3D Multi Slice Fusion (BM3D-MSF) prior that uses multiple 2D image denoisers fused to act as a fully 3D prior model in Plug and Play reconstruction approach. Our approach does not require training and are thus able to circumvent ethical issues related with patient training data and are readily deployable in varying noise and measurement sparsity levels. In addition, reconstruction with the BM3D-MSF prior achieves similar reconstruction image quality as fully 3D image priors, but with significantly reduced computational complexity. We test our method on clinical CT data and demonstrate that our approach improves reconstructed image quality.

Hossain, Maliha [ORNL]↗
DOE OSTI2025

Exascale granular microstructure reconstruction in 3D volumes of arbitrary geometries with generative learning

Reconstructing 3D granular microstructures within volumes of arbitrary geometries from limited 2D image data is crucial for predicting the material properties, as well as performances of structural components accounting for material microstructural effects. We present a novel generative learning framework that enables exascale reconstruction of granular microstructures within complex 3D geometric volumes. Building upon existing transfer learning techniques using pre-trained convolutional neural networks (CNN), we introduce several key innovations to overcome the difficulties inherent in arbitrary geometries. Our framework incorporates periodic boundary conditions using circular padding techniques, ensuring continuity and representativeness of the reconstructed microstructures. We also introduce a novel seamless transition reconstruction (STR) method that creates statistically equivalent transition zones to integrate multiple pre-existing 3D microstructure volumes. Based on STR, we propose a cost-effective strategy for reconstructing microstructures within complex geometric volumes, minimizing computational waste. Validation through numerical experiments using kinetic Monte Carlo simulations demonstrates accurate reproduction of grain statistics, including grain size distributions and morphology. A case study involving the reconstruction of a 4-blade propeller microstructure illustrates the method’s capability to efficiently handle complex geometries. In conclusion, the proposed framework significantly reduces computational demands while maintaining high reconstruction quality, paving the way for scalable microstructure reconstruction in materials design and analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2020

The Python’s Lunch: geometric obstructions to decoding Hawking radiation

According to Harlow and Hayden [ arXiv:1301.4504 ] the task of distilling information out of Hawking radiation appears to be computationally hard despite the fact that the quantum state of the black hole and its radiation is relatively un-complex. We trace this computational difficulty to a geometric obstruction in the Einstein-Rosen bridge connecting the black hole and its radiation. Inspired by tensor network models, we conjecture a precise formula relating the computational hardness of distilling information to geometric properties of the wormhole — specifically to the exponential of the difference in generalized entropies between the two non-minimal quantum extremal surfaces that constitute the obstruction. Due to its shape, we call this obstruction the ‘Python’s Lunch’, in analogy to the reptile’s postprandial bulge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Approaches for the Simulation of Coupled Processes in Evolving Fractured Porous Media Enabled by Exascale Computing

Models have historically represented fractured porous media with continuum descriptions that characterize the media using bulk parameters. The impact of small-scale features is not captured in these models, although they may be controlling the performance of subsurface applications. Pore-scale models can simulate processes in small-scale features by representing the pore space geometry explicitly but are computationally expensive for large domains. The alternative multiscale approach entails the combination of pore-scale and continuum-scale descriptions in a single framework. We use Chombo-Crunch, a computational capability that discretizes complex geometries with an adaptive, embedded boundary method to contrast these two approaches. Chombo-Crunch takes advantage of recent computational performance and memory bandwidth improvements resulting from the emergence of exascale computing resources. These combined improvements enable the efficient simulation of reactive transport in fractured media with a high degree of fidelity and the ability to capture the control small-scale processes exert on the overall medium evolution.

42 ENGINEERING↗
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2023

Structural characterization of an intrinsically disordered protein complex using integrated small-angle neutron scattering and computing

Characterizing structural ensembles of intrinsically disordered proteins (IDPs) and intrinsically disordered regions (IDRs) of proteins is essential for studying structure–function relationships. Due to the different neutron scattering lengths of hydrogen and deuterium, selective labeling and contrast matching in small-angle neutron scattering (SANS) becomes an effective tool to study dynamic structures of disordered systems. However, experimental timescales typically capture measurements averaged over multiple conformations, leaving complex SANS data for disentanglement. We hereby demonstrate an integrated method to elucidate the structural ensemble of a complex formed by two IDRs. We use data from both full contrast and contrast matching with residue-specific deuterium labeling SANS experiments, microsecond all-atom molecular dynamics (MD) simulations with four molecular mechanics force fields, and an autoencoder-based deep learning (DL) algorithm. From our combined approach, we show that selective deuteration provides additional information that helps characterize structural ensembles. We find that among the four force fields, a99SB-disp and CHARMM36m show the strongest agreement with SANS and NMR experiments. In addition, our DL algorithm not only complements conventional structural analysis methods but also successfully differentiates NMR and MD structures which are indistinguishable on the free energy surface. Finally, we present an ensemble that describes experimental SANS and NMR data better than MD ensembles generated by one single force field and reveal three clusters of distinct conformations. Our results demonstrate a new integrated approach for characterizing structural ensembles of IDPs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

High Performance Computing Systems Tools, Visualization, and Management

High Performance Computing (HPC) systems are complex setups of servers, storage devices, network switches, and cables that are specifically designed to accommodate hundreds of users running highly computationally intensive applications at a time. These applications require numerous softwares, licenses, and various levels of storage as well. All of these resources must be monitored and managed by HPC administrators, which presents a daunting task. In this project, I created numerous software tools as part of an HPC Visualization and Management system, which is now used by HPC administrators on a daily basis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Integrative computational investigation of the spectroscopy, dynamics, and controlling of molecular excitons in complex environments (Final Technical Report)

The major goal of this research project was to advance theoretical and computational capability to describe the dynamics and the spectroscopy of molecular excitons as reliably and efficiently as possible. Outcomes of the project contributed to new understanding of the interaction between light and molecular materials and ensuing dynamics of excited electronic states. These can assist experimentalists in developing novel methods to utilize quantum properties of molecules and molecular excitons for new energy harvesting and quantum information processing.

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

Designing molecular qubits: computational insights into first-row and group 6 transition metal complexes

In the realm of optically addressable qubits, a previously synthesized and characterized Cr( IV ) pseudo-tetrahedral complex, featuring four strongly donating ligands surrounding the chromium center, has demonstrated potential as a qubit candidate. This study proposes analogs of this complex through a metal substitution strategy, extending the investigation to different complexes based on metal centers selected from first-row and Group 6 transition metals. Computational modeling based on multiconfigurational methods CASPT2 and MC-PDFT was utilized to calculate energy gaps between ground and excited electronic spin states, and zero-field splitting parameters. Simulations were applied to each equilibrium geometry and related deformations based on vibrational modes. All results align with previous experimental findings, but also show that qubits based on V and Ti centers could be more electronically stable than the Cr one, suggesting a lower electronic features dependency from their related geometry. In some cases geometrical deformations provide changes in relative energy gaps between triplet and singlet excited state, that could potentially swap, offering a different initialization process, and some inspiration for ligand design based on such deformations. Additionally, this study identifies an unsynthesized Ti( II ) compound as a promising candidate for molecular qubits. This finding highlights the role of computational multireference methods in the rational design of qubit systems.

Sauza-de la Vega, Arturo [Univ. of Chicago, IL (Un↗