Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 1,459 records · Page 81

Evaporation and wetting dynamics of sessile water droplets on submicron-scale patterned silicon hydrophobic surfaces

The evaporation characteristics of 1 l sessile water droplets on hydrophobic surfaces are experimentally examined. The proposed hydrophobic surfaces are composed of submicron diameter and 4.2- m-height silicon post arrays. A digital image analysis algorithm was developed to obtain time-dependent contact angles, contact diameters, and center heights for both non-patterned polydimethylsiloxane (PDMS) surfaces and patterned post array surfaces, which have the same hydrophobic contact angles. While the contact angles exhibit three distinct stages during evaporation in the non-patterned surface case, those in the patterned silicon post array surface case decrease linearly. In the case of post array hydrophobic surfaces, the initial contact diameter remains unchanged until the portion of the droplet above the posts completely dries out. The edge shrinking velocity of the droplet shows nonlinear characteristics, and the velocity magnitude increases rapidly near the last stage of evaporation.

36 MATERIALS SCIENCE↗

TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze

Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored variational quantum eigensolver), which iteratively builds up variational a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled- gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware. Published by the American Physical Society 2024

Anastasiou, Panagiotis G. (ORCID:0000000256601791)↗

Time-dependent N -electron valence perturbation theory with matrix product state reference wavefunctions for large active spaces and basis sets: Applications to the chromium dimer and all-trans polyenes

In earlier work [A. Y. Sokolov and G. K.-L. Chan, J. Chem. Phys. 144, 064102 (2016)], we introduced a time-dependent formulation of the second-order N -electron valence perturbation theory (t-NEVPT2) which (i) had a lower computational scaling than the usual internally contracted perturbation formulation and (ii) yielded the fully uncontracted NEVPT2 energy. We present a combination of t-NEVPT2 with a matrix product state (MPS) reference wavefunction (t-MPS-NEVPT2) that allows us to compute uncontracted dynamic correlation energies for large active spaces and basis sets, using the time-dependent density matrix renormalization group algorithm. In addition, we report a low-scaling MPS-based implementation of strongly contracted NEVPT2 (sc-MPS-NEVPT2) that avoids computation of the four-particle reduced density matrix. We use these new methods to compute the dissociation energy of the chromium dimer and to study the low-lying excited states in all-trans polyenes (C 4 H 6 to C 24 H 26 ), incorporating dynamic correlation for reference wavefunctions with up to 24 active electrons and orbitals

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unstructured discontinuous Galerkin for seismic inversion.

This abstract explores the potential advantages of discontinuous Galerkin (DG) methods for the time-domain inversion of media parameters within the earth's interior. In particular, DG methods enable local polynomial refinement to better capture localized geological features within an area of interest while also allowing the use of unstructured meshes that can accurately capture discontinuous material interfaces. This abstract describes our initial findings when using DG methods combined with Runge-Kutta time integration and adjoint-based optimization algorithms for full-waveform inversion. Our initial results suggest that DG methods allow great flexibility in matching the media characteristics (faults, ocean bottom and salt structures) while also providing higher fidelity representations in target regions. Time-domain inversion using discontinuous Galerkin on unstructured meshes and with local polynomial refinement is shown to better capture localized geological features and accurately capture discontinuous-material interfaces. These approaches provide the ability to surgically refine representations in order to improve predicted models for specific geological features. Our future work will entail automated extensions to directly incorporate local refinement and adaptive unstructured meshes within the inversion process.

58 GEOSCIENCES↗

Cooperative Optimal Coordination for Distributed Energy Resources

In this paper, we consider the optimal coordination problem for distributed energy resources (DERs) including distributed generators and energy storage devices. We propose an algorithm based on the push-sum and gradient method to optimally coordinate storage devices and distributed generators in a distributed manner. In the proposed algorithm, each DER only maintains a set of variables and updates them through information exchange with a few neighbors over a time-varying directed communication network. We show that the proposed distributed algorithm solves the optimal DER coordination problem if the time-varying directed communication network is uniformly jointly strongly connected, which is a mild condition on the connectivity of communication topologies. The proposed distributed algorithm is illustrated and validated by numerical simulations.

Yang, Tao↗

Dynamic cone beam CT angiography of carotid and cerebral arteries using canine model

Purpose: This research is designed to develop and evaluate a flat-panel detector-based dynamic cone beam CT system for dynamic angiography imaging, which is able to provide both dynamic functional information and dynamic anatomic information from one multirevolution cone beam CT scan. Methods: A dynamic cone beam CT scan acquired projections over four revolutions within a time window of 40 s after contrast agent injection through a femoral vein to cover the entire wash-in and wash-out phases. A dynamic cone beam CT reconstruction algorithm was utilized and a novel recovery method was developed to correct the time-enhancement curve of contrast flow. From the same data set, both projection-based subtraction and reconstruction-based subtraction approaches were utilized and compared to remove the background tissues and visualize the 3D vascular structure to provide the dynamic anatomic information. Results: Through computer simulations, the new recovery algorithm for dynamic time-enhancement curves was optimized and showed excellent accuracy to recover the actual contrast flow. Canine model experiments also indicated that the recovered time-enhancement curves from dynamic cone beam CT imaging agreed well with that of an IV-digital subtraction angiography (DSA) study. The dynamic vascular structures reconstructed using both projection-based subtraction and reconstruction-based subtraction were almost identical as the differences between them were comparable to the background noise level. At the enhancement peak, all the major carotid and cerebral arteries and the Circle of Willis could be clearly observed. Conclusions: The proposed dynamic cone beam CT approach can accurately recover the actual contrast flow, and dynamic anatomic imaging can be obtained with high isotropic 3D resolution. This approach is promising for diagnosis and treatment planning of vascular diseases and strokes.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Flexible Quasi-Static Mooring Design Optimization Method for Floating Structures

This paper presents a flexible and efficient design method for optimizing the mooring systems of floating structures. Mooring system optimization is challenging because of the strong nonlinearity of mooring system behavior and the many technical constraints that must be satisfied. Furthermore, different mooring configurations can have very different design spaces. While some successful examples of mooring design optimization exist in the literature, developing an optimization approach that can work across various mooring design problems is a larger challenge. We present such a method based on a flexible parameterization that allows a wide variety of mooring designs to be described by a list of variables, a quasi-static mooring model that provides efficient evaluation of a mooring design without directly considering mooring system dynamics, and an optimization framework that generates, evaluates, and adjusts the mooring design while considering user-specified constraints such as offset limits, strength safety factors, and seabed contact limits. We demonstrate the design optimization framework on four mooring design problems, each for a different type of mooring system. We compare the use of different design modes to simplify the optimization problem, showing that they can reduce the computation time by up to 75%. We also compare different optimization algorithms and find that the resulting computational speed can vary by up to 51 times. We perform a sensitivity study on one design and find that the local sensitivity of anchoring radius to water depth has a positive correlation of 0.29, but the global sensitivity shows large nonlinearities. Lastly, we perform a coupled dynamic analysis on one of the optimized designs and find that the predicted mean platform motions and mooring line tensions are within 1% of dynamic results and the extreme motions and tensions are within 14%. Lastly, we show that a DEA-Chain-Polyester mooring configuration is cost-optimal for the given design problem of the demonstrations, which aligns with general industry practice.

16 TIDAL AND WAVE POWER↗

Selecting Minimal Motion Primitive Libraries with Genetic Algorithms

Motion primitives allow for application of discrete search algorithms to rapidly produce trajectories in complex continuous space. The maneuver automaton (MA) provides an elegant formulation for creating a primitive library based on trims and maneuvers. However, performance is fundamentally limited by the contents of the primitive library. If the library is too sparse, performance can be poor in terms of path cost, whereas a library that is too large can increase run time. This work outlines new methods for using genetic algorithms to prune a primitive library. The proposed methods balance the path cost and planning time while maintaining the reachability of the MA. The genetic algorithm in this paper evaluates and mutates populations of motion primitive libraries to optimize both objectives. Here, we illustrate the performance of these methods with a simulated study using a nonlinear medium-fidelity F-16 model. We optimize a library with the presented algorithm for obstacle-free navigation and a nap-of-the-Earth navigation task. In the obstacle-free navigation task, we show a tradeoff of a 10.16% higher planning cost for a 96.63% improvement in run time. In the nap-of-the-Earth task, we show a tradeoff of a 9.712% higher planning cost for a 92.06% improvement in run time.

42 ENGINEERING↗

Noise analysis of genome-scale protein synthesis using a discrete computational model of translation

Noise in genetic networks has been the subject of extensive experimental and computational studies. However, very few of these studies have considered noise properties using mechanistic models that account for the discrete movement of ribosomes and RNA polymerases along their corresponding templates (messenger RNA (mRNA) and DNA). The large size of these systems, which scales with the number of genes, mRNA copies, codons per mRNA, and ribosomes, is responsible for some of the challenges. Additionally, one should be able to describe the dynamics of ribosome exchange between the free ribosome pool and those bound to mRNAs, as well as how mRNA species compete for ribosomes. We developed an efficient algorithm for stochastic simulations that addresses these issues and used it to study the contribution and trade-offs of noise to translation properties (rates, time delays, and rate-limiting steps). The algorithm scales linearly with the number of mRNA copies, which allowed us to study the importance of genome-scale competition between mRNAs for the same ribosomes. We determined that noise is minimized under conditions maximizing the specific synthesis rate. Moreover, sensitivity analysis of the stochastic system revealed the importance of the elongation rate in the resultant noise, whereas the translation initiation rate constant was more closely related to the average protein synthesis rate. We observed significant differences between our results and the noise properties of the most commonly used translation models. Overall, our studies demonstrate that the use of full mechanistic models is essential for the study of noise in translation and transcription.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling and optimizing of the random atomic spin gyroscope drift based on the atomic spin gyroscope

In order to improve the atom spin gyroscope's operational accuracy and compensate the random error caused by the nonlinear and weak-stability characteristic of the random atomic spin gyroscope (ASG) drift, the hybrid random drift error model based on autoregressive (AR) and genetic programming (GP) + genetic algorithm (GA) technique is established. The time series of random ASG drift is taken as the study object. The time series of random ASG drift is acquired by analyzing and preprocessing the measured data of ASG. The linear section model is established based on AR technique. After that, the nonlinear section model is built based on GP technique and GA is used to optimize the coefficients of the mathematic expression acquired by GP in order to obtain a more accurate model. The simulation result indicates that this hybrid model can effectively reflect the characteristics of the ASG's random drift. The square error of the ASG's random drift is reduced by 92.40%. Comparing with the AR technique and the GP + GA technique, the random drift is reduced by 9.34% and 5.06%, respectively. The hybrid modeling method can effectively compensate the ASG's random drift and improve the stability of the system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TEMPERATURE STRUCTURE OF PROTOPLANETARY DISKS UNDERGOING LAYERED ACCRETION

We calculate the temperature structures of protoplanetary disks (PPDs) around T Tauri stars heated by both incident starlight and viscous dissipation. We present a new algorithm for calculating the temperatures in disks in hydrostatic and radiative equilibrium, based on Rybicki's method for iteratively calculating the vertical temperature structure within an annulus. At each iteration, the method solves for the temperature at all locations simultaneously, and converges rapidly even at high (>>10{sup 4}) optical depth. The method retains the full frequency dependence of the radiation field. We use this algorithm to study for the first time disks evolving via the magnetorotational instability. Because PPD midplanes are weakly ionized, this instability operates preferentially in their surface layers, and disks will undergo layered accretion. We find that the midplane temperatures T{sub mid} are strongly affected by the column density {Sigma}{sub a} of the active layers, even for fixed mass accretion rate M-dot . Models assuming uniform accretion predict midplane temperatures in the terrestrial planet forming region several x 10{sup 2} K higher than our layered accretion models do. For M-dot < 10{sup -7} M{sub sun} yr{sup -1} and the column densities {Sigma}{sub a} < 10 g cm{sup -2} associated with layered accretion, disk temperatures are indistinguishable from those of a passively heated disk. We find emergent spectra are insensitive to {Sigma}{sub a}, making it difficult to observationally identify disks undergoing layered versus uniform accretion.

79 ASTRONOMY AND ASTROPHYSICS↗

Integrating a ponderomotive guiding center algorithm into a quasi-static particle-in-cell code based on azimuthal mode decomposition

High fidelity modeling of plasma based acceleration (PBA) requires the use of three dimensional, fully nonlinear, and kinetic descriptions based on the particle-in-cell (PIC) method. In PBA an intense particle beam or laser (driver) propagates through a tenuous plasma whereby it excites a plasma wave wake. Three-dimensional PIC algorithms based on the quasi-static approximation (QSA) have been successfully applied to efficiently model the interaction between relativistic charged particle beams and plasma. In a QSA PIC algorithm, the plasma response to a charged particle beam or laser driver is calculated based on forces from the driver and self-consistent forces from the QSA form of Maxwell's equations. These fields are then used to advance the charged particle beam or laser forward by a large time step. Since the time step is not limited by the regular Courant-Friedrichs-Lewy (CFL) condition that constrains a standard 3D fully electromagnetic PIC code, a 3D QSA PIC code can achieve orders of magnitude speedup in performance. Recently, a new hybrid QSA PIC algorithm that combines another speedup technique known as an azimuthal Fourier decomposition has been proposed and implemented. This hybrid algorithm decomposes the electromagnetic fields, charge and current density into azimuthal harmonics and only the Fourier coefficients need to be updated, which can reduce the algorithmic complexity of a 3D code to that of a 2D code. Modeling the laser-plasma interaction in a full 3D electromagnetic PIC algorithm is very computationally expensive due the enormous disparity of physical scales to be resolved. In the QSA the laser is modeled using the ponderomotive guiding center (PGC) approach. We describe how to implement a PGC algorithm compatible for the QSA PIC algorithms based on the azimuthal mode expansion. Here this algorithm permits time steps orders of magnitude larger than the cell size and it can be asynchronously parallelized. Details on how this is implemented into the QSA PIC code that utilizes an azimuthal mode expansion, QPAD, are also described. Benchmarks and comparisons between a fully 3D explicit PIC code (OSIRIS), as well as a few examples related to laser wakefield acceleration, are presented.

97 MATHEMATICS AND COMPUTING↗

Enabling Extended-Term Simulation of Power Systems with High PV Penetration. Final Report

This is the final Technical Report for DOE-SETO Project Award # DE-EE0036461. The goal of this project is to advance the understanding of the grid impact of high penetration of photovoltaic (PV) generation by developing novel numerical methods to solve the differential algebraic equations (DAEs) that define power systems. This will overcome the limitations of current software packages – namely that they only consider fast dynamics over brief time periods. The work presented in this final project report covers results over the entire period of the project. This includes results on model development, code development for the PST repository, datasets in the PST repository, algorithm development and results from variable time-step simulations, development and results from multirate simulations, and sensitivity analysis of key parameter in variable time-step methods. In addition, this report discusses project outreach activities to stakeholders, and a summary of project products. Also covered in this final report is the writing of two conference papers (one of which has already been accepted) and a journal paper. In addition, the updating of two inverter models (both grid forming and grid following) to be compatible with the latest version of PST software is discussed.

14 SOLAR ENERGY↗

BEER ANALYSIS OF KEPLER AND CoRoT LIGHT CURVES. I. DISCOVERY OF KEPLER-76b: A HOT JUPITER WITH EVIDENCE FOR SUPERROTATION

We present the first case in which the BEER algorithm identified a hot Jupiter in the Kepler light curve, and its reality was confirmed by orbital solutions based on follow-up spectroscopy. The companion Kepler-76b was identified by the BEER algorithm, which detected the BEaming (sometimes called Doppler boosting) effect together with the Ellipsoidal and Reflection/emission modulations (BEER), at an orbital period of 1.54 days, suggesting a planetary companion orbiting the 13.3 mag F star. Further investigation revealed that this star appeared in the Kepler eclipsing binary catalog with estimated primary and secondary eclipse depths of 5 Multiplication-Sign 10{sup -3} and 1 Multiplication-Sign 10{sup -4}, respectively. Spectroscopic radial velocity follow-up observations with Tillinghast Reflector Echelle Spectrograph and SOPHIE confirmed Kepler-76b as a transiting 2.0 {+-} 0.26 M{sub Jup} hot Jupiter. The mass of a transiting planet can be estimated from either the beaming or the ellipsoidal amplitude. The ellipsoidal-based mass estimate of Kepler-76b is consistent with the spectroscopically measured mass while the beaming-based estimate is significantly inflated. We explain this apparent discrepancy as evidence for the superrotation phenomenon, which involves eastward displacement of the hottest atmospheric spot of a tidally locked planet by an equatorial superrotating jet stream. This phenomenon was previously observed only for HD 189733b in the infrared. We show that a phase shift of 10. Degree-Sign 3 {+-} 2. Degree-Sign 0 of the planet reflection/emission modulation, due to superrotation, explains the apparently inflated beaming modulation, resolving the ellipsoidal/beaming amplitude discrepancy. Kepler-76b is one of very few confirmed planets in the Kepler light curves that show BEER modulations and the first to show superrotation evidence in the Kepler band. Its discovery illustrates for the first time the ability of the BEER algorithm to detect short-period planets and brown dwarfs.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient algorithm for approximating one-dimensional ground states

The density-matrix renormalization-group method is very effective at finding ground states of one-dimensional (1D) quantum systems in practice, but it is a heuristic method, and there is no known proof for when it works. In this article we describe an efficient classical algorithm which provably finds a good approximation of the ground state of 1D systems under well-defined conditions. More precisely, our algorithm finds a matrix product state of bond dimension D whose energy approximates the minimal energy such states can achieve. The running time is exponential in D, and so the algorithm can be considered tractable even for D, which is logarithmic in the size of the chain. The result also implies trivially that the ground state of any local commuting Hamiltonian in 1D can be approximated efficiently; we improve this to an exact algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MCS+: An Efficient Algorithm for Crawling the Community Structure in Multiplex Networks

In this article, we consider the problem of crawling a multiplex network to identify the community structure of a layer-of-interest. A multiplex network is one where there are multiple types of relationships between the nodes. In many multiplex networks, some layers might be easier to explore (in terms of time, money etc.). We propose MCS+, an algorithm that can use the information from the easier to explore layers to help in the exploration of a layer-of-interest that is expensive to explore. We consider the goal of exploration to be generating a sample that is representative of the communities in the complete layer-of-interest. This work has practical applications in areas such as exploration of dark (e.g., criminal) networks, online social networks, biological networks, and so on. For example, in a terrorist network, relationships such as phone records, e-mail records, and so on are easier to collect; in contrast, data on the face-to-face communications are much harder to collect, but also potentially more valuable. We perform extensive experimental evaluations on real-world networks, and we observe that MCS+ consistently outperforms the best baseline—the similarity of the sample that MCS+ generates to the real network is up to three times that of the best baseline in some networks. We also perform theoretical and experimental evaluations on the scalability of MCS+ to network properties, and find that it scales well with the budget, number of layers in the multiplex network, and the average degree in the original network.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Development of a Time-Height Profile Assimilation Technique for Large-Eddy Simulation

Mesoscale-to-microscale coupling (MMC) aims to address the limited scope of traditional large-eddy simulations by driving the microscale flow with information concerning large-scale weather patterns provided by mesoscale models. We present a new offline MMC technique for horizontally homogeneous microscale flow conditions, in which internal forcing terms are computed based on mesoscale time–height profiles of mean-flow quantities. The advantage of such an approach is that it can be used to drive a microscale simulation with either mesoscale or observational data, and that it does not rely on specific terms in the mesoscale budget equations, which are typically not part of the default output of a mesoscale solver. The performance of the proposed profile assimilation technique is assessed based on the simulation of a typical diurnal cycle over the Scaled Wind Farm Technology site in west Texas. Results indicate that simple data assimilation techniques lead to unphysically high levels of shear and turbulence caused by the algorithm’s inability to cope with inaccuracies in the mesoscale time–height profiles. Modifying the algorithm to account for vertical coherence in the mesoscale source terms gives the microscale solver a greater ability to correct the provided mesoscale time–height profiles, leading to improved predictions of shear and turbulence statistics. The resulting turbulence statistics are in good agreement with meteorological tower observations and simulation results obtained with state-of-the-art coupling techniques using mesoscale budget components.

data assimilation↗

Online Stochastic Optimization of Networked Distributed Energy Resources

Our work investigates distributed control and incentive mechanisms to coordinate distributed energy resources (DERs) with both continuous and discrete decision variables as well as device dynamics in distribution grids. We formulate a multi-period social welfare maximization problem, and based on its convex relaxation propose a distributed stochastic dual gradient algorithm for managing DERs. Moreover, we extend it to an online realtime setting with time-varying operating conditions, asynchronous updates by devices, and feedback being leveraged to account for nonlinear power flows as well as reduce communication overhead. The resulting algorithm provides a general online stochastic optimization algorithm for coordinating networked DERs with discrete power setpoints and dynamics to meet operational and economic objectives and constraints. We characterize the convergence of the algorithm analytically and evaluate its performance numerically.

24 POWER TRANSMISSION AND DISTRIBUTION↗