Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical approximations”

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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quadrature Based Neural Network Learning of Stochastic Hamiltonian Systems

Hamiltonian Neural Networks (HNNs) provide structure-preserving learning of Hamiltonian systems. In this paper, we extend HNNs to structure-preserving inversion of stochastic Hamiltonian systems (SHSs) from observational data. We propose the quadrature-based models according to the integral form of the SHSs’ solutions, where we denoise the loss-by-moment calculations of the solutions. The integral pattern of the models transforms the source of the essential learning error from the discrepancy between the modified Hamiltonian and the true Hamiltonian in the classical HNN models into that between the integrals and their quadrature approximations. This transforms the challenging task of deriving the relation between the modified and the true Hamiltonians from the (stochastic) Hamilton–Jacobi PDEs, into the one that only requires invoking results from the numerical quadrature theory. Meanwhile, denoising via moments calculations gives a simpler data fitting method than, e.g., via probability density fitting, which may imply better generalization ability in certain circumstances. Numerical experiments validate the proposed learning strategy on several concrete Hamiltonian systems. The experimental results show that both the learned Hamiltonian function and the predicted solution of our quadrature-based model are more accurate than that of the corrected symplectic HNN method on a harmonic oscillator, and the three-point Gaussian quadrature-based model produces higher accuracy in long-time prediction than the Kramers–Moyal method and the numerics-informed likelihood method on the stochastic Kubo oscillator as well as other two stochastic systems with non-polynomial Hamiltonian functions. Moreover, the Hamiltonian learning error εH arising from the Gaussian quadrature-based model is lower than that from Simpson’s quadrature-based model. These demonstrate the superiority of our approach in learning accuracy and long-time prediction ability compared to certain existing methods and exhibit its potential to improve learning accuracy via applying precise quadrature formulae.

Mathematics↗
DOE OSTI2022

Detecting and characterizing simulated sea breezes over the US northeastern coast with implications for offshore wind energy

Abstract. With the planned construction of vast offshore wind farms along the US East Coast, identifying and understanding key coastal processes, such as sea breezes, has become a critical need for the sustainability and development of US offshore wind energy. In this study, a new two-step identification method is proposed to detect and characterize three types of sea breezes (pure, corkscrew and backdoor) over the US northeastern coast from a year-long WRF (Weather Research and Forecasting) simulation. The results suggest that the proposed detection method can identify the three different types of sea breezes in the model simulation. Key sea breeze features, such as the calm zone associated with pure sea breezes and coastal jets associated with corkscrew sea breezes, are evident in the sea breeze composite imagery. In addition, the simulated sea breeze events indicate a seasonal transition from pure to corkscrew sea breeze between March and August as the land–sea thermal contrast increases. Furthermore, the location and extension of the sea breeze front are different for each type of sea breeze, suggesting that the coastal impact of sea breeze varies with sea breeze type. From the wind energy perspective, the power production associated with a 10 MW offshore wind turbine would be approximately 3 to 4 times larger during a corkscrew sea breeze event than the other two types of sea breezes. This highlights the importance of identifying the correct type of sea breeze in numerical weather/wind energy forecasting.

17 WIND ENERGY↗
DOE OSTI2022

Frame invariant neural network closures for Kraichnan turbulence

Numerical simulations of geophysical and atmospheric flows have to rely on parameterizations of subgrid scale processes due to their limited spatial resolution. Despite substantial progress in developing parameterization (or closure) models for subgrid scale (SGS) processes using physical insights and mathematical approximations, they remain imperfect and can lead to inaccurate predictions. In recent years, machine learning has been successful in extracting complex patterns from high-resolution spatio-temporal data, leading to improved parameterization models, and ultimately better coarse grid prediction. However, the inability to satisfy known physics and poor generalization hinders the application of these models for real-world problems. In this work, we put forth a frame invariant closure approach to improve the accuracy and generalizability of deep learning-based subgrid scale closure models by embedding physical symmetries directly into the structure of the neural network. Specifically, we utilized specialized layers within the convolutional neural network in such a way that desired constraints are theoretically guaranteed without the need for any regularization terms. We demonstrate our framework for a two-dimensional decaying turbulence test case mostly characterized by the forward enstrophy cascade. We show that our frame invariant SGS model (i) accurately predicts the subgrid scale source term, (ii) respects the physical symmetries such as translation, Galilean, and rotation invariance, and (iii) is numerically stable when implemented in coarse-grid simulation with generalization to different initial conditions and Reynolds number. This work opens up a possibility of connecting physics-based theories and data-driven modeling paradigms, and thus represents a promising step towards the development of physically consistent data-driven turbulence closure models.

42 ENGINEERING↗
DOE OSTI2023

A unified and constructive framework for the universality of neural networks

Abstract One of the reasons why many neural networks are capable of replicating complicated tasks or functions is their universal approximation property. Though the past few decades have seen tremendous advances in theories of neural networks, a single constructive and elementary framework for neural network universality remains unavailable. This paper is an effort to provide a unified and constructive framework for the universality of a large class of activation functions including most of the existing ones. At the heart of the framework is the concept of neural network approximate identity (nAI). The main result is as follows: any nAI activation function is universal in the space of continuous functions on compacta. It turns out that most of the existing activation functions are nAI, and thus universal. The framework induces several advantages over the contemporary counterparts. First, it is constructive with elementary means from functional analysis, probability theory, and numerical analysis. Second, it is one of the first unified and constructive attempts that is valid for most of the existing activation functions. Third, it provides new proofs for most activation functions. Fourth, for a given activation and error tolerance, the framework provides precisely the architecture of the corresponding one-hidden neural network with a predetermined number of neurons and the values of weights/biases. Fifth, the framework allows us to abstractly present the first universal approximation with a favorable non-asymptotic rate. Sixth, our framework also provides insights into the developments, and hence providing constructive derivations, of some of the existing approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2020

Learning compact physics‐aware delayed photocurrent models using dynamic mode decomposition

Abstract Radiation‐induced photocurrent in semiconductor devices can be simulated using complex physics‐based models, which are accurate, but computationally expensive. This presents a challenge for implementing device characteristics in high‐level circuit simulations where it is computationally infeasible to evaluate detailed models for multiple individual circuit elements. In this work we demonstrate a procedure for learning compact delayed photocurrent models that are efficient enough to implement in large‐scale circuit simulations, but remain faithful to the underlying physics. Our approach utilizes dynamic mode decomposition (DMD), a system identification technique for learning reduced‐order discrete‐time dynamical systems from time series data based on singular value decomposition. To obtain physics‐aware device models, we simulate the excess carrier density induced by radiation pulses by solving numerically the ambipolar diffusion equation, then use the simulated internal state as training data for the DMD algorithm. Our results show that the significantly reduced‐order delayed photocurrent models obtained via this method accurately approximate the dynamics of the internal excess carrier density—which can be used to calculate the induced current at the device boundaries—while remaining compact enough to incorporate into larger circuit simulations.

Hanson, Joshua↗
DOE OSTI2020

A benchmark of Gutzwiller conjugate gradient minimization method in ground state energy calculations of dimers

Herein we present numerical results of ground-state energies of 9 molecules in the well-established G2 molecule set given by the Gutzwiller conjugate gradient minimization (GCGM) method. The method, beyond the commonly used Gutzwiller approximation, was recently developed based on Gutzwiller variational wave functions. We find that compared to benchmark data given by full configuration interaction, GCGM total energies are reasonably well reproduced with the minimum basis set. To include the dynamical correlation beyond the minimal basis calculations, we adopt the local density approximation for the dynamical correlation energy $E_c$. By comparing the results with benchmark data given by experiments and large-basis configuration interaction, the GCGM total energies with $E_c$ are in general better reproduced, but discrepancies are still observed for some dimers.

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

A reduced-order model for nonlinear radiative transfer problems based on moment equations and POD-Petrov-Galerkin projection of the normalized Boltzmann transport equation

A data-driven projection-based reduced-order model (ROM) for nonlinear thermal radiative transfer (TRT) problems is presented. The TRT ROM is formulated by (i) a hierarchy of low-order quasidiffusion (aka variable Eddington factor) equations for moments of the radiation intensity and (ii) the normalized Boltzmann transport equation (BTE). The multilevel system of moment equations is derived by projection of the BTE onto a sequence of subspaces which represent elements of the phase space of the problem. Exact closure for the moment equations is provided by the Eddington tensor. A Petrov-Galerkin (PG) projection of the normalized BTE is formulated using a proper orthogonal decomposition (POD) basis representing the normalized radiation intensity over the whole phase space and time. The Eddington tensor linearly depends on the solution of the normalized BTE. By linear superposition of the POD basis functions, a low-rank expansion of the Eddington tensor is constructed with coefficients defined by the PG projected normalized BTE. The material energy balance (MEB) equation is coupled with the effective gray low-order equations which exist on the same dimensional scale as the MEB equation. The resulting TRT ROM is structure and asymptotic preserving. A detailed analysis of the ROM is performed on the classical Fleck-Cummings (F-C) TRT multigroup test problem in 2D geometry. Numerical results are presented to demonstrate the ROM's effectiveness in the simulation of radiation wave phenomena. Importantly, the ROM is shown to produce solutions with sufficiently high accuracy while using low-rank approximation of the normalized BTE solution. Essential physical characteristics of supersonic radiation wave are preserved in the ROM solutions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Efficient proactive vehicle relocation for on-demand mobility service with recurrent neural networks

One major challenge for on-demand mobility service (OMS) providers is to seamlessly match empty vehicles with trip requests so that the total vacant mileage is minimized. In this work, we develop an innovative data-driven approach for devising efficient vehicle relocation policy for OMS that (1) proactively relocates vehicles before the demand is observed and (2) reduces the inequality among drivers' income so that the proactive relocation policy is fair and is likely to be followed by drivers. Our approach represents the fusion of optimization and machine learning methods, which comprises three steps: First, we formulate the optimal proactive relocation as an optimal/stable matching problems and solve for global optimal solutions based on historical data. Second, the optimal solutions are then grouped and fed to train the deep learning models which consist of fully connected layers and long short-term memory networks. Low rank approximation is introduced to reduce the model complexity and improve the training performances. Finally, we use the trained model to predict the relocation policy which can be implemented in real time. We conduct comprehensive numerical experiments and sensitivity analyses to demonstrate the performances of the proposed method using New York City taxi data. Here, the results suggest that our method will reduce empty mileage per trip by 54-70% under optimal matching strategy, and a 25-32% reduction can also be achieved by following stable matching strategy. We also validate that the predicted relocation policies are robust in the presence of uncertain passenger demand level and passenger trip-requesting behavior.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Bayesian Poroelastic Aquifer Characterization From InSAR Surface Deformation Data. 2. Quantifying the Uncertainty

Uncertainty quantification of groundwater (GW) aquifer parameters is critical for efficient management and sustainable extraction of GW resources. These uncertainties are introduced by the data, model, and prior information on the parameters. We develop a Bayesian inversion framework that uses Interferometric Synthetic Aperture Radar (InSAR) surface deformation data to infer the laterally heterogeneous permeability of a transient linear poroelastic model of a confined GW aquifer. The Bayesian solution of this inverse problem takes the form of a posterior probability density of the permeability. Exploring this posterior using classical Markov chain Monte Carlo (MCMC) methods is computationally prohibitive due to the large dimension of the discretized permeability field and the expense of solving the poroelastic forward problem. However, in many partial differential equation (PDE)-based Bayesian inversion problems, the data are only informative in a few directions in parameter space. For the poroelasticity problem, we prove this property theoretically for a one-dimensional problem and demonstrate it numerically for a three-dimensional aquifer model. Here we design a generalized preconditioned Crank-Nicolson (gpCN) MCMC method that exploits this intrinsic low dimensionality by using a low-rank-based Laplace approximation of the posterior as a proposal, which we build scalably. The feasibility of our approach is demonstrated through a real GW aquifer test in Nevada. The inherently two-dimensional nature of InSAR surface deformation data informs a sufficient number of modes of the permeability field to allow detection of major structures within the aquifer, significantly reducing the uncertainty in the pressure and the displacement quantities of interest.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Learning physics-based reduced-order models from data using nonlinear manifolds

Here we present a novel method for learning reduced-order models of dynamical systems using nonlinear manifolds. First, we learn the manifold by identifying nonlinear structure in the data through a general representation learning problem. The proposed approach is driven by embeddings of low-order polynomial form. A projection onto the nonlinear manifold reveals the algebraic structure of the reduced-space system that governs the problem of interest. The matrix operators of the reduced-order model are then inferred from the data using operator inference. Numerical experiments on a number of nonlinear problems demonstrate the generalizability of the methodology and the increase in accuracy that can be obtained over reduced-order modeling methods that employ a linear subspace approximation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Drift-kinetic effects of tungsten on plasma response to RMP in ITER

Here, effects of high- Z ( Z is the particle charge number) tungsten impurity ions on the plasma response to the resonant magnetic perturbation (RMP) field are numerically investigated for the ITER 15 MA baseline scenario, where the tungsten contribution to the plasma response is computed with a drift-kinetic model while the bulk thermal particle contributions follow the fluid approximation. The study yields three highlights: (i) the drift-kinetic contribution of the tungsten impurity exerts minor influence on the plasma response compared to that computed by the pure fluid model without tungsten; (ii) a new figure of merit, based on the resonant spectrum perturbation at the plasma boundary surface, results in different optimal coil phasing compared to that previously obtained by maximizing the edge-peeling plasma response; (iii) the optimal $n = 3$ RMP (for edge localized mode (ELM) control, $n$ is the toroidal mode number) is found to induce a large tungsten particle influx near the plasma edge associated with the neoclassical toroidal viscosity. The study thus provides useful data on the compatibility of the full tungsten wall with RMP ELM control in ITER.

ITER↗
DOE OSTI2025

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Generative Vulnerability Assessment for Cyber-Physical Systems

Cyber-physical systems (CPS) are highly susceptible to malicious attacks due to their complex dynamics and interconnectivity. A comprehensive understanding of their vulnerabilities is essential for designing effective resilience measures. This paper presents a data-driven attack generative system for evaluating the vulnerability of CPS. The proposed approach formulates the vulnerability assessment problem as determining the feasibility of a specific attack set based on two boundary functions that represent the effectiveness and stealthiness of attacks. The attack generative model is trained using a custom loss function, with two universal approximators designed to learn the effectiveness and stealthiness functions simultaneously. Theoretical results for successful generation and asymptotic convergence of the resulting training algorithm are given. As a result, the proposed approach is evaluated via numerical simulation of an IEEE 14-bus system and gas pipeline systems, demonstrating its viability in learning how to attack nonlinear CPS and identify potential vulnerabilities.

Computer systems organization↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum-enhanced photoprotection in neuroprotein architectures emerges from collective light-matter interactions

Background Superradiance is the phenomenon of many identical quantum systems absorbing and/or emitting photons collectively at a higher rate than any one system can individually. This phenomenon has been studied analytically in idealized distributions of electronic two-level systems (TLSs), each with a ground and excited state, as well as numerically in realistic photosynthetic nanotubes and cytoskeletal architectures. Methods Superradiant effects are studied here in idealized toy model systems and realistic biological mega-networks of tryptophan (Trp) molecules, which are strongly fluorescent amino acids found in many proteins. Each Trp molecule acts as a chromophore absorbing in the ultraviolet spectrum and can be treated approximately as a TLS, with its 1 L a excited singlet state; thus, organized Trp networks can exhibit superradiance. Such networks are found, for example, in microtubules, actin filaments, and amyloid fibrils. Microtubules and actin filaments are spiral-cylindrical protein polymers that play significant biological roles as primary constituents of the eukaryotic cytoskeleton, while amyloid fibrils have been targeted in a variety of neurodegenerative diseases. We treat these proteinaceous Trp networks as open quantum systems, using a non-Hermitian Hamiltonian to describe interactions of the chromophore network with the electromagnetic field. We numerically diagonalize the Hamiltonian to obtain its complex eigenvalues, where the real part is the energy and the imaginary part is its associated enhancement rate. We also consider multiple realizations of increasing static disorder in either the site energies or the decay rates. Results We obtained the energies and enhancement rates for realistic microtubules, actin filament bundles, and amyloid fibrils of differing lengths, and we use these values to calculate the quantum yield, which is the ratio of the number of photons emitted to the number of photons absorbed. We find that all three of these structures exhibit highly superradiant states near the low-energy portion of the spectrum, which enhances the magnitude and robustness of the quantum yield to static disorder and thermal noise. Conclusion The high quantum yield and stable superradiant states in these biological architectures may play a photoprotective rolein vivo, downconverting energetic ultraviolet photons—absorbed from those emitted by reactive free radical species—to longer, safer wavelengths and thereby mitigating biochemical stress and photophysical damage. Contrary to conventional assumptions that quantum effects cannot survive in large biosystems at high temperatures, our results suggest that macropolymeric collectives of TLSs in microtubules, actin filaments, and amyloid fibrils exhibit increasingly observable and robust effects with increasing length, up to the micron scale, due to quantum coherent interactions in the single-photon limit. Superradiant enhancement and high quantum yield exhibited in neuroprotein polymers could thus play a crucial role in information processing in the brain, the development of neurodegenerative diseases such as Alzheimer’s and related dementias, and a wide array of other pathologies characterized by anomalous protein aggregates.

Physics↗
DOE OSTI2024

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗