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

Numerical gate synthesis for quantum heuristics on bosonic quantum processors

There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ( > 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

(Doublon) Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed, such as the Transient Heatsink Overpower Response capsule (THOR), the Transient Water Irradiation System for TREAT (TWIST), and Sirius. Each has provided valuable data for materials performance and reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments can cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used for code verification, validation and uncertainty quantification. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the verification, validation and uncertainty quantification approach. To overcome this problem, the autocorrected reactimeter algorithm (ACRA) has been developed. This approach infers a time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e., when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for developing an improved version of the ACRA that does not require frozen configurations. To develop this new algorithm, we need a precise and unbiased implementation of the inverse point kinetic equations (IPKEs) as any error in the reactivity evaluation will be propagated into the choice of the optimal spatial correction. Indeed, the previous reactimeter algorithm would use approximations, such as a negligible flux amplitude derivative, to focus on rapidity. For the numerical validation of ACRA, we aim at absolute error under for reactivity derived from signals similar to the one of this study. In this summary, we test eight different IPKE implementations. Each will process a mockup signal built for this study, similar to those that the future ACRA will process. Each reactivity output will be compared to the reference reactivity that has been used to generate the mockup signal. The implementation minimizing the difference with the reference reactivity will be used in the development of a new ACRA formulation.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Overset-Grid Method with Smooth Orbital Partitioning for Molecular Scattering Calculations

To solve molecular photoionization and electron scattering problems, we use an overset-grid representation of electronic continuum functions, which has an extended central spherical grid that overlaps small spherical grids (subgrids) centered on each atom of a polyatomic molecule. Here, in this work, we present an improved algorithm that smoothly partitions the total wave function between the central grid and the atomic subgrids. The smooth partitioning allows one to use approximately one-fourth the number of partial waves on the central grid compared to our previous implementation with switching functions. The resulting numerical method for treating electron scattering and photoionization of polyatomic molecules combines the accuracy and flexibility of pure numerical grid representations with the rapid convergence of hybrid combinations of atom-centered basis-set expansions and grid methods. The overset-grid representation is implemented using the complex Kohn variational principle for scattering and photoionization amplitudes. The faster convergence with respect to the number of central grid partial waves is demonstrated and accuracy is verified by comparisons with the previous implementation and with far more computationally demanding single-center numerical expansions in electron-molecule scattering and photoionization calculations on the neon dimer (Ne 2 ) system, carbon tetrafluoride (CF 4 ) molecule, and the pyridine (C 5 H 5 N) molecule in the static-exchange approximation.

Molecules↗
DOE OSTI2020

An analytic implementation of the IR-resummation for the BAO peak

We develop an analytic method for implementing the IR-resummation of [1], which allows one to correctly and consistently describe the imprint of baryon acoustic oscillations (BAO) on statistical observables in large-scale structure. We show that the final IR-resummed correlation function can be computed analytically without relying on numerical integration, thus allowing for an efficient and accurate use of these predictions on real data in cosmological parameter fitting. In this work we focus on the one-loop correlation function and the BAO peak. We show that, compared with the standard numerical integration method of IR-resummation, the new method is accurate to better than 0.2%, and is quite easily improvable. We also give an approximate resummation scheme which is based on using the linear displacements of a fixed fiducial cosmology, which when combined with the method described above, is about six times faster than the standard numerical integration. Finally, we show that this analytic method is generalizable to higher loop computations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗
DOE OSTI2024

Dynamical ejecta from binary neutron star mergers: Impact of a small residual eccentricity and of the equation of state implementation

Predicting the properties of the matter ejected during and after a neutron star merger is crucial to our ability to use electromagnetic observations of these mergers to constrain the masses of the neutron stars, the equation of state of dense matter, and the role of neutron star mergers in the enrichment of the Universe in heavy elements. Furthermore, our ability to reliably provide such predictions is however limited by a broad range of factors, including the finite resolution of numerical simulations, their treatment of magnetic fields, neutrinos, and neutrino-matter interactions, and the approximate modeling of the equation of state of dense matter. In this manuscript, we study specifically the role that a small residual eccentricity and different implementations of the same equation of state have on the matter ejected during the merger of a 1.3M ⊙ –1.4M ⊙ binary neutron star system. We find that a residual eccentricity e ~ 0.01, as measured ~ 4–6 orbits before merger, causes O(25%–30%) changes in the amount of ejected mass, mainly due to changes in the amount of matter ejected as a result of core bounces during merger. We note that O(1%) residual eccentricities have regularly been used in binary neutron star merger simulations as proxy for circular binaries, potentially creating an additional source of error in predictions for the mass of the dynamical ejecta.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

r 2 SCAN-D4: Dispersion corrected meta-generalized gradient approximation for general chemical applications

We combine a regularized variant of the strongly constrained and appropriately normed semilocal density functional with the latest generation semi-classical London dispersion correction. The resulting density functional approximation r 2 SCAN-D4 has the speed of generalized gradient approximations while approaching the accuracy of hybrid functionals for general chemical applications. We demonstrate its numerical robustness in real-life settings and benchmark molecular geometries, general main group and organo-metallic thermochemistry, and non-covalent interactions in supramolecular complexes and molecular crystals. Main group and transition metal bond lengths have errors of just 0.8%, which is competitive with hybrid functionals for main group molecules and outperforms them for transition metal complexes. The weighted mean absolute deviation (WTMAD2) on the large GMTKN55 database of chemical properties is exceptionally small at 7.5 kcal/mol. This also holds for metal organic reactions with an MAD of 3.3 kcal/mol. The versatile applicability to organic and metal–organic systems transfers to condensed systems, where lattice energies of molecular crystals are within the chemical accuracy (errors <1 kcal/mol).

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

Dark black holes in the mass gap

Abstract In the standard picture of stellar evolution, pair-instability — the energy loss in stellar cores due to electron-positron pair production — is predicted to prevent the collapse of massive stars into black holes with mass in the range between approximately 50 and 130 solar masses — a range known as the “black hole mass gap”. LIGO and Virgo detection of black hole binary mergers containing one or both black holes with masses in thismass gapthus challenges the standard picture, possibly pointing to an unexpected merger history, unanticipated or poorly understood astrophysical mechanisms, or new physics. Here, we entertain the possibility that a “dark sector” exists, consisting of dark electrons, dark protons, and electromagnetic-like interactions, but no nuclear forces. Dark stars would inevitably form given such dark sector constituents, possibly collapsing into black holes with masses within the mass gap. We study in detail the cooling processes necessary for successful stellar collapse in the dark sector and show that for suitable choices of the particle masses, we indeed predict populating the mass gap with dark sector black holes. In particular, we numerically find that the heavier of the two dark sector massive particles cannot be lighter than, approximately, the visible sector proton for the resulting dark sector black holes to have masses within the mass gap. We discuss constraints on this scenario and how to test it with future, larger black hole merger statistics.

Astronomy & Astrophysics↗
DOE OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Droplet formation simulation using mixed finite elements

Droplet formation happens in finite time due to the surface tension force. The linear stability analysis is useful to estimate the size of a droplet but fails to approximate the shape of the droplet. This is due to a highly nonlinear flow description near the point where the first pinch-off happens. A one-dimensional axisymmetric mathematical model was first developed by Eggers and Dupont [“Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] using asymptotic analysis. This asymptotic approach to the Navier–Stokes equations leads to a universal scaling explaining the self-similar nature of the solution. Numerical models for the one-dimensional model were developed using the finite difference [Eggers and Dupont, “Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] and finite element method [Ambravaneswaran et al., “Drop formation from a capillary tube: Comparison of one-dimensional and two-dimensional analyses and occurrence of satellite drops,” Phys. Fluids 14, 2606–2621 (2002)]. The focus of this study is to provide a robust computational model for one-dimensional axisymmetric droplet formation using the Portable, Extensible Toolkit for Scientific Computation. The code is verified using the Method of Manufactured Solutions and validated using previous experimental studies done by Zhang and Basaran [“An experimental study of dynamics of drop formation,” Phys. Fluids 7, 1184–1203 (1995)]. The present model is used for simulating pendant drops of water, glycerol, and paraffin wax, with an aspiration of extending the application to simulate more complex pinch-off phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗
DOE OSTI2020

A holey cavity for single-transducer 3D ultrasound imaging with physical optimization

Within the compressive sensing (CS) framework, one effective way to increase the likelihood of successful signal reconstruction is to employ random processes in the construction of the sensing matrix. This work presents a 3D holey cavity, with diverse frequency modes, to spectrally code, that is, randomize, the ultrasound wave fields. The simulated results show that the use of such a cavity enables imaging simple or complex targets, such as spheres or the letter E, by only a single transceiver—something that is not possible without the use of a coding structure like the cavity. The effect of noise on imaging results and the size of the targets on the first-order Born approximation (BA) are also investigated. Moreover, this study attempts to optimize the cavity, based on a single numerical metric, such as the sum of singular values (SSV) or mutual coherence (MC). Yet, it will be shown that neither of these metrics can consistently compare the norm-one imaging performance between two cavities of different materials or hole sizes. This leaves finding a quantitative metric for these kinds of optimizations an open problem.

42 ENGINEERING↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Relativistic levels of mesic atoms

We revisit the derivation of the covariant two-body scalar-fermion equation with a Coulomb interaction, presented in a previous paper. We show that it can be given the formal aspect of a Dirac equation, but for the fact that the eigenvalue is also contained in one of the coefficients and thus it is not linearly included. The discussion of the boundary value problem is therefore different, although some properties of the Dirac equation can be recovered in an approximation bringing back to the concept of reduced mass. We discuss a mixed analytic-numerical method of solution which allows to obtain very accurate results and we calculate the lowest levels, states and QED corrections for pionic and kaonic atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗
DOE OSTI2021

Decentralized Data-Driven Estimation of Generator Rotor Speed and Inertia Constant Based on Adaptive Unscented Kalman Filter

This paper proposes an online decentralized and data-driven method for synchronous generator rotor speed and inertia estimation. First, an analytical relationship between the generator terminal voltage/current phasors and its internal rotor speed is derived using the Thevenin equivalent. The parameters of the latter are obtained via a recursive estimator, which allows us to estimate the generator's internal rotor speed from voltage/current phasors without the need for any generator information. Second, we reformulate the equivalent swing equation into the Kalman filter form, which enables us to use a priori-estimated internal rotor speed along with measured real and reactive power injections to obtain an estimate of the inertia for each online synchronous generator. This is achieved through an adaptive unscented Kalman filter. We demonstrate that the use of terminal bus frequency to approximate the rotor speed for inertia estimation by existing methods leads to large estimation biases/errors. Numerical simulations carried out on the IEEE 39-bus and Texas 2000-bus systems reveal that our proposed method is consistently more accurate than existing methods. Moreover, our proposed method is insensitive to both the type and location of system disturbances, and it is robust to different levels of measurement noise.

bus frequency↗
DOE OSTI2022

Hybrid data-driven and model-informed online tool wear detection in milling machines

Precision machining tool wear is responsible for low product throughput and quality. Monitoring the tool wear online is vital to prevent degradation in machining quality. However, direct real-time tool wear measurement is not practical. This paper presents residual-based anomaly detection models, combining a hybrid model comprised of a physics-based model and a data-driven model (a decision tree or a neural network) to predict signals of interest (e.g., power or forces) under nominal conditions, followed by Page’s cumulative sum test for detecting tool wear on-line using the computer numerical control machine measurements. The most informative features are ranked using dynamic programming and its approximation variants from real-time measurements and machine settings, such as the width of cut, depth of cut, feed rate and spindle speed, that serve as inputs to the predictive models. The baseline nominal model is incrementally updated with experimental data via a gradient boosted adaptation model to generate the residuals that account for discrepancies between the actual machine data under normal conditions and the baseline nominal model predictions. The hybrid model is validated against 20 Mazak milling machine experimental tests and one Haas run-to-failure experiment. The proposed anomaly detector is applied to synthetic data from simulations of the physics-based model at different operating conditions, measurement noise levels, and tool wear levels, and the methods were able to achieve an overall 92% accuracy in data with 1% noise. The anomaly detection methods based on hybrid model reduced the false alarms of either the data-driven or physical-based models alone, and are found to be capable of good online detection of tool wear.

42 ENGINEERING↗
DOE OSTI2020

Molecular bond stabilization in the strong-field dissociation of O 2 +

We theoretically examine the rotational and vibrational dynamics of O 2 + molecular ions exposed to intense, short laser pulses for conditions realized in contemporary pump-probe experiments. We solve the time-dependent Schrödinger equation within the Born-Oppenheimer approximation for an initial distribution of randomly aligned molecular ions. For fixed peak intensities, our numerical results show that total, angle-integrated O 2 + → O( 3 P) + O + ( 4 S 0 ) dissociation yields do not monotonically increase with increasing infrared-probe pulse duration. We find this pulse-duration-dependent stabilization to be consistent with the transient trapping of nuclear probability density in a light-induced (bond-hardening) potential-energy surface and robust against rotational excitation. We analyze this stabilization effect and its underlying bond-hardening mechanism (i) in the time domain, by following the evolution of partial nuclear probability densities associated with the dipole-coupled O 2 + (a 4 Π u ) and O 2 + (f 4 Π g ) cationic states, and (ii) in the frequency domain, by examining rovibrational quantum-beat spectra for the evolution of the partial nuclear probability densities associated with these states. In this work, our analysis reveals the characteristic timescale for the bond-hardening mechanism in O 2 + and explains the onset of bond stabilization for sufficiently long pulse durations.

74 ATOMIC AND MOLECULAR PHYSICS↗