Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Approximation”

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 55 records · Page 3

Approximating the particle distribution in rotating and tandem mirror traps

Steady-state distribution functions can be used to calculate stability conditions for modes, radiation energy losses and particle loss rates. Heuristic analytic approximations to these distributions can capture key behaviors of the true distributions such as the relative speeds of different transport processes while possessing computational advantages over their numerical counterparts. In this paper, we motivate and present a closed-form ana- lytic model for a distribution of particles in a centrifugal or tandem mirror. We find that our model outperforms other known models in approximating numerical steady- state simulations outside of a narrow range of low confining potentials. We demonstrate the model’s suitability in the high confining potential regime for applications such as loss-cone stability thresholds, fusion yields and available energy.

Li, G.X.

Approximating the particle distribution in rotating and tandem mirror traps

Steady-state distribution functions can be used to calculate stability conditions for modes, radiation energy losses and particle loss rates. Heuristic analytic approximations to these distributions can capture key behaviors of the true distributions such as the relative speeds of different transport processes while possessing computational advantages over their numerical counterparts. In this paper, we motivate and present a closed-form analytic model for a distribution of particles in a centrifugal or tandem mirror. We find that our model outperforms other known models in approximating numerical steady-state simulations outside of a narrow range of low confining potentials. We demonstrate the model’s suitability in the high confining potential regime for applications such as loss-cone stability thresholds, fusion yields and available energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

Analysis of Small-Angle Neutron Scattering from Blends of Charged and Neutral Polymers Based on Rod–Coil Random Phase Approximation

Blends of charged and neutral polymers are of interest due to potential applications in rechargeable batteries. In this study, concentration fluctuations in blends of charged poly[lithium 3-(methacryloyloxy)propylsulfonyl-1-(trifluoromethanesulfonyl)imide] (PLiMTFSI) and neutral poly(ethylene oxide) (PEO) were investigated by small-angle neutron scattering (SANS). The scattering data were analyzed in the framework of the random phase approximation (RPA). Since ion dissociation can lead to stiffening, the charged polymers were approximated as rods, while the neutral polymers were assumed to be random coils. This approach works reasonably well at low weight fractions of charged polymers. For blends with higher weight fractions of the charged polymer, concentration fluctuations were highly suppressed, resulting in q-independent coherent structure factors that are inconsistent with the rod-coil RPA.

Lee, Jaeyong

Breakdown of the Static Dielectric Screening Approximation of Coulomb Interactions in Atomically Thin Semiconductors

Coulomb interactions in atomically thin materials are remarkably sensitive to variations in the dielectric screening of the environment, which can be used to control exotic quantum many-body phases and engineer exciton potential landscapes. For decades, static or frequency-independent approximations of the dielectric response, where increased dielectric screening is predicted to cause an energy redshift of the exciton resonance, have been sufficient. These approximations were first applied to quantum wells and were more recently extended with initial success to layered transition metal dichalcogenides (TMDs). Here, we use charge-tunable exciton resonances to investigate screening effects in TMD monolayers embedded in materials with low-frequency dielectric constants ranging from 4 to more than 1000, a range of 2 orders of magnitude larger than in previous studies. In contrast to the redshift predicted by static models, we observe a blueshift of the exciton resonance exceeding 30 meV in higher dielectric constant environments. We explain our observations by introducing a dynamical screening model based on a solution to the Bethe-Salpeter equation (BSE). When dynamical effects are strong, we find that the exciton binding energy remains mostly controlled by the low-frequency dielectric response, while the exciton self-energy is dominated by the high-frequency one. Our results supplant the understanding of screening in layered materials and their heterostructures, introduce a knob to tune selected many-body effects, and reshape the framework for detecting and controlling correlated quantum many-body states and designing optoelectronic and quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Updimensioning strategy derived from synthetic equiaxed grain structures for approximating 3D grain size distributions from 2D visualizations with 1D parameters

We generated synthetic equiaxed grain structures using computer graphics software to explore the relationship between various grain size determination methods and true three-dimensional (3D) grain diameters. Mirroring grain measurement techniques, the synthetic 3D grain structures are imaged as 2D micrographs which are measured to yield 1D grain size parameters. Synthetic grain structures provide data at a mass scale and permit exploration of both polished and fractured surface micrographs, revealing one-to-one correspondence between exposed 2D grain cross-sections and individual 3D grains. Analysis of this correspondence yielded a procedure to approximate 3D equiaxed grain size and volume distributions based on the mode of the 2D fractograph grain size distribution. The 3D approximation procedure is shown to be less susceptible to different imaging conditions that affect small, undiscernible grains compared to the standard planimetric and linear intercept methods, which by design also tend to underestimate the 3D grain diameter. The procedure requires larger sample sizes to lower variance and a deeper analysis which could become more practical with machine learning (ML) models for grain boundary segmentation, which synthetic grain structures can help train. This work lays the foundation for analyzing other grain distributions such as columnar and composite grains in similar depth.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

A charged particle transport approximation for thick and thin plasmas

In this work, we will construct a simple method to be utilized in the interpretation of the properties of a thin plasma from a study of the transport of charged particles through it. We do so by first demonstrating how charged particle fluxes encode local plasma information in their spectra for sufficiently thick plasmas and then propose how to extend that analysis to the thin plasma limit where the extensive geometry cannot be neglected through arguments from scale separation. We provide a numerical treatment of the transport problem and demonstrate that it is in good agreement with the approximation we present. Finally, we utilize both the numerical solution and our novel approximation to study the impact of the extensive scale of the plasma on the yield and flux normalized high-energy neutron spectra resulting from the upscattering of charged fuel ions. Using this analysis, we show that (after controlling for fusion yield) for the same uniform densities and temperatures, larger plasmas have higher magnitude but softer reaction-in-flight (RIF) neutron spectra relative to smaller plasmas. This is because larger plasmas retain more knocked-on suprathermal ions within their bulk and can downscatter them to lower average energies, while smaller plasmas allow a larger fraction of high energy particles to “range out” of the system prior to substantial downscattering or inducing an RIF reaction.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

Weak entanglement approximation for nuclear structure

The interacting shell model, a configuration-interaction method, is a venerable approach for low-lying nuclear structure calculations, but it is hampered by the exponential growth of its basis dimension as one increases the single-particle space and/or the number of active particles. Recent, quantum-information-inspired work has demonstrated that the proton and neutron sectors of a nuclear wave function are weakly entangled. Furthermore, the entanglement is smaller for nuclides away from N = Z, such as heavy, neutron-rich nuclides. Here, in this study, we implement a weak entanglement approximation to bipartite configuration-interaction wave functions, approximating low-lying levels by coupling a relatively small number of many-proton and many-neutron states. This truncation scheme, which we present in the context of past approaches, reduces the basis dimension by many orders of magnitude while preserving essential features of nuclear spectra.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

In-medium similarity renormalization group with flowing 3-body operators, and approximations thereof

Here, we explore the impact of retaining three-body operators within the in-medium similarity renormalization group (IMSRG), as well as various approximations schemes. After studying two toy problems, identical fermions with a contact interaction and the Lipkin-Meshkov-Glick model, we employ the valence-space formulation of the IMSRG to investigate the even- A carbon isotopes with a chiral two-body potential. We find that retaining only those commutators expressions that scale as N 7 provides an excellent approximation of the full three-body treatment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

NLO SMEFT electroweak corrections to Higgs boson decays to four leptons in the narrow width approximation

Some of the most precise measurements of Higgs boson couplings are from the Higgs decays to 4 leptons, where deviations from the Standard Model predictions can be quantified in the framework of the Standard Model effective field theory (SMEFT). In this work, we present a complete next-to-leading order (NLO) SMEFT electroweak calculation of the rate for H → ℓ + ℓ − Z which we combine with the NLO SMEFT result for Z → ℓ + ℓ − to obtain the NLO rate for the H → 4 lepton process in the narrow width approximation. The NLO calculation provides sensitivity to a wide range of SMEFT operators that do not contribute to the rate at lowest order and demonstrates the importance of including correlations between the effects of different operators when extracting limits on SMEFT parameters. We show that the extraction of the Higgs trilinear coupling from the decay H → ℓ + ℓ − Z , Z → ℓ + ℓ − in the narrow width approximation strongly depends on the contributions of other operators that first occur at NLO. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Diagonal Approximation for Holographic Rényi Entropies

Recently, Dong et al., [A modified cosmic brane proposal for holographic Renyi entropy, J. High Energy Phys. 06 (2024) 120] proposed a modified cosmic brane prescription for computing the Rényi entropy 𝑆𝛼 of a holographic system in the presence of multiple extremal surfaces. This prescription was found by assuming a diagonal approximation, where the Rényi entropy is computed after first measuring the areas of all extremal surfaces. We derive this diagonal approximation for the case of two extremal surfaces and show that it accurately computes Rényi entropies up to 𝑂⁡(log⁡𝐺) corrections. For 𝛼 <1, this allows us to derive the modified cosmic brane prescription, which differs from the original cosmic brane prescription at leading order in 𝐺. For 𝛼 >1, it leads to the original cosmic brane prescription without needing to assume that replica symmetry is unbroken in the bulk.

FOS: Physical sciences

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms

Approximate 𝑡-Designs in Generic Circuit Architectures

Unitary 𝑡-designs are distributions on the unitary group whose first 𝑡 moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate 𝑡-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate 𝑡-design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures.

information scrambling

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data

We introduce a fast and invertible approximation for fusion plasma simulation data represented as 2D planar meshes with connectivities approximating magnetic field lines along the toroidal dimension in deformed 3D toroidal spaces. Scientific variables (e.g., density and temperature) in these fusion data are interpolated following a complex magnetic-field-line-following scheme in the toroidal space represented by a cylindrical coordinate system. This deformation in the 3D space poses challenges for root-finding and interpolation. To this end, we propose a novel paradigm for visualizing and analyzing such data based on a newly developed algorithm for constructing a 3D simplicial mesh within the deformed 3D space. Our algorithm generates a tetrahedral mesh that connects the 2D meshes using tetrahedra while adhering to the constraints on node connectivities imposed by the magnetic field-line scheme. Specifically, we first divide the space into smaller partitions to reduce complexity based on the input geometries and constraints on connectivities. Then, we independently search for a feasible tetrahedralization of each partition, considering nonconvexity. We demonstrate our method with two X-Point Gyrokinetic Code (XGC) simulation datasets on the International Thermonuclear Experimental Reactor (ITER) and Wendelstein 7-X (W7-X), and use an ocean simulation dataset to substantiate broader applicability of our method. An open source implementation of our algorithm is available at https://github.com/rcrcarissa/DeformedSpaceTet.

Ren, Congrong [The Ohio State Univ., Columbus, OH

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

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

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