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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2024

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↗

DOE OSTI2021

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↗

DOE OSTI2023

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↗

DOE OSTI2024

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↗

DOE OSTI2024

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↗

DOE OSTI2026

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↗

DOE OSTI2025

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)↗

DOE OSTI2021

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 ↗

DOE OSTI2025

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↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗

DOE OSTI2022

CFD-trained ANN Model for Approximating Near-occupant Condition in Real-time Simulations

The main drawback of Computational Fluid Dynamics (CFD) simulations has been the time and resource consuming nature which is not suitable for real-time applications. In this work, we first generated numerous CFD models of a given indoor space to obtain airspeed, temperature, and mean radiant temperature near an occupant as training data. Several artificial neural networks (ANN) models were trained using this CFD simulated data to approximate near real-time environmental conditions for a given occupant. This trained ANN model approach is a part of a real-time simulation of building operations using a combination of software and real hardware (HVAC equipment) approaches. The preliminary results suggest that the CFD- generated training data and the trained ANN model can accurately approximate such conditions in a real-time application, a method that has great potential in building simulation and building digital twin areas of research.

Zhang, Yun↗

DOE OSTI2021

MCML: Combining physical constraints with experimental data for a multi-purpose meta-generalized gradient approximation

The predictive power of density functional theory for materials properties can be improved without increasing the overall computational complexity by extending the generalized gradient approximation (GGA) for electronic exchange and correlation to density functionals depending on the electronic kinetic energy density in addition to the charge density and its gradient, resulting in a meta-GGA. Here, we propose an empirical meta-GGA model that is based both on physical constraints and on experimental and quantum chemistry reference data. Overall, the resulting optimized meta-GGA MCML yields improved surface and gas phase reaction energetics without sacrificing the accuracy of bulk property predictions of existing meta-GGA approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

A riming‐dependent parameterization of scattering by snowflakes using the self‐similar Rayleigh–Gans approximation

Abstract Riming is a key process of precipitation formation in ice‐containing clouds, but quantifying riming from observations is challenging, limiting our ability to evaluate the riming process in numerical weather models. One challenge for radar observations is that riming changes both the physical properties (mass, area cross‐section) and scattering properties of ice particles. These changes need to be implemented consistently as a function of riming in radar forward operators, which are required for retrievals and model evaluation in observation space. In this study, mass–size, cross‐section area–size, and backscattering cross‐section relations are developed as a function of the normalized rime mass for aggregates composed of various monomer types (columns, dendrites, needles, plates, and rosettes). The proposed framework allows us to simulate scattering properties of aggregated ice particles consistently as a function of riming in retrievals and radar forward operators. The parameterizations are developed from a large data set of simulated rimed aggregates of different sizes and monomer crystal types. The backscattering cross‐section parameterization (the “riming‐dependent parameterization”) is evaluated for radar frequencies of 35.6 and 94.0 GHz and is based on the Self‐Similar Rayleigh–Gans approximation (SSRGA), which is increasingly used to calculate microwave scattering of ice crystals and snowflakes. Compared with parameterizations from the literature that do not consider riming, the riming‐dependent parameterization leads to significantly smaller biases in terms of backscattering cross‐section. When using the particle masses and scattering properties of the individual particles simulated by the aggregation and riming model as a reference, the bias of our parameterization is below 1 dB when integrating over an exponential particle size distribution with sizes from 0.1–10 mm.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

Approximate recoverability and relative entropy II: 2-positive channels of general von Neumann algebras

Abstract We generalize our results in paper I in this series to quantum channels between general von Neumann algebras, proving the approximate recoverability of states which undergo a small change in relative entropy through the channel. To this end, we derive a strengthened form of the quantum data processing inequality for the change in relative entropy of two states under a channel between two von Neumann algebras. Compared to the usual inequality, there is an explicit lower bound involving the fidelity between the original state and a recovery channel.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Karhunen–Loève deep learning method for surrogate modeling and approximate Bayesian parameter estimation

We evaluate the performance of the Karhunen-Loève Deep Neural Network (KL-DNN) framework for surrogate modeling and approximate Bayesian parameter estimation in partial differential equation models. In the surrogate model, the Karhunen-Loève (KL) expansions are used for the dimensionality reduction of the number of unknown parameters and variables, and a deep neural network is employed to relate the reduced space of parameters to that of the state variables. The KL-DNN surrogate model is used to formulate a maximum-a-posteriori-like least-squares problem, which is randomized to draw samples of the posterior distribution of the parameters. We test the proposed framework for a hypothetical unconfined aquifer via comparison with the forward MODFLOW and inverse PEST++ iterative ensemble smoother (IES) solutions as well as the state-of-the-art Fourier neural operator (FNO) and deep operator networks (DeepONets) operator learning surrogate models. Our results show that the KL-DNN surrogate model outperforms FNO and DeepONet for forward predictions. For solving inverse problems, the randomized algorithm provides the same or more accurate Bayesian predictions of the parameters than IES as evidenced by the higher log-predictive probability of both the estimated parameter field and the forecast hydraulic head. The posterior mean obtained from the randomized algorithm is closer to the reference parameter field than that obtained with FNO as the maximum a posteriori estimate.

Approximate Bayesian inference↗

DOE OSTI2020

Global error analysis of the Chebyshev rational approximation method

The Chebyshev rational approximation method (CRAM) has become a widely adopted method for solving nuclear depletion problems. Therefore, understanding CRAM’s accuracy is important for the safe operation of nuclear power plants. This article performs a global error analysis of CRAM and finds that, as the length of the time step approaches zero, the relative error measured between the exact and CRAM solutions at a fixed end time approaches one and infinity for even and odd orders, respectively; for intermediate time step sizes, a minimum in relative error is observed. Finally, we show that the reason for CRAM’s behavior is that the method is inconsistent. Two best practices for using CRAM, derived from these results, are: (1) use CRAM order 16 or higher, (2) if necessary, increase the CRAM order when multiphysics coupling requires smaller time steps.

97 MATHEMATICS AND COMPUTING↗