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,765 records · Page 98

Spatial profile reconstruction of individual componentsof the nonlinear susceptibility tensors {chi}-circumflex {sup (3)}(z, {omega}', {omega}' -{omega}, {omega}) and {chi}-circumflex {sup (3)}(z, 2{omega}{+-}{omega}', {+-}{omega}', {omega}, {omega}) of a one-dimensionally inhomogeneous medium

We have proved for the first time and proposed an algorithm of unique spatial profile reconstruction of the components {chi}-circumflex {sup (3)}{sub yyyy} of complex tensors {chi}-circumflex {sup (3)}(z, {omega}', {omega}', -{omega}, {omega}) and {chi}-circumflex {sup (3)}(z, 2{omega}{+-}{omega}', {+-}{omega}', {omega}, {omega}), describing four-photon interaction of light waves in a one-dimensionally inhomogeneous plate, whose medium has a symmetry plane m{sub y} that is perpendicular to its surface. For the media with an additional symmetry axis 2{sub z}, 4{sub z}, 6{sub z} or {infinity}{sub z} that is perpendicular to the plate surface, the proposed method can be used to reconstruct about one-fifth of all independent components of the above tensors. (nonlinear optical phenomena)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enabling cooperative adaptive cruise control on strings of vehicles with heterogeneous dynamics and powertrains

Recent studies have shown that positive impact of Cooperative Adaptive Cruise Control (CACC) can only be guaranteed as market penetration rate increases. Removing the string homogeneity constraint is essential to encourage widespread adoption. In this work, a hierarchical architecture is proposed to enable CACC on vehicles with not only mixed dynamics but also different powertrain types. A low-level layer deals with the vehicle and powertrain dynamics to provide accurate and consistent reference speed tracking response. The high-level layer uses: (1) a Linear Parameter Varying feedback system to provide loop stability, robustness and enforce a variable time gap policy and (2) a feedforward system that processes Vehicle-to-Vehicle information to enhance string stability and response bandwidth, by dealing with the string heterogeneity. A gap management strategy is built on top of the CACC architecture to handle gap setting changes or cut-in/out situations, via a dynamics constrained time gap trajectory planning algorithm. We report the proposed work has been designed, developed and validated on three different real passenger vehicles on public highways and test tracks, showing the potential of the proposed algorithm to enable robust string stable CACC, despite the different dynamics and powertrains considered.

33 ADVANCED PROPULSION SYSTEMS↗

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗

A high-order spectral deferred correction strategy for low Mach number flow with complex chemistry

This article presents a fourth-order finite-volume algorithm in space and time for low Mach number reacting flow with detailed kinetics and transport. Our temporal integration scheme is based on a Multi-Implicit Spectral Deferred Correction (MISDC) strategy that iteratively couples advection, diffusion, and reactions evolving subject to a constraint. Our new approach overcomes a stability limitation of our previous second-order method encountered when trying to incorporate higher-order polynomial representations of the solution in time to increase accuracy. We have developed a new iterative scheme that naturally fits within our MISDC framework and allows us to conserve mass and energy while simultaneously satisfying the equation of state. We analyse the conditions for which the iterative schemes are guaranteed to converge to the fixed point solution. Finally, we present numerical examples illustrating the performance of the new method on premixed hydrogen, methane, and dimethyl ether flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ENHANCED LENSING RATE BY CLUSTERING OF MASSIVE GALAXIES: NEWLY DISCOVERED SYSTEMS IN THE SLACS FIELDS

Galaxy-scale strong gravitational lens systems are useful for a variety of astrophysical applications. However, their use is limited by the relatively small samples of lenses known to date. It is thus important to develop efficient ways to discover new systems both in present and forthcoming data sets. For future large high-resolution imaging surveys we anticipate an ever-growing need for efficiency and for independence from spectroscopic data. In this paper, we exploit the clustering of massive galaxies to perform a high-efficiency imaging search for gravitational lenses. Our data set comprises 44 fields imaged by the Hubble Space Telescope (HST) Advanced Camera for Surveys (ACS), each of which is centered on a lens discovered by the Strong Lens ACS Survey (SLACS). We compare four different search methods: (1) automated detection with the HST Archive Galaxy-scale Gravitational Lens Survey (HAGGLeS) robot, (2) examining cutout images of bright galaxies (BGs) after subtraction of a smooth galaxy light distribution, (3) examining the unsubtracted BG cutouts, and (4) performing a full-frame visual inspection of the ACS images. We compute purity and completeness and consider investigator time for the four algorithms, using the main SLACS lenses as a testbed. The first and second algorithms perform the best. We present the four new lens systems discovered during this comprehensive search, as well as one other likely candidate. For each new lens we use the fundamental plane to estimate the lens velocity dispersion and predict, from the resulting lens geometry, the redshifts of the lensed sources. Two of these new systems are found in galaxy clusters, which include the SLACS lenses in the two respective fields. Overall we find that the enhanced lens abundance (30{sup +24} {sub -8} lenses deg{sup -2}) is higher than expected for random fields (12{sup +4} {sub -2} lenses deg{sup -2} for the COSMOS survey). Additionally, we find that the gravitational lenses we detect are qualitatively different from those in the parent SLACS sample: this imaging survey is largely probing higher redshift, and lower mass, early-type galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum phase diagram of fermion mixtures with population imbalance in one-dimensional optical lattices

With a recently developed time-evolving block decimation algorithm, we numerically study the ground-state quantum phase diagram of Fermi mixtures with attractive interspecies interactions loaded in one-dimensional optical lattices. For our study, we adopt a general asymmetric Hubbard model with species-dependent tunneling rates to incorporate the possibility of mass imbalance in the mixtures. We find clear signatures for the existence of a Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) phase in this model in the presence of population imbalance. Our simulation also reveals that in the presence of mass imbalance, the parameter space for FFLO states shrinks or even completely vanishes depending on the strength of the attractive interaction and the degree of mass imbalance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Phonon resonances in atomic currents through Bose-Fermi mixtures in optical lattices

We present an analysis of Bose-Fermi mixtures in optical lattices for the case where the lattice potential of the fermions is tilted and the bosons (in the superfluid phase) are described by Bogoliubov phonons. It is shown that the Bogoliubov phonons enable hopping transitions between fermionic Wannier-Stark states; these transitions are accompanied by energy dissipation into the superfluid and result in a net atomic current along the lattice. We derive a general expression for the drift velocity of the fermions and find that the dependence of the atomic current on the lattice tilt exhibits negative differential conductance and phonon resonances. Numerical simulations of the full dynamics of the system based on the time-evolving block decimation algorithm reveal that the phonon resonances should be observable under the conditions of a realistic measuring procedure.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum phase transition of Bose-Einstein condensates on a nonlinear ring lattice

We study the phase transitions in a one-dimensional Bose-Einstein condensate on a ring whose atomic scattering length is modulated periodically along the ring. By using a modified Bogoliubov method to treat such a nonlinear lattice in the mean-field approximation, we find that the phase transitions are of different orders when the modulation period is 2 and greater than 2. We further perform a full quantum mechanical treatment based on the time-evolving block decimation algorithm which confirms the mean-field results and reveals interesting quantum behavior of the system. Our studies yield important knowledge of competing mechanisms behind the phase transitions and the quantum nature of this system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuous quantum phase transition between two topologically distinct valence bond solid states associated with the same spin value

We propose a one-dimensional quantum Heienberg spin-2 chain, which exhibits two topologically distinct valence bond solid states in two different solvable limits. We then construct the phase diagram and study the quantum phase transition between these two states using infinite time evolving block decimation algorithms. From the scaling relation between the entanglement entropy and the correlation length, we determine that the central charge for the underlying critical conformal field theory is around two.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pre-equilibrium evolution of conserved charges with initial conditions in the ICCING Monte Carlo event generator

Heavy-ion collisions can be well described through relativistic viscous hydrodynamics, but questions still remain when hydrodynamics is applicable because the initial state may begin very far from equilibrium. Thus, a pre-equilibrium evolution phase is used to bridge the gap between the initial state and hydrodynamics. KøMPøST is one such pre-equilibrium model that propagates the energy-momentum tensor by decomposing it into the background and fluctuations around that background, whose evolution is captured by Green's functions. We extend this formalism to include conserved charges and calculate the corresponding nonequilibrium Green's functions in the relaxation-time approximation. The ICCING algorithm initializes conserved charges in the initial state by sampling $g$ → $q$$\overline{q}$ splitting probabilities and is, thus, perfectly positioned to implement Green's functions for charge propagation. As a result, we show that this method alters the initial-state charge geometries and is applicable in central to mid-central collisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Isometric Tensor Network States in Two Dimensions

Tensor-network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. Here we consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm for approximating of the ground state of a Hamiltonian as an isometric TNS-which we demonstrate for the 2D transverse field Ising model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum simulation of QED in Coulomb gauge

A recent work considered quantum simulation of Quantum Electrodynamics on a lattice in the Coulomb gauge with gauge degrees of freedom represented in the occupation basis in momentum space. In this work, we consider the more efficient representation of the gauge degrees of freedom in field basis in position space and develop a quantum algorithm for real-time simulation. We show that the continuum Coulomb gauge Hamiltonian is equivalent to the temporal gauge Hamiltonian when acting on physical states consisting of fermion and transverse gauge fields. The Coulomb gauge Hamiltonian is discretized by using the Green’s function of the discrete Laplacian operator under the Dirichlet boundary conditions. Both the continuum Coulomb gauge Hamiltonian and the discretized one proposed here guarantee that the unphysical longitudinal gauge fields are decoupled and commute with the corresponding Hamiltonian. Thus there is no need to impose any constraint. The local gauge field basis and the canonically conjugate variable basis are swapped efficiently using the quantum Fourier transform. We prove that the qubit cost to represent physical states and the gate count for real-time simulation scale polynomially with the lattice size, energy, time, accuracy, and Hamiltonian parameters in lattice units. The gate cost here for implementing the time evolution of the gauge field is reduced at least by a factor on the order of 10 8 for modest lattice size and accuracy level compared with the previous work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Invited: Software defined accelerators from learning tools environment

Next generation systems, such as edge devices, will need to provide efficient processing of machine learning (ML) algorithms along several metrics, including energy, performance, area, and latency. However, the quickly evolving field of ML makes it extremely difficult to generate accelerators able to support a wide variety of algorithms. At the same time, designing accelerators in hardware description languages (HDLs) by hand is hard and time consuming, and does not allow quick exploration of the design space. In this paper we present the Software Defined Accelerators From Learning Tools Environment (SODALITE), an automated open source high-level ML framework-to-verilog compiler targeting ML Application-Specific Integrated Circuits (ASICs) chiplets. The SODALITE approach will implement optimal designs by seamlessly combining custom components generated through high-level synthesis (HLS) with templated and fully tunable Intellectural Properties (IPs) and macros, integrated in an extendable resource library. Through a closed loop design space exploration engine, developers will be able to quickly explore their hardware designs along different dimensions.

High-Level Synthesis, Accelerators, Hardware-Softw↗

Cyber-Physical Smart Light Control System Integration with Smart Grid using Zigbee

This paper presents a hardware-in-the-loop cyber-physical system architecture design to monitor and control smart lights connected to the active distribution grid. The architecture uses Zigbee-based (IEEE 802.15.4) wireless sensor networks and publish-subscribe architecture to exchange monitoring and control signals between smart-light actuators (SLAs) and a smart-light central controller (SLCC). Each SLA integrated into a smart light consists of a Zigbee-based endpoint module to send and receive signals to and from the SLCC. The SLCC consists of a Zigbee-based coordinator module, which further exchanges the monitoring and control signals with the active distribution management system over the TCP/IP communication network. The monitoring signals from the SLAs include light status, brightness level, voltage, current, and power data, whereas, the control signals to the SLAs include light intensity, turn ON, turn OFF, standby, and default settings. We have used our existing hardware-in-the-loop (HIL) cyber-physical system (CPS) security SCADA testbed to process signals received from the SLCC and respond suitable control signals based on the smart light schedule requirements, system operation, and active distribution grid dynamic characteristics. We have integrated the proposed cyber-physical smart light control system (CPSLCS) testbed to our existing HIL CPS SCADA testbed. We use the integrated testbed to demonstrate the efficacy of the proposed algorithm by real-time performance and latency between the SLCC and SLAs. The experiments demonstrated significant results by 100% realtime performance and low latency while exchanging data between the SLCC and SLAs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Performance Modeling of In Situ Rendering

With the push to exascale, in situ visualization and analysis will continue to play an important role in high performance computing. Tightly coupling in situ visualization with simulations constrains resources for both, and these constraints force a complex balance of trade-offs. A performance model that provides an a priori answer for the cost of using an in situ approach for a given task would assist in managing the trade-offs between simulation and visualization resources. In this work, we present new statistical performance models, based on algorithmic complexity, that accurately predict the run-time cost of a set of representative rendering algorithms, an essential in situ visualization task. To train and validate the models, we conduct a performance study of an MPI+X rendering infrastructure used in situ with three HPC simulation applications. We then explore feasibility issues using the model for selected in situ rendering questions.

Larsen, Matthew↗

Automatic Generation of High-Performance Convolution Kernels on ARM CPUs for Deep Learning

In this work, we present FastConv, a template-based code auto-generation open source library that can automatically generate high-performance deep learning convolution kernels of arbitrary matrices/tensors shapes. FastConv is based on the Winograd algorithm, which is reportedly the highest performing algorithm for the time-consuming convolution layers of convolutional neural networks. ARM CPUs cover a wide range designs and specifications, from embedded devices to HPC-grade CPUs. The leads to the dilemma of how to consistently optimize Winograd-based convolution solvers for convolution layers of different shapes. FastConv addresses this problem by using templates to auto-generate multiple shapes of tuned kernels variants suitable for skinny tall matrices. As a performance portable library, FastConv transparently searches for the best combination of kernel shapes, cache tiles, scheduling of loop orders, packing strategies, access patterns, and online/offline computations. Auto-tuning is used to search the parameter configuration space for the best performance for a given target architecture and problem size. The experiments with layer-wise evaluation on the VGG--16 model confirms a 1.25x performance gains is got by tuning the Winograd library. Integrated comparison results shows 1.02x to 1.40x, 1.14x to 2.17x, and 1.22x and 2.48x speedup is achieved over NNPACK, Arm NN, and FeatherCNN on the Kunpeng 920 beside few cases. Furthermore, problem size performance portability experiments with various convolution shapes shows that FastConv achieves 1.2x to 1.7x speedup and 2x to 22x speedup over NNPACK and ARM NN inference engine using Winograd on Kunpeng 920 . CPU performance portability evaluation on the VGG--16 show an average speedup over NNPACK of 1.42x, 1.21x, 1.26x, 1.37x, 2.26x, and 11.02x is observed on Kunpeng 920, Snapdragon 835, 855, 888, Apple M1, and AWS Graviton2, respectively.

97 MATHEMATICS AND COMPUTING↗

A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems

Historically, centrally computed algorithms have been the primary means of power system optimization and control. With increasing penetrations of distributed energy resources requiring optimization and control of power systems with many controllable devices, distributed algorithms have been the subject of significant research interest. Here, this paper surveys the literature of distributed algorithms with applications to optimization and control of power systems. In particular, this paper reviews distributed algorithms for offline solution of optimal power flow (OPF) problems as well as online algorithms for real-time solution of OPF, optimal frequency control, optimal voltage control, and optimal wide-area control problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗