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 343 records · Page 19

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗

Comparative investigations of multi-fidelity modeling on performance of electrostatically-actuated cracked micro-beams

Silicon is a commonly used material for the fabrication of beams for use in micro-electrical-mechanical systems (MEMS). Although silicon is a brittle material, it has been shown to accumulate fatigue damage at the micro-scale. Understanding the effect this has on the overall device performance is critical to the design of reliable devices. Analytical methods for modeling damage provide expedient results but are limited by broad modeling assumptions. Numerical models account for more detailed physical phenomena but can be computationally intensive. In this work, two different crack scenarios are modeled using both analytical techniques and 3D computational simulations. First, the effects of a single surface crack on the static deflection and natural frequency of an electrostatically actuated micro-beam are formulated and compared. Then, a new method for approximating damage associated with realistic distributed crack networks is formulated for use in an analytical model and numerical simulations. A method for utilizing experimentally derived crack statistics to inform the analytical and numerical distributed crack models is developed. Good agreement between the analytical and numerical models is obtained for both crack scenarios. Altogether, these models can be used to effectively simulate a variety of damage and fatigue behaviors in silicon-based MEMS devices.

42 ENGINEERING↗

Finite scale theory: Predicting nature’s shocks

In this paper, we describe a continuum model that accurately reproduces the experimentally measured structure of physical shocks in a perfect gas. In this work, we begin by presenting a history of shock structure research, theoretical, experimental and numerical, to quantify the significant discrepancies between Navier–Stokes predictions and laboratory measurements. In our first main result, we discuss modifications that generalize the Chapman–Enskog approximation and lead to a new continuum model termed the Finite Scale Equations. In our second main result, we use this continuum model to calculate shock structure with results comparable in accuracy to numerical simulations based on the Boltzmann equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessment of integral models for non-Boussinesq lazy plumes using numerical simulations

Integral modelling of turbulent buoyant plumes is crucial for rapid predictions of plume characteristics. While the governing equations are typically derived using self-similarity and a Boussinesq approximation, these assumptions may not hold for plumes originating from finite-area sources with large density ratios. Here, this work evaluates the accuracy of integral-scale models for non-Boussinesq lazy plumes using high-fidelity numerical simulations of turbulent helium plumes. We analyse the plume kinematics by computing vertical fluxes, plume radius and radial profiles, establishing some disparities between common practice and physical accuracy. We identify how the definition of the plume radius changes the perception of the plume structure when the flow is not self-similar and derive a relationship between the flux-based and threshold-based definitions without requiring self-similarity. We then examine the plume dynamics by evaluating the source terms from the governing plume equations. Our results support neglecting diffusive and viscous effects but emphasise the importance of the mean pressure gradient, even in the self-similar regime. Two coefficients need to be modelled: the well-known entrainment coefficient and the lesser-known momentum correction coefficient, which is a correction required for the momentum equation to account for self-similar and slender approximations. The momentum correction coefficient is found to be approximately constant and slightly greater than the assumed value of 1. The standard entrainment coefficient models perform well up to a local Richardson number three times the asymptotic value but overpredict entrainment for larger Richardson numbers. We propose a correction using the known finite limit of entrainment at infinite Richardson number.

Meehan, Michael Alexander [Sandia National Laborat↗

Enhancing photoionization rate calculations in low-temperature plasmas using spectral methods

Photoionization plays a central role in the development of streamer discharges and other non-equilibrium plasma phenomena. It creates seed electrons, which are essential for positive streamer propagation, allowing the ionization front to move forward. Because of this, accurate modeling of photoionization is very important for predicting streamer behavior and plasma evolution. The photoionization process in air (N 2 – O 2 mixture) is often described by the Zheleznyak model (1982). This model is usually solved through Helmholtz-type equations that approximate the Zheleznyak photoionization model (Zheleznyak et al. 1982) as Partial Differential Equations (PDEs). Conventional numerical methods, such as the Finite Difference Method (FDM) or Finite Volume Method (FVM), are widely used to solve these equations. Although they are prevalent, the computational cost of these methods due to their need for matrix operations and iterative solver is demanding. To address this challenge, this work develops a spectral solver based on the Fast Fourier Transform (FFT) combined with Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) to calculate the photoionization rate efficiently in an axisymmetric cylindrical domain. This method naturally satisfies the boundary conditions used in the model and converts the PDE into algebraic ones in spectral space. Thus, avoids the need for iterative matrix solvers. When compared with FDM results, it is demonstrated that the new solver not only maintains accuracy, but also reduces the computational cost, showing a performance increase of approximately 100 compared to FDM over a wide range of problem sizes. The method is parallelized using Message Passing Interface (MPI) and has been integrated into a fluid plasma model for streamer simulation. Here, this FFT-based approach provides a fast and reliable alternative for calculating photoionization in fluid models, helping large-scale plasma simulations run faster and efficiently, and allows higher-resolution simulation without extra computational cost.

Axisymmetric system↗

Twisted bilayer graphene as topological heavy fermion: II. Analytical approximations of the model parameters

The recently-introduced topological heavy fermion (THF) model [1] of twisted bilayer graphene (TBG) aims to reconcile the quantum-dot-like electronic structure of the latter observed by scanning tunneling microscopy, with its electron delocalization seen in transport measurements. The THF model achieves this by coupling localized (heavy) fermions with anomalous conduction electrons. Originally, the parameters of the THF model were obtained numerically from the Bistritzer–Macdonald (BM) model of TBG [1]. In this work, we derive analytical expressions for the THF model parameters as a function of the twist angle, the ratio between the tunneling amplitudes at the AA and AB regions (w 0 /w 1 ), and the screening length of the interaction potential. By numerically computing the THF model parameters across an extensive experimentally-relevant parameter space, we show that the resulting approximations are remarkably good, i.e., within the 30% relative error for almost the entire parameter space. At the single-particle level, the THF model accurately captures the energy spectrum of the BM model over a large phase space of angles and tunneling amplitude ratios. When interactions are included, we also show that the THF description of TBG is good around the magic angle for realistic values of the tunneling amplitude ratios (0.6 ≤ w 0 /w 1 ≤ 1.0), for which the hybridization between the localized and conduction fermions γ is smaller than the onsite repulsion of the heavy fermions U 1 (i.e., |γ| < U 1 ).

Approximation methods↗

High-volume tunable resonator for axion searches above 7 GHz

In this research, we present results from an experimental demonstration of a tunable thin-shell axion haloscope whose geometry decouples its overall volume from its resonant frequency, thereby evading the steep sensitivity degradation at high frequencies. An aluminum 2.6-l (41⁢λ 3 ) prototype, which tunes from 7.1 to 8.0 GHz, was fabricated and characterized at room temperature. An axion-sensitive, straightforwardly tunable TM 010 mode is clearly identified with a room-temperature quality factor, Q, of approximately 5000. The on-resonance E-field distribution is mapped and found to agree with numerical calculations. Anticipating future cryogenic operation, we develop an alignment protocol relying only on rf measurements of the cavity, maintaining a form factor of 0.57 across the full tuning range. These measurements demonstrate the feasibility of cavity-based haloscopes with operating volume V $\gg$ λ 3 . We discuss plans for future development and the parameters required for a thin-shell haloscope exploring the postinflationary axion parameter space (approximately 4 to 30 GHz) at Dine-Fischler-Srednicki-Zhitnitsky sensitivity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum phase transitions in long-range interacting hyperuniform spin chains in a transverse field

Hyperuniform states of matter are characterized by anomalous suppression of long-wavelength density fluctuations. While most of the interesting cases of disordered hyperuniformity are provided by complex many-body systems such as liquids or amorphous solids, classical spin chains with certain long-range interactions have been shown to demonstrate the same phenomenon. Such spin-chain systems are ideal models for exploring the effects of quantum mechanics on hyperuniformity. It is well-known that the transverse field Ising model shows a quantum phase transition (QPT) at zero temperature. Under the quantum effects of a transverse magnetic field, classical hyperuniform spin chains are expected to lose their hyperuniformity. High-precision simulations of these cases are complicated because of the presence of highly nontrivial long-range interactions. We perform an extensive analysis of these systems using density matrix renormalization group simulations to study the possibilities of phase transitions and the mechanism by which they lose hyperuniformity. Even for a spin chain of length 30, we see discontinuous changes in properties like the “τ order metric” of the ground state, the measure of hyperuniformity, and the second cumulant of the total magnetization along the x-direction, all suggestive of first-order QPTs. An interesting feature of the phase transitions in these disordered hyperuniform spin chains is that, depending on the parameter values, the presence of a transverse magnetic field may lead remarkably to an increase in the order of the ground state as measured by the “τ order metric,” even if hyperuniformity is lost. Therefore, it would be possible to design materials to target specific novel quantum behaviors in the presence of a transverse magnetic field. Our numerical investigations suggest that these spin chains can show no more than two QPTs. We further analyze the long-range interacting spin chains via the Jordan-Wigner mapping onto a system of spinless fermions, showing that under the pairwise-interaction approximation and a mean-field treatment, there can be at most two quantum phase transitions. Here, based on these numerical and theoretical explorations, we conjecture that for spin chains with long-range pair interactions that have convergent cosine transforms, there can be a maximum of two quantum phase transitions at zero temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Efficient High-Order Solver for Diffusion Equations with Strong Anisotropy on Non-Anisotropy-Aligned Meshes

This paper concerns numerical solution of the diffusion equation with strong anisotropy on meshes not aligned with the anisotropic vector field. In order to resolve the numerical pollution for simulations on a non-anisotropy-aligned mesh and reduce the associated high computational cost we propose an effective preconditioner, extending our previous work. Similar to the anisotropy-aligned mesh case, we apply the auxiliary space preconditioning framework to design a preconditioner where a continuous finite element space is used as the auxiliary space for the discontinuous finite element space. The key component is an effective line smoother that can mitigate the high-frequency errors perpendicular to the magnetic field. We design a graph-based approach to find such a line smoother that is approximately perpendicular to the vector fields when the mesh does not align with the anisotropy. Finally, numerical experiments for several benchmark problems are presented, demonstrating the effectiveness and robustness of the proposed preconditioner when applied to Krylov iterative methods.

97 MATHEMATICS AND COMPUTING↗

Unexpected Scaling of Peak Acceleration for a Yielding Mass-Spring System Subjected to a Triangular Base Acceleration Pulse

The use of bounding scenarios is a common practice that greatly simplifies the design and qualification of structures. However, this approach implicitly assumes that the quantities of interest increase monotonically with the input to the structure, which is not necessarily true for nonlinear structures. This paper surveys the literature for observations of nonmonotonic behavior of nonlinear systems and finds such observations in both the earthquake engineering and applied mechanics literature. Numerical simulations of a single degree-of-freedom mass-spring system with an elastic–plastic spring subjected to a triangular base acceleration pulse are then presented, and it is shown that the relative acceleration of this system scales nonmonotonically with the input magnitude in some cases. The equation of motion for this system is solved symbolically and an approximate expression for the relative acceleration is developed, which qualitatively agrees with the nonmonotonic behavior seen in the numerical results. The nonmonotonicity is investigated and found to be a result of dynamics excited by the discontinuous derivative of the base acceleration pulse, the magnitude of which scales nonmonotonically with the input magnitude due to the fact that the first yield of the spring occurs earlier as the input magnitude is increased. The relevance of this finding within the context of defining bounding scenarios is discussed, and it is recommended that modeling be used to perform a survey of the full range of possible inputs prior to defining bounding scenarios.

42 ENGINEERING↗

Atomic structure considerations for the low-temperature opacity of Xenon

Here, we have begun a preliminary investigation into the opacity of Xe at low temperatures (<50 eV). The emissivity and opacity of Xe is a crucial factor in determining the utility of Xe in EUV lithography, with numerous industrial applications. To this end, we have been exploring the accuracy of some approximations used in opacity models for the relevant ion stages of Xe (6 times ionized through 20 times ionized). Due to the complexity of Xe atomic structure, one needs to use full configuration-interaction to properly describe the strong mixing in the various n=4 sub-shells that give rise to the Δn=0 and Δn=1 transitions that dominate the opacity spectrum at low temperatures. Since calculations that include full configuration-interaction for large numbers of configurations quickly become computationally prohibitive, we have explored hybrid calculations, in which full configuration-interaction is retained for the most important transitions, while intermediate coupling is employed for all other transitions. After verifying atomic structure properties, local-thermodynamic-equilibrium (LTE) opacities are generated using the ATOMIC code at selected temperatures and densities and compared to various experimental results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Effects of artificial collisions, filtering, and nonlocal closure approaches on Hermite-based Vlasov–Poisson simulations

Kinetic simulations of collisionless plasmas are computationally challenging due to phase-space mixing and filamentation, resulting in fine-scale velocity structures. This study compares three methods developed to reduce artifacts related to limited velocity resolution in Hermite-based Vlasov–Poisson simulations: artificial collisions, filtering, and nonlocal closure approaches. We evaluate each method's performance in approximating the linear kinetic response function and suppressing recurrence in linear and nonlinear regimes. Numerical simulations of Landau damping demonstrate that artificial collisions, particularly higher orders of the Lenard-Bernstein collisional operator, most effectively recover the correct damping rate across a range of wavenumbers. Moreover, Hou-Li filtering and nonlocal closures underdamp high wavenumber modes in linear simulations, and the Lenard-Bernstein collisional operator overdamps low wavenumber modes in both linear and nonlinear simulations. This study demonstrates that hypercollisions offer a robust approach to kinetic simulations, accurately capturing collisionless dynamics with limited velocity resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗

Particle-number fluctuations near the critical point of nuclear matter

Equation of state with the quantum statistics corrections is used for particle-number fluctuations ω of the isotopically symmetric nuclear matter with interparticle van der Waals and Skyrme local density interactions. Here, the fluctuations, ω ∝ 1/K, are analytically derived through the isothermal incompressibility K at first order over a small quantum-statistics parameter. Our approximate analytical results appear to be in good agreement with the results of accurate numerical calculations. These results are also close to those obtained by using more accurate Tolman and Rowlinson expansions of the incompressibility K near the critical point. More general formula for fluctuations ω, improved at the critical point, was obtained for a finite particle-number average $\langle$N$\rangle$ by neglecting, for simplicity, small quantum statistics effects. It is shown that for a large dimensionless parameter, α ∝ K 2 $\langle$N$\rangle$/K", where K" is the second derivative of the incompressibility K as function of the average particle density n, far from the critical point (α >> 1), one finds the traditional asymptote, ω ∝ 1/K, for the fluctuations ω. For a small parameter, α << 1, near the critical point, where K = 0 and α = 0, one obtains another asymptote of ω. These fluctuations, having a maximum near the critical point as function of the average density n, for finite values of $\langle$N$\rangle$ are finite and relatively small, in contrast to the results of the traditional calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Field moment expansion method for interacting bosonic systems

In this work, we introduce a numerical method and python package, https://github.com/andillio/CHiMES, that simulates quantum systems initially well approximated by mean field theory using a second order extension of the classical field approach. We call this the field moment expansion method. In this way, we can accurately approximate the evolution of first and second field moments beyond where the mean field theory breaks down. This allows us to estimate the quantum breaktime of a classical approximation without any calculations external to the theory. We investigate the accuracy of the field moment expansion using a number of well studied quantum test problems. Interacting Bosonic systems similar to scalar field dark matter are chosen as test problems. We find that successful application of this method depends on two conditions: the quantum system must initially be well described by the classical theory, and that the growth of the higher order moments be hierarchical.

79 ASTRONOMY AND ASTROPHYSICS↗

Direct statistical simulation of the Lorenz96 system in model reduction approaches

Direct statistical simulation (DSS) of nonlinear dynamical systems bypasses the traditional route of accumulating statistics by lengthy direct numerical simulations by solving the equations that govern the statistics themselves. DSS suffers, however, from the curse of dimensionality as the statistics (such as correlations) generally have higher dimensions than the underlying dynamical variables. Here we investigate two approaches to reduce the dimensionality of DSS, illustrating each method with numerical experiments with the Lorenz96 dynamical system. The forms of DSS chosen here involve approximate closures at second and third order in the equal-time cumulants. We demonstrate significant reduction in computational effort that can be achieved without sacrificing the accuracy of DSS. The methods developed here can be applied to turbulent fluid and magnetohydrodynamical systems. Published by the American Physical Society 2025

Li, Kuan↗

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗