Search NASA⌕ Search

SEARCH · Search NASA

Results for “look-ahead”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗
NASA NTRS1989

Performance impacts of look-ahead execution in the conversation scheme

The look-ahead execution approach, which allows participant processes that exist early to exit from a conversation before other participants finish their conversation activities, is presented here as a fundamental approach to reducing the synchronization overhead. Queuing network models are developed for systems operating under the basic conversation execution scheme and systems operating under the look-ahead execution scheme. Based on the models, various performance indicators such as the system throughput, the average number of processors idling inside a conversation due to the synchronization required, and the average time spent in conversation are evaluated numerically for different application environments. The results provide insights into the extent of benefits provided by the look-ahead execution approach.

Kim, K. H.↗
NASA NTRS1991

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗
NASA NTRS1990

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 1

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. We present an implementation of a look-ahead version of the Lanczos algorithm which overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and is not restricted to steps of length 2, as earlier implementations are. Also, our implementation has the feature that it requires roughly the same number of inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗
NASA NTRS1990

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 2

It is shown how the look-ahead Lanczos process (combined with a quasi-minimal residual QMR) approach) can be used to develop a robust black box solver for large sparse non-Hermitian linear systems. Details of an implementation of the resulting QMR algorithm are presented. It is demonstrated that the QMR method is closely related to the biconjugate gradient (BCG) algorithm; however, unlike BCG, the QMR algorithm has smooth convergence curves and good numerical properties. We report numerical experiments with our implementation of the look-ahead Lanczos algorithm, both for eigenvalue problem and linear systems. Also, program listings of FORTRAN implementations of the look-ahead algorithm and the QMR method are included.

Freund, Roland W.↗
NASA NTRS1992

Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems

Systems of linear equations with Toeplitz coefficient matrices arise in many important applications. The classical Levinson algorithm computes solutions of Toeplitz systems with only O(n(sub 2)) arithmetic operations, as compared to O(n(sub 3)) operations that are needed for solving general linear systems. However, the Levinson algorithm in its original form requires that all leading principal submatrices are nonsingular. An extension of the Levinson algorithm to general Toeplitz systems is presented. The algorithm uses look-ahead to skip over exactly singular, as well as ill-conditioned leading submatrices, and, at the same time, it still fully exploits the Toeplitz structure. In our derivation of this algorithm, we make use of the intimate connection of Toeplitz matrices with formally biorthogonal polynomials.

Freund, Roland W.↗
DOE OSTI2026

Evaluating the Impacts of Coordination for Cascaded Hydropower Plants on the Mid-Columbia

The Mid-Columbia region in the U.S. Pacific Northwest includes seven large, cascaded hydropower plants with a combined nameplate capacity of nearly 14 GW. These plants have several different operators, and there is currently limited coordination among the operators. We develop a detailed model of the Mid-Columbia system that captures both river flow constraints and power system operations. We then place this detailed model within a production cost model of a 2030 system of the Western Interconnection to evaluate how coordination of the Mid-Columbia hydropower plants might impact operations throughout the interconnection. We find that coordination of the Mid-Columbia plants leads to more generation from the Mid-Columbia plants and increased revenues for the Mid-Columbia operators. This benefit is achieved primarily through better utilization of the storage reservoirs and decreased spill through the cascade. We also evaluate the impacts of look-ahead on production costs and find that longer look-ahead values result in lower system-wide production costs.

13 HYDRO ENERGY↗
NASA NTRS1973

A simulation model for a memory organization for a multiprocessor.

A model for a memory organization for a multiprocessor with look-ahead and interleaved multimodule main memory is presented. The model is used to determine the extent of look-ahead and depth of interleaving that provide the most prolific speed match between processors and main memory.

Eubank, J. B.↗
NASA NTRS1990

Evaluation of a technique to quantify microburst windshear hazard potential to aircraft

A wind shear hazard index, known as the F-factor, is investigated for application with look-ahead sensors. Based on data from microburst simulations with the NASA windshear model, the downdraft results in a significant contribution to the wind shear hazard, especially at altitudes above 150 meters. Since most look-ahead wind shear sensors can only detect horizontal shear and cannot measure vertical velocity, a relationship is developed for approximating the total F-factor using information based solely on the horizontal wind shear and altitude. This relationship is then tested using data from several microburst cases.

Byrd, G. P.↗
NASA NTRS1965

Computer modification reduces time of performing iterative division

Time reduction in performing iterative division results from using a serial-by-parallel divider employing a look-ahead feature that predetermines the sign relationships of several iterations before the computer cycle begins. This method can be employed in any data handling system performing high-speed division.

Source record↗
NASA NTRS1975

LANDSAT survey of near-shore ice conditions along the Arctic coast of Alaska

The author has identified the following significant results. On the basis of analysis of late winter 1973, 1974, and 1975 LANDSAT imagery of the Beaufort Sea coast of Alaska, the following conclusions regarding near-shore ice conditions were made: (1) by March, the seaward limit of contiguous ice is often beyond the 10 fathom contour. (2) During March, shearing can and does take place along a line roughly coincident with the 10 fathom contour. (3) Ice motions during these shearing events are not extremely great, generally on the order of 10 km. (4) Many large ice features have already been formed by late February. (5) Based on look-ahead at later LANDSAT imagery, it seems apparent that Beaufort Seas shore-fast ice was already formed by late February and may well be safe for exploratory activities from this data forward until the melt season.

Stringer, W. J.↗
NASA NTRS1991

Continuous wave laser for wind shear detection

Details of the design and development of a continuous-wave heterodyne carbon dioxide laser which has wind shear detection capabilities are given in viewgraph form. The goal of the development was to investigate the lower cost CW (rather than pulsed) lidar option for look-ahead wind shear detection from aircraft. The device has potential utility for ground based wind shear detection at secondary airports where the high cost of a Terminal Doppler Weather Radar system is not justifiable.

Nelson, Loren↗
NASA NTRS1990

QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.

Freund, Roland W.↗
NASA NTRS1991

A biconjugate gradient type algorithm on massively parallel architectures

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. Recently, Freund and Nachtigal have proposed a novel BCG type approach, the quasi-minimal residual method (QMR), which overcomes the problems of BCG. Here, an implementation is presented of QMR based on an s-step version of the nonsymmetric look-ahead Lanczos algorithm. The main feature of the s-step Lanczos algorithm is that, in general, all inner products, except for one, can be computed in parallel at the end of each block; this is unlike the other standard Lanczos process where inner products are generated sequentially. The resulting implementation of QMR is particularly attractive on massively parallel SIMD architectures, such as the Connection Machine.

Freund, Roland W.↗
NASA NTRS1992

Real-time scheduling using minimum search

In this paper we consider a simple model of real-time scheduling. We present a real-time scheduling system called RTS which is based on Korf's Minimin algorithm. Experimental results show that the schedule quality initially improves with the amount of look-ahead search and tapers off quickly. So it sppears that reasonably good schedules can be produced with a relatively shallow search.

Tadepalli, Prasad↗
NASA NTRS1992

Three-dimensional numerical simulation of the 20 June 1991, Orlando microburst

On 20 June 1991, NASA's Boeing 737, equipped with in-situ and look-ahead wind-shear detection systems, made direct low-level penetrations (300-350 m AGL) through a microburst during several stages of its evolution. This microburst was located roughly 20 km northeast of Orlando International Airport and was monitored by a Terminal Doppler Weather Radar (TDWR) located about 10 km south of the airport. The first NASA encounter with this microburst (Event 142), at approximately 2041 UTC, was during its intensification phase. At flight level, in-situ measurements indicated a peak 1-km (averaged) F-factor of approximately 0.1. The second NASA encounter (Event 143) occurred at approximately 2046 UTC, about the time of microburst peak intensity. It was during this penetration that a peak 1-km F-factor of approximately 17 was encountered, which was the largest in-situ measurement of the 1991 summer deployment. By the third encounter (Event 144), at approximately 2051 UTC, the microburst had expanded into a macroburst. During this phase of evolution, an in-situ 1-km F-factor of 0.08 was measured. The focus of this paper is to examine this microburst via numerical simulation from an unsteady, three-dimensional meteorological cloud model. The simulated high-resolution data fields of wind, temperature, radar reflectivity factor, and precipitation are closely examined so as to derive information not readily available from 'observations' and to enhance our understanding of the actual event. Characteristics of the simulated microburst evolution are compared with TDWR and in-situ measurements.

Proctor, Fred H.↗
NASA NTRS1992

A numerical field experiment approach for determining probabilities of microburst intensity

Several investigators had determined that some atmospheric parameters were related to the formation and severity of microbursts. For example, Caracena pointed out the relationship between a dry adiabatic lapse rate and microbursts in 'The crash of Delta Flight 191 at Dallas-Fort Worth international airport'. These early investigations led to the idea that numeric modeling of microbursts with varying atmospheric parameters might define 'signatures' that could lead to determining the probability of microburst intensity. The idea was that, by using already available sensors (such as static air temperature, pressure altitude, and radar reflectivity) onboard an aircraft, a reliable prediction of microburst existence and intensity could be formed. Such data could be used to create an 'expert meteorologist' using either artificial intelligence or other techniques that could be used in either reactive or look-ahead systems to vary sensitivity thresholds and coordinate the inputs from different detecting systems. To this end, Honeywell contracted to have the microburst simulations run. The questions to be addressed were the following: using the sensor set available to the aircraft (e.g. temperature, radar reflectivity, etc.), can we calculate the probability that (1) a microburst could be formed? and (2) that the resultant winds would be of sufficient magnitude to threaten the aircraft? Over a two year period, a data set of 1800 microburst simulations was accumulated. Verification of the microburst simulation was obtained using the results of other independent researchers and actual comparison to microburst events in Orlando and Denver. Some of the results from the simulation have already been incorporated into Honeywell's Windshear Detection and Guidance System with excellent results. Various aspects of this investigation are presented in viewgraph form.

Droegemeier, Kelvin K.↗
NASA NTRS1992

Visual augmentation for night flight over featureless terrain

Visual augmentation technique based on infrared cueing lights which project from the aircraft to the terrain is proposed to mitigate the problems associated with night flight over regions with featureless terrains. A series of simulation studies evaluated the effectiveness of several cueing light configurations. Results indicate that certain relatively low-cost cueing light configurations can be effectively used as pseudo-flight directors without impairing the pilot's use of available natural cues in the scene. Pilots prefer configurations which provide multiple samples of the forward terrain. Providing several 'look-aheads' helps to resolve potential vehicle/terrain state ambiguities. It is concluded that cueing lights are capable of creating visual patterns which are readily interpreted and translated to control commands, thus providing pilots with intuitive, low-workload decision aids.

Kaiser, Mary K.↗