Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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,495 records · Page 83
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Optimal guidance and propulsion control for transatmospheric vehicles

Problems associated with on-board trajectory optimization and with the synthesis of guidance laws are addressed for ascent to LEO of an air-breathing, single-stage-to-orbit vehicle. A multimode propulsion system is assumed which incorporates turbojet, ramjet, scramjet, and rocket engines. An energy-state approximation is applied to a four-state dynamic model for flight of a point mass over a spherical nonrotating earth. An algorithm for generating fuel-optimal climb profiles is derived via singular perturbation theory. This algorithm results from application of the minimum principle to a low-order dynamic model that includes general functional dependence on angle of attack and a normal component of thrust. Switching conditions are derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another. The use of bank angle to modulate the magnitude of the vertical component of lift is shown to improve the index performance. Numerical results illustrate the nature of the resulting fuel-optimal climb paths.

Corban, J. E.↗
NASA NTRS1990

Maximum likelihood tuning of a vehicle motion filter

This paper describes the use of maximum likelihood parameter estimation unknown parameters appearing in a nonlinear vehicle motion filter. The filter uses the kinematic equations of motion of a rigid body in motion over a spherical earth. The nine states of the filter represent vehicle velocity, attitude, and position. The inputs to the filter are three components of translational acceleration and three components of angular rate. Measurements used to update states include air data, altitude, position, and attitude. Expressions are derived for the elements of filter matrices needed to use air data in a body-fixed frame with filter states expressed in a geographic frame. An expression for the likelihood functions of the data is given, along with accurate approximations for the function's gradient and Hessian with respect to unknown parameters. These are used by a numerical quasi-Newton algorithm for maximizing the likelihood function of the data in order to estimate the unknown parameters. The parameter estimation algorithm is useful for processing data from aircraft flight tests or for tuning inertial navigation systems.

Trankle, Thomas L.↗
NASA NTRS1991

Exact and approximate solutions to the oblique shock equations for real-time applications

The derivation of exact solutions for determining the characteristics of an oblique shock wave in a supersonic flow is investigated. Specifically, an explicit expression for the oblique shock angle in terms of the free stream Mach number, the centerbody deflection angle, and the ratio of the specific heats, is derived. A simpler approximate solution is obtained and compared to the exact solution. The primary objectives of obtaining these solutions is to provide a fast algorithm that can run in a real time environment.

Hartley, T. T.↗
NASA NTRS1992

Functional expansion representations of artificial neural networks

In the past few years, significant interest has developed in using artificial neural networks to model and control nonlinear dynamical systems. While there exists many proposed schemes for accomplishing this and a wealth of supporting empirical results, most approaches to date tend to be ad hoc in nature and rely mainly on heuristic justifications. The purpose of this project was to further develop some analytical tools for representing nonlinear discrete-time input-output systems, which when applied to neural networks would give insight on architecture selection, pruning strategies, and learning algorithms. A long term goal is to determine in what sense, if any, a neural network can be used as a universal approximator for nonliner input-output maps with memory (i.e., realized by a dynamical system). This property is well known for the case of static or memoryless input-output maps. The general architecture under consideration in this project was a single-input, single-output recurrent feedforward network.

Gray, W. Steven↗
NASA NTRS1995

Solar Thermal Concept Evaluation

Concentrated solar thermal energy can be utilized in a variety of high temperature applications for both terrestrial and space environments. In each application, knowledge of the collector and absorber's heat exchange interaction is required. To understand this coupled mechanism, various concentrator types and geometries, as well as, their relationship to the physical absorber mechanics were investigated. To conduct experimental tests various parts of a 5,000 watt, thermal concentrator, facility were made and evaluated. This was in anticipation at a larger NASA facility proposed for construction. Although much of the work centered on solar thermal propulsion for an upper stage (less than one pound thrust range), the information generated and the facility's capabilities are applicable to material processing, power generation and similar uses. The numerical calculations used to design the laboratory mirror and the procedure for evaluating other solar collectors are presented here. The mirror design is based on a hexagonal faceted system, which uses a spherical approximation to the parabolic surface. The work began with a few two dimensional estimates and continued with a full, three dimensional, numerical algorithm written in FORTRAN code. This was compared to a full geometry, ray trace program, BEAM 4, which optimizes the curvatures, based on purely optical considerations. Founded on numerical results, the characteristics of a faceted concentrator were construed. The numerical methodologies themselves were evaluated and categorized. As a result, the three-dimensional FORTRAN code was the method chosen to construct the mirrors, due to its overall accuracy and superior results to the ray trace program. This information is being used to fabricate and subsequently, laser map the actual mirror surfaces. Evaluation of concentrator mirrors, thermal applications and scaling the results of the 10 foot diameter mirror to a much larger concentrator, were studied. Evaluations, recommendations and pit falls regarding the structure, materials and facility design are presented.

Hawk, Clark W.↗
NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗
NASA NTRS1997

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗
NASA NTRS2011

Ares I-X In-Flight Modal Identification

Operational modal analysis is a procedure that allows the extraction of modal parameters of a structure in its operating environment. It is based on the idealized premise that input to the structure is white noise. In some cases, when free decay responses are corrupted by unmeasured random disturbances, the response data can be processed into cross-correlation functions that approximate free decay responses. Modal parameters can be computed from these functions by time domain identification methods such as the Eigenvalue Realization Algorithm (ERA). The extracted modal parameters have the same characteristics as impulse response functions of the original system. Operational modal analysis is performed on Ares I-X in-flight data. Since the dynamic system is not stationary due to propellant mass loss, modal identification is only possible by analyzing the system as a series of linearized models over short periods of time via a sliding time-window of short time intervals. A time-domain zooming technique was also employed to enhance the modal parameter extraction. Results of this study demonstrate that free-decay time domain modal identification methods can be successfully employed for in-flight launch vehicle modal extraction.

Bartkowicz, Theodore J.↗
NASA NTRS2011

Understanding Effective Diameter and Its Application to Terrestrial Radiation in Ice Clouds

The cloud property known as "effective diameter" or "effective radius", which in essence is the cloud particle size distribution (PSD) volume at bulk density divided by its projected area, is used extensively in atmospheric radiation transfer, climate modeling and remote sensing. This derives from the assumption that PSD optical properties can be uniquely described in terms of their effective diameter, D(sub e), and their cloud water content (CWC), henceforth referred to as the D(sub e)-CWC assumption. This study challenges this assumption, showing that while the D(sub e)-CWC assumption appears generally valid for liquid water clouds, it appears less valid for ice clouds in regions where (1) absorption is not primarily a function of either the PSD ice water content (IWC) or the PSD projected area, and (2) where wave resonance (i.e. photon tunneling) contributes significantly to absorption. These two regions often strongly coincide at terrestrial wavelengths when De less than ~60 m, which is where this D(sub e)-CWC assumption appears poorest. Treating optical properties solely in terms of D(sub e) and IWC may lead to errors up to 24%, 26% and 20% for terrestrial radiation in the window region regarding the absorption and extinction coefficients and the single scattering albedo, respectively. Outside the window region, errors may reach 33% and 42% regarding absorption and extinction. The magnitude and sign of these errors can change rapidly with wavelength, which may produce significant errors in climate modeling, remote sensing and other applications concerned with the wavelength dependence of radiation. Where the D(sub e)-CWC assumption breaks down, ice cloud optical properties appear to depend on D(sub e), IWC and the PSD shape. Optical property parameterizations in climate models and remote sensing algorithms based on historical PSD measurements may exhibit errors due to previously unknown PSD errors (i.e. the presence of ice artifacts due to the shattering of larger ice particles on the probe inlet tube during sampling). More recently developed cloud probes are designed to mitigate this shattering problem. Using realistic PSD shapes for a given temperature (and/or IWC) and cloud type may minimize errors associated with PSD shape in ice optics parameterizations and remote sensing algorithms. While this topic was investigated using two ice optics schemes (the Yang et al., 2005 database and the modified anomalous diffraction approximation, or MADA), a physical understanding of the limitations of the D(sub e)-IWC assumption was made possible by using MADA. MADA allows one to approximate the contribution of photon tunneling to absorption relative to other optical processes, which reveals that part of the error regarding the D(sub e)-IWC assumption can be associated with tunneling. By relating the remaining error to the radiation penetration depth in bulk ice (DELTA L) due to absorption, the domain where the D(sub e)-IWC assumption is weakest was described in terms of D(sub e) and DELTA L.

Mitchell, D. L.↗
NASA NTRS2012

Post-Flight EDL Entry Guidance Performance of the 2011 Mars Science Laboratory Mission

The 2011 Mars Science Laboratory was the first successful Mars mission to attempt a guided entry which safely delivered the rover to a final position approximately 2 km from its target within a touchdown ellipse of 19.1 km x 6.9 km. The Entry Terminal Point Controller guidance algorithm is derived from the final phase Apollo Command Module guidance and, like Apollo, modulates the bank angle to control the range flown. For application to Mars landers which must make use of the tenuous Martian atmosphere, it is critical to balance the lift of the vehicle to minimize the range error while still ensuring a safe deploy altitude. An overview of the process to generate optimized guidance settings is presented, discussing improvements made over the last nine years. Key dispersions driving deploy ellipse and altitude performance are identified. Performance sensitivities including attitude initialization error and the velocity of transition from range control to heading alignment are presented. Just prior to the entry and landing of MSL in August 2012, the EDL team examined minute tuning of the reference trajectory for the selected landing site, analyzed whether adjustment of bank reversal deadbands were necessary, the heading alignment velocity trigger was in union with other parameters to balance the EDL risks, and the vertical L/D command limits. This paper details a preliminary postflight assessment of the telemetry and trajectory reconstruction that is being performed, and updates the information presented in the former paper Entry Guidance for the 2011 Mars Science Laboratory Mission (AIAA Atmospheric Flight Mechanics Conference; 8-11 Aug. 2011; Portland, OR; United States)

Mendeck, Gavin F.↗
NASA NTRS2012

Particle Filtering for Model-Based Anomaly Detection in Sensor Networks

A novel technique has been developed for anomaly detection of rocket engine test stand (RETS) data. The objective was to develop a system that postprocesses a csv file containing the sensor readings and activities (time-series) from a rocket engine test, and detects any anomalies that might have occurred during the test. The output consists of the names of the sensors that show anomalous behavior, and the start and end time of each anomaly. In order to reduce the involvement of domain experts significantly, several data-driven approaches have been proposed where models are automatically acquired from the data, thus bypassing the cost and effort of building system models. Many supervised learning methods can efficiently learn operational and fault models, given large amounts of both nominal and fault data. However, for domains such as RETS data, the amount of anomalous data that is actually available is relatively small, making most supervised learning methods rather ineffective, and in general met with limited success in anomaly detection. The fundamental problem with existing approaches is that they assume that the data are iid, i.e., independent and identically distributed, which is violated in typical RETS data. None of these techniques naturally exploit the temporal information inherent in time series data from the sensor networks. There are correlations among the sensor readings, not only at the same time, but also across time. However, these approaches have not explicitly identified and exploited such correlations. Given these limitations of model-free methods, there has been renewed interest in model-based methods, specifically graphical methods that explicitly reason temporally. The Gaussian Mixture Model (GMM) in a Linear Dynamic System approach assumes that the multi-dimensional test data is a mixture of multi-variate Gaussians, and fits a given number of Gaussian clusters with the help of the wellknown Expectation Maximization (EM) algorithm. The parameters thus learned are used for calculating the joint distribution of the observations. However, this GMM assumption is essentially an approximation and signals the potential viability of non-parametric density estimators. This is the key idea underlying the new approach.

Solano, Wanda↗
NASA NTRS2000

JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

Globus, Al↗
NASA NTRS1986

A diagonal algorithm for the method of pseudocompressibility

The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.

Rogers, S. E.↗
NASA NTRS1987

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗
NASA NTRS1999

Beta in Streamers

Streamers are often described as regions of the corona in which the density is higher than in coronal holes because the plasma is trapped by closed loops of magnetic flux. In contrast, Magnetohydrodynamics (MHD) models of the global corona show that the plasma beta identically equal to 8(pi)p/B(exp 2) > 1 in streamers above approximately 1.2Rs heliocentric height (p=pressure, B=magnetic field strength). There are three recent contributions to this topic. The first is that heating near the cusp further drives Beta up and can result in release of new slow solar wind from the top of the streamer. The second is SOHO/UVCS observations, in combination with a potential field/source surface model of the magnetic field, show beta > 1 above 1.2Rs in a streamer observed near solar sunspot minimum. The third is a magnetic field reconstruction technique (using field deforming algorithms) which was applied both to an isolated active region (AR 7999) and to the Pneuman & Kopp global MHD model. In the active region, beta becomes larger than unity at approximately 1.2Rs. In the Pneuman & Kopp model, beta = 1.0 at the base of the streamer and rises with increasing height, becoming 15-20 at 1.6Rs and 35-55 at 1.7RS. The collective implication of these three results is that beta > 1 everywhere in streamers above approximately 1.2 Rs. Global simulations go on to show that the reason streamers do not simply explode under such high beta conditions is that they are held down by pressure from the sides due to the magnetic fields (and low beta) in adjacent coronal holes. The main role of the closed magnetic loops near the cusp is to keep the streamer from continuously leaking plasma, as otherwise happens in a magnetic pinch which is similar but has no closed loops. The purpose of this note is to summarize the results implying that beta > 1 is a general property of streamers above 1.2 Rs.

Suess, Steven T.↗
NASA NTRS2011

Parallel Wavefront Analysis for a 4D Interferometer

This software provides a programming interface for automating data collection with a PhaseCam interferometer from 4D Technology, and distributing the image-processing algorithm across a cluster of general-purpose computers. Multiple instances of 4Sight (4D Technology s proprietary software) run on a networked cluster of computers. Each connects to a single server (the controller) and waits for instructions. The controller directs the interferometer to several images, then assigns each image to a different computer for processing. When the image processing is finished, the server directs one of the computers to collate and combine the processed images, saving the resulting measurement in a file on a disk. The available software captures approximately 100 images and analyzes them immediately. This software separates the capture and analysis processes, so that analysis can be done at a different time and faster by running the algorithm in parallel across several processors. The PhaseCam family of interferometers can measure an optical system in milliseconds, but it takes many seconds to process the data so that it is usable. In characterizing an adaptive optics system, like the next generation of astronomical observatories, thousands of measurements are required, and the processing time quickly becomes excessive. A programming interface distributes data processing for a PhaseCam interferometer across a Windows computing cluster. A scriptable controller program coordinates data acquisition from the interferometer, storage on networked hard disks, and parallel processing. Idle time of the interferometer is minimized. This architecture is implemented in Python and JavaScript, and may be altered to fit a customer s needs.

Rao, Shanti R.↗
DOE OSTI2021

Improving the accuracy and efficiency of quantum connected moments expansions

The still-maturing noisy intermediate-scale quantum technology faces strict limitations on the algorithms that can be implemented efficiently. In the realm of quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous, with many variations. Alternatively, a promising new avenue has been unraveled by the quantum variants of techniques grounded on expansions of the moments of the Hamiltonian, notably the connected moments expansion (CMX) and the Peeters–Devreese–Soldatov (PDS) energy functional. Common to those approaches is that, upon preparing an approximate ground state used to compute the necessary moments, the accuracy of the estimated ground state energy depends on the degree of overlap between the prepared state and the true ground state. Thus, we use the ADAPT-VQE algorithm to test shallow circuit construction strategies for the purpose of increasing the overlap with the exact ground state, validated by the sizable accuracy improvement herein reported in the PDS and CMX ground state energies. We also show that we can take advantage of the fact that the terms to be measured are highly recurring in different moments, incurring a substantial reduction in the number of necessary measurements. Finally, by coupling this measurement caching with a threshold that determines whether a given term is to be measured based on its associated scalar coefficient, we observe a further reduction in the number of circuit implementations while allowing for tunable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2006

Time Relevance of Convective Weather Forecast for Air Traffic Automation

The Federal Aviation Administration (FAA) is handling nearly 120,000 flights a day through its Air Traffic Management (ATM) system and air traffic congestion is expected to increse substantially over the next 20 years. Weather-induced impacts to throughput and efficiency are the leading cause of flight delays accounting for 70% of all delays with convective weather accounting for 60% of all weather related delays. To support the Next Generation Air Traffic System goal of operating at 3X current capacity in the NAS, ATC decision support tools are being developed to create advisories to assist controllers in all weather constraints. Initial development of these decision support tools did not integrate information regarding weather constraints such as thunderstorms and relied on an additional system to provide that information. Future Decision Support Tools should move towards an integrated system where weather constraints are factored into the advisory of a Decision Support Tool (DST). Several groups such at NASA-Ames, Lincoln Laboratories, and MITRE are integrating convective weather data with DSTs. A survey of current convective weather forecast and observation data show they span a wide range of temporal and spatial resolutions. Short range convective observations can be obtained every 5 mins with longer range forecasts out to several days updated every 6 hrs. Today, the short range forecasts of less than 2 hours have a temporal resolution of 5 mins. Beyond 2 hours, forecasts have much lower temporal. resolution of typically 1 hour. Spatial resolutions vary from 1km for short range to 40km for longer range forecasts. Improving the accuracy of long range convective forecasts is a major challenge. A report published by the National Research Council states improvements for convective forecasts for the 2 to 6 hour time frame will only be achieved for a limited set of convective phenomena in the next 5 to 10 years. Improved longer range forecasts will be probabilistic as opposed to the deterministic shorter range forecasts. Despite the known low level of confidence with respect to long range convective forecasts, these data are still useful to a DST routing algorithm. It is better to develop an aircraft route using the best information available than no information. The temporally coarse long range forecast data needs to be interpolated to be useful to a DST. A DST uses aircraft trajectory predictions that need to be evaluated for impacts by convective storms. Each time-step of a trajectory prediction n&s to be checked against weather data. For the case of coarse temporal data, there needs to be a method fill in weather data where there is none. Simply using the coarse weather data without any interpolation can result in DST routes that are impacted by regions of strong convection. Increasing the temporal resolution of these data can be achieved but result in a large dataset that may prove to be an operational challenge in transmission and loading by a DST. Currently, it takes about 7mins retrieve a 7mb RUC2 forecast file from NOAA at NASA-Ames Research Center. A prototype NCWF6 1 hour forecast is about 3mb in size. A Six hour NCWFG forecast with a 1hr forecast time-step will be about l8mb (6 x 3mb). A 6 hour NCWF6 forecast with a l5min forecast time-step will be about 7mb (24 x 3mb). Based on the time it takes to retrieve a 7mb RUC2 forecast, it will take approximately 70mins to retrieve a 6 hour NCWF forecast with 15min time steps. Until those issues are addressed, there is a need to develop an algorithm that interpolates between these temporally coarse long range forecasts. This paper describes a method of how to use low temporal resolution probabilistic weather forecasts in a DST. The beginning of this paper is a description of some convective weather forecast and observation products followed by an example of how weather data are used by a DST. The subsequent sections will describe probabilistic forecasts followed by a descrtion of a method to use low temporal resolution probabilistic weather forecasts by providing a relevance value to these data outside of their valid times.

Chan, William N.↗