Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple iterations”

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 145 records · Page 8

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Globus, Al↗

QTGA Analysis with Concurrent Deposition

Analysis of outgassed species behavior is often performed using QCM thermogravimetric analysis (QTGA). Prior methods are suited to laboratory testing of materials samples where the source of contaminant can be removed from the system. An approach suitable presented for use during hardware bakeout and outgassing certification is presented. An iterative process is shown to fit surface activation energies and the arrival flux for multiple species.

Hughes, David W.↗

Iterative solution of large, sparse linear systems on a static data flow architecture - Performance studies

The applicability of static data flow architectures to the iterative solution of sparse linear systems of equations is investigated. An analytic performance model of a static data flow computation is developed. This model includes both spatial parallelism, concurrent execution in multiple PE's, and pipelining, the streaming of data from array memories through the PE's. The performance model is used to analyze a row partitioned iterative algorithm for solving sparse linear systems of algebraic equations. Based on this analysis, design parameters for the static data flow architecture as a function of matrix sparsity and dimension are proposed.

Reed, D. A.↗

A microwave scattering model for layered vegetation

A microwave scattering model was developed for layered vegetation based on an iterative solution of the radiative transfer equation up to the second order to account for multiple scattering within the canopy and between the ground and the canopy. The model is designed to operate over a wide frequency range for both deciduous and coniferous forest and to account for the branch size distribution, leaf orientation distribution, and branch orientation distribution for each size. The canopy is modeled as a two-layered medium above a rough interface. The upper layer is the crown containing leaves, stems, and branches. The lower layer is the trunk region modeled as randomly positioned cylinders with a preferred orientation distribution above an irregular soil surface. Comparisons of this model with measurements from deciduous and coniferous forests show good agreements at several frequencies for both like and cross polarizations. Major features of the model needed to realize the agreement include allowance for: (1) branch size distribution, (2) second-order effects, and (3) tree component models valid over a wide range of frequencies.

Karam, Mostafa A.↗

A Comparison of Techniques for Scheduling Earth-Observing Satellites

Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.

Globus, Al↗

Implementation and Testing of Inverse Kinematics on Robotic Arm

COSIE (Coronal Spectrographic Imager in the Extreme Ultraviolet) is a proposed solar tracking ISS imaging payload that will help bridge the theoretical gap between the physics of the low corona and the heliosphere. This scientific instrument requires high pointing accuracy, on the order of arc seconds. The instrument is mounted on to a three revolute joint robotic arm in order to track the roll, pitch and yaw motion of the Sun. The goal of this project is to construct a prototype model of the robotic arm and implement the proposed analytical inverse kinematics algorithm. In robotics, the inverse kinematics problem is solving for the set of joint angles that achieve the desired end effect or location and/or orientation. In this case, orientation is the focus. Depending on the configuration, multiple sets of joint angle solutions may exist. Due to the complexity of robotics, typically iterative methods are used to solve for the joint angle solution sets. However, in this case, an analytical solution exists. A small robotic arm representative of the full size hardware was constructed. The inverse kinematics algorithm, originally in MATLAB/Simulink, was converted into C in order to interface with the motors. This C software was implemented on a Windows PC and micro-controller, and serial communication between the two was established, allowing the motors to be directly controlled by the inverse kinematics algorithm. Testing the inverse kinematics on a physical system will allow the validity and accuracy of the analytic solution to be verified.

Franz, Carter↗

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↗

Single and multiple scattering contributions to circumsolar radiation

The contributions to the angular distribution of the almucantar radiance in the forward direction due to multiple scattering are compared to those due to single scattering. The contributions have been calculated by a computer code employing the Gauss-Seidel iterative approach to the solution of the radiative transfer equation for a plane parallel atmosphere composed of air molecules, aerosol particles, and ozone. The code is similar to that of Dave (1972) except in the construction of the source matrix. In the near-forward direction the multiple scattering contributions are significant for optical depths of the order of 0.4. The shape of the angular distribution of almucantar radiance to 10 degrees is less sensitive to multiple scattering.

Box, M. A.↗

A parallel iterative solution method for systems of nonlinear hyperbolic equations

An iterative algorithm suitable for the solution of a system of nonlinear hyperbolic partial differentiation equations in multiple dimensions is discussed. Current numerical methods for systems of nonlinear PDEs have limited parallelism due to strong coupling between the equations. This method decouples the PDEs by linearizing the convention coefficient for a space-time domain. This provides large grain parallelism. The linearization also allows the treatment of some terms in the equations as source terms, providing more freedom to choose from a wider variety of numerical methods. Smaller grain parallelism may be exploited within the solves for each equation. Thus, the method has potential for parallelism at several levels.

Scroggs, Jeffrey S.↗

Domain Decomposition Algorithms for First-Order System Least Squares Methods

Least squares methods based on first-order systems have been recently proposed and analyzed for second-order elliptic equations and systems. They produce symmetric and positive definite discrete systems by using standard finite element spaces, which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these first-order least squares methods are studied. Some representative overlapping and substructuring algorithms are considered in their additive and multiplicative variants. The theoretical and numerical results obtained show that the classical convergence bounds (on the iteration operator) for standard Galerkin discretizations are also valid for least squares methods.

Pavarino, Luca F.↗

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗

Real-Time Parameter Estimation for Flexible Aircraft

A method for estimating aeroelastic stability and control derivatives for flexible aircraft is developed and demonstrated using flight test data for the X-56A subscale demonstrator. The method uses the equation-error approach with frequency-domain data, and can be applied post-flight or in real time during flight. The non-dimensional aeroelastic forces and moments and the explanatory variables (including generalized displacement, rate, and acceleration states for the vibration modes) are estimated using a finite element model and onboard sensor measurements in both a least squares and Kalman filtering framework. The data are then transformed into the frequency domain for parameter estimation using equation error. This method can result in a more efficient analysis than with other iterative methods, and can leverage existing statistical tools for model structure determination, data collinearity detection, combining multiple maneuvers or prior information, and others to improve model quality.

Grauer, Jared A.↗

A hypermatrix formulation for subspace iteration

The computational efficiency of subspace iteration is addressed relative to the data structures adopted for the very large and generally sparse coefficient matrices. The frequent triangulations and matrix multiplications demand that access to the terms in the coefficient matrices be unbiased. Reliance on virtual memory (paging) operating systems with no special considerations for localized data access is not adequate. Specific data structures must be designed that accommodate the needs of the numerical algorithm yet eliminate unnecessary paging. An implementation of the subspace iteration method using hypermatrix data structures is presented. Use of hypermatrices is shown to provide unbiased and localized data access. The various modifications to the conventional formulation are described and an example problem illustrates the potential benefits of the hypermatrix formulation. Possibilities for adapting hypermatrix data structures to new supercomputer architectures are discussed.

Schmidt, Richard J.↗

Registration of video sequences from multiple sensors

In this paper, we describe an approach for registration of video sequences from a suite of multiple sensors including television, infrared and radar. Video sequences generated by these sensors may contain abrupt changes in local contrast and inconsistent image features, which pose additional difficulties for registration. Our approach to registration addresses the difficulties caused by using multiple sensors. We use a representation for registration that is invariant to local contrast changes, followed by smoothing of the resulting error measure used for registration, for robust estimation of registration parameters. We use an iterative procedure to reduce the effect of inconsistent features. Finally, we describe a method that uses same-sensor registration to aide in performing registration of sequences of video frames across multiple sensors.

Sharma, Ravi K.↗

Deriving Plasma Densities and Elemental Abundances from SERTS Differential Emission Measure Analysis

We use high-resolution spectral emission line data obtained by the SERTS instrument during three rocket flights to demonstrate a new approach for constraining electron densities of solar active region plasma.We apply differential emission measure (DEM) forward-fitting techniques to characterize the multithermal solar plasma producing the observed EUV spectra, with constraints on the high-temperature plasma from the Yohkoh Soft X-ray Telescope. In this iterative process, we compare line intensities predicted by an input source distribution to observed line intensities for multiple iron ion species, and search a broad range of densities to optimize chi-square simultaneously for the many available density-sensitive lines. This produces a density weighted by the DEM, which appears to be useful for characterizing the bulk of the emitting plasma over a significant range of temperature. This "DEM-weighted density" technique is complementary to the use of density-sensitive line ratios and less affected by uncertainties in atomic data and ionization fraction for any specific line. Once the DEM shape and the DEM-weighted density have been established from the iron lines, the relative elemental abundances can be determined for other lines in the spectrum. We have also identified spectral lines in the SERTS wavelength range that may be problematic

corona↗

Equivalent source modeling of the main field using MAGSAT data

An iterative least squares estimation algorithm with the capability for including a priori statistical information was implemented to recover multiple magnetic dipole models of the Earth's main magnetic field. The dipoles are fixed to a specified radius at or below the core-mantle boundary and centered on equal area blocks. The algorithm can solve for dipole magnitudes only (fixed orientations), or allow full freedom of orientation and solve for vector components. External field parameters and observatory anomaly biases can also be estimated simultaneously. Time dependence is modeled using first time derivatives for dipole vector components. Single-epoch and time dependent dipole models are derived using MAGSAT and observatory annul means data. Equivalent spherical harmonic representation are computed in closed form from the dipole models and compared with truncated spherical harmonic models estimated in the standard way from the same data sets. In particular, a 21 deg spatial resolution model based on 93 dipoles was computed based on observatory annual means data and a selected MAGSAT data set and was compared with candidate IGRF 1975 models and their 1980 secular variation.

Mayhew, M. A.↗

Iterative Mechanism Solutions with Scenario and ADAMS

This slide presentation reviews the use of iterative solutions using Scenario for Motion (UG NX 2 Motion) to assist in designing the Mars Science Laboratory (MSL). The MSL will have very unique design requirements, and in order to meet these requirements the system must have the ability to design for static stability, simulate mechanism kinematics, simulate dynamic behaviour and be capable of reconfiguration, and iterations as designed. The legacy process used on the Mars Exploration rovers worked, but it was cumbersome using multiple tools, limited configuration control, with manual process and communication, and multiple steps. The aim is to develop a mechanism that would reduce turn around time, and make more reiterations possible, to improve the quality and quantity of data, and to enhance configuration control. Currently for NX Scenario for Motion uses are in the articulation studies, the simulations of traverse motions,and subsystem simulations. The design of the Rover landing model requires accurate results, flexible elements, such as beams, and the use of the full ADAMS solver has been used. In order to achieve this, when required, there has been a direct translation from Scenario to ADAMS, with additional data in ascii format. The process that has been designed to move from Scenario to ADAMS is reviewed.

Mars Science Laboratory (MSL)↗

Development of a Ground Test and Analysis Protocol for NASA's NextSTEP Phase 2 Habitation Concepts

The NASA Next Space Technologies for Exploration Partnerships (NextSTEP) program is a public-private partnership model that seeks commercial development of deep space exploration capabilities to support human spaceflight missions around and beyond cislunar space. NASA first issued the Phase 1 NextSTEP Broad Agency Announcement to U.S. industries in 2014, which called for innovative cislunar habitation concepts that leveraged commercialization plans for low-Earth orbit. These habitats will be part of the Deep Space Gateway (DSG), the cislunar space station planned by NASA for construction in the 2020s. In 2016, Phase 2 of the NextSTEP program selected five commercial partners to develop ground prototypes. A team of NASA research engineers and subject matter experts (SMEs) have been tasked with developing the ground-test protocol that will serve as the primary means by which these Phase 2 prototypes will be evaluated. Since 2008, this core test team has successfully conducted multiple spaceflight analog mission evaluations utilizing a consistent set of operational tools, methods, and metrics to enable the iterative development, testing, analysis, and validation of evolving exploration architectures, operations concepts, and vehicle designs. The purpose of implementing a similar evaluation process for the Phase 2 Habitation Concepts is to consistently evaluate different commercial partner ground prototypes to provide data-driven, actionable recommendations for Phase 3. This paper describes the process by which the ground test protocol was developed and the objectives, methods, and metrics by which the NextSTEP Phase 2 Habitation Concepts will be rigorously and systematically evaluated. The protocol has been developed using both a top-down and bottom-up approach. Top-down development began with the Human Exploration and Operations Mission Directorate (HEOMD) exploration objectives and ISS Exploration Capability Study Team (IECST) candidate flight objectives. Strategic questions and associated rationales, derived from these candidate architectural objectives, provide the framework by which the ground-test protocol will address the DSG stack elements and configurations, systems and subsystems, and habitation, science, and EVA functions. From these strategic questions, high-level functional requirements for the DSG were drafted and associated ground-test objectives and analysis protocols were established. Bottom-up development incorporated objectives from NASA SMEs in autonomy, avionics and software, communication, environmental control and life support systems, exercise, extravehicular activity, exploration medical operations, guidance navigation and control, human factors and behavioral performance, human factors and habitability, logistics, Mission Control Center operations, power, radiation, robotics, safety and mission assurance, science, simulation, structures, thermal, trash management, and vehicle health. Top-down and bottom-up objectives were integrated to form overall functional requirements - ground-test objectives and analysis mapping. From this mapping, ground-test objectives were organized into those that will be evaluated through inspection, demonstration, analysis, subsystem standalone testing, and human-in-the-loop (HITL) testing. For the HITL tests, mission-like timelines, procedures, and flight rules have been developed to directly meet ground test objectives and evaluate specific functional requirements. Data collected from these assessments will be analyzed to determine the acceptability of habitation element configurations and the combinations of capabilities that will result in the best habitation platform to be recommended by the test team for Phase 3.

Gernhardt, Michael L.↗