Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical errors”

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 325 records · Page 18

MFNets: data efficient all-at-once learning of multifidelity surrogates as directed networks of information sources

We present an approach for constructing a surrogate from ensembles of information sources of varying cost and accuracy. The multifidelity surrogate encodes connections between information sources as a directed acyclic graph, and is trained via gradient-based minimization of a nonlinear least squares objective. While the vast majority of state-of-the-art assumes hierarchical connections between information sources, our approach works with flexibly structured information sources that may not admit a strict hierarchy. The formulation has two advantages: (1) increased data efficiency due to parsimonious multifidelity networks that can be tailored to the application; and (2) no constraints on the training data—we can combine noisy, non-nested evaluations of the information sources. Finally, numerical examples ranging from synthetic to physics-based computational mechanics simulations indicate the error in our approach can be orders-of-magnitude smaller, particularly in the low-data regime, than single-fidelity and hierarchical multifidelity approaches.

97 MATHEMATICS AND COMPUTING↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

From Data to Discovery: AI's Transformative Role in Thin Film Research

The advancement of thin film technologies is pivotal for progress in numerous fields, including energy, electronics, and quantum computing. However, the traditional trial-and-error approach to materials discovery is inherently slow and inefficient. This presentation will showcase how artificial intelligence (AI) is transforming thin film research by enabling a data-driven paradigm shift. We will highlight our past successes in applying AI to understand radiation damage in thin film oxides, demonstrating how graph analytics can unravel complex material behavior. Additionally, we will provide insights into our current work at the National Renewable Energy Laboratory, where we are leading the charge in autonomous materials science. Backed by a $14M investment in our characterization facility, we are developing AI-guided workflows that seamlessly integrate experimentation and AI-guided decision-making. By harnessing the power of AI, we aim to accelerate the discovery and design of high-performance thin films, propelling innovation across a multitude of industries.

36 MATERIALS SCIENCE↗

Embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods

We construct a family of embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods of order 2 ≤ p ≤ 4 to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction, the goals include non-defective property, large stability region, and small error values as defined in Dekker and Verwer (1984) and Kennedy et al. (2000). The new family of embedded pairs offer the ability for strong stability preserving (SSP) methods to adapt by varying the step-size. Through several numerical experiments, we assess the overall effectiveness in terms of work versus precision while also taking into consideration accuracy and stability.

97 MATHEMATICS AND COMPUTING↗

Problem-tailored Simulation of Energy Transport on Noisy Quantum Computers

The transport of conserved quantities like spin and charge is fundamental to characterizing the behavior of quantum many-body systems. Numerically simulating such dynamics is generically challenging, which motivates the consideration of quantum computing strategies. However, the relatively high gate errors and limited coherence times of today's quantum computers pose their own challenge, highlighting the need to be frugal with quantum resources. In this work we report simulations on quantum hardware of infinite-temperature energy transport in the mixed-field Ising chain, a paradigmatic many-body system that can exhibit a range of transport behaviors at intermediate times. We consider a chain with L = 12 sites and find results broadly consistent with those from ideal circuit simulators over 90 Trotter steps, containing up to 990 entangling gates. To obtain these results, we use two key problem-tailored insights. First, we identify a convenient basis – the Pauli Y basis – in which to sample the infinite-temperature trace and provide theoretical and numerical justifications for its efficiency relative to, e.g., the computational basis. Second, in addition to a variety of problem-agnostic error mitigation strategies, we employ a renormalization strategy that compensates for global nonconservation of energy due to device noise. We discuss the applicability of the proposed sampling approach beyond the mixed-field Ising chain and formulate a variational method to search for a sampling basis with small sample-to-sample fluctuations for an arbitrary Hamiltonian. This opens the door to applying these techniques in more general models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems

We explore using neural operators, or neural network representations of nonlinear maps between function spaces, to accelerate infinite-dimensional Bayesian inverse problems (BIPs) with models governed by nonlinear parametric partial differential equations (PDEs). Neural operators have gained significant attention in recent years for their ability to approximate the parameter-to-solution maps defined by PDEs using as training data solutions of PDEs at a limited number of parameter samples. The computational cost of BIPs can be drastically reduced if the large number of PDE solves required for posterior characterization are replaced with evaluations of trained neural operators. However, reducing error in the resulting BIP solutions via reducing the approximation error of the neural operators in training can be challenging and unreliable. We provide an a priori error bound result that implies certain BIPs can be ill-conditioned to the approximation error of neural operators, thus leading to inaccessible accuracy requirements in training. To reliably deploy neural operators in BIPs, we consider a strategy for enhancing the performance of neural operators: correcting the prediction of a trained neural operator by solving a linear variational problem based on the PDE residual. We show that a trained neural operator with error correction can achieve a quadratic reduction of its approximation error, all while retaining substantial computational speedups of posterior sampling when models are governed by highly nonlinear PDEs. The strategy is applied to two numerical examples of BIPs based on a nonlinear reaction–diffusion problem and deformation of hyperelastic materials. We demonstrate that posterior representations of the two BIPs produced using trained neural operators are greatly and consistently enhanced by error correction.

97 MATHEMATICS AND COMPUTING↗

Axisymmetric hydrodynamics in numerical relativity: treating coordinate singularity, artificial heating and modeling MHD instabilities

Two-dimensional axisymmetric simulations of binary neutron star (BNS) merger remnant are a cheap alternative to 3D simulations. To maintain realism for secular timescales, simulations must avoid accumulated errors from drifts in conserved quantities and artificial heating, and they must model turbulent transport in a way that remains plausible throughout the evolution. It is also crucial to avoid numerical artifacts due to the polar coordinate axis singularity. Methods that behave well near the axis often break flux-conservative form of the hydrodynamic equations, resulting in significant drifts in conserved quantities. We present a flux-conservative scheme that maintains smoothness near the axis without sacrificing conservative formulation of the equations or incurring drifts in conserved global quantities. We compare the numerical performance of different treatments of the hydrodynamic equations when evolving a hypermassive neutron star resembling the remnant of a BNS merger. These simulations demonstrate that the new scheme combines the axis smoothness of non-conservative methods with the mass and angular momentum conservation of other conservative methods on $\sim 10^2$ ms timescales of viscous and neutrino-driven evolution. Because fluid profiles remain smooth in the remnant interior, it is possible to remove artificial heating by evolving the entropy density. We show how physical heating and cooling terms can be easily calculated from source terms of the conservative evolution variables and demonstrate our implementation. Finally, we discuss and implement improvements to the effective viscosity scheme to better model the effect of magnetohydrodynamic instabilities as the remnant evolves.

axisymmetry↗

Optimal Experimental Design for Inverse Problems in the Presence of Observation Correlations

Optimal experimental design (OED) is the general formalism of sensor placement and decisions on the data collection strategy for engineered or natural experiments. This problem is prevalent in many critical fields such as battery design, numerical weather prediction, geosciences, environmental and urban studies. State-of-the-art computational methods for experimental design do not accommodate correlation structure in observational errors produced by many expensive-to-operate devices such as X-ray machines, radars, and satellites. Discarding evident data correlations leads to biased results, higher expenses, and waste of valuable resources. We present a general formulation of the OED formalism for model-constrained large-scale Bayesian linear inverse problems, where measurement errors are generally correlated. The proposed approach utilizes the Hadamard product of matrices to formulate the weighted-likelihood, and is valid for both finite as well as infinite-dimensional Bayesian inverse problems. Extensive numerical experiments are carried out for empirical verification of the proposed approach using an advection-diffusion model, where the objective is to optimally place a small set of sensors, under a limited budget, to predict the concentration of a contaminant in a closed and bounded domain.

Correlated observations↗

Quantification of modeling uncertainty in the Rayleigh damping model

Understanding and accurately characterizing energy dissipation mechanisms in civil structures during earthquakes is an important element of seismic assessment and design. The most commonly used model is attributed to Rayleigh. This paper proposes a systematic approach to quantify the uncertainty associated with Rayleigh's damping model. Bayesian calibration with embedded model error is employed to treat the coefficients of the Rayleigh model as random variables using modal damping ratios. Through a numerical example, we illustrate how this approach works and how the calibrated model can address modeling uncertainty associated with the Rayleigh damping model.

42 ENGINEERING↗

Fast dynamic aperture optimization with forward-reversal integration

A fast dynamic aperture (DA) optimization method for storage rings has been developed through the use of reversal integration. Even if dynamical systems have an exact reversal symmetry, a numerical forward integration differs from its reversal. For a chaotic trajectory, cumulative round-off errors are scaled, which results in an exponential growth on the difference. The exponential effect is a generic chaos indicator which represents the sensitivity of the chaotic motion to its initial condition. The chaos indicator of the charged particle motion can be obtained by comparing the forward integrations of particle trajectories with corresponding reversals, a.k.a. “backward integrations.” The indicator is observable even through short-term particle tracking simulations. Therefore, adopting it as an objective function could speed up optimization. Finally, the DA of the National Synchrotron Light Source II storage ring, and another test diffraction-limited light source ring, were optimized using this method for the purpose of demonstration.

43 PARTICLE ACCELERATORS↗

Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation

Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 − δ while only requiring a single copy of the initial state. Here we subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: $Θ‖\mathscr{H}‖|t|+ln(1/ϵ)+ln(1/δ)$. Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H2 molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerical Validation of an Algorithm for Combined Soiling and Degradation Analysis of Photovoltaic Systems

We describe and demonstrate an open-source algorithm for simultaneously quantifying degradation and soiling of photovoltaic (PV) systems from energy-production time series data. The new analysis is based on year-on-year degradation rate analysis combined with stochastic rate and recovery soiling analysis. The algorithm is designed to fit into the workflow provided by RdTools, a Python module maintained by NREL and collaboratively developed with the community, which provides a framework and functions for degradation and loss-factor analysis of PV field data. We demonstrate the method on numerically simulated PV data sets and show that it reduces the root-mean-square error of the P50 degradation rate estimate when soiling is present.

14 SOLAR ENERGY↗

Fast Dynamic Aperture Optimization with Reversal Integration

A fast method for dynamic aperture (DA) optimization of storage rings has been developed through the use of reversal integration. Even if dynamical systems have an exact reversal symme- try, a numerical forward integration di ers from its reversal. For chaotic trajectories, cumulative round-o errors are scaled, which results in an exponential growth in the di erence. The exponential e ect, intrinsically associated with the Lyapunov exponent, is a generic indicator of chaos because it represents the sensitivity of chaotic motion to an initial condition. A chaos indicator of the charged particle motion is then obtained by comparing the forward integrations of particle trajectories with corresponding reversals, a.k.a. \backward integrations." The indicator was con rmed to be ob- servable through short-term particle tracking simulations. Therefore, adopting it as an objective function could speed up optimization. The DA of the National Synchrotron Light Source II storage ring, and another test di raction-limited light source ring, were optimized using this method for the purpose of demonstration.

36 MATERIALS SCIENCE↗

Quarter 4 Report: Report on Final Findings and Opportunities for Future Work in the Use of Mixed Precision in Iterative Solvers

The fourth quarter of the project was spent developing an error analysis of the s-step Lanczos and CG algorithms. Our theoretical bounds and numerical experiments show that the numerical behavior of the algorithm can be significantly improved by using extra precision in a small part of the computation related to the computation and application of the Gram matrix. We have published a technical report which includes all steps of the analysis [8]; a shortened version for journal submission is in preparation. We plan to submit this paper in the following weeks. Activities related to this also include a collaboration with Ichitaro Yamazaki on gathering performance results for these new mixed precision s-step Krylov subspace methods using single/double precision on GPUs. Namely, we would like to obtain performance results that show that the performance overhead of using double the working precision in these select computations is minimal. Other activities include attending biweekly xSDK meetings and presenting a pitch talk on this work to the group on February 25, 2021. In the remainder of the document, we summarize our findings on the potential for mixed precision in classical Krylov subspace methods and s-step Krylov subspace methods, as well as key opportunities for future work.

97 MATHEMATICS AND COMPUTING↗

Sensitivity Study for Forecasting Variables of WRF-Solar Using a Tangent Linear Approach

Integrating solar generation in recent years has highlighted the need for improved accuracy in predicting solar power. Confidence in solar power forecasting can be achieved by designing an ensemble that provides reliable probabilistic information for solar radiation with reduced uncertainty and error. Ideally, ensemble members are created through the optimized perturbation of the initial conditions in numerical weather prediction (NWP) models. Tangent linear models are capable of efficiently investigating the sensitivity of solar radiation to model input parameters because they do not require individual perturbation of each variable. This sensitivity study using tangent linear models provide us the capability to identify the right variables to perturb in an ensemble prediction system. In this study, we developed tangent linear models for WRF-Solar modules that directly impact the computation of solar radiation and the simulation of cloud formation and dissipation including the Fast All-sky Model for Solar Applications (FARMS), the Noah land surface model (LSM), the Thompson microphysics, the Mello-Yamada-Nakanishi-Niino (MYNN) boundary layer parameterization, and the Deng scheme for a shallow-convection parameterization. A sensitivity analysis was conducted under various scenarios based on satellite observations and model simulations from the National Solar Radiation Data Base (NSRDB) and WRF-Solar, respectively. Critical forecasting variables that are highly sensitive to the forecasting of global horizontal irradiance (GHI), direct normal irradiance (DNI), cloud mixing ratio, cloud tendency, cloud fraction, and sensible and latent heat fluxes were determined using the relevant WRF-Solar module. This study will be used as a guidance on future research leading to high-quality probabilistic solar forecasting. In this presentation, we discuss the validation of tangent linear approach for WRF-Solar modules and illustrate how the sensitivity results are valuable in the improvement of probabilistic solar prediction.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Studying phonon coherence with a quantum sensor

Nanomechanical oscillators offer numerous advantages for quantum technologies. Their integration with superconducting qubits shows promise for hardware-efficient quantum error-correction protocols involving superpositions of mechanical coherent states. Limitations of this approach include mechanical decoherence processes, particularly two-level system (TLS) defects, which have been widely studied using classical fields and detectors. In this manuscript, we use a superconducting qubit as a quantum sensor to perform phonon number-resolved measurements on a piezoelectrically coupled phononic crystal cavity. This enables a high-resolution study of mechanical dissipation and dephasing in coherent states of variable size ($\overline{n}$ ≃ 1 – 10 phonons). We observe nonexponential relaxation and state size-dependent reduction of the dephasing rate, which we attribute to TLS. Using a numerical model, we reproduce the dissipation signatures (and to a lesser extent, the dephasing signatures) via emission into a small ensemble (N = 5) of rapidly dephasing TLS. Our findings comprise a detailed examination of TLS-induced phonon decoherence in the quantum regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Training and Generalization of Deep Operator Networks

Here, we present a novel training method for deep operator networks (DeepONets), one of the most popular neural network models for operators. DeepONets are constructed by two subnetworks, namely the branch and trunk networks. Typically, the two subnetworks are trained simultaneously, which amounts to solving a complex optimization problem in a high dimensional space. In addition, the nonconvex and nonlinear nature makes training very challenging. To tackle such a challenge, we propose a two-step training method that trains the trunk network first and then sequentially trains the branch network. The core mechanism is motivated by the divide-and-conquer paradigm and is the decomposition of the entire complex training task into two subtasks with reduced complexity. Therein the Gram–Schmidt orthonormalization process is introduced which significantly improves stability and generalization ability. On the theoretical side, we establish a generalization error estimate in terms of the number of training data, the width of DeepONets, and the number of input and output sensors. Numerical examples are presented to demonstrate the effectiveness of the two-step training method, including Darcy flow in heterogeneous porous media.

deep operator networks↗