Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Introduction to multigrid methods

These notes were written for an introductory course on the application of multigrid methods to elliptic and hyperbolic partial differential equations for engineers, physicists and applied mathematicians. The use of more advanced mathematical tools, such as functional analysis, is avoided. The course is intended to be accessible to a wide audience of users of computational methods. We restrict ourselves to finite volume and finite difference discretization. The basic principles are given. Smoothing methods and Fourier smoothing analysis are reviewed. The fundamental multigrid algorithm is studied. The smoothing and coarse grid approximation properties are discussed. Multigrid schedules and structured programming of multigrid algorithms are treated. Robustness and efficiency are considered.

Wesseling, P.↗
NASA NTRS2004

Structural Health Management for Future Aerospace Vehicles

Structural Health Management (SHM) will be of critical importance to provide the safety, reliability and affordability necessary for the future long duration space missions described in America's Vision for Space Exploration. Long duration missions to the Moon, Mars and beyond cannot be accomplished with the current paradigm of periodic, ground based structural integrity inspections. As evidenced by the Columbia tragedy, this approach is also inadequate for the current Shuttle fleet, thus leading to its initial implementation of on-board SHM sensing for impact detection as part of the return to flight effort. However, future space systems, to include both vehicles as well as structures such as habitation modules, will require an integrated array of onboard in-situ sensing systems. In addition, advanced data systems architectures will be necessary to communicate, store and process massive amounts of SHM data from large numbers of diverse sensors. Further, improved structural analysis and design algorithms will be necessary to incorporate SHM sensing into the design and construction of aerospace structures, as well as to fully utilize these sensing systems to provide both diagnosis and prognosis of structural integrity. Ultimately, structural integrity information will feed into an Integrated Vehicle Health Management (IVHM) system that will provide real-time knowledge of structural, propulsion, thermal protection and other critical systems for optimal vehicle management and mission control. This paper will provide an overview of NASA research and development in the area of SHM as well as to highlight areas of technology improvement necessary to meet these future mission requirements.

Prosser, W. H.↗
NASA NTRS2019

VIIRS Deep Blue Aerosol Products Over Land: Extending the EOS Long‐Term Aerosol Data Records

A primary goal of the Deep Blue (DB) project is to create consistent long‐term aerosol data records, suitable for climate studies, using multiple satellite instruments. In order to continue Earth Observing System (EOS)‐era aerosol products into the Joint Polar Satellite System era, we have successfully ported the DB algorithm to process data from the Visible Infrared Imaging Radiometer Suite (VIIRS). Although the basic structure of the VIIRS algorithm is similar to that for the Moderate Resolution Imaging Spectroradiometer (MODIS), many enhancements have been made compared to the MODIS collection 6 (C6) version. Most have also been implemented in the latest MODIS Collection 6.1 (C6.1). For example, a new smoke mask was developed based on the spectral curvature of measured reflectance to distinguish biomass burning smoke from weakly absorbing urban/industrial aerosols. Consequently, a new aerosol‐type flag was added into the VIIRS DB data set. In addition, new dust models have been developed to account for the nonsphericity of mineral dust. As a result, a discontinuity in the retrieved aerosol optical depth (AOD) of Saharan dust plumes seen in MODIS C6 products near the boundary between North Africa and the Atlantic has been much reduced. We have also evaluated the VIIRS and MODIS Terra/Aqua C6.1 AOD against Aerosol Robotic Network data. VIIRS and MODIS retrievals show similar performance; around 80% of matchups agree with Aerosol Robotic Network within the expected error of ±(0.05 + 20)%, indicating that DB can provide consistent AOD through the historical EOS and present Joint Polar Satellite System eras.

aerosols↗
DOE OSTI2015

Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

The Structure of Evolution LOCBURST: The BATSE Burst Location Algorithm

The gamma-ray bursts (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE 1B, 2B, and 3B gamma-ray burst catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data as well as locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.

Pendleton, Geoffrey N.↗
NASA NTRS2003

A Time Integration Algorithm Based on the State Transition Matrix for Structures with Time Varying and Nonlinear Properties

A variable order method of integrating the structural dynamics equations that is based on the state transition matrix has been developed. The method has been evaluated for linear time variant and nonlinear systems of equations. When the time variation of the system can be modeled exactly by a polynomial it produces nearly exact solutions for a wide range of time step sizes. Solutions of a model nonlinear dynamic response exhibiting chaotic behavior have been computed. Accuracy of the method has been demonstrated by comparison with solutions obtained by established methods.

Bartels, Robert E.↗
NASA NTRS2023

User Guide for TROPICS Data Products

This document provides information for using the data products available from the “Time-Resolved Observations of Precipitation structure and storm Intensity with a Constellation of Smallsats” (TROPICS) mission. The TROPICS mission will produce a range of data products that will be available at the NASA Goddard Earth Sciences Data and Information Services Center (GES DISC). The data products will be produced at the TROPICS Data Processing Center (UW-M SSEC), and consist of Level-1 radiances (antenna and brightness temperatures), Level-2a unified resolution radiance, Level-2b Atmospheric Vertical Temperature Profiles (AVTP), Level-2b Atmospheric Vertical Moisture Profiles (AVMP), Level-2b Instantaneous Surface Rain Rate (ISRR), and Level-2b Tropical Cyclone (TC) intensity algorithms to estimate two primary variables: Minimum Sea Level Pressure (MSLP) and Maximum Sustained Winds (MSW). Two independent intensity estimation methods are included: 1) the Tropical Cyclone Intensity Estimate algorithm (TCIE) developed at the University of Wisconsin/CIMSS using native microwave brightness temperatures and 2) the Hurricane Intensity and Structure Algorithm (HISA) developed at Colorado State University/CIRA using microwave retrievals of temperature, moisture, and integrated quantities. In addition to MSW and MSLP, HISA also provides estimates of surface wind radii and 2D winds at standard pressure levels. TROPICS is adapting the NOAA STAR Microwave Integrated Retrieval System (MIRS) to retrieve the AVTP and AVMP data products. The ISRR algorithm uses the NASA Goddard Precipitation Retrieval and Profiling Scheme (PRPS).

TROPICS↗
DOE OSTI2023

Extending PETSc's Composable Hierarchical Solvers (Final Technical Report)

This report documents research activities conducted at CU Boulder as part of Extending PETSc’s Composable Hierarchical Solvers, which has been part of a collaboration with Argonne National Laboratory (separate award). Our work has focused on performance-portable end-to-end GPU solvers demonstrated via exemplary applications in nonlinear fluid and structural mechanics. We describe advances in algorithmic composition and analysis in the context of these applications, but the implementations are fully documented and decoupled, and in use by other projects. We believe the vertical integration achieved through collaboration with ECP’s CEED and the PSAAP center at CU was necessary to take risks with data structures and algorithms.

42 ENGINEERING↗
NASA NTRS1989

Passive microwave retrievals of rainfall and rain system structure

Consideration is given to the development of algorithms for the Tropical Rainfall Measuring Mission to retrieve rain and rain vertical structure from passive microwave radiometry. The self-consistency approach for surface rain rate retrieval of Kummerow et al. (1989) is applied to microwave brightness temperature data from the Cooperative Huntsville Meteorological Experiment (Dodge et al., 1986). Because the algorithm simultaneously retrieves rainfall rate and rain system structure, it is suggested that the algorithm can be used to overcome the problem of the dependence of brightness temperatures on the vertical profile of hydrometeors.

Kummerow, Christian↗
NASA NTRS1996

High Performance Parallel Multigrid Algorithms for Unstructured Grids

We describe a high performance parallel multigrid algorithm for a rather general class of unstructured grid problems in two and three dimensions. The algorithm PUMG, for parallel unstructured multigrid, is related in structure to the parallel multigrid algorithm PSMG introduced by McBryan and Frederickson, for they both obtain a higher convergence rate through the use of multiple coarse grids. Another reason for the high convergence rate of PUMG is its smoother, an approximate inverse developed by Baumgardner and Frederickson.

Frederickson, Paul O.↗
NASA NTRS1976

Optimization of multi-constrained structures based on optimality criteria

A weight-reduction algorithm is developed for the optimal design of structures subject to several multibehavioral inequality constraints. The structural weight is considered to depend linearly on the design variables. The algorithm incorporates a simple recursion formula derived from the Kuhn-Tucker necessary conditions for optimality, associated with a procedure to delete nonactive constraints based on the Gauss-Seidel iterative method for linear systems. A number of example problems is studied, including typical truss structures and simplified wings subject to static loads and with constraints imposed on stresses and displacements. For one of the latter structures, constraints on the fundamental natural frequency and flutter speed are also imposed. The results obtained show that the method is fast, efficient, and general when compared to other competing techniques. Extensions to the generality of the method to include equality constraints and nonlinear merit functions is discussed.

Rizzi, P.↗
DOE OSTI2022

Low rank approximation in simulations of quantum algorithms

Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low rank tensor and all intermediate states of the quantum algorithm can be represented or approximated by low rank tensors. Here, in this paper, we examine the possibility of simulating a few quantum algorithms by using low-rank canonical polyadic (CP) decomposition to represent the input and all intermediate states of these algorithms. Two rank reduction algorithms are used to enable efficient simulation. We show that some of the algorithms preserve the low rank structure of the input state and can thus be efficiently simulated on a classical computer. However, the rank of the intermediate states in other quantum algorithms can increase rapidly, making efficient simulation more difficult. To some extent, such difficulty reflects the advantage or superiority of a quantum computer over a classical computer. As a result, understanding the low rank structure of a quantum algorithm allows us to identify algorithms that can benefit significantly from quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

A concept for dynamic control of RPV information system parameters

A globally adaptive image compression structure has been developed for use in the tactical environment of a remotely piloted vehicle. The control structure is based on an image compression algorithm RM2 but can be easily extended to standard algorithms. It is shown that this structure provides an operator with the flexibility to dynamically maximize the usefulness of a limited and changing bit rate and should significantly improve overall system performance in tactical environments.

Rice, R. F.↗
NASA NTRS1993

Locating Damaged Truss Members From Responses To Vibrations

Method of on-orbit assessment for location of damage based on use of capabilities of vibration-control system to measure vibrations in structure. Experiment involved use of laboratory scale-model truss structure exhibiting expected characteristics of truss structures proposed for large spacecraft. Vibrations excited in truss, and measurements of responses of structure used in series of two identification algorithms to produce mathematical model of structure in current condition, possibly containing damage. Similar methods considered for examining buildings for damage by earthquakes.

Smith, S. W.↗