Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 559 records · Page 31

Constrained Local Approximate Ideal Restriction for Advection-Diffusion Problems

Herein this paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, $\ell \text{AIR}$ (local approximate ideal restriction), that was developed for solving advection-dominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of $\ell \text{AIR}$ in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in $\ell \text{AIR}$. The resulting constrained $\ell \text{AIR}$ algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.

97 MATHEMATICS AND COMPUTING↗

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗

Mathematical Model for Li-S Cell with Shuttling-Induced Capacity Loss Approximation

Lithium sulfur (Li-S) batteries have the potential to outperform the current lithium ion batteries and transform the technology of the future. However, dissolution, diffusion, and shuttling of the dissolved polysulfides result in parasitic reactions and substantial capacity loss. To provide a better understanding of the shuttling process, a 1D porous electrode mathematical model has been developed in this paper. An approximation method is used to account for the shuttling-induced capacity loss by adding an extra source/sink term in the material balance equations for the species involved in the parasitic reactions. Shuttling constants used in the source terms can be determined by fitting the model predictions to the experimental measurements. Here, the results showed that by including the approximation method, the model was able to predict the active material loss and the continuous decrease of volume fractions of Li 2 S on the cathode surface. The model sheds light on the capacity loss mechanism occurring inside the cell as a result of the shuttling of polysulfides.

25 ENERGY STORAGE↗

Revisiting the Hail Radar Reflectivity–Kinetic Energy Flux Relation by Combining T-Matrix and Discrete Dipole Approximation Calculations to Size Distribution Observations

The retrieval of hail kinetic energy with weather radars or its simulation in numerical models is challenging because of the shape complexity and variable density of hailstones. We combine 3D scans of individual hailstones with measurements of the particle size distributions (PSD) and T-matrix calculations to understand how hail reflectivity Z changes when approximating hailstones as spheroids, as compared to the realistic shapes obtained by 3D scanning technology. Additionally, recent terminal velocity relations are used to compare Z to the hail kinetic energy flux E ˙ . We parameterize the hail backscattering cross sections at L, S, C, and X bands as a function of size between 0.5 and 5.0 cm, matching the range of the observed PSDs. The scattering calculations use the T-matrix method for size parameters below 1.0 and the discrete dipole approximation (DDA) method otherwise. The DDA calculations are done for 48 digital models of realistic hailstones of sizes between 1 and 5 cm. The DDA cross sections are calculated for multiple orientations and averaged assuming a fully random orientation distribution to provide a single value per hailstone. The T-matrix reflectivity assuming solid ice spheres presents negligible differences to DDA results for size parameters below 1.0. Therefore, T matrix was used to fill in the gaps left by the DDA calculations. The results are mapped to the same size bins of the observed PSDs, allowing the calculation of the radar reflectivity. This is then correlated to E ˙ , allowing a potential improvement of past retrieval methods of E ˙ from Z in multiple wavelengths.

54 ENVIRONMENTAL SCIENCES↗

Stability and Convergence of Solutions to Stochastic Inverse Problems Using Approximate Probability Densities

Data-consistent inversion is designed to solve a class of stochastic inverse problems where the solution is a pullback of a probability measure specified on the outputs of a quantities of interest (QoI) map. Here, this work presents stability and convergence results for the case where finite QoI data result in an approximation of the solution as a density. Given their popularity in the literature, separate results are proven for three different approaches to measuring discrepancies between probability measures: f-divergences, integral probability metrics, and L p metrics. In the context of integral probability metrics, we also introduce a pullback probability metric that is well-suited for data-consistent inversion. This fills a theoretical gap in the convergence and stability results for data-consistent inversion that have mostly focused on convergence of solutions associated with approximate maps. Numerical results are included to illustrate key theoretical results with intuitive and reproducible test problems that include a demonstration of convergence in the measure-theoretic "almost" sense.

97 MATHEMATICS AND COMPUTING↗

Design of double- and multi-bend achromat lattices with large dynamic aperture and approximate invariants

A numerical method to design nonlinear double- and multi-bend achromat (DBA and MBA) lattices with approximate invariants of motion is investigated. The search for such nonlinear lattices is motivated by Fermilab’s Integrable Optics Test Accelerator (IOTA), whose design is based on an integrable Hamiltonian system with two invariants of motion. While it may not be possible to design an achromatic lattice for a dedicated synchrotron light source storage ring with one or more exact invariants of motion, it is possible to tune the sextupoles and octupoles in existing DBA and MBA lattices to produce approximate invariants. In our procedure, the lattice is tuned while minimizing the turn-by-turn fluctuations of the Courant-Snyder actions J x and J y at several distinct amplitudes, while simultaneously minimizing diffusion of the on-energy betatron tunes. The resulting lattices share some important features with integrable ones, such as a large dynamic aperture, trajectories confined to invariant tori, robustness to resonances and errors, and a large amplitude-dependent tune-spread. Compared to the nominal NSLS-II lattice, the single- and multi-bunch instability thresholds are increased and the bunch-by-bunch feedback gain can be reduced.

43 PARTICLE ACCELERATORS↗

Rapid, Approximate Multi-Axis Vibration Testing [Slides]

Sequential single-axis testing provides a poor approximation of service environments. Multi-axis vibration tests are not yet standard practice. How good do multi-axis tests need to be to replace single-axis testing in practice? Is the simplest possible multi-axis test close to single-axis testing in test quality? Can single-axis testing techniques provide a sufficient rapid approximation to a multi-axis test? How much can we improve multi-axis test quality by optimizing passive test fixture hardware instead of adding active excitation sources?

42 ENGINEERING↗

On the approximations underpinning fast nuclear cloud models

Fast nuclear cloud models have been used for many decades to predict cloud rise and growth following a nuclear detonation for both emergency response and debris collections mission planning. We present derivations and discussions of the approximations made by such fast nuclear cloud models in common use. In particular, the models we discuss all fundamentally rely on an empirical entrainment parameter to inexpensively model the cloud rise and growth of a buoyant bubble due to entrainment of an ambient air mass on its surface. We show the particular circumstances under which these models are equivalent as well as apply a virtual mass correction throughout them. Aside from some minor differences in representation and the use of the Boussinesq approximation, these models are all very similar and necessitate the specification of an entrainment parameter to accurately determine the cloud rise.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Approximate Quantum Codes From Long Wormholes

We discuss families of approximate quantum error correcting codes which arise as the nearly-degenerate ground states of certain quantum many-body Hamiltonians composed of non-commuting terms. For exact codes, the conditions for error correction can be formulated in terms of the vanishing of a two-sided mutual information in a low-temperature thermofield double state. We consider a notion of distance for approximate codes obtained by demanding that this mutual information instead be small, and we evaluate this mutual information for the SYK model and for a family of low-rank SYK models. After an extrapolation to nearly zero temperature, we find that both kinds of models produce fermionic codes with constant rate as the number, N , of fermions goes to infinity. For SYK, the distance scales as N 1 / 2 , and for low-rank SYK, the distance can be arbitrarily close to linear scaling, e.g. N .99 , while maintaining a constant rate. We also consider an analog of the no low-energy trivial states property which we dub the no low-energy adiabatically accessible states property and show that these models do have low-energy states that can be prepared adiabatically in a time that does not scale with system size N . We discuss a holographic model of these codes in which the large code distance is a consequence of the emergence of a long wormhole geometry in a simple model of quantum gravity.

Physics↗

Photon (Non)Conservation in the Reduced Speed of Light Approximation and How to (Almost) Fix It

The "Reduced Speed of Light" (RSL) approximation is commonly used to speed up radiative transfer calculations in cosmological simulations. However, it has been shown previously that the RSL approximation leads to photon non-conservation when the radiation field is rapidly evolving in time. I show that these missing photons can be counted exactly for some numerical schemes. Adding them back into a simulation, however, is a much harder task. I show one example of such a scheme, which achieves sub-percent accuracy on simple tests. Unfortunately, the scheme performs much worse on semi-realistic simulations of cosmic reionization, leading to a faster overlap and significant errors in the point-wise comparison of the RSL radiation field with the reference simulation that maintains the full speed of light for the radiative transfer.

Gnedin, Nickolay Y. [Fermilab; Chicago U., KICP; C↗

Dilute Paramagnetism and Non-Trivial Topology in Quasicrystal Approximant Fe4Al13

A very fundamental property of both weakly and strongly interacting materials is the nature of their magnetic response. In this work, we detail the growth of crystals of the quasicrystal approximant Fe4Al13 with an Al flux solvent method. We characterize our samples using electrical transport and heat capacity, yielding results consistent with a simple non-magnetic metal. However, magnetization measurements portray an extremely unusual response for a dilute paramagnet and do not exhibit the characteristic Curie behavior expected for a weakly interacting material at high temperature. Electronic structure calculations confirm metallic behavior but also indicate that each isolated band near the Fermi energy hosts non-trivial topologies, including strong, weak, and nodal components, with resultant topological surface states distinguishable from bulk states on the (001) surface. With half-filled flat bands apparent in the calculation, but an absence of long-range magnetic order, the unusual quasi-paramagnetic response suggests the dilute paramagnetic behavior in this quasicrystal approximant is surprising and may serve as a test of the fundamental assumptions that are taken for granted for the magnetic response of weakly interacting systems.

Avers, Keenan E. (ORCID:0000000223441939)↗

Natively Periodic Fast Multipole Method: Approximating the Optimal Green’s Function

The fast multipole method (FMM) obeys periodic boundary conditions "natively" if it uses a periodic Green's function for computing the multipole expansion in the interaction zone of each FMM oct-tree node. One can define the "optimal" Green's function for such a method that results in the numerical solution that converges to the equivalent particle-mesh (PM) solution in the limit of sufficiently high order of multipoles. A discrete functional equation for the optimal Green's function can be derived, but is not practically useful as methods for its solution are not known. Instead, this paper presents an approximation for the optimal Green's function that is accurate to better than 10 -3 in ${L}_{\mathrm{MAX}}$ norm and 10 -4 in L 2 norm for practically useful multipole counts. Such an approximately optimal Green's function offers a practical way for implementing the FMM with periodic boundary conditions natively, without the need to compute lattice sums or to rely on hybrid FMM-PM approaches.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗