Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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 829 records · Page 46

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhancing ACPF Analysis: Integrating Newton-Raphson Method with Gradient Descent and Computational Graphs

This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Exploring Explicit Uncertainty for Binary Analysis (EUBA)

Reverse engineering (RE) analysts struggle to address critical questions about the safety of binary code accurately and promptly, and their supporting program analysis tools are simply wrong sometimes. The analysis tools have to approximate in order to provide any information at all, but this means that they introduce uncertainty into their results. And those uncertainties chain from analysis to analysis. We hypothesize that exposing sources, impacts, and control of uncertainty to human binary analysts will allow the analysts to approach their hardest problems with high-powered analytic techniques that they know when to trust. Combining expertise in binary analysis algorithms, human cognition, uncertainty quantification, verification and validation, and visualization, we pursue research that should benefit binary software analysis efforts across the board. We find a strong analogy between RE and exploratory data analysis (EDA); we begin to characterize sources and types of uncertainty found in practice in RE (both in the process and in supporting analyses); we explore a domain-specific focus on uncertainty in pointer analysis, showing that more precise models do help analysts answer small information flow questions faster and more accurately; and we test a general population with domain-general sudoku problems, showing that adding "knobs" to an analysis does not significantly slow down performance. This document describes our explorations in uncertainty in binary analysis.

97 MATHEMATICS AND COMPUTING↗

Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms

The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. In this work, we describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.

97 MATHEMATICS AND COMPUTING↗

Improved Frequency-Domain Steady-State Modeling of the Dual-Active-Bridge Converter Considering Finite ZVS Transition Time Effects

This article presents an improved analytical modeling (IAM) approach for the dual-active-bridge (DAB) converter in the frequency-domain. Specifically, finite transition times are incorporated into the improved modeling that are significant in DAB converters operated at high frequency. The IAM approach is first motivated by comparing traditional frequency-domain modeling against realistic simulation results in LTspice. Next, the IAM approach is mathematically developed in an iterative fashion, where the conventional frequency-domain approach is used as the initialization of the operational behavior of the converter. Subsequent iterations of the IAM algorithm incorporate finite rise- and falltimes of device output capacitances based on detailed switching behavior analyses, which may considerably perturb the desired modulation parameters (i.e., phase shift and zero states). While the initially proposed IAM approach demonstrates advantages over ideal modeling, it is still shown to exhibit errors when applied to device transitions with significant nonlinearity in parasitic output capacitance. To account for this, a three-slope approximation to the switching transition is then motivated and developed, which enables significantly improved steady-state prediction accuracy. Simulation and experimental results confirm unacceptable inaccuracies associated with the conventional frequency-domain modeling across a wide range of operating conditions, alongside enhanced accuracy provided by the proposed modeling approach.

14 SOLAR ENERGY↗

Gravitation and Mesh Adaption

The Gravitation and Mesh Adaptation (GaMA) toolbox consists of a set of Matlab classes for modeling the environment around asteroids and comets. A variety of gravitational models and supporting algorithms from are consolidated alongside a custom meshing utility tailored for the application. This allows the user to work within a single streamlined environment to import and manipulate surface definitions, probe the dynamical environment, integrate trajectories, and post-process results. For other applications, modified surface meshes can be exported. Gravity Models: 1) Werner's analytic polyhedron model 2) Mascon model 3) Gottlieb's spherical harmonic model 4) Approximate polyhedron models 5) Curvilinear surface models 6) Custom composite models Meshing Features: 1) Array-based half-edge data structure 2) Supports curvilinear surface definitions up to degree 4 3) Ray-tracing 4) Coarsening 5) Feature-based refinement 6) Projection 7) Smoothing 8) Mesh quality validity tests 9) Mesh repair Additional Features: 1) Solar radiation pressure model 2) Distant 3rd body model 3) Collision detection 4) Trajectory integration and post-processing 5) Visualization of surface fields

Pearl, Jason↗

Penalized ensemble Kalman filters for high dimensional non-linear systems

The ensemble Kalman filter (EnKF) is a data assimilation technique that uses an ensemble of models, updated with data, to track the time evolution of a usually non-linear system. It does so by using an empirical approximation to the well-known Kalman filter. However, its performance can suffer when the ensemble size is smaller than the state space, as is often necessary for computationally burdensome models. This scenario means that the empirical estimate of the state covariance is not full rank and possibly quite noisy. To solve this problem in this high dimensional regime, we propose a computationally fast and easy to implement algorithm called the penalized ensemble Kalman filter (PEnKF). Under certain conditions, it can be theoretically proven that the PEnKF will be accurate (the estimation error will converge to zero) despite having fewer ensemble members than state dimensions. Further, as contrasted to localization methods, the proposed approach learns the covariance structure associated with the dynamical system. These theoretical results are supported with simulations of several non-linear and high dimensional systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A simple fourth order propagator based on the Magnus expansion in the Liouville space: Application to a Λ-system and assessment of the rotating wave approximation

A simple fourth-order propagator [Ture and Jang, J. Phys. Chem. A 128, 2871 (2024)] based on the Magnus expansion is extended to the Liouville space for both closed-system and Lindbladian open-system quantum dynamics. For both dynamics, commutator free versions of fourth-order propagators are provided as well. These propagators are then applied to the dynamics of a driven Λ-system, where Lindblad terms represent the effect of a photonic bath. For both dynamics, the accuracy of the rotating wave approximation (RWA) for the matter–radiation interaction is assessed. We confirmed reasonable performance of RWA for weak and resonant fields. However, small errors appear for moderate fields and substantial errors can be found for strong fields where coherent population trapping can still be expected. We also found that the presence of bath for open-system quantum dynamics consistently reduces the errors of the RWA. These results provide quantitative information on how the RWA breaks down beyond weak field or for non-resonant cases. Major results are benchmarked against results of our sixth-order ME-based propagator. Finally, we also provide numerical comparison of our algorithms with other fourth-order algorithms for the Λ-system. These confirm reasonable performance of our simple propagators and the improvement gained through commutator-free expressions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Kohn–Sham Density in a Slater Orbital Basis Set

Finite, atom-centered Slater basis sets are used to determine approximate Kohn–Sham molecular orbitals. This is achieved by minimizing the kinetic energy plus the sum-squared difference between the Kohn–Sham density and the full configuration interaction density. As a result of the finite basis, a weight factor is introduced to balance the two minimization components. Results herein show that this can be done systematically, without sensitive dependence on the choice of scaling factor. In addition, the algorithm is applied to the LiH diatomic for fractional electron counts, where stretching the bond introduces significant reorganization of the electron density. As a result, the analysis will show the correct KS orbital structure and reveal the effects of correlation and electron locality on the KS solutions.

74 ATOMIC AND MOLECULAR PHYSICS↗

Electron-scale current sheets and energy dissipation in 3D kinetic-scale plasma turbulence with low electron beta

ABSTRACT Three-dimensional kinetic-scale turbulence is studied numerically in the regime where electrons are strongly magnetized (the ratio of plasma species pressure to magnetic pressure is βe = 0.1 for electrons and βi = 1 for ions). Such a regime is relevant in the vicinity of the solar corona, the Earth’s magnetosheath, and other astrophysical systems. The simulations, performed using the fluid-kinetic spectral plasma solver (sps) code, demonstrate that the turbulent cascade in such regimes can reach scales smaller than the electron inertial scale, and results in the formation of electron-scale current sheets (ESCS). Statistical analysis of the geometrical properties of the detected ESCS is performed using an algorithm based on the medial axis transform. A typical half-thickness of the current sheets is found to be on the order of electron inertial length or below, while their half-length falls between the electron and ion inertial length. The pressure–strain interaction, used as a measure of energy dissipation, exhibits high intermittency, with the majority of the total energy exchange occurring in current structures occupying approximately 20 per cent of the total volume. Some of the current sheets corresponding to the largest pressure–strain interaction are found to be associated with Alfvénic electron jets and magnetic configurations typical of reconnection. These reconnection candidates represent about 1 per cent of all the current sheets identified.

79 ASTRONOMY AND ASTROPHYSICS↗

Development and Validation of Passive Yaw in the Open-Source WEC-Sim Code

A passive yaw implementation is developed, validated, and explored for the WEC-Sim, an open-source wave energy converter modeling tool that works within MATLAB/Simulink. The Reference Model 5 (RM5) is selected for this investigation, and a WEC-Sim model of the device is modified to allow yaw motion. A boundary element method (BEM) code was used to calculate the excitation force coefficients for a range of wave headings. An algorithm was implemented in WEC-Sim to determine the equivalent wave heading from a body’s instantaneous yaw angle and interpolate the appropriate excitation coefficients to ensure the correct time-domain excitation force. This approach is able to determine excitation force for a body undergoing large yaw displacement. For the mathematically simple case of regular wave excitation, the dynamic equation was integrated numerically and found to closely approximate the results from this implementation in WEC-Sim. A case study is presented for the same device in irregular waves. In this case, computation time is increased by 32x when this interpolation is performed at every time step. To reduce this expense, a threshold yaw displacement can be set to reduce the number of interpolations performed. A threshold of 0.01° was found to increase computation time by only 22x without significantly affecting time domain results. Similar amplitude spectra for yaw force and displacements are observed for all threshold values less than 1°, for which computation time is only increased by 2.2x.

50 EE - Wind and Water Power Program - Water (EE-4↗

Development and Validation of Passive Yaw in the Open-Source WEC-Sim Code: Preprint

A passive yaw implementation is developed, validated, and explored for the Wave Energy Converter Simulator (WEC-Sim), an open-source wave energy converter modeling tool that works within MATLAB/Simulink. The Reference Model 5 (RM5) is selected for this investigation, and a WEC-Sim model of the device is modified to allow yaw motion. A boundary element method (BEM) code was used to calculate the excitation force coefficients for a range of wave headings. An algorithm was implemented in WEC-Sim to determine the equivalent wave heading from a body’s instantaneous yaw angle and interpolate the appropriate excitation coefficients to ensure the correct time-domain excitation force. This approach is able to determine excitation force for a body undergoing large yaw displacement. For the mathematically simple case of regular wave excitation, the dynamic equation was integrated numerically and found to closely approximate the results from this implementation in WEC-Sim. A case study is presented for the same device in irregular waves. In this case, computation time is increased by 32x when this interpolation is performed at every time step. To reduce this expense, a threshold yaw displacement can be set to reduce the number of interpolations performed. A threshold of 0.01 was found to increase computation time by only 22x without significantly affecting time domain results. Similar amplitude spectra for yaw force and displacements are observed for all threshold values less than or equal to 1, for which computation time is only increased by 2.2x.

50 EE - Wind and Water Power Program - Water (EE-4↗

Measurement of the muon spin precession frequency using the straw tracking detectors at the Fermilab Muon g-2 experiment

The measurement of the anomalous magnetic dipole moment of the muon ($a_{\mu}$) has long stood as an excellent precision test of the Standard Model (SM). The Fermilab Muon g-2 experiment has recently finished data-taking and in July 2023 published its latest determination of $a_\mu$ with a world-leading precision of 0.2\,ppm. In this publication, it surpassed the systematic uncertainty goal defined in the TDR. The analyses of a dataset approximately four times larger than this recent publication is now underway. The principle measurement of the Muon g-2 experiment measures $a_{\mu}$ by taking the ratio of two frequencies; the anomalous precession frequency ($\omega_a$) and the muon-weighted magnetic field of the experiment's storage ring measured from the precession frequency of protons in water using nuclear magnetic resonance (NMR) probes. In all publications to date, $\omega_a$ has been determined using energy deposits in the 24 calorimeters. However, the Fermilab experiment has t wo straw tracker detectors measuring the time and momentum of charged particles which can in principle also be used to to measure $\omega_a$ and such a measurement can provide an invaluable cross-check of the calorimeter result with different, and reduced, systematic uncertainties. This thesis presents the first (blinded) determination of $\omega_a$ using just charged tracks from the straw tracking detectors as opposed to calorimeter energy deposits. This analysis was undertaken using the Run-2/3 dataset which represents approximately 25\% of the final dataset. A total uncertainty of 2.19\,ppm on $\omega_a$ was obtained which is dominated by the statistical uncertainty of 2.16\,ppm. Additionally two new methodologies important to the analysis of the straw tracking data have been developed: one to better determine the track arrival time ($t_0$) and one to determine the level of pileup in the tracking detectors. The new $t_0$ algorithm which incorporates angular information improves t he resolution on the determination of the $t_0$ by a factor of two and results in 19\% more tracks being successfully reconstructed. The data from the trackers is also used to determine the beam profile that weights the magnetic field in the determination of $a_\mu$ and in determining several of the systematic uncertainties in the calorimeter-based $\omega_a$ analysis. A detailed study of the impact of the internal alignment of the tracker, the $t_0$ and pileup on the determination of the beam position was undertaken and propagated through to an uncertainty in the $\omega_a$ determination. These uncertainties were used in the Fermilab Muon g-2 experiment's recent publication in Phys. Rev. Lett.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Validation of LOCA2 and STAR-ESDM Statistically Downscaled Products

The National Climate Assessment (NCA) is the preeminent national report examining current and future risks posed by climate change. Countless agencies, policymakers, stakeholders and other end-users rely upon guidance from the NCA to plan for an uncertain future. These groups all depend on modern curated data, provided alongside the NCA, to quantify the impact of climate change on metrics of relevance for their decision processes. In its fifth iteration (NCA5), two statistically downscaled ensemble products, each providing data at grid spacing of approximately 5km over the contiguous United States, were selected to accompany the report. These include LOCalized Analogs version 2 (LOCA2) and Seasonal Trends and Analysis of Residuals Empirical-Statistical Downscaling Model (STAR-ESDM). Both data products are produced through a process known as statistical downscaling, where relatively coarse Global Climate Model (GCM) data is refined to locally relevant scales through the application of scientifically-supported empirical and algorithmic relationships. In support of the NCA effort, this report provides an independent validation of these two products against historical observations, with a focus on precipitation and near-surface temperature variables. Based on the results of this validation, several recommendations are provided related to the use of these data products. The structure of this report is as follows: In section 2, we review three gridded observational products that are used as part of our intercomparison. In section 3, we describe the two statistical downscaling techniques and their corresponding datasets that are the focus of this study. In section 4, the methodology we employ for validation is described. Section 5 provides results of the validation, which in turn motivate our recommendations on the use of these data products. A brief summary is provided in section 6.

54 ENVIRONMENTAL SCIENCES↗

Subhalos in Galaxy Clusters: Coherent Accretion and Internal Orbits

Subhalo dynamics in galaxy cluster host halos govern the observed distribution and properties of cluster member galaxies. We use the IllustrisTNG simulation to investigate the accretion and orbits of subhalos found in cluster-size halos. We find that the median change in the major axis direction of cluster-size host halos is approximately 80° between a ∼ 0.1 and the present day. We identify coherent regions in the angular distribution of subhalo accretion, and ∼68% of accreted subhalos enter their host halo through ∼38% of the surface area at the virial radius. The majority of galaxy clusters in the sample have ∼2 such coherent regions. We further measure angular orbits of subhalos with respect to the host major axis and use a clustering algorithm to identify distinct orbit modes with varying oscillation timescales. The orbit modes correlate with subhalo accretion conditions. Subhalos in orbit modes with shorter oscillations tend to have lower peak masses and accretion directions somewhat more aligned with the major axis. One orbit mode, exhibiting the least oscillatory behavior, largely consists of subhalos that accrete near the plane perpendicular to the host halo major axis. Our findings are consistent with expectations from inflow from major filament structures and internal dynamical friction: most subhalos accrete through coherent regions, and more massive subhalos experience fewer orbits after accretion. Our work offers a unique quantification of subhalo dynamics that can be connected to how the intracluster medium strips and quenches cluster galaxies.

galaxy clusters↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

PyFLOSIC: Python-based Fermi–Löwdin orbital self-interaction correction

We present pyflosic, an open-source, general-purpose python implementation of the Fermi–Löwdin orbital self-interaction correction (FLO-SIC), which is based on the python simulation of chemistry framework (pyscf) electronic structure and quantum chemistry code. Thanks to pyscf, pyflosic can be used with any kind of Gaussian-type basis set, various kinds of radial and angular quadrature grids, and all exchange-correlation functionals within the local density approximation, generalized-gradient approximation (GGA), and meta-GGA provided in the libxc and xcfun libraries. A central aspect of FLO-SIC is the Fermi-orbital descriptors, which are used to estimate the self-interaction correction. Importantly, they can be initialized automatically within pyflosic; they can also be optimized within pyflosic with an interface to the atomic simulation environment, a python library that provides a variety of powerful gradient-based algorithms for geometry optimization. Although pyflosic has already facilitated applications of FLO-SIC to chemical studies, it offers an excellent starting point for further developments in FLO-SIC approaches, thanks to its use of a high-level programming language and pronounced modularity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗