Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer science, Physics”

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

Probabilistic constrained Bayesian inversion for transpiration cooling

Abstract To enable safe operations in applications such as rocket combustion chambers, the materials require cooling to avoid material damage. Here, transpiration cooling is a promising cooling technique. Numerous studies investigate possibilities to simulate and evaluate the complex cooling mechanism. One naturally arising question is the amount of coolant required to ensure a safe operation. To study this, we introduce an approach that determines the posterior probability distribution of the Reynolds number using an inverse problem and constraining the maximum temperature of the system under parameter uncertainties. Mathematically, this chance inequality constraint is dealt with by a generalized polynomial chaos expansion of the system. The posterior distribution will be evaluated by different Markov chain Monte Carlo based methods. A novel method for the constrained case is proposed and tested among others on two‐dimensional transpiration cooling models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

A framework for stochastic simulations and visualization of biological electron-transfer dynamics

Electron transfer (ET) dictates a wide variety of energy-conversion processes in biological systems. Visualizing ET dynamics could provide key insight into understanding and possibly controlling these processes. We present a computational framework named VizBET to visualize biological ET dynamics, using an outer-membrane Mtr–Omc cytochrome complex in Shewanella oneidensis MR-1 as an example. Starting from X-ray crystal structures of the constituent cytochromes, molecular dynamics simulations are combined with homology modeling, protein docking, and binding free energy computations to sample the configuration of the complex as well as the change of the free energy associated with ET. This information, along with quantum-mechanical calculations of the electronic coupling, provides inputs to kinetic Monte Carlo (KMC) simulations of ET dynamics in a network of heme groups within the complex. Visualization of the KMC simulation results has been implemented as a plugin to the Visual Molecular Dynamics (VMD) software. Finally, VizBET has been used to reveal the nature of ET dynamics associated with novel nonequilibrium phase transitions in a candidate configuration of the Mtr–Omc complex due to electron–electron interactions.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2019

A bi-fidelity method for the multiscale Boltzmann equation with random parameters

In this paper, we study the multiscale Boltzmann equation with multi-dimensional random parameters by a bi-fidelity stochastic collocation (SC) method developed in [52], [70], [71]. By choosing the compressible Euler system as the low-fidelity model, we adapt the bi-fidelity SC method to combine computational efficiency of the low-fidelity model with high accuracy of the high-fidelity (Boltzmann) model. With only a small number of high-fidelity asymptotic-preserving solver runs for the Boltzmann equation, the bi-fidelity approximation can capture well the macroscopic quantities of the solution to the Boltzmann equation in the random space. Additionally, a priori estimate on the accuracy between the high- and bi-fidelity solutions together with a convergence analysis is established. Finally, we present extensive numerical experiments to verify the efficiency and accuracy of our proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A novel energy balance approach for a verifiable and accurate solution of radiation extinction in purely absorbing particle clouds

Here we consider the problem of radiation transport through purely absorbing particle clouds. The gold-standard solution of particle-resolved Monte Carlo ray-tracing method to this problem is computationally expensive and therefore solving the radiation transport equation (specifically, the Beer-Bouguer law (BB-law)) on a Eulerian mesh is often preferred. While the absorption coefficient in the real problem is infinite, the BB-law approximates it to be a finite number in the form of number density through a set of assumptions. For particle clouds that do not obey these assumptions, the BB-law predicts an incorrect exponential decay. Also, when the number density is computed using the nearest-neighbor approach, the BB-law solution diverges when the Eulerian mesh size becomes closer to or smaller than the particle size. This numerical divergence is due to the homogenization error. Although the filtering strategy for number density minimizes the homogenization error, it still converges to an incorrect exponential decay for particle clouds that break the BB-law constraints and the cost of the filtering is equivalent to that of the gold-standard solution. In this study, we develop a novel, highly accurate, verifiable and cost-effective solution to the radiation transport equation on a Eulerian domain using an energy balance approach where we derive an expression for the absorption coefficient as a function of particle and Eulerian mesh sizes. We apply our new method to Poisson and turbulent particle clouds that violate all the BB-law constraints and show that the solution is converging upon the mesh refinement, and eventually, we recover the same gold-standard solution for a much cheaper computational cost.

42 ENGINEERING↗
DOE OSTI2022

Transport error estimation using residual Monte Carlo

The residual Monte Carlo (RMC) method is also known in the literature as sequential Monte Carlo and reduced-source Monte Carlo. Given a Monte Carlo method for solving a linear equation and an approximate solution to that system, the residual method enables use of essentially the same Monte Carlo algorithm to directly compute the additive error or “defect” associated with the approximate solution. As the size of the defect decreases relative to the size of the solution, the residual Monte Carlo method becomes increasingly efficient relative to the standard Monte Carlo (SMC) method. Here we present a new RMC algorithm for evaluating the space-angle error in S n radiation transport solutions, and provide computational examples demonstrating that it can be far more efficient than SMC for this purpose. Herein we also describe a particular pitfall that must be avoided if RMC is to be efficient, and explain why the performance of RMC can significantly differ between different transport problems and different quantities of interest for the same problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values

We present a method of detecting bifurcations by locating zeros of a signed version of the smallest singular value of the Jacobian. This enables the use of quadratically convergent root-bracketing techniques or Chebyshev interpolation to locate bifurcation points. Only positive singular values have to be computed, though the method relies on the existence of an analytic or smooth singular value decomposition (SVD). The sign of the determinant of the Jacobian, computed as part of the bidiagonal reduction in the SVD algorithm, eliminates slope discontinuities at the zeros of the smallest singular value. We use the method to search for spatially quasi-periodic traveling water waves that bifurcate from large-amplitude periodic waves. The water wave equations are formulated in a conformal mapping framework to facilitate the computation of the quasi-periodic Dirichlet-Neumann operator. We find examples of pure gravity waves with zero surface tension and overhanging gravity-capillary waves. In both cases, the waves have two spatial quasi-periods whose ratio is irrational. We follow the secondary branches via numerical continuation beyond the realm of linearization about solutions on the primary branch to obtain traveling water waves that extend over the real line with no two crests or troughs of exactly the same shape. The pure gravity wave problem is of relevance to ocean waves, where capillary effects can be neglected. Such waves can only exist through secondary bifurcation as they do not persist to zero amplitude. The gravity-capillary wave problem demonstrates the effectiveness of using the signed smallest singular value as a test function for multi-parameter bifurcation problems. This test function becomes mesh independent once the mesh is fine enough.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Turning Outsiders into Insiders: A Call for Papers to Expand the Reach of National Laboratories’ Safety Successes, Challenges, Research, and Approaches

The most complex challenges facing the world today comprise the work of [Department of Energy’s] (DOE’s) 17 National Laboratories: [...] From furthering U.S. energy independence and leadership in clean technologies; to promoting innovation that advances U.S. economic competitiveness; to conducting research of the highest caliber in the physical, chemical, biological, materials, computational, and information sciences to advance understanding of the world around us-the Laboratories’ purview is expansive and further their contributions are indispensable.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2025

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Non-adiabatic approximations in time-dependent density functional theory: progress and prospects

Time-dependent density functional theory continues to draw a large number of users in a wide range of fields exploring myriad applications involving electronic spectra and dynamics. Although in principle exact, the predictivity of the calculations is limited by the available approximations for the exchange-correlation functional. In particular, it is known that the exact exchange-correlation functional has memory-dependence, but in practise adiabatic approximations are used which ignore this. Here we review the development of non-adiabatic functional approximations, their impact on calculations, and challenges in developing practical and accurate memory-dependent functionals for general purposes.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Emergent topological quantum orbits in the charge density wave phase of kagome metal CsV 3 Sb 5

The recently discovered kagome materials AV 3 Sb 5 (A = K, Rb, Cs) attract intense research interest in intertwined topology, superconductivity, and charge density waves (CDW). Although the in-plane 2 × 2 CDW is well studied, its out-of-plane structural correlation with the Fermi surface properties is less understood. In this work, we advance the theoretical description of quantum oscillations and investigate the Fermi surface properties in the three-dimensional CDW phase of CsV 3 Sb 5 . We derived Fermi-energy-resolved and layer-resolved quantum orbits that agree quantitatively with recent experiments in the fundamental frequency, cyclotron mass, and topology. We reveal a complex Dirac nodal network that would lead to a π Berry phase of a quantum orbit in the spinless case. However, the phase shift of topological quantum orbits is contributed by the orbital moment and Zeeman effect besides the Berry phase in the presence of spin-orbital coupling (SOC). Therefore, we can observe topological quantum orbits with a π phase shift in otherwise trivial orbits without SOC, contrary to common perception. Our work reveals the rich topological nature of kagome materials and paves a path to resolve different topological origins of quantum orbits.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Complexity-calibrated benchmarks for machine learning reveal when prediction algorithms succeed and mislead

Abstract Recurrent neural networks are used to forecast time series in finance, climate, language, and from many other domains. Reservoir computers are a particularly easily trainable form of recurrent neural network. Recently, a “next-generation” reservoir computer was introduced in which the memory trace involves only a finite number of previous symbols. We explore the inherent limitations of finite-past memory traces in this intriguing proposal. A lower bound from Fano’s inequality shows that, on highly non-Markovian processes generated by large probabilistic state machines, next-generation reservoir computers with reasonably long memory traces have an error probability that is at least $$\sim 60\%$$ ∼ 60 % higher than the minimal attainable error probability in predicting the next observation. More generally, it appears that popular recurrent neural networks fall far short of optimally predicting such complex processes. These results highlight the need for a new generation of optimized recurrent neural network architectures. Alongside this finding, we present concentration-of-measure results for randomly-generated but complex processes. One conclusion is that large probabilistic state machines—specifically, large $$\epsilon$$ ϵ -machines—are key to generating challenging and structurally-unbiased stimuli for ground-truthing recurrent neural network architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Ice rule breakdown and frustrated antiferrotoroidicity in an artificial colloidal Cairo ice

Abstract We combine experiments and numerical simulations to investigate the low energy states and the emergence of topological defects in an artificial colloidal ice in the Cairo geometry. This type of geometry is characterized by a mixed coordination ( z ), with coexistence of both z = 3 and z = 4 vertices. We realize this particle ice by confining field tunable paramagnetic colloidal particles within a lattice of topographic double wells at a one to one filling using optical tweezers. By raising the interaction strength via an applied magnetic field, we find that the ice rule breaks down, and positive monopoles with charge q = + 2 accumulate in the z = 4 vertices and are screened by negative ones ( q = − 1 ) in the z = 3. The resulting, strongly coupled state remains disordered. Further, via analysis of the mean chirality associated to each pentagonal plaquette, we find that the disordered ensemble for this geometry is massively degenerate and it corresponds to a frustrated antiferrotoroid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Design-to-Deployment Continuum Platform for Microscopes and Computing Ecosystems

Science ecosystems with networked computing systems and physical instruments are increasingly being deployed with a goal to achieve the productivity promised by AI-supported remote automation. In support of these efforts, the virtual infrastructure twins (VITs) have been successfully utilized to develop the orchestration codes for these ecosystems without requiring physical access to expensive instruments, such as electron microscopes. Currently, the utility of such a VIT is severely limited by the computing capacity and capability of the computing system used as its host. Furthermore, codes developed on the VIT typically need to be transferred and refactored for production use, particularly, on high-performance systems with accelerators. In response, we develop a design-to-deployment continuum platform wherein a VIT runs natively on the ecosystem's own computing system, and thereby facilitates the continual in-situ testing and transition of codes for production use. Here, we describe the development and testing of software for remote microscope steering and GPU-based image reconstruction using this platform on a multi-GPU computing system networked to Nion microscopes. We demonstrate a continual transition of steering and reconstruction codes developed under VIT platform to production ecosystem deployment.

Al-Najjar, Anees [Oak Ridge National Laboratory (O↗
DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗