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,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

SIRENA Software for Athena X-IFU Event Reconstruction

The X-ray Observatory Athena was proposed in April 2014 as the mission to implement the science theme "The Hot and Energetic Universe" selected by ESA for L2 (the second Large-class mission in ESAs Cosmic Vision science programme). One of the two X-ray detectors designed to be onboard Athena is X-IFU, a cryogenic microcalorimeter based on Transition Edge Sensor (TES) technology that will provide spatially resolved high-resolution spectroscopy. X-IFU will be developed by an international consortium led by IRAP (PI), SRON (co-PI) and IAPS/INAF (co-PI) and involving ESA Member States, Japan and the United States. In Spain, IFCA (CSIC-UC) has an anticipated contribution to X-IFU through the Digital Readout Electronics (DRE) unit, in particular in the Event Processor Subsytem. For this purpose and in collaboration with the Athena end-to-end simulations team, we are currently developing the SIRENA package as part of the publicly available SIXTE end-to-end simulator. SIRENA comprises a set of processing algorithms aimed at recognizing, from a noisy signal, the intensity pulses generated by the absorption of the X-ray photons, to lately reconstruct their energy, position and arrival time. This poster describes the structure of the package and the different algorithms currently implemented as well as their comparative performance in the energy resolution achieved in the reconstruction of the instrument events.

M T Ceballos↗
DOE OSTI2016

A fingerprint based metric for measuring similarities of crystalline structures

Measuring similarities/dissimilarities between atomic structures is important for the exploration of potential energy landscapes. However, the cell vectors together with the coordinates of the atoms, which are generally used to describe periodic systems, are quantities not directly suitable as fingerprints to distinguish structures. Based on a characterization of the local environment of all atoms in a cell, we introduce crystal fingerprints that can be calculated easily and define configurational distances between crystalline structures that satisfy the mathematical properties of a metric. This distance between two configurations is a measure of their similarity/dissimilarity and it allows in particular to distinguish structures. The new method can be a useful tool within various energy landscape exploration schemes, such as minima hopping, random search, swarm intelligence algorithms, and high-throughput screenings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1990

Acceleration and torque feedback for robotic control - Experimental results

Gross motion control of robotic manipulators typically requires significant on-line computations to compensate for nonlinear dynamics due to gravity, Coriolis, centripetal, and friction nonlinearities. One controller proposed by Luo and Saridis avoids these computations by feeding back joint acceleration and torque. This study implements the controller on a Puma 600 robotic manipulator. Joint acceleration measurement is obtained by measuring linear accelerations of each joint, and deriving a computationally efficient transformation from the linear measurements to the angular accelerations. Torque feedback is obtained by using the previous torque sent to the joints. The implementation has stability problems on the Puma 600 due to the extremely high gains inherent in the feedback structure. Since these high gains excite frequency modes in the Puma 600, the algorithm is modified to decrease the gain inherent in the feedback structure. The resulting compensator is stable and insensitive to high frequency unmodeled dynamics. Moreover, a second compensator is proposed which uses acceleration and torque feedback, but still allows nonlinear terms to be fed forward. Thus, by feeding the increment in the easily calculated gravity terms forward, improved responses are obtained. Both proposed compensators are implemented, and the real time results are compared to those obtained with the computed torque algorithm.

Mclnroy, John E.↗
DOE OSTI2022

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Microstructure Reconstruction of Sheet Molding Composite Using a Random Chips Packing Algorithm

Fiber-reinforced polymer composites are strong candidates for structural materials to replace steel and light alloys in lightweight vehicle design because of their low density and relatively high strength. In the integrated computational materials engineering (ICME) development of carbon fiber composites, microstructure reconstruction algorithms are needed to generate material microstructure representative volume element (RVE) based on the material processing information. The microstructure RVE reconstruction enables the material property prediction by finite element analysis (FEA)This paper presents an algorithm to reconstruct the microstructure of a chopped carbon fiber/epoxy laminate material system produced by compression molding, normally known as sheet molding compounds (SMC). The algorithm takes the result from material’s manufacturing process as inputs, such as the orientation tensor of fibers, the chopped fiber sheet geometry, and the fiber volume fraction. The chopped fiber sheets are treated as deformable rectangle chips and a random packing algorithm is developed to pack these chips into a square plate. The RVE is built in a layer-by-layer fashion until the desired number of lamina is reached, then a fine tuning process is applied to finalize the reconstruction. Compared to the previous methods, this new approach has the ability to model bended fibers by allowing limited amount of overlaps of rectangle chips. Furthermore, the method does not need SMC microstructure images, for which the image-based characterization techniques have not been mature enough, as inputs. Case studies are performed and the results show that the statistics of the reconstructed microstructures generated by the algorithm matches well with the target input parameters from processing.

Huang, Tianyu↗
NASA NTRS1989

An adaptive implicit/explicit finite element scheme for compressible viscous high speed flow

An adaptive implicit/explicit finite element procedure for the solution of three-dimensional problems of steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid-exhibiting structure in the normal direction is employed, while away from this region the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, solutions are obtained for the problems of shock-boundary layer interaction and shock-shock interaction on a swept cylindrical leading edge. Comparisons are made with experimental observations.

Hassan, O.↗
NASA NTRS1989

The simulation of 2D compressible viscous high speed flow by the finite element method

Am implicit/explicit procedure for the solution of problems of two-dimensional steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid which need only exhibit structure in the normal direction is employed while, away from this region, the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach, based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, problems of shock-boundary layer interaction and flow over a simulated forebody at high Mach number are included.

Hassan, O.↗
NASA NTRS1989

Analysis of whisker-toughened ceramic components - A design engineer's viewpoint

The analysis of components fabricated from whisker-toughened ceramic matrix composites requires a departure from the 'factor-of-safety' design philosophy prevalent in the design of metallic structural component, which are more tolerant of flaws. A public-domain computer algorithm has been developed which, in conjunction with a general-purposed FEM program, can predict the fast-fracture reliability of a structural component under multiaxial loading conditions. The present version of the algorithm, designated 'Toughened Ceramics Analysis and Reliability Evaluation of Structures', accounts for material symmetry imposed by whisker orientation; the processes of crack deflection and crack pinning are also addressed.

Duffy, Stephen F.↗
NASA NTRS1985

Modeling and analysis of pinhole occulter experiment: Initial study phase

The feasibility of using a generic simulation, TREETOPS, to simulate the Pinhole/Occulter Facility (P/OF) to be tested on the space shuttle was demonstrated. The baseline control system was used to determine the pointing performance of the P/OF. The task included modeling the structure as a three body problem (shuttle-instrument pointing system- P/OP) including the flexibility of the 32 meter P/OF boom. Modeling of sensors, actuators, and control algorithms was also required. Detailed mathematical models for the structure, sensors, and actuators are presented, as well as the control algorithm and corresponding design procedure. Closed loop performance using this controller and computer listings for the simulator are also given.

Vandervoort, R. J.↗
DOE OSTI2025

Predicting interface structure using the minima hopping method

Here, we adapt the minima hopping method (MHM) to the problem of interfacial structure prediction and apply it to study a canonical problem, the tilt grain boundaries in SrTiO 3 . Our method employs a hybrid approach by first exploring the potential energy surface (PES) of different grain boundary samplings with an empirical force field, among which the fifteen candidates with lower energies are then refined using ab initio density functional theory (DFT) calculations. During the exploratory stage, we bias the search using a local order parameter to primarily sample various reconstructions in the vicinity of the interface, while preserving the crystallinity of the bulk regions. We further enhance the search by incorporating initial structures with rigid body displacements to account for translational variations between bulk phases, enabling the MHM to effectively generate both stoichiometric and nonstoichiometric SrTiO 3 Σ⁢3(111)[110] and Σ⁢3(112)[110] grain boundaries. From an algorithmic standpoint, MHM outperforms earlier studies based on genetic algorithms (GA) by identifying more stable interfacial structures of several SrTiO 3 grain boundaries. The performance of the present implementation of the MHM approach is primarily limited by exploring an approximate description of the PES with a rather simple Buckingham potential. This limitation leads to variations in performance when compared to approaches utilizing more advanced surrogate PES models, such as direct DFT-PES sampling or GA with the embedded atom method (EAM). Despite the present limitations, the MHM approach is able to yield interfacial structures with comparable or lower interfacial energies in specific cases, such as Σ⁢3(111)[110] Γ=1, ±0.5 and Σ⁢3(112)[110] Γ= ±1, −2, underscoring the robustness of the MHM approach even with a simple approximation of the DFT PES. The MHM interfacial structure prediction method thus offers an efficient approach to understanding the grain boundaries and heterointerfaces at the atomic scale, providing an important prerequisite for effective materials design.

density functional theory↗
DOE OSTI2015

Integrated IO Services for Trilinos Data Structures

The Trilinos Project is an effort to develop algorithms and enabling technologies within an object- oriented software framework for the solution of large-scale, complex multi-physics engineering and scientific problems. A unique design feature of Trilinos is its focus on packages. While the abstractions make it easy to incorporate advanced processing and data manipulation tools, it is not always obvious how to take advantage of these features. The trios package incorporated two years ago offers general data management services, but has yet to offer integrated support for core Trilinos data structures, such as those offered in the Tpetra package. An initial attempt to incorporate native Trilinos data structure support into trios services revealed the complexity, from a non-mathematician's perspective, of using Trilinos. This project sought to understand the complexities and potential barriers not just for non-mathematicians that want to contribute to or use Trilinos, but potentially for new mathematically-inclined users as well that may want to offer services to support users. This report documents the challenges for trios to offer some simple data manipulation required as a precursor to any direct data services integration and makes recommendations for clarifying the performance implications and general approach to use.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

NMR_DIFFSIM v. 1.0

The software generates and analyzes nuclear magnetic resonance spin diffusion simulations for the purpose of measuring domain sizes or spin diffusion constants in a heterogenous sample. Its primary capabilities are: 1. It solves the spin magnetization diffusion equation to simulate the results of a spin diffusion experiment using any structural input geometry, including structure models generated by molecular dynamics or other computational or experimental methods. 2. It compares the results of simulations on an input structure to experimental data, providing a data fitting algorithm to extract physical information from the experimental data via the simulation. 3. It can provide statistical measures to compare correlations between structural models, to determine domain clustering and connectedness, and to provide goodness-of-fit measures including chord length distributions, chi-squared values, Pearson coefficients and pair correlation functions. 4. It provides output reports, data files, and movies to visualize simulation results.

Sorte, Eric↗
NASA NTRS1982

Application of the Hughes-LIU algorithm to the 2-dimensional heat equation

An implicit explicit algorithm for the solution of transient problems in structural dynamics is described. The method involved dividing the finite elements into implicit and explicit groups while automatically satisfying the conditions. This algorithm is applied to the solution of the linear, transient, two dimensional heat equation subject to an initial condition derived from the soluton of a steady state problem over an L-shaped region made up of a good conductor and an insulating material. Using the IIT/PRIME computer with virtual memory, a FORTRAN computer program code was developed to make accuracy, stability, and cost comparisons among the fully explicit Euler, the Hughes-Liu, and the fully implicit Crank-Nicholson algorithms. The Hughes-Liu claim that the explicit group governs the stability of the entire region while maintaining the unconditional stability of the implicit group is illustrated.

Malkus, D. S.↗
DOE OSTI2017

Fe-Cluster Compounds of Chalcogenides: Candidates for Rare-Earth-Free Permanent Magnet and Magnetic Nodal-Line Topological Material

Here, Fe-cluster-based crystal structures are predicted for chalcogenides Fe 3 X 4 (X = S, Se, Te) using an adaptive genetic algorithm. Topologically different from the well-studied layered structures of iron chalcogenides, the newly predicted structures consist of Fe clusters that are either separated by the chalcogen atoms or connected via sharing of the vertex Fe atoms. Additionally, using first-principles calculations, we demonstrate that these structures have competitive or even lower formation energies than the experimentally synthesized Fe 3 X 4 compounds and exhibit interesting magnetic and electronic properties. In particular, we show that Fe 3 X 4 can be a good candidate as a rare-earth-free permanent magnet and Fe 3 X 4 can be a magnetic nodal-line topological material.

36 MATERIALS SCIENCE↗
NASA NTRS1979

Control of large flexible space structures using pole placement design techniques

A design approach via the pole placement techniques for the class of large flexible space structures is developed. The numerical problems in pole placement algorithm, arising from large dimension systems and the extremely low frequency eigenvalues which occur in large space structure models are examined. It shows these numerical difficulties may be overcome by properly selecting the sensor/actuator locations and introducing a frequency scaling scheme. The concepts of this paper are illustrated by some numerical studies on the linear feedback control design of a representative large spacecraft consisting of a small rigid core with ten radial booms (five booms 1000 ft long and five shorter booms 700 ft long) lying in a plane.

Wu, Y. W.↗
NASA NTRS1984

Dual structural-control optimization of large space structures

A new approach is proposed for solving dual structural-control optimization problems for high-order flexible space structures where reduced-order structural models are employed. For a given initial structural dessign, a quadratic control cost is minimized subject to a constant-mass constraint. The sensitivity of the optimal control cost with respect to the stuctural design variables is then determined and used to obtain successive structural redesigns using a contrained gradient optimization algorithm. This process is repeated until the constrained control cost sensitivity becomes negligible. A numerical example is presented which demonstrates that this new approach effectively addresses the problem of dual optimization for potentially very high-order structures.

Messac, A.↗
NASA NTRS2004

Global Precipitation Measurement (GPM) Ground Validation: Plans and Preparations

The Global Precipitation Measurement (GPM) program is an international partnership led by the National Aeronautics and Space Administration (NASA) and the Japan Aerospace Exploration Agency (JAXA). GPM will improve climate, weather, and hydro-meteorological forecasts through more frequent and more accurate measurement of precipitation across the globe. This paper describes the concept, the planning, and the preparations for Ground Validation within the GPM program. Ground Validation (GV) plays an important role in the program by investigating and quantitatively assessing the errors within the satellite retrievals. These quantitative estimates of retrieval errors will assist the scientific community by bounding the errors within their research products. The two fundamental requirements of the GPM Ground Validation program are: (1) error characterization of the precipitation retrievals and (2) continual improvement of the satellite retrieval algorithms. These two driving requirements determine the measurements, instrumentation, and location for ground observations. This paper outlines GV plans for estimating the systematic and random components of retrieval error and for characterizing the spatial p d temporal structure of the error and plans for algorithm improvement in which error models are developed and experimentally explored to uncover the physical causes of errors within the retrievals. This paper discusses NASA locations for GV measurements as well as anticipated locations from international GPM partners. NASA's primary locations for validation measurements are an oceanic site at Kwajalein Atoll in the Republic of the Marshall Islands and a continental site in north-central Oklahoma at the U.S. Department of Energy's Atmospheric Radiation Measurement Program site.

Schwaller, M.↗
NASA NTRS2004

Closed Loop System Identification with Genetic Algorithms

High performance control design for a flexible space structure is challenging since high fidelity plant models are di.cult to obtain a priori. Uncertainty in the control design models typically require a very robust, low performance control design which must be tuned on-orbit to achieve the required performance. Closed loop system identi.cation is often required to obtain a multivariable open loop plant model based on closed-loop response data. In order to provide an accurate initial plant model to guarantee convergence for standard local optimization methods, this paper presents a global parameter optimization method using genetic algorithms. A minimal representation of the state space dynamics is employed to mitigate the non-uniqueness and over-parameterization of general state space realizations. This control-relevant system identi.cation procedure stresses the joint nature of the system identi.cation and control design problem by seeking to obtain a model that minimizes the di.erence between the predicted and actual closed-loop performance.

Whorton, Mark S.↗