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 991 records · Page 55

A Formal Model for Real-Time Parallel Computation

The imposition of real-time constraints on a parallel computing environment--- specifically high-performance, cluster-computing systems--- introduces a variety of challenges with respect to the formal verification of the system's timing properties. In this paper, we briefly motivate the need for such a system, and we introduce an automaton-based method for performing such formal verification. We define the concept of a consistent parallel timing system: a hybrid system consisting of a set of timed automata (specifically, timed Buechi automata as well as a timed variant of standard finite automata), intended to model the timing properties of a well-behaved real-time parallel system. Finally, we give a brief case study to demonstrate the concepts in the paper: a parallel matrix multiplication kernel which operates within provable upper time bounds. We give the algorithm used, a corresponding consistent parallel timing system, and empirical results showing that the system operates under the specified timing constraints.

formal methods↗

Rapid calculation of terrain parameters for radiation modeling from digital elevation data

Digital elevation models are now widely used to calculate terrain parameters to determine incoming solar and longwave radiation for use in surface climate models, interpretation of remote-sensing data, and parameters in hydrologic models. Because of the large number of points in an elevation grid, fast algorithms are useful to save computation time. A description is given of rapid methods for calculating slope and azimuth, solar illumination angle, horizons, and view factors for radiation from sky and terrain. Calculation time is reduced by fast algorithms and lookup tables.

Dozier, Jeff↗

Optimal discrete-time dynamic output-feedback design - A w-domain approach

An alternative method for optimal digital control design is described in this paper. The method is based on the usage of the w-transform and has many attractive design features. One of these is its immediate connection with frequency loop-shaping techniques that are now popular and effective for multivariable control synthesis in continuous-time domain. Furthermore, any design algorithms originally developed for continuous-time systems can now be immediately extended to the discrete-time domain. The main results presented in this paper are the exact problem formulation and solution of an optimal discrete-time dynamic output-feedback design in the w-domain involving a quadratic performance index to random disturbances. In addition, necessary conditions for optimality are obtained for the numerical solution of the optimal output-feedback compensator design. A numerical example is presented illustrating its application to the design of a low-order dynamic compensator in a stability augmentation system of a commercial transport.

Ha, Cheolkeun↗

Gradient-Based Multi-Area Distribution System State Estimation

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Quadrature algorithms to the luminosity distance with a time-dependent dark energy model

In our previous work [1], we have proposed two methods for computing the luminosity distance d{sub L}{sup Λ} in ΛCDM model. In this paper, two effective quadrature algorithms, known as Romberg Integration and composite Gaussian Quadrature, are presented to calculate the luminosity distance d{sub L}{sup CPL} in the Chevallier-Polarski-Linder parametrization(CPL) model. By comparing both the efficiency and accuracy of the two algorithms, we find that the second is more promising. Moreover, we develop another strategy adapted for approximating d{sub L}{sup Λ} in flat ΛCDM universe. To some extent, our methods can make contributions to the recent numerical stimulation for the investigation of dark energy cosmology.

79 ASTRONOMY AND ASTROPHYSICS↗

Defining a Metric Space of Host Logs and Operational Use Cases

Host logs, in particular, Windows Event Logs, are a valuable source of information often collected by security operation centers (SOCs). The semi-structured nature of host logs inhibits automated analytics, and while manual analysis is common, the sheer volume makes manual inspection of all logs impossible. Although many powerful algorithms for analyzing time-series and sequential data exist, utilization of such algorithms for most cyber security applications is either infeasible or requires tailored, research-intensive preparations. In particular, basic mathematic and algorithmic developments for providing a generalized, meaningful similarity metric on system logs is needed to bridge the gap between many existing sequential data mining methods and this currently available but under-utilized data source. In this paper, we provide a rigorous definition of a metric product space on Windows Event Logs, providing an embedding that allows for the application of established machine learning and time-series analysis methods. We then demonstrate the utility and flexibility of this embedding with multiple use-cases on real data: (1) comparing known infected to new host log streams for attack detection and forensics, (2) collapsing similar streams of logs into semantically-meaningful groups (by user, by role), thereby reducing the quantity of data but not the content, (3) clustering logs as well as short sequences of logs to identify and visualize user behaviors and background processes over time. Overall, we provide a metric space framework for general host logs and log sequences that respects semantic similarity and facilitates a wide variety of data science analytics to these logs without data-specific preparations for each.

Verma, Miki↗

Low-synch Gram–Schmidt with delayed reorthogonalization for Krylov solvers

The parallel strong-scaling of iterative methods is often determined by the number of global reductions at each iteration. Low-synch Gram-Schmidt algorithms are applied here to the Arnoldi algorithm to reduce the number of global reductions and therefore to improve the parallel strong-scaling of iterative solvers for nonsymmetric matrices such as the GMRES and the Krylov-Schur iterative methods. In the Arnoldi context, the factorization is "left-looking" and processes one column at a time. Among the methods for generating an orthogonal basis for the Arnoldi algorithm, the classical Gram-Schmidt algorithm, with reorthogonalization (CGS2) requires three global reductions per iteration. A new variant of CGS2 that requires only one reduction per iteration is presented and applied to the Arnoldi algorithm. Delayed CGS2 (DCGS2) employs the minimum number of global reductions per iteration (one) for a one-column at-a-time algorithm. The main idea behind the new algorithm is to group global reductions by rearranging the order of operations. DCGS2 must be carefully integrated into an Arnoldi expansion or a GMRES solver. Numerical stability experiments assess robustness for Krylov-Schur eigenvalue computations. Performance experiments on the ORNL Summit supercomputer then establish the superiority of DCGS2 over CGS2.

97 MATHEMATICS AND COMPUTING↗

Method and system for enabling real-time speckle processing using hardware platforms

An accelerator for the speckle atmospheric compensation algorithm may enable real-time speckle processing of video feeds that may enable the speckle algorithm to be applied in numerous real-time applications. The accelerator may be implemented in various forms, including hardware, software, and/or machine-readable media.

Ortiz, Fernando E.↗

Fast QSTS for Distributed PV Impact Studies Using Vector Quantization and Variable Time-Steps

As the penetration level of PV systems increases, utilities are in great need of methods to quickly and effectively analyze PV's impact on electric distribution systems. Compared to other conventional methods, quasi-static time-series (QSTS) based analysis has demonstrated its advantages of accurately capturing the impact of interest, e.g. control device operations, and min and max voltages. However, yearlong QSTS simulation with 1-second granularity is currently too computationally expensive for regular use. Therefore, vector quantization (VQ) and variable time-step (VTS) solution methods have been developed to accelerate QSTS simulation. This paper proposes the combination of VQ with VTS. We investigate the effectiveness of implementing VQ in combination with 2 VTS algorithms, predetermined time-step (PT) and VTS with backtrack downsampling (VTS-BD) to demonstrate a runtime reduction of 99.55% with error metrics below acceptable thresholds.

14 SOLAR ENERGY↗

Improved Coupled Fluid/Structural Dynamical Model

Improved algorithm developed for simulation of coupled motions of fluids and structures. Minimum requirement for correct simulation of damping is forces and velocities at interface compatible in models of structure and fluid at each time step. Improved algorithm, conforms to this requirement, involves fluid-transient model, structural modal/transient model, and an algebraic impedance/coupling subalgorithm. Use of this algorithm greatly improves computational stability.

Fenwick, James R.↗

Data and Analysis from a Time-Resolved Tomographic Optical Beam Diagnostic

An optical tomographic diagnostic instrument developed for the acquisition of high-speed time-resolved images has been fielded at the Dual-Axis Radiographic Hydrodynamic Test (DARHT) Facility at Los Alamos National Laboratory. The instrument was developed for the creation of time histories of electron-beam cross section through the collection of Cerenkov light. Four optical lines of sight optically collapse an image and relay projections via an optical fiber relay to recording instruments; a tomographic reconstruction algorithm creates the time history. Because the instrument may be operated in an adverse environment, it may be operated, adjusted, and calibrated remotely. The instrument was operated over the course of various activities during and after DARHT commissioning, and tomographic reconstructions reported verifiable beam characteristics. Results from the collected data and reconstructions and analysis of the data are discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Real-Time Feedback-Based Optimization of Distribution Grids: A Unified Approach

This paper develops an algorithmic framework for real-time optimization of distribution-level distributed energy resources (DERs). The framework optimizes the operation of both DERs that are individually controllable and groups of DERs (i.e., aggregations) that are jointly controlled at an electrical point of connection. From an electrical standpoint, wye and delta single- and multi-phase connections are accounted for. The algorithm enables (groups of) DERs to pursue given performance objectives, while adjusting their (aggregate) powers to respond to services requested by grid operators and to maintain electrical quantities within engineering limits. The design of the algorithm leverages a time-varying bi-level problem formulation capturing various performance objectives and engineering constraints, and an online implementation of primal-dual projected-gradient methods. The gradient steps are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. Stability and convergence claims are established in terms of tracking of the solution of the time-varying optimization problem. Finally, the method is tested in a realistic distribution.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, explicit, path-adaptive descent guidance algorithms must provide the stability and customizability required for a safe and efficient descent to the lunar surface, while also meeting program and vehicle constraints. Several descent algorithms have been flown and tested for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms to a two-stage descent vehicle. Due to payload mass and fairing constraints of the existing fleet of launch vehicles, multi-stage descent architectures are a unique option for achieving the greatest possible mass to lunar surface. This paper seeks to compare the performance of guidance configurations of a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a baseline to compare the guidance algorithms tested. Time-to-go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Preliminary results are presented that show relative performance metrics for a range of different guidance algorithm configurations.

Jason M Everett↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

kasacrcfrcorppiv.c1

This datastream is made by kasacrcfrcorppiv VAP from kasacrcfrqc.b1 by applying an attenuation algorithm. It has (time, range) Ka-band PPI radial radar data. A c1 level output file is created for each input kasacrcfrq1.b1 input file in PPI mode. This DOD is the same as kasacrcfrq1.b1 except for an attenuation algorithm field (reflectivity_at_cor) being added to it.

54 ENVIRONMENTAL SCIENCES↗

Dynamic Identification for Control of Large Space Structures

This is a compilation of reports by the one author on one subject. It consists of the following five journal articles: (1) A Parametric Study of the Ibrahim Time Domain Modal Identification Algorithm; (2) Large Modal Survey Testing Using the Ibrahim Time Domain Identification Technique; (3) Computation of Normal Modes from Identified Complex Modes; (4) Dynamic Modeling of Structural from Measured Complex Modes; and (5) Time Domain Quasi-Linear Identification of Nonlinear Dynamic Systems.

Ibrahim, S. R.↗

The power and efficiency of advanced software and parallel processing

Real-time simulation of flexible and articulating systems is difficult because of the computational burden of the time varying calculations. The mobile servicing system of the NASA Space Station Freedom will handle heavy payloads by local arm manipulations and by translating along the spline of the Station, it is crucial to have real-time simulation available. To enable such a simulation to be of high fidelity and to be able to be hosted on a modest computer, special care must be made in formulating the structural dynamics. Frontal solution algorithms save considerable time in performing these calculations. In addition, it is necessary to take advantage of parallel processing be compatible to take full advantage of both. An approach is offered which will result in high fidelity, real-time simulation for flexible, articulating systems such as the space Station remote servicing system.

Singh, Ramen P.↗