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 1,711 records · Page 95

Relaxation algorithms for matrix completion, with applications to seismic travel-time data interpolation

Travel time tomography is used to infer the underlying three-dimensional wavespeed structure of the Earth by fitting seismic travel time data collected at surface stations. Data interpolation and denoising techniques are important pre-processing steps that use prior knowledge about the data, including parsimony in the frequency and wavelet domains, low-rank structure of matricizations, and local smoothness. In this work, we show how local smoothness structure can be combined with low rank constraints using level-set optimization formulations, and develop a new relaxation algorithm that can efficiently solve these joint problems. In the seismology setting, we use the approach to interpolate missing stations and de-noise observed stations. The new approach is competitive with alternative algorithms, and offers new functionality to interpolate observed data using both smoothness and low rank structure in the presence of data fitting constraints.

constrained optimization↗

System for Configuring Modular Telemetry Transponders

A system for configuring telemetry transponder cards uses a database of error checking protocol data structures, each containing data to implement at least one CCSDS protocol algorithm. Using a user interface, a user selects at least one telemetry specific error checking protocol from the database. A compiler configures an FPGA with the data from the data structures to implement the error checking protocol.

Varnavas, Kosta A.↗

Implementation of a block Lanczos algorithm for eigenproblem solution of gyroscopic systems

This paper describes the details of implementation of a general numerical procedure developed for the accurate and economical computation of natural frequencies and associated modes of any elastic structure rotating along an arbitrary axis. A block version of the Lanczos algorithm is derived for the solution that fully exploits associated matrix sparsity and employs only real numbers in all relevant computations. It is also capable of determining multiple roots and proves to be most efficient when compared to other, similar, existing techniques.

Gupta, K. K.↗

Specification of inputs and instrumentation for flutter testing of multivariable systems

The application of system identification methods in flutter testing of aeroelastic structure is discussed. The accuracy with which flutter parameters are estimated depends upon the test plan and on the algorithms used to reduce the data. The techniques for selecting the kinds and optimal positions of inputs and instrumentation, under typical test constraints, are presented. Identification results for both the input/output transfer function and the value of physical parameters are given. Numerical results on the optimal input spectrum and the accelerometer location for estimating flutter parameters of a two dimensional wing are obtained using these algorithms. Current work on applying system identification methods to high order three dimensional aeroelastic structures is reported.

Gupta, N. K.↗

Wave forecast and its application to the optimal control of offshore floating wind turbine for load mitigation

Control algorithms play an important role in energy capture and load mitigation for offshore floating wind turbines (OFWTs). One of the advanced and effective control techniques is the feedforward or model predictive control approach, which requires the forecast of incoming environment conditions. For OFWTs, wave loading is one of the dominant sources to excite structural responses. This study is thus motivated to develop forecasting algorithms for wave elevations and wave excitation forces with the purpose of applying feedforward controllers on OFWTs. Two forecasting algorithms, the approximate Prony Method based on ESPRIT (Estimation of Signal Parameters via Rotational Invariance Techniques) and SVM (Support Vector Machine) regression, are developed and validated using wave records from tank tests. Utilizing the forecasted wave elevations and wave excitation forces, a feedforward LQR controller is designed to mitigate structural loads of an OFWT system.

17 WIND ENERGY↗

Grid sensitivity for aerodynamic optimization and flow analysis

After reviewing relevant literature, it is apparent that one aspect of aerodynamic sensitivity analysis, namely grid sensitivity, has not been investigated extensively. The grid sensitivity algorithms in most of these studies are based on structural design models. Such models, although sufficient for preliminary or conceptional design, are not acceptable for detailed design analysis. Careless grid sensitivity evaluations, would introduce gradient errors within the sensitivity module, therefore, infecting the overall optimization process. Development of an efficient and reliable grid sensitivity module with special emphasis on aerodynamic applications appear essential. The organization of this study is as follows. The physical and geometric representations of a typical model are derived in chapter 2. The grid generation algorithm and boundary grid distribution are developed in chapter 3. Chapter 4 discusses the theoretical formulation and aerodynamic sensitivity equation. The method of solution is provided in chapter 5. The results are presented and discussed in chapter 6. Finally, some concluding remarks are provided in chapter 7.

Sadrehaghighi, I.↗

Topological grid structure - A data structure for earth science modeling

The automated analysis of land surface features is increasingly important to earth scientists. User-friendly algorithms for studying these features can be integrated into geographic information systems through the use of topological grid structure, which maintains the simplicity and transportability of standard grid structure while providing the essential capability to treat groups of contiguous, identically-classified pixels (corresponding to lakes, forests, fields, etc.) as distinct spatial entities.

Goldberg, M.↗

Low-rank factorization of electron integral tensors and its application in electronic structure theory

In this letter, we introduce the reverse Cuthill-McKee (RCM) algorithm, which is often used for the bandwidth reduction of sparse tensors, to transform the two-electron integral tensors to their block diagonal forms. By further applying the pivoted Cholesky decomposition (CD) on each of the diagonal blocks, we are able to represent the high-dimensional two-electron integral tensors in terms of permutation matrices and low-rank Cholesky vectors. This representation facilitates the low-rank factorization of the high-dimensional tensor contractions that are usually encountered in post-Hartree-Fock calculations. In this letter, we discuss the second-order Møller-Plesset (MP2) method and linear coupled- cluster model with doubles (L-CCD) as two simple examples to demonstrate the efficiency of the RCM-CD technique in representing two-electron integrals in a compact form.

electronic structure theory↗

Drop Size Distribution Measurements Supporting the NASA Global Precipitation Measurement Mission: Infrastructure and Preliminary Results

Global Precipitation Measurement Mission (GPM) retrieval algorithm validation requires datasets that characterize the 4-D structure, variability, and correlation properties of hydrometeor particle size distributions (PSD) and accumulations over satellite fields of view (5 -- 50 km). Key to this process is the combined use of disdrometer and polarimetric radar platforms. Here the disdrometer measurements serve as a reference for up-scaling dual-polarimetric radar observations of the PSD to the much larger volumetric sampling domain of the radar. The PSD observations thus derived provide a much larger data set for assessing DSD variability, and satellite-based precipitation retrieval algorithm assumptions, in all three spatial dimensions for a range of storm types and seasons. As one component of this effort, the GPM Ground Validation program recently acquired five 3rd generation 2D Video disdrometers as part of its Disdrometer and Radar Observations of Precipitation Facility (DROP), currently hosted in northern Alabama by the NASA Marshall Space Flight Center and the University of Alabama in Huntsville. These next-generation 2DVDs were operated and evaluated in different phases of data collection under the scanning domain of the UAH ARMOR C-band dual-polarimetric radar. During this period approximately 7500 minutes of PSD data were collected and processed to create gamma size distribution parameters using a truncated method of moments approach. After creating the gamma parameter datasets the DSDs were then used as input to T-matrix code for computation of polarimetric radar moments at C-band. The combined dataset was then analyzed with two basic objectives in mind: 1) the investigation of seasonal variability in the rain PSD parameters as observed by the 2DVDs; 2) the use of combined polarimetric moments and observed gamma distribution parameters in a functional form to retrieve PSD parameters in 4-D using the ARMOR radar for precipitation occurring in different seasons and for different rain system types. Preliminary results suggest that seasonal variations in the DSD parameters do occur, but are most pronounced when comparing tropical PSDs to either winter or summer convective precipitation. For example the previously documented shift to relatively smaller drop diameters in higher number concentrations for equivalent rain rate bins was observed in tropical storm rainbands occurring over Huntsville. On a more inter seasonal basis empirical fits between parameters such as D0 and ZDR do not appear to exhibit robust seasonal biases- i.e., one fit seems to work for all seasons within acceptable standard error (O[10%]) for estimates of D0. In polarimetric retrievals of the vertical variability in PSD (rain layer) for a tropical rainband we find that the Do varies with height when partitioned by specified precipitation categories (e.g., convective or stratiform, heavy and light stratiform etc.) but this variation is of order 10-20% and is smaller than the difference in D0 observed between the basic delineation of convective and stratiform precipitation types. Currently we are expanding our analysis of the vertical structure of the PSD to include several seasonally and/or dynamically-different storm system types (e.g., winter convection and stratiform events; summer mid-latitude convective etc.) sampled by ARMOR. The study will present the results of our combined analyses.

Petersen, Walter A.↗

Machine Learning for Dynamic Test Sensor Placement

There are multiple different algorithms to perform modal test sensor placement optimization: effective independence, residual kinetic energy, iterative Guyan reduction, genetic algorithms, or a brute-force methodology. However, any of these methods may be computationally expensive, especially for structural models with a large number of degrees of freedom. Given the high-cost and the need to optimize the solution, modal sensor placement is a great application for machine learning (ML) algorithms. In this paper, we will apply ML algorithms to determine the optimal sensor locations for simple and complex structures. We will also discuss the benefits and drawbacks of using machine learning over other sensor placement algorithms.

Kelsey Buckles↗

Sequential square root filtering and smoothing of discrete linear systems

A square root information filter/smoother is derived using recursive least-squares arguments. The combined filter/smoother algorithm has the following attributes: (1) it has a square root structure, which enhances numerical accuracy; (2) filter and smoother mechanizations are identical in form, facilitating implementation of the smoother; and (3) storage and computation requirements are modest compared with other smoothing algorithms. Partitioning the results to separate bias parameters provides further computational economies and reduction of storage requirements.

Bierman, G. J.↗

Complex Electronic Structure of Rare Earth Activators in Scintillators

To aid and further the understanding of the microscopic mechanisms behind the scintillator nonproportionality that leads to degradation of the attainable energy resolution, we have developed theoretical and experimental algorithms and procedures to determine the position of the 4f energy levels of rare earth dopants relative to the host band edge states.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TPS In-Flight Health Monitoring Project Progress Report

Progress in the development of new thermal protection systems (TPS) is reported. New approaches use embedded lightweight, sensitive, fiber optic strain and temperature sensors within the TPS. Goals of the program are to develop and demonstrate a prototype TPS health monitoring system, develop a thermal-based damage detection algorithm, characterize limits of sensor/system performance, and develop ea methodology transferable to new designs of TPS health monitoring systems. Tasks completed during the project helped establish confidence in understanding of both test setup and the model and validated system/sensor performance in a simple TPS structure. Other progress included complete initial system testing, commencement of the algorithm development effort, generation of a damaged thermal response characteristics database, initial development of a test plan for integration testing of proven FBG sensors in simple TPS structure, and development of partnerships to apply the technology.

Kostyk, Chris↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

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.↗

Ecological applications of high resolution spectrometry

Future directions of NASA's space program plans include a significant effort at studying the Earth as a system of interrelated ecosystems. As part of NASA's Earth Observing System (Eos) Program a series of space platforms will be launched and operated to study the Earth with a variety of active and passive instruments. Several of the Eos instruments will be capable of imaging the planet's surface reflectance on a large number of very narrow portions of the solar spectrum. After the development of appropriate algorithms, this reflectance information will be used to determine key parameters about the structure and function of terrestrial and aquatic ecosystems and the pattern and processes of those systems across large areas of the globe. Algorithm development applicable to terrestrial systems will permit the inference of ecological processes from high resolution spectrometry data, similar to that to be forthcoming from the Eos mission. The first summer was spent working with tropical soils and relating their reflectance characteristics to particle size, iron content, and color. This summer the emphasis is on vegetation and work was begun with the Forest Ecosystems Dynamics Project in the Earth Resources Branch where both optical and radar characteristics of a mixed conifer/hardwood forest in Maine are being studied for use in a ecological modeling effort. A major series of aircraft overflights will take place throughout the summer. Laboratory and field spectrometers are used to measure the spectral reflectance of a hierarchy of vegetation from individual leaves to whole canopies for eventual modeling of their nutrient content using reflectance data. Key leaf/canopy parameters are being approximated including chlorophyll, nitrogen, phosphorus, water content, and leaf specific weight using high resolution spectrometry alone. Measurements are made of carbon exchange across the landscape for input to a spatial modeling effort to gauge production within the forest. A Geographic Information System approach is used to associate these data, images, and other collateral information for the forest into a database with a common projection suitable for spatial modeling.

Lawrence, William T.↗

A space-time parallel algorithm with adaptive mesh refinement for computational fluid dynamics

This work describes a space-time parallel algorithm with space-time adaptive mesh refinement (AMR). AMR with subcycling is added to multigrid reduction-in-time (MGRIT) in order to provide solution efficient adaptive grids with a reduction in work performed on coarser grids. This algorithm is achieved by integrating two software libraries: XBraid (Parallel time integration with multigrid. https://computation.llnl.gov/projects/parallel-timeintegration-multigrid) and Chombo (Chombo software package for AMR applications—design document, 2014). The former is a parallel time integration library using multigrid and the latter is a massively parallel structured AMR library. Employing this adaptive space-time parallel algorithm is Chord (Comput Fluids 123:202–217, 2015), a computational fluid dynamics (CFD) application code for solving compressible fluid dynamics problems. For the same solution accuracy, speedups are demonstrated from the use of space-time parallelization over the time-sequential integration on Couette flow and Stokes’ second problem. On a transient Couette flow case, at least a 1.5× speedup is achieved, and with a time periodic problem, a speedup of up to 13.7× over the time-sequential case is obtained. In both cases, the speedup is achieved by adding processors and exploring additional parallelization in time. The numerical experiments show the algorithm is promising for CFD applications that can take advantage of the time parallelism. Future work will focus on improving the parallel performance and providing more tests with complex fluid dynamics to demonstrate the full potential of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Adaptive-Control Experiments On A Large Flexible Structure

Antennalike flexible structure built for research in advanced technology including suppression of vibrations and control of initial deflections. Structure instrumented with sensors and actuators connected to digital electronic control system, programmed with control algorithms to be tested. Particular attention in this research focused on direct model-reference adaptive-control algorithm based on command generator tracker theory. Built to exhibit multiple vibrational modes, low modal frequencies, and low structural damping. Made three-dimensional so complicated interactions among components of structure and control system investigated.

Ih, Che-Hang C.↗