Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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 847 records · Page 47

Unsteady transonic algorithm improvements for realistic aircraft applications

Improvements to a time-accurate approximate factorization (AF) algorithm were implemented for steady and unsteady transonic analysis of realistic aircraft configurations. These algorithm improvements were made to the CAP-TSD (Computational Aeroelasticity Program - Transonic Small Disturbance) code developed at the Langley Research Center. The code permits the aeroelastic analysis of complete aircraft in the flutter critical transonic speed range. The AF algorithm of the CAP-TSD code solves the unsteady transonic small-disturbance equation. The algorithm improvements include: an Engquist-Osher (E-O) type-dependent switch to more accurately and efficiently treat regions of supersonic flow; extension of the E-O switch for second-order spatial accuracy in these regions; nonreflecting far field boundary conditions for more accurate unsteady applications; and several modifications which accelerate convergence to steady-state. Calculations are presented for several configurations including the General Dynamics one-ninth scale F-16C aircraft model to evaluate the algorithm modifications. The modifications have significantly improved the stability of the AF algorithm and hence the reliability of the CAP-TSD code in general.

Batina, John T.↗

A Lagrange multiplier based divide and conquer finite element algorithm

A novel domain decomposition method based on a hybrid variational principle is presented. Prior to any computation, a given finite element mesh is torn into a set of totally disconnected submeshes. First, an incomplete solution is computed in each subdomain. Next, the compatibility of the displacement field at the interface nodes is enforced via discrete, polynomial and/or piecewise polynomial Lagrange multipliers. In the static case, each floating subdomain induces a local singularity that is resolved very efficiently. The interface problem associated with this domain decomposition method is, in general, indefinite and of variable size. A dedicated conjugate projected gradient algorithm is developed for solving the latter problem when it is not feasible to explicitly assemble the interface operator. When implemented on local memory multiprocessors, the proposed methodology requires less interprocessor communication than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory and compares favorably with factorization based parallel direct methods.

Farhat, C.↗

Assessment of the 60 Km Rapid Update Cycle (RUC) with Near Real-Time Aircraft Reports

NASA is developing the Center-TBACON Advisory System (CTAS), a set of Air Traffic Management (ATM) Decision Support Tools (DST) to enable controllers to increase airspace capacity and flight efficiency. A crucial component of the CTAS, or any ATM DST, is the computation of the time-of-flight of aircraft along flight path segments which requires accurate knowledge of the wind through which the aircraft are flying. CTAS currently uses wind information from the Rapid Update Cycle (RUC), a numerical prediction model run operationally by the National Weather Service (NWS) National Center for Environmental Prediction (NCEP). There exists near real-time wind observations from commercial aircraft that can be used to increase the accuracy of the RUC wind forecasts via the FAA Integrated Terminal Weather System (ITWS) Terminal Winds (TW) algorithm. This report presents a study based on the application of the ITWS TW algorithm as an improvement to the baseline RUC product. Terminal Winds generally does not support the full Center airspace; the domain of the prototype MIT/LLITWS TW system was increased to cover the Denver Center airspace to support this study. This study has three goals: 1) determine the errors in the baseline 60-kilometer resolution RUC forecast wind fields relative to the needs of en route DSTs such as CTAS; 2) determine the benefit of using the TW algorithm to refine the RUC forecast wind fields with near real-tlme Meteorological Data Collection and Reporting System (MDCRS) aircraft reports, and 3) identify factors that influence wind field errors in order to improve accuracy and estimate errors in real time. The data for this study were collected over a one-year period for the Denver Center airspace and over one miIlion verification observations were used. This study is part of a larger effort funded by NASA which includes the NOAA/FSL.

Cole, R. E.↗

Receiver Gain Modulation Circuit

A receiver gain modulation circuit (RGMC) was developed that modulates the power gain of the output of a radiometer receiver with a test signal. As the radiometer receiver switches between calibration noise references, the test signal is mixed with the calibrated noise and thus produces an ensemble set of measurements from which ensemble statistical analysis can be used to extract statistical information about the test signal. The RGMC is an enabling technology of the ensemble detector. As a key component for achieving ensemble detection and analysis, the RGMC has broad aeronautical and space applications. The RGMC can be used to test and develop new calibration algorithms, for example, to detect gain anomalies, and/or correct for slow drifts that affect climate-quality measurements over an accelerated time scale. A generalized approach to analyzing radiometer system designs yields a mathematical treatment of noise reference measurements in calibration algorithms. By treating the measurements from the different noise references as ensemble samples of the receiver state, i.e. receiver gain, a quantitative description of the non-stationary properties of the underlying receiver fluctuations can be derived. Excellent agreement has been obtained between model calculations and radiometric measurements. The mathematical formulation is equivalent to modulating the gain of a stable receiver with an externally generated signal and is the basis for ensemble detection and analysis (EDA). The concept of generating ensemble data sets using an ensemble detector is similar to the ensemble data sets generated as part of ensemble empirical mode decomposition (EEMD) with exception of a key distinguishing factor. EEMD adds noise to the signal under study whereas EDA mixes the signal with calibrated noise. It is mixing with calibrated noise that permits the measurement of temporal-functional variability of uncertainty in the underlying process. The RGMC permits the evaluation of EDA by modulating the receiver gain using an external signal. Without the RGMC, samples of calibrated references from radiometers form an ensemble data set of the natural occurring fluctuations within a receiver. By driving the gain of an otherwise stable receiver with an external signal, the conceptual framework and generalization of the mathematics of EDA can be tested. A series of measurements was conducted to evaluate and characterize the performance of the RGMC. Test signals stepped the RGMC across its dynamic range of performance using a radiometer that sampled four noise references; analysis indicates that the RGMC successfully modulated the receiver gain with an external signal. Calibration algorithms applied to four noise references demonstrate the RGMC produced ensemble data sets of the external signal.

Jones, Hollis↗

Automated classification of scientific publications linked to GES DISC datasets

The data collections archived and distributedby the GES DISC NASA data center arewidely utilized for various Earth Science studies.As these collections are created, many researchworks are published regarding the collections, algorithms,validations and applications. SinceGES DISC collects these publications and providestheir citations for the users, it is helpful tocategorize them based on how they relate to the datasetsthey are associated with. Specifically,whether the publication that is linked to GES DISCdataset is using it for applicational research,or if it describes the algorithm for dataset creation,or the validation of the dataset, or providesthe general overview of the data collection. Currently,this process requires simple manuallabelling, and as such, may be possible to solve viaautomation. To approach this problem, wedeveloped machine learning classifiers to predictthe category a publication belongs to. We usedmanually labeled publications as training data forsupervised machine learning algorithms:Random Forest and Naive Bayes. We achieved classificationaccuracy that is substantially betterthan the baseline accuracy, thus greatly improvingthe efficiency of the publication internalanalysis.

Rohan Dayal↗

Segmentation Of Multifrequency Complex-Amplitude SAR Data

Several mathematical models and associated algorithms implement method of segmenting multifrequency, highly speckled, high-resolution, complex-amplitude (amplitude and phase) synthetic-aperture-radar (SAR) digitized image into regions, within each of which radar backscattering characteristics are similar or homogeneous from place to place. Typically, each region represents different type of terrain or other surface; e.g., forest, agricultural land, sea ice, or water. Method of segmentation of SAR scene into regions is product of generalization, to multifrequency case, of single-frequency method described in "Algorithms for Segmentation of Complex-Amplitude SAR Data" (NPO-18524).

Rignot, Eric J.↗

Simulator Evaluation of Runway Incursion Prevention Technology for General Aviation Operations

A Runway Incursion Prevention System (RIPS) has been designed under previous research to enhance airport surface operations situation awareness and provide cockpit alerts of potential runway conflict, during transport aircraft category operations, in order to prevent runway incidents while also improving operations capability. This study investigated an adaptation of RIPS for low-end general aviation operations using a fixed-based simulator at the National Aeronautics and Space Administration (NASA) Langley Research Center (LaRC). The purpose of the study was to evaluate modified RIPS aircraft-based incursion detection algorithms and associated alerting and airport surface display concepts for low-end general aviation operations. This paper gives an overview of the system, simulation study, and test results.

Jones, Denise R.↗

Optimal Aerosol Parameterization for Remote Sensing Retrievals

We have developed a new algorithm for the retrieval of aerosol and gases from SAGE It1 solar transmission measurements. This algorithm improves upon the NASA operational algorithm in several key aspects, including solving the problem non-linearly and incorporating a new methodology for separating the contribution of aerosols and gases. In order to extract aerosol information we have built a huge database of aerosol models for both stratospheric and tropospheric aerosols, and polar stratospheric cloud particles. This set of models allows us to calculate a vast range of possible extinction spectra for aerosols. and from these, derive a set of eigenvectors which then provide the basis set used in our inversion algorithm. Our aerosol algorithm and retrievals are described in several articles (listed in References Section) published under this grant. In particular they allow us to analyze the spectral properties of aerosols and PSCs and ultimately derive their microphysical properties. We have found some considerable differences between our spectra and the ones derived from the SAGE III operational algorithm. These are interesting as they provide an independent check on the validity of published aerosol data and, in particular, on their associated uncertainties. In order to understand these differences, we are assembling independent aerosol data from other sources with which to make comparisons. We have carried out extensive comparisons of our ozone retrievals with both SAGE III and independent lidar, ozonesonde, and satellite measurements (Polyakov et al., 2004). These show very good agreement throughout the stratosphere and help to quantify differences which can be attributed to natural variation in ozone versus that produced by algorithmic differences. In the mid - upper stratosphere, agreement with independent data was generally within 5 - 20%. but in the lower stratosphere the differences were considerably larger. We believe that a large proportion of this discrepancy in the lower stratosphere is attributable to natural variation, and is also seen in comparisons between lidar and ozonesonde measurements. NO2 profiles obtained with our algorithm were compared to those obtained through the SAGE III operational algorithm and exhibited differences of 20 - 40%. Our retrieved profiles agree with the HALOE NO2 measurements significantly better than those of the operational retrieval. In other work (described below), we are extending our aerosol retrievals into the infrared regime and plan to perform retrievals from combined uv-visible-infrared spectra. This work will allow us to use the spectra to derive the size and composition of aerosols, and we plan to employ our algorithms in the analysis of PSC spectra. We are presently also developing a limb-scattering algorithm to retrieve aerosol data from limb measurements of solar scattered radiation.

Newchurch, Michael J.↗

Preconditioning for the Navier-Stokes equations with finite-rate chemistry

The extension of Van Leer's preconditioning procedure to generalized finite-rate chemistry is discussed. Application to viscous flow is begun with the proper preconditioning matrix for the one-dimensional Navier-Stokes equations. Eigenvalue stiffness is resolved and convergence-rate acceleration is demonstrated over the entire Mach-number range from nearly stagnant flow to hypersonic. Specific benefits are realized at the low and transonic flow speeds typical of complete propulsion-system simulations. The extended preconditioning matrix necessarily accounts for both thermal and chemical nonequilibrium. Numerical analysis reveals the possible theoretical improvements from using a preconditioner for all Mach number regimes. Numerical results confirm the expectations from the numerical analysis. Representative test cases include flows with previously troublesome embedded high-condition-number areas. Van Leer, Lee, and Roe recently developed an optimal, analytic preconditioning technique to reduce eigenvalue stiffness over the full Mach-number range. By multiplying the flux-balance residual with the preconditioning matrix, the acoustic wave speeds are scaled so that all waves propagate at the same rate, an essential property to eliminate inherent eigenvalue stiffness. This session discusses a synthesis of the thermochemical nonequilibrium flux-splitting developed by Grossman and Cinnella and the characteristic wave preconditioning of Van Leer into a powerful tool for implicitly solving two and three-dimensional flows with generalized finite-rate chemistry. For finite-rate chemistry, the state vector of unknowns is variable in length. Therefore, the preconditioning matrix extended to generalized finite-rate chemistry must accommodate a flexible system of moving waves. Fortunately, no new kind of wave appears in the system. The only existing waves are entropy and vorticity waves, which move with the fluid, and acoustic waves, which propagate in Mach number dependent directions. The nonequilibrium vibrational energies and species densities in the unknown state vector act strictly as convective waves. The essential concept for extending the preconditioning to generalized chemistry models is determining the differential variables which symmetrize the flux Jacobians. The extension is then straight-forward. This algorithm research effort will be released in a future version of the production level computational code coined the General Aerodynamic Simulation Program (GASP), developed by Walters, Slack, and McGrory.

Godfrey, Andrew G.↗

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗

Analytical learning and term-rewriting systems

Analytical learning is a set of machine learning techniques for revising the representation of a theory based on a small set of examples of that theory. When the representation of the theory is correct and complete but perhaps inefficient, an important objective of such analysis is to improve the computational efficiency of the representation. Several algorithms with this purpose have been suggested, most of which are closely tied to a first order logical language and are variants of goal regression, such as the familiar explanation based generalization (EBG) procedure. But because predicate calculus is a poor representation for some domains, these learning algorithms are extended to apply to other computational models. It is shown that the goal regression technique applies to a large family of programming languages, all based on a kind of term rewriting system. Included in this family are three language families of importance to artificial intelligence: logic programming, such as Prolog; lambda calculus, such as LISP; and combinatorial based languages, such as FP. A new analytical learning algorithm, AL-2, is exhibited that learns from success but is otherwise quite different from EBG. These results suggest that term rewriting systems are a good framework for analytical learning research in general, and that further research should be directed toward developing new techniques.

Laird, Philip↗

Flux-split algorithms for the multi-dimensional Euler equations with real gases

Upwind algorithms are developed for the numerical solution of the multidimensional Euler equations for real gases. Flux-splitting methods are derived which account for a general equation of state. Approximations to the state equation based on physical arguments result in simplified algorithms which may be implemented into existing perfect-gas codes. Applications of the method to several high-Mach-number high-temperature flows are presented for two and three space dimensions.

Grossman, B.↗

Multiple-grid acceleration of Lax-Wendroff algorithms

A technique for accelerating the convergence of a one-step Lax-Wendroff method to a steady-state solution is discussed and its applicability extended to the more general class of two-step Lax-Wendroff methods. Several two-step methods which lead to quite efficient multiple grid algorithms are discussed. Computational results are presented using the full two dimensional Euler equations for both subcritical and shocked supercritical flows. Extensions and generalizations are mentioned.

Johnson, G. M.↗

On the eigenvalue and eigenvector derivatives of a general matrix

The existence of differentiable eigenvalues and eigenvectors for a general matrix is addressed. The eigenspace which contains differentiable eigenvectors is determined and computed by using the concept of subspace intersection in conjunction with the singular value decomposition algorithm. The differentiable eigenvectors associated with repeated eigenvalues should be simultaneously the eigenvectors of the general matrix and its corresponding sensitivity matrix. Furthermore, the derivatives for differentiable eigenvectors associated with repeated eigenvalues can be computed using higher order derivatives of the matrix, whereas the corresponding eigenvalue derivatives are the eigenvalues of the sensitivity matrix.

Juang, Jer-Nan↗

Acoustooptic linear algebra processors - Architectures, algorithms, and applications

Architectures, algorithms, and applications for systolic processors are described with attention to the realization of parallel algorithms on various optical systolic array processors. Systolic processors for matrices with special structure and matrices of general structure, and the realization of matrix-vector, matrix-matrix, and triple-matrix products and such architectures are described. Parallel algorithms for direct and indirect solutions to systems of linear algebraic equations and their implementation on optical systolic processors are detailed with attention to the pipelining and flow of data and operations. Parallel algorithms and their optical realization for LU and QR matrix decomposition are specifically detailed. These represent the fundamental operations necessary in the implementation of least squares, eigenvalue, and SVD solutions. Specific applications (e.g., the solution of partial differential equations, adaptive noise cancellation, and optimal control) are described to typify the use of matrix processors in modern advanced signal processing.

Casasent, D.↗

Supervised Machine Learning Approach for Classifying Earth Science Publications

The data collections archived and distributed by the GES DISC NASA data center are widely utilized for various Earth Science studies. As these collections are created, many research works are published regarding these collections' algorithms, their validation, and their applications. As NASA data centers collect these publications for public use, it is helpful to categorize them based on how they relate to their associated datasets. Specifically, whether the publication linked to the GES DISC dataset is using it for applicational research, describing the algorithm used for the dataset creation, validating the dataset, or providing a general overview of the data collection. Currently, this process requires simple manual labeling, and as such, it may be possible to solve via automation. To approach this problem, machine learning classifiers were developed to predict a publication's category. Manually labeled publications were used as the training data for the supervised machine learning algorithms, specifically Random Forest and Multinomial Naïve Bayes. After balancing the dataset and implementing the Multinomial Naïve Bayes algorithm, the classification accuracy achieved was substantially higher than the baseline accuracy, thus significantly improving the efficiency of publication labeling.

Rohan Dayal↗

A diagonal form of an implicit approximate-factorization algorithm with application to a two dimensional inlet

A modification of an implicit approximate-factorization finite-difference algorithm applied to the two dimensional Euler and Navier-Stokes equations in general curvilinear coordinates is presented for supersonic free stream flow about and through inlets. The modification transforms the coupled system of equations into an uncoupled diagonal form which requires less computation work. For steady-state applications the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. Solutions are given for inviscid and laminar flow about a two dimensional wedge inlet configuration. Comparisons are made between computed results and exact theory.

Chaussee, D. S.↗