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,099 records · Page 61

Mechanisms for the convergence of time-parallelized, parareal turbulent plasma simulations

Parareal is a recent algorithm able to parallelize the time dimension in spite of its sequential nature. It has been applied to several linear and nonlinear problems and, very recently, to a simulation of fully-developed, two-dimensional drift wave turbulence. The mere fact that parareal works in such a turbulent regime is in itself somewhat unexpected, due to the characteristic sensitivity of turbulence to any change in initial conditions. This fundamental property of any turbulent system should render the iterative correction procedure characteristic of the parareal method inoperative, but this seems not to be the case. In addition, the choices that must be made to implement parareal (division of the temporal domain, election of the coarse solver and so on) are currently made using trial-and-error approaches. Here, we identify the mechanisms responsible for the convergence of parareal of these simulations of drift wave turbulence. We also investigate which conditions these mechanisms impose on any successful parareal implementation. The results reported here should be useful to guide future implementations of parareal within the much wider context of fully-developed fluid and plasma turbulent simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TH-AB-202-12: The First Clinical Implementation of a Real-Time Six Degree of Freedom Tracking System During Radiation Therapy

Purpose: In current practice, imaging is typically performed prior to treatment; the cancer target motion during treatment is unknown. We present the first clinical implementation of real time Kilovoltage Intrafraction Monitoring (KIM) system which tracks the cancer target translational and rotational motions during treatment. Methods: KIM technology: KIM estimates the 3D position of the target tumour based on segmented 2D positions of the three implanted fiducials in each of the kV images (125 kV, 10 mA at 11 fps) taken continuously during the treatment arc. The 2D-3D target estimation is based on a probability distribution function, obtained during pre-treatment CBCT. Rotations about each axis with the centroid of the markers as the pivot were calculated using the iterative closest point algorithm in real time. Patient: A patient with prostate adenocarcinoma undergoing stereotactic body radiotherapy (SBRT) with 36.25 Gy delivered in 5 fractions (Varian TrueBeam, 6X, VMAT) was enrolled in the study. The trial complies with Australian ethical and regulatory standards. Results: Of the 5 fractions of treatment the patient received, KIM was utilised successfully in 4 fractions with 3 couch shifts due to large persistent prostate movements (>2mm for more than 5 seconds). KIM translational accuracy and precision in comparison with post treatment kV-MV triangulation are 0.28±0.59 mm, −0.19±0.25 mm and 0.23±0.69 mm in the Left-Right, Superior-Inferior and Anterior-Posterior directions, respectively. KIM rotational accuracy as compared with triangulation is: 0.429°±2.22°, −0.44°±4.7° and 0.06°±1.08° in the roll, pitch and yaw direction, respectively. Conclusion: The first six degree of freedom KIM system was successfully implemented clinically. The presented KIM system has sub-millimeters accuracy and precision in all three translational axes, and less than 1° of mean error in all three rotational axes. Acknowledgement: This work is supported by Cancer Australia grants APPXXX, APPYYY.

60 APPLIED LIFE SCIENCES↗

Linear-Scaling Local Natural Orbital-Based Full Triples Treatment in Coupled-Cluster Theory

We present an efficient, asymptotically linear-scaling implementation of the canonically O(N 8 ) coupled-cluster method with singles, doubles, and full triples excitations (CCSDT) method. We apply the domain-based local pair natural orbital (DLPNO) approach for computing CCSDT amplitudes. Our method, called DLPNO–CCSDT, uses the converged coupled-cluster amplitudes from a preceding DLPNO–CCSD(T) computation as a starting point for the solution of the CCSDT equations in the local natural orbital basis. To simplify the working equations, we t1-dress our two-electron integrals and Fock matrices, allowing our equations to take on the form of CCDT. With appropriate parameters, our method can recover more than 99.99% of the total canonical CCSDT correlation energy. In addition, we demonstrate that our method consistently yields sub-kJ mol –1 errors in relative energies when compared to canonical CCSDT, and, likewise, when computing the difference between CCSDT and CCSD(T). Finally, to highlight the low scaling of our algorithm, we present timings on linear alkanes (up to 30 carbons and 730 basis functions) and water clusters (up to 131 water molecules and 3144 basis functions).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enforcing global constraints for the dispersion closure problem: τ 2 -SIMPLE algorithm

Permeability and effective dispersion tensors are critical parameters to characterize flow and transport in porous media at the continuum scale. Homogenization theory defines a framework in which such effective properties are first computed from solving a closure problem in a repeating unit cell of the periodic microstructure and then used in a macroscopic formulation for efficient computation. The closure problem is formulated as a local boundary value problem subjected to global constraints, which guarantee the uniqueness of the solution and can be difficult to satisfy for complex geometries and at high flow conditions. These constraints also ensure that pore-scale pressure, velocity, and concentration fields can be accurately reconstructed from the closure variable. Building on a previous work, here we present a framework that allows to satisfy global constraints associated to both the permeability and the dispersion closure problems by introducing two artificial time scales. The algorithm, called τ 2 -SIMPLE, computes both permeability and effective dispersion given an arbitrarily complex geometry and flow condition. Furthermore, this algorithm is demonstrated to be accurate for both 2D and 3D geometries across varying flow conditions, and thus it can be used to quickly characterize effective properties from porous media images in many applications.

97 MATHEMATICS AND COMPUTING↗

Optimal checkpointing for adjoint multistage time-stepping schemes

Here, we consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes that require computing several substeps within one complete time step. Specifically, we propose two algorithms that can generate optimal checkpoint-ing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with other algorithms. The CAMS algorithm is made publicly available in a library with bindings to C and Python. Numerical results show that the proposed algorithms can deliver up to two times the speedup compared with that of classical Revolve. Moreover, we discuss the utilization of the CAMS library in mature scientific computing libraries and demonstrate the ease of using it in an adjoint workflow. The proposed algorithms have been adopted by the PETSc TSAdjoint library. Their performance has been demonstrated with a large-scale PDE-constrained optimization problem on a leadership-class supercomputer. This work is a significant extension of the authors' conference paper.

97 MATHEMATICS AND COMPUTING↗

A fast exact simulation method for a class of Markov jump processes

A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length τ. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its implementation, analyze its properties, and compare its performance with three other commonly used SSA methods in four examples. Our performance tests and CPU operation statistics show certain advantages of the HLM for large scale problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unsteady transonic algorithm improvements for realistic aircraft applications

Improvements to a time-accurate approximate factorization (AF) algorithm were implemented for steady and unsteady transonic analysis of realistic aircraft configurations. These algorithm improvements were made to the CAP-TSD (Computational Aeroelasticity Program - Transonic Small Disturbance) code developed at the Langley Research Center. The code permits the aeroelastic analysis of complete aircraft in the flutter critical transonic speed range. The AF algorithm of the CAP-TSD code solves the unsteady transonic small-disturbance equation. The algorithm improvements include: an Engquist-Osher (E-O) type-dependent switch to more accurately and efficiently treat regions of supersonic flow; extension of the E-O switch for second-order spatial accuracy in these regions; nonreflecting far field boundary conditions for more accurate unsteady applications; and several modifications which accelerate convergence to steady-state. Calculations are presented for several configurations including the General Dynamics one-ninth scale F-16C aircraft model to evaluate the algorithm modifications. The modifications have significantly improved the stability of the AF algorithm and hence the reliability of the CAP-TSD code in general.

Batina, John T.↗

Unsteady transonic algorithm improvements for realistic aircraft applications

Improvements to a time-accurate approximate factorization (AF) algorithm have been implemented for steady and unsteady transonic analysis of realistic aircraft configurations. The algorithm improvements include: an Engquist-Osher (E-O) type-dependent switch to more accurately and efficiently treat regions of supersonic flow, extension of the E-O switch for second-order spatial accuracy in these regions, nonreflecting far field boundary conditions for more accurate unsteady applications, and several modifications which accelerate convergence to steady-state. Calculations are presented for several configurations to evaluate the algorithm modifications. The modifications have significantly improved the stability of the AF algorithm and hence the reliability of the CAP-TSD code in general.

Batina, John T.↗

Apparatus for using a time interval counter to measure frequency stability

An apparatus for measuring the relative stability of two signals is disclosed comprising a means for mixing the two signals down to a beat note sine wave and for producing a beat note square wave whose upcrossings are the same as the sine wave. A source of reference frequency is supplied to a clock divider and interval counter to synchronize them and to generate a picket fence for providing a time reference grid of period shorter than the beat period. An interval counter is employed to make a preliminary measurement between successive upcrossings of the beat note square wave for providing an approximate time interval therebetween as a reference. The beat note square wave and the picket fence are then provided to the interval counter to provide an output consisting of the time difference between the upcrossing of each beat note square wave cycle and the next picket fence pulse such that the counter is ready for each upcrossing and dead time is avoided. A computer containing an algorithm for calculating the exact times of the beat note upcrossings then computes the upcrossing times.

Greenhall, Charles A.↗

Autonomous space processor for orbital debris

The development of an Autonomous Space Processor for Orbital Debris (ASPOD) was the goal. The nature of this craft, which will process, in situ, orbital debris using resources available in low Earth orbit (LEO) is explained. The serious problem of orbital debris is briefly described and the nature of the large debris population is outlined. The focus was on the development of a versatile robotic manipulator to augment an existing robotic arm, the incorporation of remote operation of the robotic arms, and the formulation of optimal (time and energy) trajectory planning algorithms for coordinated robotic arms. The mechanical design of the new arm is described in detail. The work envelope is explained showing the flexibility of the new design. Several telemetry communication systems are described which will enable the remote operation of the robotic arms. The trajectory planning algorithms are fully developed for both the time optimal and energy optimal problems. The time optimal problem is solved using phase plane techniques while the energy optimal problem is solved using dynamic programming.

Ramohalli, Kumar↗

Anomaly Detection in Large Sets of High-Dimensional Symbol Sequences

This paper addresses the problem of detecting and describing anomalies in large sets of high-dimensional symbol sequences. The approach taken uses unsupervised clustering of sequences using the normalized longest common subsequence (LCS) as a similarity measure, followed by detailed analysis of outliers to detect anomalies. As the LCS measure is expensive to compute, the first part of the paper discusses existing algorithms, such as the Hunt-Szymanski algorithm, that have low time-complexity. We then discuss why these algorithms often do not work well in practice and present a new hybrid algorithm for computing the LCS that, in our tests, outperforms the Hunt-Szymanski algorithm by a factor of five. The second part of the paper presents new algorithms for outlier analysis that provide comprehensible indicators as to why a particular sequence was deemed to be an outlier. The algorithms provide a coherent description to an analyst of the anomalies in the sequence, compared to more normal sequences. The algorithms we present are general and domain-independent, so we discuss applications in related areas such as anomaly detection.

Budalakoti, Suratna↗

Towards real-time monitoring: data assimilated time-lapse full waveform inversion for seismic velocity and uncertainty estimation

SUMMARY Rapid development of time-lapse seismic monitoring instrumentations has made it possible to collect dense time-lapse data for tomographically retrieving time-lapse (even continuous) images of subsurface changes. While traditional time-lapse full waveform inversion (TLFWI) algorithms are designed for sparse time-lapse surveys, they lack of effective temporal constraint on time-lapse data, and, more importantly, lack of the uncertainty estimation of the TLFWI results that is critical for further interpretation. Here, we propose a new data assimilation TLFWI method, using hierarchical matrix powered extended Kalman filter (HiEKF) to quantify the image uncertainty. Compared to existing Kalman filter algorithms, HiEKF allows to store and update a data-sparse representation of the cross-covariance matrices and propagate model errors without expensive operations involving covariance matrices. Hence, HiEKF is computationally efficient and applicable to 3-D TLFWI problems. Then, we reformulate TLFWI in the framework of HiEKF (termed hereafter as TLFWI-HiEKF) to predict time-lapse images of subsurface spatiotemporal velocity changes and simultaneously quantify the uncertainty of the inverted velocity changes over time. We demonstrate the validity and applicability of TLFWI–HiEKF with two realistic CO2 monitoring models derived from Frio-II and Cranfield CO2 injection sites, respectively. In both 2-D and 3-D examples, the inverted high-resolution time-lapse velocity results clearly reveal a continuous velocity reduction due to the injection of CO2. Moreover, the accuracy of the model is increasing over time by assimilating more time-lapse data while the standard deviation is decreasing over lapsed time. We expect TLFWI-HiEKF to be equipped with real-time seismic monitoring systems for continuously imaging the distribution of subsurface gas and fluids in the future large-scale CO2 sequestration experiments and reservoir management.

58 GEOSCIENCES↗

The Block V Receiver fast acquisition algorithm for the Galileo S-band mission

A fast acquisition algorithm for the Galileo suppressed carrier, subcarrier, and data symbol signals under low data rate, signal-to-noise ratio (SNR) and high carrier phase-noise conditions has been developed. The algorithm employs a two-arm fast Fourier transform (FFT) method utilizing both the in-phase and quadrature-phase channels of the carrier. The use of both channels results in an improved SNR in the FFT acquisition, enabling the use of a shorter FFT period over which the carrier instability is expected to be less significant. The use of a two-arm FFT also enables subcarrier and symbol acquisition before carrier acquisition. With the subcarrier and symbol loops locked first, the carrier can be acquired from an even shorter FFT period. Two-arm tracking loops are employed to lock the subcarrier and symbol loops parameter modification to achieve the final (high) loop SNR in the shortest time possible. The fast acquisition algorithm is implemented in the Block V Receiver (BVR). This article describes the complete algorithm design, the extensive computer simulation work done for verification of the design and the analysis, implementation issues in the BVR, and the acquisition times of the algorithm. In the expected case of the Galileo spacecraft at Jupiter orbit insertion PD/No equals 14.6 dB-Hz, R(sym) equals 16 symbols per sec, and the predicted acquisition time of the algorithm (to attain a 0.2-dB degradation from each loop to the output symbol SNR) is 38 sec.

Aung, M.↗

Fault Detection and Performance Monitoring of Propellers in Electric UAV

Unmanned aerial vehicles (UAVs) are used in various industries such as agriculture and logistics, to name but a few, where their applications are beyond basic mapping, surveillance, and photography. In near future, UAVs are expected to be used in package delivery service and larger electric vertical takeoff and landing vehicles will be employed for urban air mobility applications (air taxi). Thus, several electric propulsion systems will enter the low-altitude airspace with frequent take offs and landings. To achieve state-of-the-art safety standards under such high traffic density, UAVs will require in-time fault detection and performance monitoring of critical powertrain components. This work focuses on propeller blade performance and damage detection in electric UAVs. Propellers are the fastest moving component in an UAV; even a minor defect in the propeller blades could cause performance deterioration, with consequent challenges in flying through the planned trajectory or adhere to the safety requirements of the operation. Monitoring and updating aerodynamic efficiency of each rotor would therefore enable the detection of off-nominal propeller conditions thus magnifying the state-awareness of powertrain monitoring systems based on the acquired electrical signals. We use an extended Kalman filter-based parameter estimation algorithm that incorporates time history responses from UAV powertrain in conjunction with a full powertrain system model. Propeller fault detection is achieved by incorporating the aerodynamic parameters of propeller into the powertrain model. The proposed technique is successfully validated with numerical simulations.

Unmanned aerial vehicles↗

Real-time trajectory optimization on parallel processors

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Psiaki, Mark L.↗

Using Fuzzy Clustering for Real-time Space Flight Safety

To ensure space flight safety, it is necessary to monitor myriad sensor readings on the ground and in flight. Since a space shuttle has many sensors, monitoring data and drawing conclusions from information contained within the data in real time is challenging. The nature of the information can be critical to the success of the mission and safety of the crew and therefore, must be processed with minimal data-processing time. Data analysis algorithms could be used to synthesize sensor readings and compare data associated with normal operation with the data obtained that contain fault patterns to draw conclusions. Detecting abnormal operation during early stages in the transition from safe to unsafe operation requires a large amount of historical data that can be categorized into different classes (non-risk, risk). Even though the 40 years of shuttle flight program has accumulated volumes of historical data, these data don t comprehensively represent all possible fault patterns since fault patterns are usually unknown before the fault occurs. This paper presents a method that uses a similarity measure between fuzzy clusters to detect possible faults in real time. A clustering technique based on a fuzzy equivalence relation is used to characterize temporal data. Data collected during an initial time period are separated into clusters. These clusters are characterized by their centroids. Clusters formed during subsequent time periods are either merged with an existing cluster or added to the cluster list. The resulting list of cluster centroids, called a cluster group, characterizes the behavior of a particular set of temporal data. The degree to which new clusters formed in a subsequent time period are similar to the cluster group is characterized by a similarity measure, q. This method is applied to downlink data from Columbia flights. The results show that this technique can detect an unexpected fault that has not been present in the training data set.

Lee, Charles↗

SU-C-BRC-07: Parametrized GPU Accelerated Electron Monte Carlo Second Check

Purpose: I am presenting a parameterized 3D GPU accelerated electron Monte Carlo second check program. Method: I wrote the 3D grid dose calculation algorithm in CUDA and utilized an NVIDIA GeForce GTX 780 Ti to run all of the calculations. The electron path beyond the distal end of the cone is governed by four parameters: the amplitude of scattering (AMP), the mean and width of a Gaussian energy distribution (E and α), and the percentage of photons. In my code, I adjusted all parameters until the calculated PDD and profile fit the measured 10×10 open beam data within 1%/1mm. I then wrote a user interface for reading the DICOM treatment plan and images in Python. In order to verify the algorithm, I calculated 3D dose distributions on a variety of phantoms and geometries, and compared them with the Eclipse eMC calculations. I also calculated several patient specific dose distributions, including a nose and an ear. Finally, I compared my algorithm’s computation times to Eclipse’s. Results: The calculated MU for all of the investigated geometries agree with the TPS within the TG-114 action level of 5%. The MU for the nose was < 0.5 % different while the MU for the ear at 105 SSD was ∼2 %. Calculation times for a 12MeV 10×10 open beam ranged from 1 second for a 2.5 mm grid resolution with ∼15 million particles to 33 seconds on a 1 mm grid with ∼460 million particles. Eclipse calculation runtimes distributed over 10 FAS workers were 9 seconds to 15 minutes respectively. Conclusion: The GPU accelerated second check allows quick MU verification while accounting for patient specific geometry and heterogeneity.

60 APPLIED LIFE SCIENCES↗

Deploying a Model Predictive Traffic Signal Control Algorithm - A Field Deployment Experiment Case Study: Preprint

This paper presents a field deployment experiment of a real-time traffic signal control algorithm. We implemented the Model Predictive Control (MPC) algorithm based on Virtual Phase-Link (VPL) model. We selected the deployment locations and times based on an energy saving potential concept. We developed a set of experiment systems to enable the deployment including sensing, processing, and actuating components. We tested the systems rigorously before the experiment days. We reported the key procedures on the experiment days including the steps took, real-time control procedure, and the monitoring of the experiment. We evaluated the impact of the deployment with the changes in delay and energy consumption.

deployment↗