Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Recursion”

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 163 records · Page 9

An improved fast multipole method for electrostatic potential calculations in a class of coarse-grained molecular simulations

This paper presents a novel algorithm to approximate the long-range electrostatic potential field in the Cartesian coordinates applicable to 3D coarse-grained simulations of biopolymers. In such models, coarse-grained clusters are formed via treating groups of atoms as rigid and/or flexible bodies connected together via kinematic joints. Therefore, multibody dynamic techniques are used to form and solve the equations of motion of such coarse-grained systems. In this article, the approximations for the potential fields due to the interaction between a highly negatively/positively charged pseudo-atom and charged particles, as well as the interaction between clusters of charged particles, are presented. These approximations are expressed in terms of physical and geometrical properties of the bodies such as the entire charge, the location of the center of charge, and the pseudo-inertia tensor about the center of charge of the clusters. Further, a novel substructuring scheme is introduced to implement the presented far-field potential evaluations in a binary tree framework as opposed to the existing quadtree and octree strategies of implementing fast multipole method. Using the presented Lagrangian grids, the electrostatic potential is recursively calculated via sweeping two passes: assembly and disassembly. In the assembly pass, adjacent charged bodies are combined together to form new clusters. Then, the potential field of each cluster due to its interaction with faraway resulting clusters is recursively calculated in the disassembly pass. The method is highly compatible with multibody dynamic schemes to model coarse-grained biopolymers. Since the proposed method takes advantage of constant physical and geometrical properties of rigid clusters, improvement in the overall computational cost is observed comparing to the tradition application of fast multipole method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-dimensional methods for quantum homodyne tomography

We provide optimized recursion relations for homodyne tomography. We improve previous methods by mitigating the divergences intrinsic in the calculation of the pattern functions used previously, and detail how to implement the data analysis through Monte Carlo simulations. Our refinements are necessary for the reconstruction of excited quantum states which populate a high-dimensional subspace of the electromagnetic field Hilbert space. •Stabilization of numerics for quantum homodyne tomography reconstructions.•High dimensional quantum homodyne tomography reconstruction.•Monte Carlo simulations of quantum homodyne tomography.•Quantum Homodyne tomography simulations.

Mosco, Nicola↗

X-ray and neutron total scattering analysis of Hy·(Bi0.2Ca0.55Sr0.25)(Ag0.25Na0.75)Nb3O10·xH2O perovskite nanosheet booklets with stacking disorder

Ion-exchanged Aurivillius materials form perovskite nanosheet booklets wherein well-defined bi-periodic sheets, with ~11.5 Å thickness, exhibit extensive stacking disorder. The perovskite layer contents were defined initially using combined synchrotron X-ray and neutron Rietveld refinement of the parent Aurivillius structure. The structure of the subsequently ion-exchanged material, which is disordered in its stacking sequence, is analyzed using both pair distribution function (PDF) analysis and recursive method simulations of the scattered intensity. Combined X-ray and neutron PDF refinement of supercell stacking models demonstrates sensitivity of the PDF to both perpendicular and transverse stacking vector components. Further, hierarchical ensembles of stacking models weighted by a standard normal distribution are demonstrated to improve PDF fit over 1–25 Å. Recursive method simulations of the X-ray scattering profile demonstrate agreement between the real space stacking analysis and more conventional reciprocal space methods. The local structure of the perovskite sheet is demonstrated to relax only slightly from the Aurivillius structure after ion exchange.

Metz, Peter↗

Machine Learning Prediction of the Experimental Transition Temperature of Fe(II) Spin-Crossover Complexes

Spin-crossover (SCO) complexes are materials that exhibit changes in the spin state in response to external stimuli, with potential applications in molecular electronics. It is challenging to know a priori how to design ligands to achieve the delicate balance of entropic and enthalpic contributions needed to tailor a transition temperature close to room temperature. Here, we leverage the SCO complexes from the previously curated SCO-95 data set [Vennelakanti et al. J. Chem. Phys. 159, 024120 (2023)] to train three machine learning (ML) models for transition temperature (T 1/2 ) prediction using graph-based revised autocorrelations as features. We perform feature selection using random forest-ranked recursive feature addition (RF-RFA) to identify the features essential to model transferability. Of the ML models considered, the full feature set RF and recursive feature addition RF models perform best, achieving moderate correlation to experimental T 1/2 values. We then compare ML T 1/2 predictions to those from three previously identified best-performing density functional approximations (DFAs) which accurately predict SCO behavior across SCO-95, finding that the ML models predict T 1/2 more accurately than the best-performing DFAs. In addition, we study ML model predictions for a set of 18 SCO complexes for which only estimated T 1/2 values are available. Upon excluding outliers from this set, the RF-RFA RF model shows a strong correlation to estimated T 1/2 values with a Pearson’s r of 0.82. In contrast, DFA-predicted T 1/2 values have large errors and show no correlation to estimated T 1/2 values over the same set of complexes. Overall, our study demonstrates slightly superior performance of ML models in comparison with some of the best-performing DFAs, and we expect ML models to improve further as larger data sets of SCO complexes are curated and become available for model training.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Models and Algorithms for Equilibrium Analysis of Mixed-Material Nucleic Acid Systems

Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.

2′OMe-RNA↗

Many-body calculations of low energy eigenstates in magnetic and periodic systems with self healing diffusion Monte Carlo: steps beyond the fixed-phase

The self-healing diffusion Monte Carlo algorithm (SHDMC) [Reboredo, Hood and Kent, Phys. Rev. B {\bf 79}, 195117 (2009), Reboredo, {\it ibid.} {\bf 80}, 125110 (2009)] is extended to study the ground and excited states of magnetic and periodic systems. A recursive optimization algorithm is derived from the time evolution of the mixed probability density. The mixed probability density is given by an ensemble of electronic configurations (walkers) with complex weight. This complex weigh allows the amplitude of the fix-node wave function to move away from the trial wave function phase. This novel approach is both a generalization of SHDMC and the fixed-phase approximation [Ortiz, Ceperley and Martin Phys Rev. Lett. {\bf 71}, 2777 (1993)]. When used recursively it improves simultaneously the node and phase. The algorithm is demonstrated to converge to the nearly exact solutions of model systems with periodic boundary conditions or applied magnetic fields. The method is also applied to obtain low energy excitations with magnetic field or periodic boundary conditions. The potential applications of this new method to study periodic, magnetic, and complex Hamiltonians are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exponential renormalisation. II. Bogoliubov's R-operation and momentum subtraction schemes

This article aims at advancing the recently introduced exponential method for renormalisation in perturbative quantum field theory. It is shown that this new procedure provides a meaningful recursive scheme in the context of the algebraic and group theoretical approach to renormalisation. In particular, we describe in detail a Hopf algebraic formulation of Bogoliubov's classical R-operation and counterterm recursion in the context of momentum subtraction schemes. This approach allows us to propose an algebraic classification of different subtraction schemes. Our results shed light on the peculiar algebraic role played by the degrees of Taylor jet expansions, especially the notion of minimal subtraction and oversubtractions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-layer Lanczos iteration approach to calculations of vibrational energies and dipole transition intensities for polyatomic molecules

We report a rigorous full dimensional quantum dynamics algorithm, the multi-layer Lanczos method, for computing vibrational energies and dipole transition intensities of polyatomic molecules without any dynamics approximation. The multi-layer Lanczos method is developed by using a few advanced techniques including the guided spectral transform Lanczos method, multi-layer Lanczos iteration approach, recursive residue generation method, and dipole-wavefunction contraction. The quantum molecular Hamiltonian at the total angular momentum J = 0 is represented in a set of orthogonal polyspherical coordinates so that the large amplitude motions of vibrations are naturally described. In particular, the algorithm is general and problem-independent. An application is illustrated by calculating the infrared vibrational dipole transition spectrum of CH{sub 4} based on the ab initio T8 potential energy surface of Schwenke and Partridge [Spectrochimica Acta, Part A 57, 887 (2001)] and the low-order truncated ab initio dipole moment surfaces of Yurchenko et al. [J. Mol. Spectrosc. 291, 69 (2013)]. A comparison with experiments is made. The algorithm is also applicable for Raman polarizability active spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An algebraic function operator expectation value based eigenstate determinations for quantum systems with one degree of freedom

This proceedings paper aims to show the efficiency of an expectation value identity for a given algebraic function operator which is assumed to be depending pn only position operator. We show that this expectation value formula becomes enabled to determine the eigenstates of the quantum system Hamiltonian as long as it is autonomous and an appropriate basis set in position operator is used. This approach produces a denumerable infinite recursion which may be considered as revisited but at the same time generalized form of the recursions over the natural number powers of the position operator. The content of this short paper is devoted not only to the formulation of the new method but also to show that this novel approach is capable of catching the eigenvalues and eigenfunctions for Hydrogen-like systems, beyond that, it can give a hand to us to reveal the wavefunction structure. So it has also somehow a confirmative nature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-iterative characteristics analysis for high-pressure ramp loading

Here in the canonical ramp compression experiment, a smoothly increasing load is applied to the surface of the sample, and the particle velocity history is measured at two or more different distances into the sample, at interfaces where the surface of the sample can be probed. The velocity histories are used to deduce a stress-density relation, usually using iterative Lagrangian analysis to account for the perturbing effect of the impedance mismatch at the interface. In that technique, a stress-density relation is assumed in order to correct for the perturbation and is adjusted until it becomes consistent with the deduced stress-density relation. This process is subject to the usual difficulties of nonlinear optimization, such as the existence of local minima (sensitivity to the initial guess), possible failure to converge, and relatively large computational effort. We show that, by considering the interaction of successive characteristics reaching a free surface, the stress-density relation can be deduced directly by recursion rather than iteration. This calculation is orders of magnitude faster than iterative analysis and does not require an initial guess. Direct recursion may be less suitable for very noisy data, but it was robust when applied to trial data. The stress-density relation deduced was identical to the result from iterative Lagrangian analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Circuit complexity and functionality: A statistical thermodynamics perspective

Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge (“wormhole”) connecting the two sides of an anti-de Sitter “eternal” black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length—an important problem in cryptography—as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with “gases of gates.” This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level.

Science & Technology - Other Topics↗

Development of control quality factor for HVAC control loop performance assessment I—Methodology (ASHRAE RP-1587)

This article is the second paper from the ASHRAE research project RP-1587, focusing on the methodology of obtaining a control quality factor (CQF). This article presents a development of two CQFs for assessing the heating, ventilation, and air-conditioning (HVAC) control loop performance. Both CQFs are able to detect whether the control loop is able to maintain the setpoint and identify the loop's ability to handle disturbances. In addition, the reversal behaviors are assessed as well. The first CQF (CQF-Harris) is proposed based on the normalized Harris index using the recursive least squares method. This recursive least squares method is selected because of its computational efficiency compared with the maximum likelihood estimation method. The second CQF (CQF-EWMA) is based on the exponentially weighted moving average of the error ratio. The assessment scale of excellent, good, fair, bad, and failed, which indicates the quality of the HVAC control loops, is established as well. The sensitivity analysis for both CQFs is also conducted, and it provides insights on choosing the appropriate parameters to compute such CQFs. Such parameters include the sampling frequency, the length of the moving window, and the variance of the unmeasured disturbance. The field evaluations and tests of the proposed CQFs for simulated control loops and real control loops can be found in the companion paper with the title 'Development of Control Quality Factor for HVAC Control Loop Performance Assessment - III: Field Testing and Results (ASHRAE RP-1587).'

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Multi-layer hydrostatic equilibrium of planets and synchronous moons: theory and application to Ceres and to solar system moons

The hydrostatic equilibrium of multi-layer bodies lacks a satisfactory theoretical treatment despite its wide range of applicability. Here we show that by using the exact analytical potential of homogeneous ellipsoids we can obtain recursive analytical solutions and an exact numerical method for the hydrostatic equilibrium shape problem of multi-layer planets and synchronous moons. The recursive solutions rely on the series expansion of the potential in terms of the polar and equatorial shape eccentricities, while the numerical method uses the exact potential expression. These solutions can be used to infer the interior structure of planets and synchronous moons from their observed shape, rotation, and gravity. When applied to the dwarf planet Ceres, we show that it is most likely a differentiated body with an icy crust of equatorial thickness 30-90 km and a rocky core of density 2.4-3.1 g cm{sup –3}. For synchronous moons, we show that the J {sub 2}/C {sub 22} ≅ 10/3 and the (b – c)/(a – c) ≅ 1/4 ratios have significant corrections of order Ω{sup 2}/(πGρ), with important implications for how their gravitational coefficients are determined from fly-by radio science data and for how we assess their hydrostatic equilibrium state.

79 ASTRONOMY AND ASTROPHYSICS↗

Effective field theory of dark energy: a dynamical analysis

The effective field theory (EFT) of dark energy relies on three functions of time to describe the dynamics of background cosmology. The viability of these functions is investigated here by means of a thorough dynamical analysis. While the system is underdetermined, and one can always find a set of functions reproducing any expansion history, we are able to determine general compatibility conditions for these functions by requiring a viable background cosmology. In particular, we identify a set of variables that allows us to transform the non-autonomous system of equations into an infinite-dimensional one characterized by a significant recursive structure. We then analyze several autonomous sub-systems, obtained truncating the original one at increasingly higher dimension, that correspond to increasingly general models of dark energy and modified gravity. Furthermore, we exploit the recursive nature of the system to draw some general conclusions on the different cosmologies that can be recovered within the EFT formalism and the corresponding compatibility requirements for the EFT functions. The machinery that we set up serves different purposes. It offers a general scheme for performing dynamical analysis of dark energy and modified gravity models within the model independent framework of EFT; the general results, obtained with this technique, can be projected into specific models, as we show in one example. It also can be used to determine appropriate ansätze for the three EFT background functions when studying the dynamics of cosmological perturbations in the context of large scale structure tests of gravity.

79 ASTRONOMY AND ASTROPHYSICS↗

The positive orthogonal Grassmannian and loop amplitudes of ABJM

Herein we study the combinatorics associated with the positive orthogonal Grassmannian OG k and its connection to ABJM scattering amplitudes. We present a canonical embedding of OG k into the Grassmannian Gr( k , 2 k ), from which we deduce the canonical volume form that is invariant under equivalence moves. Remarkably the canonical forms of all reducible graphs can be converted into reduced ones with products of d log forms. Unlike super Yang–Mills, here the Jacobian plays a crucial role to ensure the d log form of the reduced representation. Furthermore in the positive region, we identify the functional map that arises from the triangle equivalence move as a 3-string scattering S -matrix which satisfies the tetrahedron equations by Zamolodchikov, implying (2 + 1)-dimensional integrability. We discuss the solution to the BCFW recursion relation for loop amplitudes, and demonstrate the presence of all physical singularities as well as the absence of all spurious ones. The on-shell diagram solution to the loop recursion relation exhibits manifest two-site cyclic symmetry and reveals that, to all loop, four and six-point amplitudes only have logarithmic singularities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian

We provide an explicit recursive divide-and-conquer approach for simulating quantum dynamics and derive a discrete first-quantized nonrelativistic QED Hamiltonian based on the many-particle Pauli-Fierz Hamiltonian. We apply this recursive divide-and-conquer algorithm to this Hamiltonian and compare it to a concrete simulation algorithm that uses qubitization. Our divide-and-conquer algorithm, using lowest-order Trotterization, scales for fixed grid spacing as O ~ ( Λ N 2 η 2 t 2 / ϵ ) for grid size N , η particles, simulation time t , field cutoff Λ , and error ϵ . Our qubitization algorithm scales as O ~ ( N ( η + N ) ( η + Λ 2 ) t log ( 1 / ϵ ) ) . This shows that even a naive partitioning and low-order splitting formula can yield, through our divide-and-conquer formalism, superior scaling to qubitization for large Λ . We compare the relative costs of these two algorithms on systems that are relevant for applications such as the spontaneous emission of photons and the photoionization of electrons. We observe that for different parameter regimes, one method can be favored over the other. Finally, we give new algorithmic and circuit-level techniques for gate optimization, including a new way of implementing a group of multicontrolled- X gates that can be used for better analysis of circuit cost. Published by the American Physical Society 2024

Mukhopadhyay, Priyanka (ORCID:0000000164639100)↗

Real Time Effective Impedance Estimation for Power System State Estimation

Here, we introduce two tools-the Effective Impedance State Estimator (EISE), and the Real Time Effective Impedance Estimator (RTEIE). The EISE is novel in that it is an entirely data-driven state estimator, and does not require a network model. Thus, the EISE is well suited for applications in which an accurate network model is not available. Instead of using a network impedance model, the EISE uses an effective impedance network model that is learned online by the RTEIE. The RTEIE recursively estimates the effective impedance network model using phasor measurement unit (PMU) measurements. The mathematical reasoning for using an effective impedance model, rather than a full network impedance model, is given. The recursive estimation framework allows the RTEIE to take the entire history of phasor measurements into account to produce a model estimate, while still adjusting to changes in the network impedance due to external factors such as topology changes and temperature. The merits of the RTEIE and EISE are demonstrated by comparing the accuracy of the EISE with a conventional state estimator on a toy network.

24 POWER TRANSMISSION AND DISTRIBUTION↗