Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 415 records · Page 23

Multiobjective insensitive design of airplane control systems with uncertain parameters

A multiobjective computer-aided design algorithm has been developed which minimizes the sensitivity of the design objectives to uncertainties in system parameters. The more important uncertain parameters are described by a gaussian random vector with known covariance matrix, and a vector sensitivity objective function is defined as the probabilities that the design objectives will violate specified requirements constraints. Control system parameters are found which minimize the sensitivity vector in a Pareto-optimal sense, using constrained minimization algorithms. Example results are shown for lateral stability augmentation system (SAS) design for three Shuttle flight conditions.

Schy, A. A.↗

Efficient use of high performance computers for integrated controls and structures design

Simply transporting design codes from sequential-scalar computers to parallel-vector computers does not fully utilize the computational benefits offered by high performance computers. By performing integrated controls and structures design on an experimental truss platform with both sequential-scalar and parallel-vector design codes, conclusive results are presented to substantiate this claim. The efficiency of a Cholesky factorization scheme in conjunction with a variable-band row data structure is presented. In addition, the Lanczos eigensolution algorithm has been incorporated in the design code for both parallel and vector computations. Comparisons of computational efficiency between the initial design code and the parallel-vector design code are presented. It is shown that the Lanczos algorithm with the Cholesky factorization scheme is far superior to the sub-space iteration method of eigensolution when substantial numbers of eigenvectors are required for control design and/or performance optimization. Integrated design results show the need for continued efficiency studies in the area of element computations and matrix assembly.

Belvin, W. K.↗

Testing of the on-board attitude determination and control algorithms for SAMPEX

Algorithms for on-board attitude determination and control of the Solar, Anomalous, and Magnetospheric Particle Explorer (SAMPEX) have been expanded to include a constant gain Kalman filter for the spacecraft angular momentum, pulse width modulation for the reaction wheel command, an algorithm to avoid pointing the Heavy Ion Large Telescope (HILT) instrument boresight along the spacecraft velocity vector, and the addition of digital sun sensor (DSS) failure detection logic. These improved algorithms were tested in a closed-loop environment for three orbit geometries, one with the sun perpendicular to the orbit plane, and two with the sun near the orbit plane - at Autumnal Equinox and at Winter Solstice. The closed-loop simulator was enhanced and used as a truth model for the control systems' performance evaluation and sensor/actuator contingency analysis. The simulations were performed on a VAX 8830 using a prototype version of the on-board software.

Mccullough, Jon D.↗

Space shuttle guidance, navigation and control equation document no. 4: Precision state and filter weighting matrix extrapolation

The Precision State and Filter Weighting Matrix Extrapolation Routine is described which provides the capability to extrapolate any spacecraft geocentric state vector either backwards or forwards in time through a force field consisting of the earth's primary central-force gravitational attraction and a superimposed perturbing acceleration. The routine also provides the capability of extrapolating the filter-weighting matrix along the precision trajectory. This matrix is a square root form of the error covariance matrix and contains statistical information relative to the accuracies of the state vectors and certain other optionally estimated quantities. The routine is a cooled algorithm for the numerical solution of modified forms of the basic differential equations which are satisfied by the geocentric state vector of the spacecraft's center of mass and by the filter-weighting matrix.

Robertson, W. M.↗

Optimal Pitch Thrust-Vector Angle and Benefits for all Flight Regimes

The NASA Dryden Flight Research Center is exploring the optimum thrust-vector angle on aircraft. Simple aerodynamic performance models for various phases of aircraft flight are developed and optimization equations and algorithms are presented in this report. Results of optimal angles of thrust vectors and associated benefits for various flight regimes of aircraft (takeoff, climb, cruise, descent, final approach, and landing) are given. Results for a typical wide-body transport aircraft are also given. The benefits accruable for this class of aircraft are small, but the technique can be applied to other conventionally configured aircraft. The lower L/D aerodynamic characteristics of fighters generally would produce larger benefits than those produced for transport aircraft.

Gilyard, Glenn B.↗

Inversion of Multiangular Polarimetric Measurements Over Open and Coastal Ocean Waters: A Joint Retrieval Algorithm for Aerosol and Water-Leaving Radiance Properties

Ocean color remote sensing is a challenging task over coastal waters due to the complex optical properties of aerosols and hydrosols. In order to conduct accurate atmospheric correction, we previously implemented a joint retrieval algorithm, hereafter referred to as the Multi-Angular Polarimetric Ocean coLor (MAPOL) algorithm, to obtain the aerosol and water-leaving signal simultaneously. The MAPOL algorithm has been validated with synthetic data generated by a vector radiative transfer model, and good retrieval performance has been demonstrated in terms of both aerosol and ocean water optical properties (Gao et al., 2018). In this work we applied the algorithm to airborne polarimetric measurements from the Research Scanning Polarimeter (RSP) over both open and coastal ocean waters acquired in two field campaigns: the Ship-Aircraft Bio-Optical Research (SABOR) in 2014 and the North Atlantic Aerosols and Marine Ecosystems Study (NAAMES) in 2015 and 2016. Two different yet related bio-optical models are designed for ocean water properties. One model aligns with traditional open ocean water bio-optical models that parameterize the ocean optical properties in terms of the concentration of chlorophyll a. The other is a generalized bio-optical model for coastal waters that includes seven free parameters to describe the absorption and scattering by phytoplankton, colored dissolved organic matter, and nonalgal particles. The retrieval errors of both aerosol optical depth and the water-leaving radiance are evaluated. Through the comparisons with ocean color data products from both in situ measurements and the Moderate Resolution Imaging Spectroradiometer (MODIS), and the aerosol product from both the High Spectral Resolution Lidar (HSRL) and the Aerosol Robotic Network (AERONET), the MAPOL algorithm demonstrates both flexibility and accuracy in retrieving aerosol and water-leaving radiance properties under various aerosol and ocean water conditions.

Gao, Meng↗

Use of Polarization Lidar for Investigation of Meteorological Formations

This paper presents the results of theoretical and experimental, investigations of depolarization characteristics of different meteorological formations. Experimental investigations are carried out with a monostatic lidar. The ruby laser radiation is polarized in a vertical plane. The radiation reflected is accepted by a lens system of 150 rom in diameter and a viewing angle of 12' and further it is divided by Wollaston prism into the components polarized orthogonally. In this case the principal plane of the prism is exposed parallel with the laser polarization plane. Investigations show the degree of radiation polarization, reflected from water clouds, to be changed within 1/0.7 (seldom up to 0.6) depending on their density. In most cases a signal reflected from the cloud leading edge is polarized completely. The time shift is observed between polarized and crosspolarized components of a Fignal, reflected from a cloud, depending on the density of a meteorological object. While penetrating into the cloud depth a degree of polarization decreases up to 0.8-0.7, and the character of this decrease is different for various types of clouds. For crystal clouds the shift between the components of the reflected signal is not observed and the magnitude of polarization degree amounts to 0.1/0.3 in comparison with water clouds. The polarization degree of radiation reflected by fog is not less than 0.6, and that in the rains of average intensity (about 5 mm/h) is always about 1. The authors have suggested an algorithm of numerical solution of nonstationary transfer equation in the vector form to forecast the influence of multiple scattering effects on polarization characteristics of the lidar light signal. The method of statistical simulation (Monte-Carlo technique) forms the basis of the algorithm. Numerical estimates obtained for a model of stratocumulus at lambda = 0.6943 microns under boundary conditions close to the conditions of natural experiment being discussed proved to be in a good agreement with the results of observation. Specifically, Fig. 1 shows the profiles of polarization (p) versus depth (L) of the following drop formations: fog (curve 1) with horizontal meteorological visibility of 4 km two stratocumulus at a height of 1100 m with the attenuation factors delta = 0.01m(exp -1) (curve 2) and delta = 0.05m(exp -1) (curve 3). Curve 3 shows the results of numerical estimates and the value of their statistical error.

Balin, Yu. S.↗

Towards a Verifiable Domain-Specific Language for Hardware-Accelerated Stencils

Defining a domain-specific language (DSL) that supports vector-calculus abstractions eases the porting of partial differential equation (PDE) solvers to specialized architectures. Sufficiently high-level abstractions empower users to express universal laws with sufficient generality that the laws must always hold true within their domain of validity. A broad class of PDE solvers employs stencil-based algorithms, the target domain of Berkeley Lab's stencil accelerator chip co-design project. First released as open-source in January 2026, the Formal software framework lays a foundation for defining an embedded DSL based on composable operators that implement mimetic numerical methods -- stencil algorithms that guarantee satisfaction of discrete versions of important vector calculus theorems. The Formal DSL will be the frontend to a new class of stencil-PDE accelerators developed jointly by LBNL, UHCL, and UC Berkeley through the DOE Competitive Portfolios for Computer Science Project. This offers the potential of an order of magnitude acceleration for this important category of computational methods to serve the DOE mission. Future work on the Formal DSL will facilitate software verification via type-safe templates that enable problem-specific correctness proofs relying upon generic function theory and carefully crafted unit tests.

Rouson, Damian↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASA's Space Launch System

The engineering development of the new Space Launch System (SLS) launch vehicle requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The characteristics of these spacecraft systems must be matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large and complex system engineering challenge, which is being addressed in part by focusing on the specific subsystems involved in the handling of off-nominal mission and fault tolerance with response management. Using traditional model based system and software engineering design principles from the Unified Modeling Language (UML) and Systems Modeling Language (SysML), the Mission and Fault Management (M&FM) algorithms for the vehicle are crafted and vetted in specialized Integrated Development Teams (IDTs) composed of multiple development disciplines such as Systems Engineering (SE), Flight Software (FSW), Safety and Mission Assurance (S&MA) and the major subsystems and vehicle elements such as Main Propulsion Systems (MPS), boosters, avionics, Guidance, Navigation, and Control (GNC), Thrust Vector Control (TVC), and liquid engines. These model based algorithms and their development lifecycle from inception through Flight Software certification are an important focus of this development effort to further insure reliable detection and response to off-nominal vehicle states during all phases of vehicle operation from pre-launch through end of flight. NASA formed a dedicated M&FM team for addressing fault management early in the development lifecycle for the SLS initiative. As part of the development of the M&FM capabilities, this team has developed a dedicated testbed that integrates specific M&FM algorithms, specialized nominal and off-nominal test cases, and vendor-supplied physics-based launch vehicle subsystem models. Additionally, the team has developed processes for implementing and validating these algorithms for concept validation and risk reduction for the SLS program. The flexibility of the Vehicle Management End-to-end Testbed (VMET) enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the developed algorithms utilizing actual subsystem models such as MPS. The intent of VMET is to validate the M&FM algorithms and substantiate them with performance baselines for each of the target vehicle subsystems in an independent platform exterior to the flight software development infrastructure and its related testing entities. In any software development process there is inherent risk in the interpretation and implementation of concepts into software through requirements and test cases into flight software compounded with potential human errors throughout the development lifecycle. Risk reduction is addressed by the M&FM analysis group working with other organizations such as S&MA, Structures and Environments, GNC, Orion, the Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission and Loss of Crew probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and associated detection and responses that can be tested in VMET to ensure that failures can be detected, and confirm that responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - ARINC 653 partitioned OS, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM such as telemetry packing and processing. The baseline plan for use of VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by Flight Software. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure the effectiveness of M&FM algorithms performance in the FSW development and test processes.

Trevino, Luis↗

Algorithm developments for the Euler equations with calculations of transonic flows

A new algorithm has been developed for the Euler equations that uses flux vector splitting in combination with the concept of rotating the coordinate system to the local streamwise direction. Flux vector biasing is applied along the local streamwise direction and central differencing is used transverse to the flow direction. The flux vector biasing is switched from upwind for supersonic flow to downwind-biased for subsonic flow. This switching is based on the Mach number; hence the proper domain of dependence is used in the supersonic regions and the switching occurs across shock waves. The theoretical basis and the development of the formulas for flux vector splitting are presented. Then several one-dimensional calculations are presented of steady and unsteady transonic flows, which demonstrate the stability and accuracy of the algorithm. Finally results are shown for unsteady transonic flow over an airfoil. The pressure coefficient plots show sharp transonic shock profiles, and the Mach contour plots show smoothly varying contours.

Goorjian, Peter M.↗

Mission and Navigation Design for the 2009 Mars Science Laboratory Mission

NASA s Mars Science Laboratory mission will launch the next mobile science laboratory to Mars in the fall of 2009 with arrival at Mars occurring in the summer of 2010. A heat shield, parachute, and rocket-powered descent stage, including a sky crane, will be used to land the rover safely on the surface of Mars. The direction of the atmospheric entry vehicle lift vector will be controlled by a hypersonic entry guidance algorithm to compensate for entry trajectory errors and counteract atmospheric and aerodynamic dispersions. The key challenges for mission design are (1) develop a launch/arrival strategy that provides communications coverage during the Entry, Descent, and Landing phase either from an X-band direct-to-Earth link or from a Ultra High Frequency link to the Mars Reconnaissance Orbiter for landing latitudes between 30 deg North and 30 deg South, while satisfying mission constraints on Earth departure energy and Mars atmospheric entry speed, and (2) generate Earth-departure targets for the Atlas V-541 launch vehicle for the specified launch/arrival strategy. The launch/arrival strategy employs a 30-day baseline launch period and a 27-day extended launch period with varying arrival dates at Mars. The key challenges for navigation design are (1) deliver the spacecraft to the atmospheric entry interface point (Mars radius of 3522.2 km) with an inertial entry flight path angle error of +/- 0.20 deg (3 sigma), (2) provide knowledge of the entry state vector accurate to +/- 2.8 km (3 sigma) in position and +/- 2.0 m/s (3 sigma) in velocity for initializing the entry guidance algorithm, and (3) ensure a 99% probability of successful delivery at Mars with respect to available cruise stage propellant. Orbit determination is accomplished via ground processing of multiple complimentary radiometric data types: Doppler, range, and Delta-Differential One-way Ranging (a Very Long Baseline Interferometry measurement). The navigation strategy makes use of up to five interplanetary trajectory correction maneuvers to achieve entry targeting requirements. The requirements for cruise propellant usage and atmospheric entry targeting and knowledge are met with ample margins.

Mission design↗

New Parallel Algorithms for Structural Analysis and Design of Aerospace Structures

Subspace and Lanczos iterations have been developed, well documented, and widely accepted as efficient methods for obtaining p-lowest eigen-pair solutions of large-scale, practical engineering problems. The focus of this paper is to incorporate recent developments in vectorized sparse technologies in conjunction with Subspace and Lanczos iterative algorithms for computational enhancements. Numerical performance, in terms of accuracy and efficiency of the proposed sparse strategies for Subspace and Lanczos algorithm, is demonstrated by solving for the lowest frequencies and mode shapes of structural problems on the IBM-R6000/590 and SunSparc 20 workstations.

Nguyen, Duc T.↗

Novel, Miniature Multi-Hole Probes and High-Accuracy Calibration Algorithms for their use in Compressible Flowfields

Two new calibration algorithms were developed for the calibration of non-nulling multi-hole probes in compressible, subsonic flowfields. The reduction algorithms are robust and able to reduce data from any multi-hole probe inserted into any subsonic flowfield to generate very accurate predictions of the velocity vector, flow direction, total pressure and static pressure. One of the algorithms PROBENET is based on the theory of neural networks, while the other is of a more conventional nature (polynomial approximation technique) and introduces a novel idea of local least-squares fits. Both algorithms have been developed to complete, user-friendly software packages. New technology was developed for the fabrication of miniature multi-hole probes, with probe tip diameters all the way down to 0.035". Several miniature 5- and 7-hole probes, with different probe tip geometries (hemispherical, conical, faceted) and different overall shapes (straight, cobra, elbow probes) were fabricated, calibrated and tested. Emphasis was placed on the development of four stainless-steel conical 7-hole probes, 1/16" in diameter calibrated at NASA Langley for the entire subsonic regime. The developed calibration algorithms were extensively tested with these probes demonstrating excellent prediction capabilities. The probes were used in the "trap wing" wind tunnel tests in the 14'x22' wind tunnel at NASA Langley, providing valuable information on the flowfield over the wing. This report is organized in the following fashion. It consists of a "Technical Achievements" section that summarizes the major achievements, followed by an assembly of journal articles that were produced from this project and ends with two manuals for the two probe calibration algorithms developed.

Rediniotis, Othon K.↗

Global Sensitivity Analysis of Simulated Remote Sensing Polarimetric Observations Over Snow

This study presents a detailed theoretical assessment of the information content of passive polarimetric observations over snow scenes, using a global sensitivity analysis (GSA) method. Conventional sensitivity studies focus on varying a single parameter while keeping all other parameters fixed. In contrast, the GSA correctly addresses the covariance of state parameters across their entire parameter space, hence favoring a more correct interpretation of inversion algorithms and the optimal design of their state vectors. The forward simulations exploit a vector radiative transfer model to obtain the Stokes vector emerging at the top of the atmosphere for different solar zenith angles, when the bottom boundary consists of a vertically resolved snowpack of non-spherical grains. The presence of light-absorbing particulates (LAPs), either embedded in the snow or aloft in the atmosphere above in the form of aerosols, is also considered. The results are presented for a set of wavelengths spanning the visible (VIS), near-infrared (NIR), and shortwave infrared (SWIR) region of the spectrum. The GSA correctly captures the expected, high sensitivity of the reflectance to LAPs in the VIS–NIR and to grain size at different depths in the snowpack in the NIR–SWIR. With adequate viewing geometries, mono-angle measurements of total reflectance in the VIS–SWIR (akin to those of the Moderate Resolution Imaging Spectroradiometer, MODIS) resolve grain size in the top layer of the snowpack sufficiently well. The addition of multi-angle polarimetric observations in the VIS–NIR provides information on grain shape and microscale roughness. The simultaneous sensitivity in the VIS–NIR to both aerosols and snow-embedded impurities can be disentangled by extending the spectral range to the SWIR, which contains information on aerosol optical depth while remaining essentially unaffected when the same particulates are mixed with the snow. Multi-angle polarimetric observations can therefore (i) effectively partition LAPs between the atmosphere and the surface, which represents a notorious challenge for snow remote sensing based on measurements of total reflectance only and (ii) lead to better estimates of grain shape and roughness and, in turn, the asymmetry parameter, which is critical for the determination of albedo. The retrieval uncertainties are minimized when the degree of linear polarization is used in place of the polarized reflectance. The Sobol indices, which are the main metric for the GSA, were used to select the state parameters in retrievals performed on data simulated for multiple instrument configurations. Improvements in retrieval quality with the addition of measurements of polarization, multi-angle views, and different spectral channels reflect the information content, identified by the Sobol indices, relative to each configuration. The results encourage the development of new remote sensing algorithms that fully leverage multi-angle and polarimetric capabilities of modern remote sensors. They can also aid flight planning activities, since the optimal exploitation of the information content of multi-angle measurements depends on the viewing geometry. The better characterization of surface and atmospheric parameters in snow-covered regions advances research opportunities for scientists of the cryosphere and ultimately benefits albedo estimates in climate models.

remote sensing↗

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗

A fully vectorized numerical solution of the incompressible Navier-Stokes equations

A vectorizable algorithm is presented for the implicit finite difference solution of the incompressible Navier-Stokes equations in general curvilinear coordinates. The unsteady Reynolds averaged Navier-Stokes equations solved are in two dimension and non-conservative primitive variable form. A two-layer algebraic eddy viscosity turbulence model is used to incorporate the effects of turbulence. Two momentum equations and a Poisson pressure equation, which is obtained by taking the divergence of the momentum equations and satisfying the continuity equation, are solved simultaneously at each time step. An elliptic grid generation approach is used to generate a boundary conforming coordinate system about an airfoil. The governing equations are expressed in terms of the curvilinear coordinates and are solved on a uniform rectangular computational domain. A checkerboard SOR, which can effectively utilize the computer architectural concept of vector processing, is used for iterative solution of the governing equations.

Patel, N.↗

A prescription of Winograd's discrete Fourier transform algorithm

A detailed and complete description of Winograd's discrete Fourier transform algorithm (DFT) is presented omitting all proofs and derivations. The algorithm begins with the transfer of data from the input vector array to the working array where the actual transformation takes place, otherwise known as input scrambling and output unscrambling. The third array holds constraints required in the transformation stage that are evaluated in the precomputation stage. The algorithm is made up of several FORTRAN subroutines which are not to be confused with practical software algorithmic implementation since they are designed for clarity and not for speed.

Zohar, S.↗

Algorithms and programming tools for image processing on the MPP, part 2

A number of algorithms were developed for image warping and pyramid image filtering. Techniques were investigated for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some utilities for dealing with very long vectors and for sorting were developed. Documentation pages for the algorithms which are available for distribution are given. The performance of the MPP for a number of basic data manipulations was determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications. The Parallel Pascal development system, which is a portable programming environment for the MPP, was improved and better documentation including a tutorial was written. This environment allows programs for the MPP to be developed on any conventional computer system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions. The algorithms were tested on the MPP and a presentation on the development system was made to the MPP users group. The UNIX version of the Parallel Pascal System was distributed to a number of new sites.

Reeves, Anthony P.↗