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,639 records · Page 91

Relaxation algorithms for matrix completion, with applications to seismic travel-time data interpolation

Travel time tomography is used to infer the underlying three-dimensional wavespeed structure of the Earth by fitting seismic travel time data collected at surface stations. Data interpolation and denoising techniques are important pre-processing steps that use prior knowledge about the data, including parsimony in the frequency and wavelet domains, low-rank structure of matricizations, and local smoothness. In this work, we show how local smoothness structure can be combined with low rank constraints using level-set optimization formulations, and develop a new relaxation algorithm that can efficiently solve these joint problems. In the seismology setting, we use the approach to interpolate missing stations and de-noise observed stations. The new approach is competitive with alternative algorithms, and offers new functionality to interpolate observed data using both smoothness and low rank structure in the presence of data fitting constraints.

constrained optimization↗

Development of a takeoff performance monitoring system

The development and testing of a real-time takeoff performance monitoring system is discussed. The algorithm is made up of two segments: a pretakeoff segment and a real-time segment. One-time inputs of ambient conditions and airplane configuration information are used in the pretakeoff segment to generate schedule performance data for that takeoff. The real-time segment uses the scheduled performance data generated in the pretakeoff segment, runway length data, and measured parameters to monitor the performance of the airplane throughout the takeoff roll. Airplane and engine performance deficiencies are detected and annunciated. An important feature of this algorithm is the one-time estimation of the runway rolling friction coefficient. The algorithm was tested using a six degree of freedom airplane model in a computer simulation. Results from a series of sensitivity analysis are also included.

Srivatsan, R.↗

Estimation of area-averaged rainfall over tropical oceans from microwave radiometry - A single channel approach

This paper presents a new simple retrieval algorithm for estimating area-time averaged rain rates over tropical oceans by using single channel microwave measurements from satellites. The algorithm was tested by using the Nimbus-5 Electrically Scanning Microwave Radiometer and a simple microwave radiative transfer model to retrieve seasonal 5-deg x 5-deg area averaged rainrate over the tropical Atlantic and Pacific from December 1973 to November 1974. The brightness temperatures were collected and analyzed into histograms for each season and in each grid box from December 1973 to November 1974. The histograms suggest a normal distribution of background noise plus a skewed rain distribution at the higher brightness temperatures. By using a statistical estimation procedure based upon normally distributed background noise, the rain distribution was separated from the raw histogram. The radiative transfer model was applied to the rain-only distribution to retrieve area-time averaged rainrates throughout the tropics. Despite limitations of single channel information, the retrieved seasonal rain rates agree well in the open ocean with expectations based upon previous estimates of tropical rainfall over the oceans.

Shin, Kyung-Sup↗

The iQID Camera: An Ionizing-Radiation Quantum Imaging Detector

We have developed and tested a novel, ionizing-radiation Quantum Imaging Detector (iQID). This scintillation-based detector was originally developed as a high-resolution gamma-ray imager, called BazookaSPECT, for use in single-photon emission computed tomography (SPECT). Recently, we have investigated the detectors response and imaging potential with other forms of ionizing radiation including alpha, neutron, beta, and fission fragment particles. The detector’s response to a broad range of ionizing radiation has prompted its new title. The principle operation of the iQID camera involves coupling a scintillator to an image intensifier. The scintillation light generated particle interactions is optically amplified by the intensifier and then re-imaged onto a CCD/CMOS camera sensor. The intensifier provides sufficient optical gain that practically any CCD/CMOS camera can be used to image ionizing radiation. Individual particles are identified and their spatial position (to sub-pixel accuracy) and energy are estimated on an event-by-event basis in real time using image analysis algorithms on high-performance graphics processing hardware. Distinguishing features of the iQID camera include portability, large active areas, high sensitivity, and high spatial resolution (tens of microns). Although modest, iQID has energy resolution that is sufficient to discrimate between particles. Additionally, spatial features of individual events can be used for particle discrimination. An important iQID imaging application that has recently been developed is single-particle, real-time digital autoradiography. In conclusion, we present the latest results and discuss potential applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

State estimation of an acid gas removal (AGR) plant as part of an integrated gasification combined cycle (IGCC) plant with CO2 capture

An accurate estimation of process state variables not only can increase the effectiveness and reliability of process measurement technology, but can also enhance plant efficiency, improve control system performance, and increase plant availability. Future integrated gasification combined cycle (IGCC) power plants with CO2 capture will have to satisfy stricter operational and environmental constraints. To operate the IGCC plant without violating stringent environmental emission standards requires accurate estimation of the relevant process state variables, outputs, and disturbances. Unfortunately, a number of these process variables cannot be measured at all, while some of them can be measured, but with low precision, low reliability, or low signal-to-noise ratio. As a result, accurate estimation of the process variables is of great importance to avoid the inherent difficulties associated with the inaccuracy of the data. Motivated by this, the current paper focuses on the state estimation of an acid gas removal (AGR) process as part of an IGCC plant with CO2 capture. This process has extensive heat and mass integration and therefore is very suitable for testing the efficiency of the designed estimators in the presence of complex interactions between process variables. The traditional Kalman filter (KF) (Kalman, 1960) algorithm has been used as a state estimator which resembles that of a predictor-corrector algorithm for solving numerical problems. In traditional KF implementation, good guesses for the process noise covariance matrix (Q) and the measurement noise covariance matrix (R) are required to obtain satisfactory filter performance. However, in the real world, these matrices are unknown and it is difficult to generate good guesses for them. In this paper, use of an adaptive KF will be presented that adapts Q and R at every time step of the algorithm. Results show that very accurate estimations of the desired process states, outputs or disturbances can be achieved by using the adaptive KF.

97 MATHEMATICS AND COMPUTING↗

An advanced algorithm for construction of Integral Transport Matrix Method operators using accumulation of single cell coupling factors

The Integral Transport Matrix Method (ITMM) has been shown to be an effective method for solving the neutron transport equation in large domains on massively parallel architectures. In the limit of very large number of processors, the speed of the algorithm, and its suitability for unstructured meshes, i.e. other than an ordered Cartesian grid, is limited by the construction of four matrix operators required for obtaining the solution in each sub-domain. The existing algorithm used for construction of these matrix operators, termed the differential mesh sweep, is computationally expensive and was developed for a structured grid. This work proposes the use of a new algorithm for construction of these operators based on the construction of a single, fundamental matrix representing the transport of a particle along every possible path throughout the sub-domain mesh. Each of the operators is constructed by multiplying an element of this fundamental matrix by two factors dependent only upon the operator being constructed and on properties of the emitting and incident cells. The ITMM matrix operator construction time for the new algorithm is demonstrated to be shorter than the existing algorithm in all tested cases with both isotropic and anisotropic scattering considered. While also being a more efficient algorithm on a structured Cartesian grid, the new algorithm is promising in its geometric robustness and potential for being applied to an unstructured mesh, with the ultimate goal of application to an unstructured tetrahedral mesh on a massively parallel architecture. (authors)

97 MATHEMATICS AND COMPUTING↗

Application of Backward Differentiation Formulas to Neutron Kinetics Problems

The neutron kinetics equations belong to the class of stiff equations for numerical time integration schemes. In this work, the accuracy and speed of algorithms based on backward differentiation formulas (BDFs) are studied with regard to point and spatial neutron kinetics problems. Using a BDF algorithm with the automatic selection of time step and order, solutions to a number of model problems with both a positive and negative reactivity insertion are analyzed. Plots of numerical cost dependences on local and global errors are presented. The results indicate that algorithms based on BDFs are highly efficient and that their application to nuclear reactor simulation is justified.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Distributed Inertia Management Under Communication Constraints

This paper presents a framework for distributed inertia management based on consensus algorithm. We propose a methodology to achieve optimal operation of inertia sources such as distributed energy resources (DERs) and synchronous generators in real time. Additionally, we analyze the algorithm under communication constraints and evaluate its robustness under scenarios involving communication time delays and packet losses. The proposed approach is validated via simulations on a 4-node system test feeder, demonstrating its effectiveness and resilience.

Yadav, Ajay [ORNL] (ORCID:000000016111881X)↗

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗

Streaming Readout and Data-Stream Processing With ERSAP

With the exponential growth in the volume and complexity of data generated at high-energy physics and nuclear physics research facilities, there is an imperative demand for innovative strategies to process this data in real or near-real-time. Given the surge in the requirement for high-performance computing, it becomes pivotal to reassess the adaptability of current data processing architectures in integrating new technologies and managing streaming data. This paper introduces the ERSAP framework, a modern solution that synergizes flow-based programming with the reactive actor model, paving the way for distributed, reactive, and high performance in data stream processing applications. Additionally, we unveil a novel algorithm focused on time-based clustering and event identification in data streams. The efficacy of this approach is further exemplified through the data-stream processing outcomes obtained from the recent beam tests of the EIC prototype calorimeter at DESY.

Vardan, Gyurjyan↗

Avoiding Communication in Primal and Dual Block Coordinate Descent Methods

Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration, which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid communication. We show how applying similar algorithmic transformations can lead to primal and dual block coordinate descent methods that only communicate every $s$ iterations---where $s$ is a tuning parameter---instead of every iteration for the regularized least-squares problem. We show that the communication-avoiding variants reduce the number of synchronizations by a factor of $s$ on distributed-memory parallel machines without altering the convergence rate and attain strong scaling speedups of up to $6.1\times$ over the “standard algorithm" on a Cray XC30 supercomputer.

97 MATHEMATICS AND COMPUTING↗

Linear scaling solution of the time-dependent self-consistent-field equations with quasi-independent Rayleigh quotient iteration

An algorithm for solution of the Time-Dependent Self-Consistent-Field (TD-SCF) equations is developed, based on dual solution channels for non-linear optimization of the Tsiper functional [J.Phys.B, 34 L401 (2001)]. This formulation poses the TD-SCF problem as two Rayleigh quotients, coupled weakly through biorthogonality. Convergence rates for the Random Phase Approximation (RPA) are found to be equivalent to the Tamm-Dancoff approximation (TDA). Moreover, the variational nature of the quotient is robust to approximation errors, allowing linear scaling solution to the bulk limit of the RPA matrix-eigenvalue and exchange operator problem for molecular wires with extended conjugation, including polyphenylene vinylene and the (4,3) nanotube.

74 ATOMIC AND MOLECULAR PHYSICS↗

Overcoming time-integration errors in SINDA's FWDBCK solution routine

The FWDBCK time step, which is usually chosen intuitively to achieve adequate accuracy at reasonable computational costs, can in fact lead to large errors. NASA observed such errors in solving cryogenic problems on the COBE spacecraft, but a similar error is also demonstrated for a single node radiating to space. An algorithm has been developed for selecting the time step during the course of the simulation. The error incurred when the time derivative is replaced by the FWDBCK time difference can be estimated from the Taylor-Series expression for the temperature. The algorithm selects the time step to keep this error small. The efficacy of the method is demonstrated on the COBE and single-node problems.

Skladany, J. T.↗

Performance of the local reconstruction algorithms for the CMS hadron calorimeter with Run 2 data

A description is presented of the algorithms used to reconstruct energy deposited in the CMS hadron calorimeter during Run 2 (2015–2018) of the LHC. During Run 2, the characteristic bunch-crossing spacing for proton-proton collisions was 25 ns, which resulted in overlapping signals from adjacent crossings. The energy corresponding to a particular bunch crossing of interest is estimated using the known pulse shapes of energy depositions in the calorimeter, which are measured as functions of both energy and time. A variety of algorithms were developed to mitigate the effects of adjacent bunch crossings on local energy reconstruction in the hadron calorimeter in Run 2, and their performance is compared.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Parallel multi-time step integration on a transputer system

An algorithm which allows different nodes of the finite element mesh to be integrated with different time steps is presented for second order finite element systems. The implementation of this algorithm on a system of transputer processors is discussed and a numerical example is used to evaluate the efficiency of the algorithm.

Smolinski, P.↗

Implementation of adaptive proximate time-optimal controllers

Following a review of the Proximate Time-Optimal Servomechanism (PTOS) and the adaptive version of PTOS (APTOS), implementation techniques are described which make both algorithms practical for discrete-time control of second-order plants with real roots. The double integrator plant and the real pole plus an integrator plant are both used as examples. The effects of unmodeled dynamics on the algorithms are discussed and illustrated by simulation and experiment.

Workman, M. L.↗

NASA Tech Briefs, March 2013

Topics covered include: Remote Data Access with IDL Data Compression Algorithm Architecture for Large Depth-of-Field Particle Image Velocimeters Vectorized Rebinning Algorithm for Fast Data Down-Sampling Display Provides Pilots with Real-Time Sonic-Boom Information Onboard Algorithms for Data Prioritization and Summarization of Aerial Imagery Monitoring and Acquisition Real-time System (MARS) Analog Signal Correlating Using an Analog-Based Signal Conditioning Front End Micro-Textured Black Silicon Wick for Silicon Heat Pipe Array Robust Multivariable Optimization and Performance Simulation for ASIC Design; Castable Amorphous Metal Mirrors and Mirror Assemblies; Sandwich Core Heat-Pipe Radiator for Power and Propulsion Systems; Apparatus for Pumping a Fluid; Cobra Fiber-Optic Positioner Upgrade; Improved Wide Operating Temperature Range of Li-Ion Cells; Non-Toxic, Non-Flammable, -80 C Phase Change Materials; Soft-Bake Purification of SWCNTs Produced by Pulsed Laser Vaporization; Improved Cell Culture Method for Growing Contracting Skeletal Muscle Models; Hand-Based Biometric Analysis; The Next Generation of Cold Immersion Dry Suit Design Evolution for Hypothermia Prevention; Integrated Lunar Information Architecture for Decision Support Version 3.0 (ILIADS 3.0); Relay Forward-Link File Management Services (MaROS Phase 2); Two Mechanisms to Avoid Control Conflicts Resulting from Uncoordinated Intent; XTCE GOVSAT Tool Suite 1.0; Determining Temperature Differential to Prevent Hardware Cross-Contamination in a Vacuum Chamber; SequenceL: Automated Parallel Algorithms Derived from CSP-NT Computational Laws; Remote Data Exploration with the Interactive Data Language (IDL); Mixture-Tuned, Clutter Matched Filter for Remote Detection of Subpixel Spectral Signals; Partitioned-Interval Quantum Optical Communications Receiver; and Practical UAV Optical Sensor Bench with Minimal Adjustability.

Source record↗

SU-E-T-444: Gravity Effect On Maximum Leaf Speed in Dynamic IMRT Treatments

Purpose: A leaf sequencing algorithm has been recently developed in our department. Our purpose is to utilize this algorithm to reduce treatment time by studying the feasibility of using several maximum leaf speeds depending on gantry angle and leaf thickness (0.5 or 1 cm at isocenter). To do so, the gravity effect on MLC performance has been examined by means of analysing the dynalog files. Methods: Leaf position errors has been ascertained according to gantry angle and leaf speed in MLC Millenium120 (Varian). In order to do this, the following test has been designed: all leaves move in synchrony, with same speed and 1 cm gap between opposite leaves. This test is implemented for 18 different speeds: 0.25-0.5-0.75-1-1.25-1.5-1.75-2-2.1-2.2-2.3-2.4-2.5-2.6-2.7-2.8-2.9-3.0 cm/s and 8 gantry angles: 0-45-90-135-180-225-270-315. Collimator angle is 2 degrees in all cases since it is the most usual one in IMRT treatments in our department. Dynamic tolerance is 2 mm. Dynalogs files of 10 repetitions of the test are analysed with a Mathlab in-house developed software and RMS error and 95th percentiles are calculated. Varian recommends 2.5 cm/s as the maximum leaf speed for its segmentation algorithm. In our case, we accept this speed in the most restrictive situation: gantry angle 270 and 1 cm leaf thickness. Maximum speeds for the rest of the cases are calculated by keeping the difference between 95th percentile and dynamic tolerance. In this way, beam hold-off probability does not increase. Results: Maximum speeds every 45 degrees of gantry rotation have been calculated for both leaf thickness. These results are 2.9-2.9-2.9-2.9-2.7-2.6-2.6-2.7 cm/s for 0.5 cm leaf thickness and 2.7-2.7-2.7-2.7-2.6-2.5-2.5-2.6 cm/s for 1 cm leaf thickness. Conclusion: Gravity effect on MLC positioning has been studied. Maximum leaf speed according to leaf thickness and gantry angle have been calculated which reduces treatment time.

60 APPLIED LIFE SCIENCES↗