Development of an algorithm for the nonlinear stability analysis of the orbiting astronomical observatory control system
Stability analysis algorithm for estimating equilibrium state of OAO control system
Cohen, V.↗
SEARCH · Search NASA
Results for “Algorithm Development”
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.
Development of an algorithm for the stability analysis of a nonlinear precision attitude control system
Nonlinear precision attitude control system stability analysis algorithm based on quadratic Liapunov function
Chomas, A.↗
Effects of aircraft and flight parameters on energy-efficient profile descents in time-based metered traffic
Concepts to save fuel while preserving airport capacity by combining time based metering with profile descent procedures were developed. A computer algorithm is developed to provide the flight crew with the information needed to fly from an entry fix to a metering fix and arrive there at a predetermined time, altitude, and airspeed. The flight from the metering fix to an aim point near the airport was calculated. The flight path is divided into several descent and deceleration segments. Descents are performed at constant Mach numbers or calibrated airspeed, whereas decelerations occur at constant altitude. The time and distance associated with each segment are calculated from point mass equations of motion for a clean configuration with idle thrust. Wind and nonstandard atmospheric properties have a large effect on the flight path. It is found that uncertainty in the descent Mach number has a large effect on the predicted flight time. Of the possible combinations of Mach number and calibrated airspeed for a descent, only small changes were observed in the fuel consumed.
Dejarnette, F. R.↗
Algorithms for Software Development
Management aid makes changes obvious. One key element in scheme for software development control is check summing. If check sum for given line in source file is different from previous version, it is evident change has been made. Subsequent editing of file creates new lines, deletes old ones, modifies characters, moves lines, or copies (reuse) existing lines. Combination of three elements of line code permits all transactions to be detected.
Tausworthe, R. C.↗
High resolution imaging
Diffraction-limited telescopic observations were obtained of solar system objects and a program of research into Uranus, Neptune, Pluto and the asteroids based upon the data obtained was persued. Two camera systems appropriate for this work were developed. Most importantly, the PAPA photon address camera was developed and proven. Algorithms were developed for both phase and amplitude recovery and were validated on theoretical and laboratory data and to a limited extent on telescopic data. A laboratory simulator was constructed that was used for development but is also available for controlled investigation of image reconstruction. During 1985 two successful expeditions were made to Hawaii and Cerro Tololo and a large body of data on Pluto, Uranus, Neptune and two asteroids are on tape.
Goody, R.↗
Development of parallel algorithms for electrical power management in space applications
The application of parallel techniques for electrical power system analysis is discussed. The Newton-Raphson method of load flow analysis was used along with the decomposition-coordination technique to perform load flow analysis. The decomposition-coordination technique enables tasks to be performed in parallel by partitioning the electrical power system into independent local problems. Each independent local problem represents a portion of the total electrical power system on which a loan flow analysis can be performed. The load flow analysis is performed on these partitioned elements by using the Newton-Raphson load flow method. These independent local problems will produce results for voltage and power which can then be passed to the coordinator portion of the solution procedure. The coordinator problem uses the results of the local problems to determine if any correction is needed on the local problems. The coordinator problem is also solved by an iterative method much like the local problem. The iterative method for the coordination problem will also be the Newton-Raphson method. Therefore, each iteration at the coordination level will result in new values for the local problems. The local problems will have to be solved again along with the coordinator problem until some convergence conditions are met.
Berry, Frederick C.↗
On the development of efficient algorithms for three dimensional fluid flow
The difficulties of constructing efficient algorithms for three-dimensional flow are discussed. Reasonable candidates are analyzed and tested, and most are found to have obvious shortcomings. Yet, there is promise that an efficient class of algorithms exist between the severely time-step sized-limited explicit or approximately factored algorithms and the computationally intensive direct inversion of large sparse matrices by Gaussian elimination.
Maccormack, R. W.↗
New developments in astrodynamics algorithms for autonomous rendezvous
A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.
Klumpp, Allan R.↗
Improving stability and strength characteristics of framed structures with nonlinear behavior
In this paper an optimal design procedure is introduced to improve the overall performance of nonlinear framed structures. The design methodology presented here is a multiple-objective optimization procedure whose objective functions involve the buckling eigenvalues and eigenvectors of the structure. A constant volume with bounds on the design variables is used in conjunction with an optimality criterion approach. The method provides a general tool for solving complex design problems and generally leads to structures with better limit strength and stability. Many algorithms have been developed to improve the limit strength of structures. In most applications geometrically linear analysis is employed with the consequence that overall strength of the design is overestimated. Directly optimizing the limit load of the structure would require a full nonlinear analysis at each iteration which would be prohibitively expensive. The objective of this paper is to develop an algorithm that can improve the limit-load of geometrically nonlinear framed structures while avoiding the nonlinear analysis. One of the novelties of the new design methodology is its ability to efficiently model and design structures under multiple loading conditions. These loading conditions can be different factored loads or any kind of loads that can be applied to the structure simultaneously or independently. Attention is focused on optimal design of space framed structures. Three-dimensional design problems are more complicated to carry out, but they yield insight into real behavior of the structure and can help avoiding some of the problems that might appear in planar design procedure such as the need for out-of-plane buckling constraint. Although researchers in the field of structural engineering generally agree that optimum design of three-dimension building frames especially in the seismic regions would be beneficial, methods have been slow to emerge. Most of the research in this area has dealt with the optimization of truss and plane frame structures.
Pezeshk, Shahram↗
Development of homotopy algorithms for fixed-order mixed H2/H(infinity) controller synthesis
A major difficulty associated with H-infinity and mu-synthesis methods is the order of the resulting compensator. Whereas model and/or controller reduction techniques are sometimes applied, performance and robustness properties are not preserved. By directly constraining compensator order during the optimization process, these properties are better preserved, albeit at the expense of computational complexity. This paper presents a novel homotopy algorithm to synthesize fixed-order mixed H2/H-infinity compensators. Numerical results are presented for a four-disk flexible structure to evaluate the efficiency of the algorithm.
Whorton, M.↗
Recent Development of Multigrid Algorithms for Mixed and Noncomforming Methods for Second Order Elliptical Problems
Multigrid algorithms for nonconforming and mixed finite element methods for second order elliptic problems on triangular and rectangular finite elements are considered. The construction of several coarse-to-fine intergrid transfer operators for nonconforming multigrid algorithms is discussed. The equivalence between the nonconforming and mixed finite element methods with and without projection of the coefficient of the differential problems into finite element spaces is described.
Chen, Zhangxin↗
JPL Developments in Retrieval Algorithms for Geostationary Observations - Applications to H2CO
JPL has strong expertise in atmospheric retrievals from UV and thermal IR, and a wide range of tools to apply to observations and instrument characterization. Radiative Transfer, AMF, Inversion, Fitting, Assimilation. Tools were applied for a preliminary study of H2CO sensitivities from GEO. Results show promise for moderate/strong H2CO lading but also that low background conditions will prove a challenge. H2CO DOF are not too strongly dependent on FWHM. GEMS (Geostationary Environmental Monitoring Spectrometer) choice of 0.6 nm FWHM (?) spectral resolution is adequate for H2CO retrievals. Case study can easily be adapted to GEMS observations/instrument model for more in-depth sensitivity characterization.
radiative transfer modeling↗
Microphysical Retrievals from Simultaneous Measurements by Airborne and Ground Radars during OLYMPEX
The OLYMPEX field campaign took place over the Olympic Peninsula of Washington during winter 2015-2016. During the intensive observing period, several aircraft flights obtained multi-frequency airborne radar measurements at X-, Ku-, Ka, and W-band from radars aboard the ER-2 and DC-8 aircraft. In addition, ground radars at S- and X-band performed RHI scans under the aircraft ground tracks. These coincident datasets provide a wealth of complementary information about the hydrometeor particle sizes, shapes, and orientations.In order to synthesize these measurements and test the robustness of scattering models, an optimal estimation retrieval based upon a Hitschfeld-Bordan profiling algorithm has been developed. This algorithm retrieves profiles of the particle size distribution parameters Nw and Dm, and, in the ice phase, relative proportions of aggregate, pristine, and rimed particles, using scattering models with different size-density and size-aspect ratio relationships. Under this formulation, only the pristine particles are horizontally aligned and capable of producing non-zero ZDR and KDP.From the nadir-looking airborne multifrequency radars, we find that aggregates may be readily distinguished from rimed and pristine particles owing to their uniqueness in triple-frequency space. However, rimed and pristine particles occupy a similar region in this space and thus polarimetric measurements greatly enhance their identification in our retrieval framework. With these capabilities we will present analyses of three-dimensional hydrometeor mapping obtained during various OLYMPEX cases. Some features retrieved in these cases include a layer of enhanced aggregation about 2km above the melting layer, hypothesized to be maintained by orographic uplift. This layer is often situated above a layer of denser, aligned particles. Regions of riming and supercooled liquid water beneath generating cells are also identified by our retrieval algorithm. Comparisons to in-situ observations and evaluation of scattering models will be presented.
Munchak, S. Joseph↗
Control Algorithms and Simulated Environment Developed and Tested for Multiagent Robotics for Autonomous Inspection of Propulsion Systems
The NASA Glenn Research Center and academic partners are developing advanced multiagent robotic control algorithms that will enable the autonomous inspection and repair of future propulsion systems. In this application, on-wing engine inspections will be performed autonomously by large groups of cooperative miniature robots that will traverse the surfaces of engine components to search for damage. The eventual goal is to replace manual engine inspections that require expensive and time-consuming full engine teardowns and allow the early detection of problems that would otherwise result in catastrophic component failures. As a preliminary step toward the long-term realization of a practical working system, researchers are developing the technology to implement a proof-of-concept testbed demonstration. In a multiagent system, the individual agents are generally programmed with relatively simple controllers that define a limited set of behaviors. However, these behaviors are designed in such a way that, through the localized interaction among individual agents and between the agents and the environment, they result in self-organized, emergent group behavior that can solve a given complex problem, such as cooperative inspection. One advantage to the multiagent approach is that it allows for robustness and fault tolerance through redundancy in task handling. In addition, the relatively simple agent controllers demand minimal computational capability, which in turn allows for greater miniaturization of the robotic agents.
Wong, Edmond↗
Parallel algorithms and architecture for computation of manipulator forward dynamics
Parallel computation of manipulator forward dynamics is investigated. Considering three classes of algorithms for the solution of the problem, that is, the O(n), the O(n exp 2), and the O(n exp 3) algorithms, parallelism in the problem is analyzed. It is shown that the problem belongs to the class of NC and that the time and processors bounds are of O(log2/2n) and O(n exp 4), respectively. However, the fastest stable parallel algorithms achieve the computation time of O(n) and can be derived by parallelization of the O(n exp 3) serial algorithms. Parallel computation of the O(n exp 3) algorithms requires the development of parallel algorithms for a set of fundamentally different problems, that is, the Newton-Euler formulation, the computation of the inertia matrix, decomposition of the symmetric, positive definite matrix, and the solution of triangular systems. Parallel algorithms for this set of problems are developed which can be efficiently implemented on a unique architecture, a triangular array of n(n+2)/2 processors with a simple nearest-neighbor interconnection. This architecture is particularly suitable for VLSI and WSI implementations. The developed parallel algorithm, compared to the best serial O(n) algorithm, achieves an asymptotic speedup of more than two orders-of-magnitude in the computation the forward dynamics.
Fijany, Amir↗
Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm
The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.
Mavriplis, Dimitri J.↗
Improving unfolding and systematic uncertainty estimation using generative diffusion networks (Final Technical Report)
This final technical report summarizes the key accomplishments on the unfolding using diffusion model project, a DOE award received by PI Pierre-Hugues Beauchemin at Tufts University. This project main goal was to investigate the potential of diffusion models for unfolding experimental High Energy Physics data from detector effects while controlling systematics uncertainties. The project accomplished its goals by completing the following objectives: 1) Performing an object-by-object, event-by-event unfolding of various kinematic distributions reconstructed from detector data in HEP in a way that keeps correlations between unfolded observables while demonstrating competitive performance compared to standard algorithms used in the field; 2) Address the generalization problem by developing an unfolding algorithm capable to correctly infer the underlying distributions of observables and processes never seen before, while controlling the dominant theoretical uncertainties affecting the process, therefore increasing the effectiveness, the precision, and the applicability of the developed algorithm; 3) Understand the theoretical foundations between the developed algorithm so to extend it to applications beyond experimental HEP, for broader benefits to the society. This report provides an overview of the accomplishments related to each of these key objectives.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Quasi-static solution algorithms for kinematically/materially nonlinear thermomechanical problems
This paper develops an algorithmic solution strategy which allows the handling of positive/indefinite stiffness characteristics associated with the pre- and post-buckling of structures subject to complex thermomechanical loading fields. The flexibility of the procedure is such that it can be applied to both finite difference and element-type simulations. Due to the generality of the algorithmic approach developed, both kinematic and thermal/mechanical type material nonlinearity including inelastic effects can be treated. This includes the possibility of handling completely general thermomechanical boundary conditions. To demonstrate the scheme, the results of several benchmark problems is presented.
Padovan, J.↗