Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
NASA NTRS2025

Generalized Reference Targeting for Spaceflight

For spaceflight programs to achieve some of the aggressive exploration initiatives such as visiting and landing on other celestial bodies, rendezvousing with other orbiting vehicles, and ultimately returning crew safely to Earth, an assortment of targeting algorithms to compute the necessary burns to strategically maneuver a spacecraft to a variety of destinations are required. Numerous examples exist, but rather than creating and implementing multiple targeting solutions, is it possible to have a general targeting model that can accommodate a variety of applications? Originally motivated for mission design and analysis purposes, this paper outlines a generalized reference targeting algorithm for spaceflight that may also have applications in on-orbit flight software. It accommodates arbitrary flight dynamics and both impulsive and finite burns for either absolute or relative targeting applications. It also allows for an arbitrary number of targeting design parameters such as multiple discrete correction burns or finite thrust parameters to satisfy numerous combinations of targeting constraints that can have fixed or variable time epochs. Given a reference trajectory, this targeting technique provides a general framework to quickly solve an assortment of targeting problems that may be well-defined, over-determined, or under-determined while naturally producing metrics providing insight into the controllability for a given problem formulation. Due to the derivation, speed, and accuracy of the algorithm, it lends to supporting rapid linear covariance analysis and robust trajectory design applications for a variety of flight phases such as rendezvous and docking, cislunar transfer, interplanetary flight, orbit maintenance, de-orbit, and powered descent and landing.

Targeting↗
NASA NTRS1991

Optimal design of solidification processes

An optimal design algorithm is presented for the analysis of general solidification processes, and is demonstrated for the growth of GaAs crystals in a Bridgman furnace. The system is optimal in the sense that the prespecified temperature distribution in the solidifying materials is obtained to maximize product quality. The optimization uses traditional numerical programming techniques which require the evaluation of cost and constraint functions and their sensitivities. The finite element method is incorporated to analyze the crystal solidification problem, evaluate the cost and constraint functions, and compute the sensitivities. These techniques are demonstrated in the crystal growth application by determining an optimal furnace wall temperature distribution to obtain the desired temperature profile in the crystal, and hence to maximize the crystal's quality. Several numerical optimization algorithms are studied to determine the proper convergence criteria, effective 1-D search strategies, appropriate forms of the cost and constraint functions, etc. In particular, we incorporate the conjugate gradient and quasi-Newton methods for unconstrained problems. The efficiency and effectiveness of each algorithm is presented in the example problem.

Dantzig, Jonathan A.↗
DOE OSTI2024

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V.

47 OTHER INSTRUMENTATION↗
NASA NTRS1990

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗
DOE OSTI2020

A mass-transfer particle-tracking method for simulating transport with discontinuous diffusion coefficients

The problem of a spatially discontinuous diffusion coefficient (D(x)) is one that may be encountered in hydrogeologic systems due to natural geological features or as a consequence of numerical discretization of flow properties. To date, mass-transfer particle-tracking (MTPT) methods, a family of Lagrangian methods in which diffusion is jointly simulated by random walk and diffusive mass transfers, have been unable to solve this problem. This manuscript presents a new mass-transfer (MT) algorithm that enables MTPT methods to accurately solve the problem of discontinuous D(x). To achieve this, we derive a semi-analytical solution to the discontinuous D(x) problem by employing a predictor-corrector approach, and we use this semi-analytical solution as the weighting function in a reformulated MT algorithm. Furthermore, this semi-analytical solution is generalized for cases with multiple 1D interfaces as well as for 2D cases, including a 2 × 2 tiling of 4 subdomains that corresponds to a numerically-generated diffusion field. The solutions generated by this new mass-transfer algorithm closely agree with an analytical 1D solution or, in more complicated cases, trusted numerical results, demonstrating the success of our proposed approach.

42 ENGINEERING↗
NASA NTRS2006

ARISE (Antarctic Remote Ice Sensing Experiment) in the East 2003: Validation of Satellite-derived Sea-ice Data Product

Preliminary results are presented from the first validation of geophysical data products (ice concentration, snow thickness on sea ice (h(sub s) and ice temperature (T(sub i))fr om the NASA EOS Aqua AMSR-E sensor, in East Antarctica (in September-October 2003). The challenge of collecting sufficient measurements with which to validate the coarse-resolution AMSR-E data products adequately was addressed by means of a hierarchical approach, using detailed in situ measurements, digital aerial photography and other satellite data. Initial results from a circumnavigation of the experimental site indicate that, at least under cold conditions with a dry snow cover, there is a reasonably close agreement between satellite- and aerial-photo-derived ice concentrations, i.e. 97.2+/-.6% for NT2 and 96.5+/-2.5% for BBA algorithms vs 94.3% for the aerial photos. In general, the AMSR-E concentration represents a slight overestimate of the actual concentration, with the largest discrepancies occurring in regions containing a relatively high proportion of thin ice. The AMSR-E concentrations from the NT2 and BBA algorithms are similar on average, although differences of up to 5% occur in places, again related to thin-ice distribution. The AMSR-E ice temperature (T(sub i)) product agrees with coincident surface measurements to approximately 0.5 C in the limited dataset analyzed. Regarding snow thickness, the AMSR h(sub s) retrieval is a significant underestimate compared to in situ measurements weighted by the percentage of thin ice (and open water) present. For the case study analyzed, the underestimate was 46% for the overall average, but 23% compared to smooth-ice measurements. The spatial distribution of the AMSR-E h(sub s) product follows an expected and consistent spatial pattern, suggesting that the observed difference may be an offset (at least under freezing conditions). Areas of discrepancy are identified, and the need for future work using the more extensive dataset is highlighted.

Massom, Robert A.↗
DOE OSTI2021

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗
NASA NTRS1989

NETRA: A parallel architecture for integrated vision systems. 1: Architecture and organization

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is considered to be a system that uses vision algorithms from all levels of processing for a high level application (such as object recognition). A model of computation is presented for parallel processing for an IVS. Using the model, desired features and capabilities of a parallel architecture suitable for IVSs are derived. Then a multiprocessor architecture (called NETRA) is presented. This architecture is highly flexible without the use of complex interconnection schemes. The topology of NETRA is recursively defined and hence is easily scalable from small to large systems. Homogeneity of NETRA permits fault tolerance and graceful degradation under faults. It is a recursively defined tree-type hierarchical architecture where each of the leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide for desired flexibility. A qualitative evaluation of NETRA is presented. Then general schemes are described to map parallel algorithms onto NETRA. Algorithms are classified according to their communication requirements for parallel processing. An extensive analysis of inter-cluster communication strategies in NETRA is presented, and parameters affecting performance of parallel algorithms when mapped on NETRA are discussed. Finally, a methodology to evaluate performance of algorithms on NETRA is described.

Choudhary, Alok N.↗
NASA NTRS1983

New syndrome decoder for (n, 1) convolutional codes

The letter presents a new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck. The new technique uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). A recursive, Viterbi-like, algorithm is developed to find the minimum weight error vector E(D). An example is given for the binary nonsystematic (2, 1) CC.

Reed, I. S.↗
NASA NTRS1982

Some aspects of algorithm performance and modeling in transient thermal analysis of structures

The status of an effort to increase the efficiency of calculating transient temperature fields in complex aerospace vehicle structures is described. The advantages and disadvantages of explicit and implicit algorithms are discussed. A promising set of implicit algorithms with variable time steps, known as the GEAR package is described. Four test problems, used for evaluating and comparing various algorithms, were selected and finite element models of the configurations are described. These problems include a space shuttle frame component, an insulated cylinder, a metallic panel for a thermal protection system, and a model of the space shuttle orbiter wing. Results generally indicate a preference for implicit oer explicit algorithms for solution of transient structural heat transfer problems when the governing equations are stiff.

Adelman, H. M.↗
DOE OSTI2022

Satellite-based evaluation of AeroCom model bias in biomass burning regions

Global models are widely used to simulate biomass burning aerosol (BBA). Exhaustive evaluations on model representation of aerosol distributions and properties are fundamental to assess health and climate impacts of BBA. Here we conducted a comprehensive comparison of Aerosol Comparisons between Observations and Models (AeroCom) project model simulations with satellite observations. A total of 59 runs by 18 models from three AeroCom Phase-III experiments (i.e., biomass burning emissions, CTRL16, and CTRL19) and 14 satellite products of aerosols were used in the study. Aerosol optical depth (AOD) at 550 nm was investigated during the fire season over three key fire regions reflecting different fire dynamics (i.e., deforestation-dominated Amazon, Southern Hemisphere Africa where savannas are the key source of emissions, and boreal forest burning in boreal North America). The 14 satellite products were first evaluated against AErosol RObotic NETwork (AERONET) observations, with large uncertainties found. But these uncertainties had small impacts on the model evaluation that was dominated by modeling bias. Through a comparison with Polarization and Directionality of the Earth’s Reflectances measurements with the Generalized Retrieval of Aerosol and Surface Properties algorithm (POLDER-GRASP), we found that the modeled AOD values were biased by –93 % to 152 %, with most models showing significant underestimations even for the state-of-the-art aerosol modeling techniques (i.e., CTRL19). By scaling up BBA emissions, the negative biases in modeled AOD were significantly mitigated, although it yielded only negligible improvements in the correlation between models and observations, and the spatial and temporal variations in AOD biases did not change much. For models in CTRL16 and CTRL19, the large diversity in modeled AOD was in almost equal measures caused by diversity in emissions, lifetime, and the mass extinction coefficient (MEC). We found that in the AeroCom ensemble, BBA lifetime correlated significantly with particle deposition (as expected) and in turn correlated strongly with precipitation. Additional analysis based on Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) aerosol profiles suggested that the altitude of the aerosol layer in the current models was generally too low, which also contributed to the bias in modeled lifetime. Modeled MECs exhibited significant correlations with the Ångström exponent (AE, an indicator of particle size). Comparisons with the POLDER-GRASP-observed AE suggested that the models tended to overestimate the AE (underestimated particle size), indicating a possible underestimation of MECs in models. The hygroscopic growth in most models generally agreed with observations and might not explain the overall underestimation of modeled AOD. Our results imply that current global models contain biases in important aerosol processes for BBA (e.g., emissions, removal, and optical properties) that remain to be addressed in future research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2022

Satellite-Based Evaluation of AeroCom Model Bias in Biomass Burning Regions

Global models are widely used to simulate biomass burning aerosol (BBA). Exhaustive evaluations on model representation of aerosol distributions and properties are fundamental to assess health and climate impacts of BBA. Here we conducted a comprehensive comparison of Aerosol Comparisons between Observations and Models (AeroCom) project model simulations with satellite observations. A total of 59 runs by 18 models from three AeroCom Phase-III experiments (i.e., biomass burning emissions, CTRL16, and CTRL19) and 14 satellite products of aerosols were used in the study. Aerosol optical depth (AOD) at 550 nm was investigated during the fire season over three key fire regions reflecting different fire dynamics (i.e., deforestation-dominated Amazon, Southern Hemisphere Africa where savannas are the key source of emissions, and boreal forest burning in boreal North America). The 14 satellite products were first evaluated against AErosol RObotic NETwork (AERONET) observations, with large uncertainties found. But these uncertainties had small impacts on the model evaluation that was dominated by modeling bias. Through a comparison with Polarization and Directionality of the Earth’s Reflectances measurements with the Generalized Retrieval of Aerosol and Surface Properties algorithm (POLDER-GRASP), we found that the modeled AOD values were biased by −93 % to 152 %, with most models showing significant underestimations even for the state-of-the-art aerosol modeling techniques (i.e., CTRL19). By scaling up BBA emissions, the negative biases in modeled AOD were significantly mitigated, although it yielded only negligible improvements in the correlation between models and observations, and the spatial and temporal variations in AOD biases did not change much. For models in CTRL16 and CTRL19, the large diversity in modeled AOD was in almost equal measures caused by diversity in emissions, lifetime, and the mass extinction coefficient (MEC). We found that in the AeroCom ensemble, BBA lifetime correlated significantly with particle deposition (as expected) and in turn correlated strongly with precipitation. Additional analysis based on Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) aerosol profiles suggested that the altitude of the aerosol layer in the current models was generally too low, which also contributed to the bias in modeled lifetime. Modeled MECs exhibited significant correlations with the Ångström exponent (AE, an indicator of particle size). Comparisons with the POLDER-GRASP-observed AE suggested that the models tended to overestimate the AE (underestimated particle size), indicating a possible underestimation of MECs in models. The hygroscopic growth in most models generally agreed with observations and might not explain the overall underestimation of modeled AOD. Our results imply that current global models contain biases in important aerosol processes for BBA (e.g., emissions, removal, and optical properties) that remain to be addressed in future research.

biomass burning aerosols↗
NASA NTRS1991

Galileo Attitude Determination: Experiences with a Rotating Star Scanner

The Galileo experience with a rotating star scanner is discussed in terms of problems encountered in flight, solutions implemented, and lessons learned. An overview of the Galileo project and the attitude and articulation control subsystem is given and the star scanner hardware and relevant software algorithms are detailed. The star scanner is the sole source of inertial attitude reference for this spacecraft. Problem symptoms observed in flight are discussed in terms of effects on spacecraft performance and safety. Sources of thse problems include contributions from flight software idiosyncrasies and inadequate validation of the ground procedures used to identify target stars for use by the autonomous on-board star identification algorithm. Problem fixes (some already implemented and some only proposed) are discussed. A general conclusion is drawn regarding the inherent difficulty of performing simulation tests to validate algorithms which are highly sensitive to external inputs of statistically 'rare' events.

Merken, L.↗
DOE OSTI2021

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

Some aspects of algorithm performance and modeling in transient thermal analysis of structures

The status of an effort to increase the efficiency of calculating transient temperature fields in complex aerospace vehicle structures is described. The advantages and disadvantages of explicit and implicit algorithms are discussed. A promising set of implicit algorithms with variable time steps, known as the GEAR package is described. Four test problems, used for evaluating and comparing various algorithms, have been selected and finite-element models of the configurations are described. These problems include a Space Shuttle frame component, an insulated cylinder, a metallic panel for a thermal protection system, and a model of the Space Shuttle Orbiter wing. Results generally indicate a preference for implicit over explicit algorithms for solution of transient structural heat transfer problems when the governing equations are 'stiff' (typical of many practical problems such as insulated metal structures).

Adelman, H. M.↗
NASA NTRS2010

A General Closed-Form Solution for the Lunar Reconnaissance Orbiter (LRO) Antenna Pointing System

The National Aeronautics and Space Administration s (NASA) Lunar Reconnaissance Orbiter (LRO) launched on June 18, 2009 from the Cape Canaveral Air Force Station aboard an Atlas V launch vehicle into a direct insertion trajectory to the Moon LRO, designed, built, and operated by the NASA Goddard Space Flight Center in Greenbelt, MD, is gathering crucial data on the lunar environment that will help astronauts prepare for long-duration lunar expeditions. During the mission s nominal life of one year its six instruments and one technology demonstrator will find safe landing site, locate potential resources, characterize the radiation environment and test new technology. To date, LRO has been operating well within the bounds of its requirements and has been collecting excellent science data images taken from the LRO Camera Narrow Angle Camera (LROC NAC) of the Apollo landing sites have appeared on cable news networks. A significant amount of information on LRO s science instruments is provided at the LRO mission webpage. LRO s Attitude Control System (ACS), in addition to controlling the orientation of the spacecraft is also responsible for pointing the High Gain Antenna (HGA). A dual-axis (or double-gimbaled) antenna, deployed on a meter-long boom, is required to point at a selected Earth ground station. Due to signal loss over the distance from the Moon to Earth, pointing precision for the antenna system is very tight. Since the HGA has to be deployed in spaceflight, its exact geometry relative to the spacecraft body is uncertain. In addition, thermal distortions and mechanical errors/tolerances must be characterized and removed to realize the greatest gain from the antenna system. These reasons necessitate the need for an in-flight calibration. Once in orbit around the moon, a series of attitude maneuvers was conducted to provide data needed to determine optimal parameters to load onboard, which would account for the environmental and mechanical errors at any antenna orientation. The nominal geometry for the HGA involves an outer gimbal axis that is exactly perpendicular to the inner gimbal axis, and a target direction that is exactly perpendicular to the outer gimbal axis. For this nominal geometry, closed-form solutions of the desired gimbal angles are simple to get for a desired target direction specified in the spacecraft body fame. If the gimbal axes and the antenna boresight are slightly misaligned, the nominal closed-form solution is not sufficiently accurate for computing the gimbal angles needed to point at a target. In this situation, either a general closed-form solution has to be developed for a mechanism with general geometries, or a correction scheme has to be applied to the nominal closed-form solutions. The latter has been adopted for Solar Dynamics Observatory (SDO) as can be seen in Reference 1, and the former has been used for LRO. The advantage of the general closed-form solution is the use of a small number of parameters for the correction of nominal solutions, especially in the regions near singularities. Singularities here refer to cases when the nominal closed-form solutions have two or more solutions. Algorithm complexity, however, is the disadvantage of the general closed-form solution.

Shah, Neerav↗
NASA NTRS1981

Some aspects of algorithm performance and modeling in transient analysis of structures

The status of an effort to increase the efficiency of calculating transient temperature fields in complex aerospace vehicle structures is described. The advantages and disadvantages of explicit algorithms with variable time steps, known as the GEAR package, is described. Four test problems, used for evaluating and comparing various algorithms, were selected and finite-element models of the configurations are described. These problems include a space shuttle frame component, an insulated cylinder, a metallic panel for a thermal protection system, and a model of the wing of the space shuttle orbiter. Results generally indicate a preference for implicit over explicit algorithms for solution of transient structural heat transfer problems when the governing equations are stiff (typical of many practical problems such as insulated metal structures).

Adelman, H. M.↗
NASA NTRS1980

Pareto-optimal multi-objective design of airplane control systems

A constrained minimization algorithm for the computer aided design of airplane control systems to meet many requirements over a set of flight conditions is generalized using the concept of Pareto-optimization. The new algorithm yields solutions on the boundary of the achievable domain in objective space in a single run, whereas the older method required a sequence of runs to approximate such a limiting solution. However, Pareto-optimality does not guarantee a satisfactory design, since such solutions may emphasize some objectives at the expense of others. The designer must still interact with the program to obtain a well-balanced set of objectives. Using the example of a fighter lateral stability augmentation system (SAS) design over five flight conditions, several effective techniques are developed for obtaining well-balanced Pareto-optimal solutions. For comparison, one of these techniques is also used in a recently developed algorithm of Kreisselmeier and Steinhauser, which replaces the hard constraints with soft constraints, using a special penalty function. It is shown that comparable results can be obtained.

Schy, A. A.↗