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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

Comparison of continuous and discrete adaptive identification algorithms

Discretization of a popular continuous-time control algorithm is effected and an equivalent discrete-time identification law developed and compared to a published discrete identification algorithm developed from Lyapunov Theory. Results are compared as regards asymptotic stability as insured using Lyapunov theory. Some analysis and design guidelines are proposed as regards implementation and practical utility.

Colburn, B. K.↗
NASA NTRS1993

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗
NASA NTRS1992

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗
NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗
NASA NTRS1988

Genetic algorithms for adaptive real-time control in space systems

Genetic Algorithms that are used for learning as one way to control the combinational explosion associated with the generation of new rules are discussed. The Genetic Algorithm approach tends to work best when it can be applied to a domain independent knowledge representation. Applications to real time control in space systems are discussed.

Vanderzijp, J.↗
NASA NTRS1978

A study of trends and techniques for space base electronics

A sputtering system was developed to deposit aluminum and aluminum alloys by the dc sputtering technique. This system is designed for a high level of cleanliness and for monitoring the deposition parameters during film preparation. This system is now ready for studying the deposition and annealing parameters upon double-level metal preparation. A technique recently applied for semiconductor analysis, the finite element method, was studied for use in the computer modeling of two dimensional MOS transistor structures. It was concluded that the method has not been sufficiently well developed for confident use at this time. An algorithm was developed for confident use at this time. An algorithm was developed for implementing a computer study which is based upon the finite difference method. The program which was developed was modified and used to calculate redistribution data for boron and phosphorous which had been predeposited by ion implantation with range and straggle conditions. Data were generated for 111 oriented SOS films with redistribution in N2, dry O2 and steam ambients.

Trotter, J. D.↗
NASA NTRS2003

An optimal modification of a Kalman filter for time scales

The Kalman filter in question, which was implemented in the time scale algorithm TA(NIST), produces time scales with poor short-term stability. A simple modification of the error covariance matrix allows the filter to produce time scales with good stability at all averaging times, as verified by simulations of clock ensembles.

time scale Kalman filter↗
NASA NTRS2010

On-Orbit Prospective Echocardiography on International Space Station

A number of echocardiographic research projects and experiments have been flown on almost every space vehicle since 1970, but validation of standard methods and the determination of Space Normal cardiac function has not been reported to date. Advanced Diagnostics in Microgravity (ADUM) -remote guided echocardiographic technique provides a novel and effective approach to on-board assessment of cardiac physiology and structure using a just-in-time training algorithm and real-time remote guidance aboard the International Space Station (ISS). The validation of remotely guided echocardiographic techniques provides the procedures and protocols to perform scientific and clinical echocardiography on the ISS and the Moon. The objectives of this study were: 1.To confirm the ability of non-physician astronaut/cosmonaut crewmembers to perform clinically relevant remotely guided echocardiography using the Human Research Facility on board the ISS. 2.To compare the preflight, postflight and in-flight echocardiographic parameters commonly used in clinical medicine.

Hamilton, Douglas R.↗
NASA NTRS1991

A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids

A solution procedure for solving nonlinear time-marching problems is presented. The nonsymmetric systems of equations arising from a Newton-type linearization of these time-marching problems are solved using an iterative strategy based on the generalized minimal residual (GMRES) algorithm. Matrix-free techniques leading to reduction in storage are presented. Incorporation of a linesearch algorithm in the Newton-GMRES scheme is discussed. An automatic time-increment control strategy is developed to increase the stability of the time-marching process. High-speed flow computations demonstrate the effectiveness of these algorithms.

Johan, Zdenek↗
NASA NTRS1993

Description and performance analysis of a generalized optimal algorithm for aerobraking guidance

A practical real-time guidance algorithm has been developed for aerobraking vehicles which nearly minimizes the maximum heating rate, the maximum structural loads, and the post-aeropass delta V requirement for orbit insertion. The algorithm is general and reusable in the sense that a minimum of assumptions are made, thus greatly reducing the number of parameters that must be determined prior to a given mission. A particularly interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency and ease of use. The trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗
NASA NTRS1992

A generalized reusable guidance algorithm for optimal aerobraking

A practical real-time guidance algorithm was developed for guiding aerobraking vehicles in such a way that the maximum heating rate, the maximum structural loads, and the post-aeropass delta-V requirements (for post-aeropass orbit insertion) are all minimized. The algorithm is general and reusable in the sense that a minimum of assumptions are made, thus minimizing the number of gains and mission-dependent parameters that must be laboriously determined prior to a particular mission. A particularly interesting feature is that inplane guidance performance is tuned by simply adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is turned by simply adjusting a plane controller time constant. Other objectives in the algorithm development are simplicity, efficiency, and ease of use. The algorithm is developed for, but not necessarily restricted to, a single pass mission and a trimmed vehicle with a bank angle modulation as the method of trajectory control. Guidance performance is demonstrated via results obtained using this algorithm integrated into an aerobraking test-bed program. Comparisons are made with numerical results from a version of the aerobraking guidance algorithm that was to be flown onboard NASA's aeroassist flight experiment (AFE) vehicle. Promising results are obtained with a minimum of development effort.

Dukeman, G. A.↗
NASA NTRS1984

Refinement and evaluation of helicopter real-time self-adaptive active vibration controller algorithms

A Real-Time Self-Adaptive (RTSA) active vibration controller was used as the framework in developing a computer program for a generic controller that can be used to alleviate helicopter vibration. Based upon on-line identification of system parameters, the generic controller minimizes vibration in the fuselage by closed-loop implementation of higher harmonic control in the main rotor system. The new generic controller incorporates a set of improved algorithms that gives the capability to readily define many different configurations by selecting one of three different controller types (deterministic, cautious, and dual), one of two linear system models (local and global), and one or more of several methods of applying limits on control inputs (external and/or internal limits on higher harmonic pitch amplitude and rate). A helicopter rotor simulation analysis was used to evaluate the algorithms associated with the alternative controller types as applied to the four-bladed H-34 rotor mounted on the NASA Ames Rotor Test Apparatus (RTA) which represents the fuselage. After proper tuning all three controllers provide more effective vibration reduction and converge more quickly and smoothly with smaller control inputs than the initial RTSA controller (deterministic with external pitch-rate limiting). It is demonstrated that internal limiting of the control inputs a significantly improves the overall performance of the deterministic controller.

Davis, M. W.↗
NASA NTRS1982

Some statistical performance characteristics of the 'ITD' modal identification algorithm

Performance characteristics of the Ibrahim time-domain algorithms are examined on a statistical basis. The method uses multiple free-response measurements from a test structure directly in the time domain, and displays varying accuracy, with the strongly excited modes identified most accurately and the weakly excited modes least accurately. Sets of computer-generated free-response functions for a simple 1-mode model are used to study the identification performance for several basic changes in the modal characteristics of the data, the user-selectable analysis constants, and the level of superimposed noise. Results indicate the existence of a direct and often linear effect of noise on the scatter of identified parameters, and good identification is maintained at the 1% noise level down to the point in frequency when only 1/4-cycle of data is analyzed.

Pappa, R. S.↗
NASA NTRS2005

Evaluation of shoulder integrity in space: first report of musculoskeletal US on the International Space Station

Investigative procedures were approved by Henry Ford Human Investigation Committee and NASA Johnson Space Center Committee for Protection of Human Subjects. Informed consent was obtained. Authors evaluated ability of nonphysician crewmember to obtain diagnostic-quality musculoskeletal ultrasonographic (US) data of the shoulder by following a just-in-time training algorithm and using real-time remote guidance aboard the International Space Station (ISS). ISS Expedition-9 crewmembers attended a 2.5-hour didactic and hands-on US training session 4 months before launch. Aboard the ISS, they completed a 1-hour computer-based Onboard Proficiency Enhancement program 7 days before examination. Crewmembers did not receive specific training in shoulder anatomy or shoulder US techniques. Evaluation of astronaut shoulder integrity was done by using a Human Research Facility US system. Crew used special positioning techniques for subject and operator to facilitate US in microgravity environment. Common anatomic reference points aided initial probe placement. Real-time US video of shoulder was transmitted to remote experienced sonologists in Telescience Center at Johnson Space Center. Probe manipulation and equipment adjustments were guided with verbal commands from remote sonologists to astronaut operators to complete rotator cuff evaluation. Comprehensive US of crewmember's shoulder included transverse and longitudinal images of biceps and supraspinatus tendons and articular cartilage surface. Total examination time required to guide astronaut operator to acquire necessary images was approximately 15 minutes. Multiple arm and probe positions were used to acquire dynamic video images that were of excellent quality to allow evaluation of shoulder integrity. Postsession download and analysis of high-fidelity US images collected onboard demonstrated additional anatomic detail that could be used to exclude subtle injury. Musculoskeletal US can be performed in space by minimally trained operators by using remote guidance. This technique can be used to evaluate shoulder integrity in symptomatic crewmembers after strenuous extravehicular activities or to monitor microgravity-associated changes in musculoskeletal anatomy. Just-in-time training, combined with remote experienced physician guidance, may provide a useful approach to complex medical tasks performed by nonexperienced personnel in a variety of remote settings, including current and future space programs. (c) RSNA, 2004.

Space Flight/education↗
NASA NTRS2011

Time Synchronization and Distribution Mechanisms for Space Networks

This work discusses research on the problems of synchronizing and distributing time information between spacecraft based on the Network Time Protocol (NTP), where NTP is a standard time synchronization protocol widely used in the terrestrial network. The Proximity-1 Space Link Interleaved Time Synchronization (PITS) Protocol was designed and developed for synchronizing spacecraft that are in proximity where proximity is less than 100,000 km distant. A particular application is synchronization between a Mars orbiter and rover. Lunar scenarios as well as outer-planet deep space mother-ship-probe missions may also apply. Spacecraft with more accurate time information functions as a time-server, and the other spacecraft functions as a time-client. PITS can be easily integrated and adaptable to the CCSDS Proximity-1 Space Link Protocol with minor modifications. In particular, PITS can take advantage of the timestamping strategy that underlying link layer functionality provides for accurate time offset calculation. The PITS algorithm achieves time synchronization with eight consecutive space network time packet exchanges between two spacecraft. PITS can detect and avoid possible errors from receiving duplicate and out-of-order packets by comparing with the current state variables and timestamps. Further, PITS is able to detect error events and autonomously recover from unexpected events that can possibly occur during the time synchronization and distribution process. This capability achieves an additional level of protocol protection on top of CRC or Error Correction Codes. PITS is a lightweight and efficient protocol, eliminating the needs for explicit frame sequence number and long buffer storage. The PITS protocol is capable of providing time synchronization and distribution services for a more general domain where multiple entities need to achieve time synchronization using a single point-to-point link.

Woo, Simon S.↗
NASA NTRS1977

Timing formulas for dissection algorithms on vector computers

The use of the finite element and finite difference methods often leads to the problem of solving large, sparse, positive definite systems of linear equations. MACSYMA plays a major role in the generation of formulas representing the time required for execution of the dissection algorithms. The use of MACSYMA in the generation of those formulas is described.

Poole, W. G., Jr.↗