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 883 records · Page 49

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗

Improvements to Stitching Controls for Manufacturing Advanced Stitched Composites

Stitched composites have been extensively studied and have been shown to have benefits over unstitched composites for stiffened structures, including improved damage tolerance, reduced weight, and fewer fasteners. These benefits make stitched composites attractive from a performance perspective, however, the nature of stitching the preforms prior to infusion includes additional manufacturing steps and equipment compared to conventional resin infusion. Stitching of composite material structures at NASA Langley Research Center (LaRC) is performed at the Integrated Structural Assembly of Advanced Composites (ISAAC) facility using control algorithms developed by the lead author. Two deficiencies have been identified in the current control algorithms, and mitigations for these deficiencies were developed within the Hi-Rate Composite Aircraft Manufacturing (HiCAM) project and are presented herein. First, decoupling stitch translation and rotation takes more time for stitching since two robot operation control steps are executed for each stitch. Therefore, a method was developed to determine when to decouple the translation and rotation for stitching, which reduces stitch time by decoupling the operation control steps only when necessary to execute the stitch properly. Second, a correction to the sideslip stitching approach that eliminates a significant portion of the pre- and post-stitching activities was developed. The developed method adjusts the sideslip stitch angle based on the rotations of previous stitches to ensure that the width of the stitching seam remains constant along its length. Constant seam width eliminates observed overlap of the insertion and catcher thread portions for highly curved paths, which maintains the desired uniformity of through-the-thickness architecture along the seam and eliminates the local degradation of properties where the insertion needle is too close to, or crosses, the catcher needle portion of the seam.

stitching↗

Comparison of two matrix data structures for advanced CSM testbed applications

The first section describes data storage schemes presently used by the Computational Structural Mechanics (CSM) testbed sparse matrix facilities and similar skyline (profile) matrix facilities. The second section contains a discussion of certain features required for the implementation of particular advanced CSM algorithms, and how these features might be incorporated into the data storage schemes described previously. The third section presents recommendations, based on the discussions of the prior sections, for directing future CSM testbed development to provide necessary matrix facilities for advanced algorithm implementation and use. The objective is to lend insight into the matrix structures discussed and to help explain the process of evaluating alternative matrix data structures and utilities for subsequent use in the CSM testbed.

Regelbrugge, M. E.↗

Smart Composite Overwrapped Pressure Vessel - Integrated Structural Health Monitoring System to Meet Space Exploration and International Space Station Mission Assurance Needs

Currently there are no integrated NDE methods for baselining and monitoring defect levels in fleet for Composite Overwrapped Pressure Vessels (COPVs) or related fracture critical composites, or for performing life-cycle maintenance inspections either in a traditional remove-and-inspect mode or in a more modern in situ inspection structural health monitoring (SHM) mode. Implicit in SHM and autonomous inspection is the existence of quantitative accept-reject criteria. To be effective, these criteria must correlate with levels of damage known to cause composite failure. Furthermore, implicit in SHM is the existence of effective remote sensing hardware and automated techniques and algorithms for interpretation of SHM data. SHM of facture critical composite structures, especially high pressure COPVs, is critical to the success of nearly every future NASA space exploration program as well as life extension of the International Space Station. It has been clearly stated that future NASA missions may not be successful without SHM [1]. Otherwise, crews will be busy addressing subsystem health issues and not focusing on the real NASA mission

Saulsberry, Regor↗

A generalized multiple-input, multiple-output modal parameter estimation algorithm

A new method for experimental determination of the modal parameters of a structure is presented. The method allows for multiple input forces to be applied simultaneously, and for an arbitrary number of acceleration response measurements to be employed. These data are used to form the equations of motion for a damped linear elastic structure. The modal parameters are then obtained through an eigenvalue technique. In conjunction with the development of the equations, an extensive computer simulation study was performed. The results of the study show a marked improvement in the mode shape identification for closely-spaced modes as the number of applied forces is increased. Also demonstrated is the influence of noise on the method's ability to identify accurate modal parameters. Here again, an increase in the number of exciters leads to a significant improvement in the identified parameters.

Craig, R. R., Jr.↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAFT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAFT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗

SYNTHESIS OF NOVEL ALL-DIELECTRIC GRATING FILTERS USING GENETIC ALGORITHMS

We are concerned with the design of inhomogeneous, all dielectric (lossless) periodic structures which act as filters. Dielectric filters made as stacks of inhomogeneous gratings and layers of materials are being used in optical technology, but are not common at microwave frequencies. The problem is then finding the periodic cell's geometric configuration and permittivity values which correspond to a specified reflectivity/transmittivity response as a function of frequency/illumination angle. This type of design can be thought of as an inverse-source problem, since it entails finding a distribution of sources which produce fields (or quantities derived from them) of given characteristics. Electromagnetic sources (electric and magnetic current densities) in a volume are related to the outside fields by a well known linear integral equation. Additionally, the sources are related to the fields inside the volume by a constitutive equation, involving the material properties. Then, the relationship linking the fields outside the source region to those inside is non-linear, in terms of material properties such as permittivity, permeability and conductivity. The solution of the non-linear inverse problem is cast here as a combination of two linear steps, by explicitly introducing the electromagnetic sources in the computational volume as a set of unknowns in addition to the material unknowns. This allows to solve for material parameters and related electric fields in the source volume which are consistent with Maxwell's equations. Solutions are obtained iteratively by decoupling the two steps. First, we invert for the permittivity only in the minimization of a cost function and second, given the materials, we find the corresponding electric fields through direct solution of the integral equation in the source volume. The sources thus computed are used to generate the far fields and the synthesized triter response. The cost function is obtained by calculating the deviation between the synthesized value of reflectivity/transmittivity and the desired one. Solution geometries for the periodic cell are sought as gratings (ensembles of columns of different heights and widths), or combinations of homogeneous layers of different dielectric materials and gratings. Hence the explicit unknowns of the inversion step are the material permittivities and the relative boundaries separating homogeneous parcels of the periodic cell.

Zuffada, Cinzia↗

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

Optimal design of composite hip implants using NASA technology

Using an adaptation of NASA software, we have investigated the use of numerical optimization techniques for the shape and material optimization of fiber composite hip implants. The original NASA inhouse codes, were originally developed for the optimization of aerospace structures. The adapted code, which was called OPORIM, couples numerical optimization algorithms with finite element analysis and composite laminate theory to perform design optimization using both shape and material design variables. The external and internal geometry of the implant and the surrounding bone is described with quintic spline curves. This geometric representation is then used to create an equivalent 2-D finite element model of the structure. Using laminate theory and the 3-D geometric information, equivalent stiffnesses are generated for each element of the 2-D finite element model, so that the 3-D stiffness of the structure can be approximated. The geometric information to construct the model of the femur was obtained from a CT scan. A variety of test cases were examined, incorporating several implant constructions and design variable sets. Typically the code was able to produce optimized shape and/or material parameters which substantially reduced stress concentrations in the bone adjacent of the implant. The results indicate that this technology can provide meaningful insight into the design of fiber composite hip implants.

Blake, T. A.↗

Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes

The Advisory Group for Aerospace Research and Development (AGARD) has requested my participation in the lecture series entitled Parallel Computing in Computational Fluid Dynamics to be held at the von Karman Institute in Brussels, Belgium on May 15-19, 1995. In addition, a request has been made from the US Coordinator for AGARD at the Pentagon for NASA Ames to hold a repetition of the lecture series on October 16-20, 1995. I have been asked to be a local coordinator for the Ames event. All AGARD lecture series events have attendance limited to NATO allied countries. A brief of the lecture series is provided in the attached enclosure. Specifically, I have been asked to give two lectures of approximately 75 minutes each on the subject of parallel solution techniques for the fluid flow equations on unstructured meshes. The title of my lectures is "Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes" (Parts I-II). The contents of these lectures will be largely review in nature and will draw upon previously published work in this area. Topics of my lectures will include: (1) Mesh partitioning algorithms. Recursive techniques based on coordinate bisection, Cuthill-McKee level structures, and spectral bisection. (2) Newton's method for large scale CFD problems. Size and complexity estimates for Newton's method, modifications for insuring global convergence. (3) Techniques for constructing the Jacobian matrix. Analytic and numerical techniques for Jacobian matrix-vector products, constructing the transposed matrix, extensions to optimization and homotopy theories. (4) Iterative solution algorithms. Practical experience with GIVIRES and BICG-STAB matrix solvers. (5) Parallel matrix preconditioning. Incomplete Lower-Upper (ILU) factorization, domain-decomposed ILU, approximate Schur complement strategies.

Barth, Timothy J.↗

Goddard Latent Heating (LH) Retrieval Algorithm

Rainfall production is a fundamental process within the Earth's hydrological cycle because it represents both a principal forcing term in surface water budgets, and its energetics corollary, latent heating, is the principal source of atmospheric diabatic heating. Latent heat release itself is a consequence of phase changes between the vapor, liquid, and frozen states of water. The properties of the vertical distribution of latent heat release modulate large-scale meridional and zonal circulations within the Tropics - as well as modify the energetic efficiencies of mid-latitude weather systems. This paper highlights the retrieval of latent heat release from satellite measurements generated by the Tropical Rainfall Measuring Mission (TRMM) and Global Precipitation Mission (GPM) satellite observatory, which were launched in November 1997 and February 2014, respectively. Both TRMM and GPM measurements have been providing an accurate four-dimensional account of rainfall over the global Tropics and mid-latitudes: information that can be used to estimate the space-time structure of latent heating. Two sets of latent heating retrieval algorithm methodologies (Goddard Convective-Stratiform or CSH, and Japan Spectral Latent Heating or SLH) have been developed to estimate latent heating based on rain rate profile retrievals obtained from TRMM and GPM measurements. The CSH algorithm will be described followed by a discussion its improvements and performance against the combined derived surface ran rates. We will also present the CSH retrieved LH for TRMM and GPM.

Tao, Wei-Kuo↗

Follow on Researches for X-56A Aircraft at NASA Dryden Flight Research Center (Progress Report)

A lot of composite materials are used for the modern aircraft to reduce its weight. Aircraft aeroservoelastic models are typically characterized by significant levels of model parameter uncertainty due to composite manufacturing process. Small modeling errors in the finite element model will eventually induce errors in the structural flexibility and mass, thus propagating into unpredictable errors in the unsteady aerodynamics and the control law design. One of the primary objectives of X-56A aircraft is the flight demonstration of active flutter suppression, and therefore in this study, the identification of the primary and secondary modes is based on the flutter analysis of X-56A aircraft. It should be noted that for all three Mach number cases rigid body modes and mode numbers seven and nine are participated 89.1 92.4 % of the first flutter mode. Modal participation of the rigid body mode and mode numbers seven and nine for the second flutter mode are 94.6 96.4%. Rigid body mode and the first two anti-symmetric modes, eighth and tenth modes, are participated 93.2 94.6% of the third flutter mode. Therefore, rigid body modes and the first four flexible modes of X-56A aircraft are the primary modes during the model tuning procedure. The ground vibration test-validated structural dynamic finite element model of the X-56A aircraft is to obtain in this study. The structural dynamics finite element model of X-56A aircraft is improved using the parallelized big-bang big-crunch algorithm together with a hybrid optimization technique.

Structural Dynamic Model Tuning↗

A comparison of refined models for flexible subassemblies

Interactions between structure response and control of large flexible space systems have challenged current modeling techniques and have prompted development of new techniques for model improvement. Due to the geometric complexity of envisioned large flexible space structures, finite element models (FEM's) will be used to predict the dynamic characteristics of structural components. It is widely accepted that these models must be experimentally 'validated' before their acceptance as the basis for final design analysis. However, predictions of modal properties (natural frequencies, mode shapes, and damping ratios) are often in error when compared to those obtained from Experimental Modal Analysis (EMA). Recent research efforts have resulted in the development of algorithmic approaches for model improvement, also referred to as system or structure identification.

Smith, Suzanne Weaver↗

Development of a Multilevel Optimization Approach to the Design of Modern Engineering Systems

A general algorithm is proposed which carries out the design process iteratively, starting at the top of the hierarchy and proceeding downward. Each subproblem is optimized separately for fixed controls from higher level subproblems. An optimum sensitivity analysis is then performed which determines the sensitivity of the subproblem design to changes in higher level subproblem controls. The resulting sensitivity derivatives are used to construct constraints which force the controlling subproblems into chosing their own designs so as to improve the lower levels subproblem designs while satisfying their own constraints. The applicability of the proposed algorithm is demonstrated by devising a four-level hierarchy to perform the simultaneous aerodynamic and structural design of a high-performance sailplane wing for maximum cross-country speed. Finally, the concepts discussed are applied to the two-level minimum weight structural design of the sailplane wing. The numerical experiments show that discontinuities in the sensitivity derivatives may delay convergence, but that the algorithm is robust enough to overcome these discontinuities and produce low-weight feasible designs, regardless of whether the optimization is started from the feasible space or the infeasible one.

Barthelemy, J. F. M.↗