Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximate computing”

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 865 records · Page 48

Sparse Solutions for Single Class SVMs: A Bi-Criterion Approach

In this paper we propose an innovative learning algorithm - a variation of One-class nu Support Vector Machines (SVMs) learning algorithm to produce sparser solutions with much reduced computational complexities. The proposed technique returns an approximate solution, nearly as good as the solution set obtained by the classical approach, by minimizing the original risk function along with a regularization term. We introduce a bi-criterion optimization that helps guide the search towards the optimal set in much reduced time. The outcome of the proposed learning technique was compared with the benchmark one-class Support Vector machines algorithm which more often leads to solutions with redundant support vectors. Through out the analysis, the problem size for both optimization routines was kept consistent. We have tested the proposed algorithm on a variety of data sources under different conditions to demonstrate the effectiveness. In all cases the proposed algorithm closely preserves the accuracy of standard one-class nu SVMs while reducing both training time and test time by several factors.

Das, Santanu↗

Algorithm for Rapid Searching Among Star-Catalog Entries

An algorithm searches a star catalog to identify guide stars within the field of view of a telescope or camera. The algorithm is fast: the number of computations needed to perform the search is approximately proportional to the logarithm of the number of stars in the catalog. The algorithm requires the prior organization of the star catalog into a hierarchy utilizing independent spherical coverings (see figure), such that each successively higher level contains fewer elements. In the lowest and most numerous level of the hierarchy, the elements are individual stars in the star catalog. The next higher level contains a spherical covering (a constellation of n points on a sphere that minimizes the maximum distance of any point on the sphere from the closest one of the n points), the next higher level contains a smaller spherical covering, and so forth, ending at the highest level, which contains one element representing the point of entry into the search structure. With necessary exceptions at the lowest and highest levels, each element at each level is labeled in terms of the element to which it is linked in the next higher level and the first element to which it is linked in the next lower level. Each element is also labeled in terms of (1) its coordinates on the celestial sphere and (2) the largest angular distance to any element in any lower level in the hierarchy. The elements at all levels of the hierarchy are numbered on a single list, such that the elements of each constellation at each level are numbered consecutively. The algorithm is recursive. The input required to start the algorithm comprises the coordinates of a point on the celestial sphere. Attention is then focused on individual elements of the hierarchy, starting from the topmost one, as follows: The angle between the input point and the element under consideration is calculated. If the calculated angle is larger than the sum of (1) the predetermined angle to the most distant element plus (2) the half field of view of the telescope, then no stars will be within the field of view and this recursive part of the algorithm is terminated.

Liebe, Carl Christian↗

Uncertainty Analysis via Failure Domain Characterization: Unrestricted Requirement Functions

This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. The methods developed herein, which are based on nonlinear constrained optimization, are applicable to requirement functions whose functional dependency on the uncertainty is arbitrary and whose explicit form may even be unknown. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the assumed uncertainty model (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort.

Crespo, Luis G.↗

Uncertainty Analysis via Failure Domain Characterization: Polynomial Requirement Functions

This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. A Bernstein expansion approach is used to size hyper-rectangular subsets while a sum of squares programming approach is used to size quasi-ellipsoidal subsets. These methods are applicable to requirement functions whose functional dependency on the uncertainty is a known polynomial. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the uncertainty model assumed (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort.

Crespo, Luis G.↗

Rapid Switching and Modulation by use of Coupled VCSELs

Devices incorporating coupled vertical-cavity surface-emitting lasers (VCSELs) have been proposed as means to effect unprecedentedly rapid modulation and/or switching of light beams in advanced optical communication and information-processing systems. A basic device according to the proposal would comprise two or more VCSELs (1) positioned so close to each other that they are coupled and (2) connected to a current source that biases them at a steady current above the threshold current for lasing. The operation of VCSELs under the conditions stated above has been simulated computationally with an algorithm that solves an approximation of the Maxwell-Bloch equations. (These are nonlinear coupled partial differential equations that model the relevant aspects of the physics of semiconductor lasers.) The results of the simulations show that the intensities of the beams oscillate, out of phase relative to each other, at a frequency that is typically of the order of tens of gigahertz. In particular, one simulation was performed for two coupled VCSELs, each having a circular aperture 5.6 microns in diameter, operating at a wavelength of 980 nm. The results of the simulation showed that the intensities of the two beams oscillated in opposite phase (see Figure 1) at a frequency of 42 GHz. In the far field, the beams were found to be separated by an angle of approx.=8deg. The intensities of the beams were also found to oscillate in the near field, 90deg out of phase with the oscillation in the far field. Figure 2 depicts a simple near-field switching device in which an assembly of microlenses would couple the two oscillating beams to two receivers.

Goorjian, Peter M.↗

The Continual Intercomparison of Radiation Codes: Results from Phase I

The computer codes that calculate the energy budget of solar and thermal radiation in Global Climate Models (GCMs), our most advanced tools for predicting climate change, have to be computationally efficient in order to not impose undue computational burden to climate simulations. By using approximations to gain execution speed, these codes sacrifice accuracy compared to more accurate, but also much slower, alternatives. International efforts to evaluate the approximate schemes have taken place in the past, but they have suffered from the drawback that the accurate standards were not validated themselves for performance. The manuscript summarizes the main results of the first phase of an effort called "Continual Intercomparison of Radiation Codes" (CIRC) where the cases chosen to evaluate the approximate models are based on observations and where we have ensured that the accurate models perform well when compared to solar and thermal radiation measurements. The effort is endorsed by international organizations such as the GEWEX Radiation Panel and the International Radiation Commission and has a dedicated website (i.e., http://circ.gsfc.nasa.gov) where interested scientists can freely download data and obtain more information about the effort's modus operandi and objectives. In a paper published in the March 2010 issue of the Bulletin of the American Meteorological Society only a brief overview of CIRC was provided with some sample results. In this paper the analysis of submissions of 11 solar and 13 thermal infrared codes relative to accurate reference calculations obtained by so-called "line-by-line" radiation codes is much more detailed. We demonstrate that, while performance of the approximate codes continues to improve, significant issues still remain to be addressed for satisfactory performance within GCMs. We hope that by identifying and quantifying shortcomings, the paper will help establish performance standards to objectively assess radiation code quality, and will guide the development of future phases of CIRC

Oreopoulos, Lazaros↗

Modeling the Effects of Beam Size and Flaw Morphology on Ultrasonic Pulse/Echo Sizing of Delaminations in Carbon Composites

The size and shape of a delamination in a multi-layered structure can be estimated in various ways from an ultrasonic pulse/echo image. For example the -6dB contours of measured response provide one simple estimate of the boundary. More sophisticated approaches can be imagined where one adjusts the proposed boundary to bring measured and predicted UT images into optimal agreement. Such approaches require suitable models of the inspection process. In this paper we explore issues pertaining to model-based size estimation for delaminations in carbon fiber reinforced laminates. In particular we consider the influence on sizing when the delamination is non-planar or partially transmitting in certain regions. Two models for predicting broadband sonic time-domain responses are considered: (1) a fast "simple" model using paraxial beam expansions and Kirchhoff and phase-screen approximations; and (2) the more exact (but computationally intensive) 3D elastodynamic finite integration technique (EFIT). Model-to-model and model-to experiment comparisons are made for delaminations in uniaxial composite plates, and the simple model is then used to critique the -6dB rule for delamination sizing.

Margetan, Frank J.↗

An Analytical Solution for Yaw Maneuver Optimization on the International Space Station and Other Orbiting Space Vehicles

This paper presents a new method for optimizing yaw maneuvers, which are the most common large maneuvers on the International Space Station (ISS). The goal of the maneuver optimization is to find a maneuver trajectory with minimal torques acting on the vehicle during the maneuver. Therefore, the thruster firings necessary to perform the maneuver are minimized. Reduction of thruster firings saves propellant and decreases structural loads and contamination of the vehicle critical elements, thus saving the service life of the thrusters and the vehicle itself. Equations describing the pitch and roll motion needed to counteract the major torques during a yaw maneuver are obtained. Also, a yaw rate profile is suggested. In the obtained optimized case, the torques are significantly reduced. The proposed approximate analytical solution does not require extensive computer resources and, therefore, can be implemented using software onboard the ISS. As a result, the maneuver execution will be automatic. This is one of the major benefits of the simplified solution presented in this paper with respect to existing computational approaches. The suggested maneuver optimization method can be used not only for the ISS, but for other space vehicles as well.

Dobrinskaya, Tatiana↗

The Effects of High Density on the X-ray Spectrum Reflected from Accretion Discs Around Black Holes

Current models of the spectrum of X-rays reflected from accretion discs around black holes and other compact objects are commonly calculated assuming that the density of the disc atmosphere is constant within several Thomson depths from the irradiated surface. An important simplifying assumption of these models is that the ionization structure of the gas is completely specified by a single, fixed value of the ionization parameter (xi), which is the ratio of the incident flux to the gas density. The density is typically fixed at n(sub e) = 10(exp 15) per cu cm. Motivated by observations, we consider higher densities in the calculation of the reflected spectrum. We show by computing model spectra for n(sub e) approximately greater than 10(exp 17) per cu cm that high-density effects significantly modify reflection spectra. The main effect is to boost the thermal continuum at energies 2 approximately less than keV. We discuss the implications of these results for interpreting observations of both active galactic nuclei and black hole binaries. We also discuss the limitations of our models imposed by the quality of the atomic data currently available.

accretion↗

A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits

Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.

Kechedzhi, Kostyantyn↗

Summary of Ice Shape Geometric Fidelity Studies on an Iced Swept Wing

Understanding the aerodynamic impact of swept-wing ice accretions is a crucial component of the design of modern aircraft. Computer-simulation tools are commonly used to approximate ice shapes, so the necessary level of detail or fidelity of those simulated ice shapes must be understood relative to high-fidelity representations of the ice. Previous tests were performed in the NASA Icing Research Tunnel to acquire high-fidelity ice shapes. Some of those ice shapes are based on aircraft certification requirements. From this database, full-span artificial ice shapes were designed and manufactured for both an 8.9%-scale and 13.3%-scale semispan wing model of the CRM65 which has been established as the full-scale baseline for this swept-wing project. These models were tested in the Walter H. Beech wind tunnel at Wichita State University and at the ONERA (Office national d'etudes et de recherches aerospatiales) F1 facility, respectively. The data collected in the Wichita State University wind tunnel provided a low-Reynolds number baseline study while the pressurized F1 facility produced data over a wide range of Reynolds and Mach numbers with the highest Reynolds number studied being approximately Re = 11.9 by 10 (sup 6). Three different fidelity representations were created based on three different icing conditions. Lower-fidelity ice shapes were created by lofting a smooth ice shape between cross-section cuts of the high-fidelity ice shape. Grit roughness was attached to this smooth ice shape as another fidelity variant. The data indicates that the geometric fidelity of the ice shapes resulted in significant differences in lift and drag. These results were similar at both facilities over the wide range of test conditions utilized.

Aerodynamics↗

Autonomous Spacecraft Attitude Control Using Deep Reinforcement Learning

While machine learning and spacecraft autonomy continue to gain research interest, significant work remains to be done in efficiently applying modern machine learning techniques to problems in space ight. This study presents a framework for deriving a discrete neural spacecraft attitude controller using reinforcement learning, a paradigm of machine learning, without the need for high-performance computing. The developed attitude controller is an approximately time-optimal solution to a highly constrained control problem, able to achieve well above industry-standard pointing accuracies. Control examples are also presented of the agent performing large-angle spacecraft slews in the developed simulation environment and future extensions of this work are discussed.

ATAP↗

Reduced-Order Aerodynamic Modeling Based on CFD Frequency Responses from Multisine Inputs

A system identification analysis was performed to determine a reduced-order model (ROM) of a computational fluid dynamics (CFD) solver in support of linear aeroservoelastic model development and feedback control design. The approach was applied to the FUN3D code for the half-span wind tunnel test article used in the NASA-Boeing collaboration called the Integrated Adaptive Wing Technology Maturation (IAWTM) project. In a transonic flow condition, multiple inputs (11 structural mode displacements and 3 control surface deflections) were simultaneously excited with orthogonal phase-optimized multisines while multiple outputs (the corresponding 14 generalized aerodynamic forces) were recorded. From these recorded times series, the matrix of frequency responses was computed and subsequently fit using rational function approximations (RFAs). It was found that the entire (14 x 14) matrix of frequency responses could be determined from a single CFD run and that results generally followed trends predicted using other methods. Differences were attributed to the modeling fidelity and nonlinearities from structural mode and control surface interactions at higher reduced frequencies. More accurate fits of the RFAs to the frequency response data were obtained by making two CFD runs, one with only structural mode excitations and one with only control surface excitations, which reduced the degree of nonlinearity in the modeling data.

Aeroservoelasticity↗

On Characterization of Flow Disturbances in Arc-Jet Testing

This paper reports computational simulations and analysis of flow characterization tests in high enthalpy arc-jet facilities at NASA Ames Research Center. Flow disturbances and their characterization are presented through case studies, and their implications for testing are discussed. The case studies include free-jet test configurations from three different arc heaters and nozzles: the 60-MW IHF 30-inch conical nozzle, the 10-MW TP3 15-inch conical nozzle, and the 20-MW AHF 12-inch conical nozzle. For all cases, test articles are placed in the jet exiting the conical nozzle, and the existence of a flow disturbance is confirmed through flow survey data using pitot pressure and heat flux probes and accompanying analysis. The paper focuses on cases where the effects of the disturbances on test article surface quantities are important. The present analysis comprises computational fluid dynamics simulations of the nonequilibrium flowfield in the facility nozzles and test box, including the models tested. Comparisons of computations with the experimental measurements are presented. The computations that reproduce the probe sweep data approximately are essential to interpret the arc-jet test data accurately, while providing insights into several observed calorimeter anomalies caused by flow disturbances.

Arc-jet testing↗

On Characterization of Flow Disturbances in Arc-Jet Testing

This paper reports computational simulations and analysis of flow characterization tests in high enthalpy arc-jet facilities at NASA Ames Research Center. Flow disturbances and their characterization are presented through case studies, and their implications for testing are discussed. The case studies include free-jet test configurations from three different arc heaters and nozzles: the 60-MW IHF 30-inch conical nozzle, the 10-MW TP3 15-inch conical nozzle, and the 20-MW AHF 12-inch conical nozzle. For all cases, test articles are placed in the jet exiting the conical nozzle, and the existence of a flow disturbance is confirmed through flow survey data using pitot pressure and heat flux probes and accompanying analysis. The paper focuses on cases where the effects of the disturbances on test article surface quantities are important. The present analysis comprises computational fluid dynamics simulations of the nonequilibrium flowfield in the facility nozzles and test box, including the models tested. Comparisons of computations with the experimental measurements are presented. The computations that reproduce the probe sweep data approximately are essential to interpret the arc-jet test data accurately, while providing insights into several observed calorimeter anomalies caused by flow disturbances.

Arc-jet testing↗

Design and Computational/Experimental Analysis of Low Sonic Boom Configurations

Recent studies have shown that inviscid CFD codes combined with a planar extrapolation method give accurate sonic boom pressure signatures at distances greater than one body length from supersonic configurations if either adapted grids swept at the approximate Mach angle or very dense non-adapted grids are used. The validation of CFD for computing sonic boom pressure signatures provided the confidence needed to undertake the design of new supersonic transport configurations with low sonic boom characteristics. An aircraft synthesis code in combination with CFD and an extrapolation method were used to close the design. The principal configuration of this study is designated LBWT (Low Boom Wing Tail) and has a highly swept cranked arrow wing with conventional tails, and was designed to accommodate either 3 or 4 engines. The complete configuration including nacelles and boundary layer diverters was evaluated using the AIRPLANE code. This computer program solves the Euler equations on an unstructured tetrahedral mesh. Computations and wind tunnel data for the LBWT and two other low boom configurations designed at NASA Ames Research Center are presented. The two additional configurations are included to provide a basis for comparing the performance and sonic boom level of the LBWT with contemporary low boom designs and to give a broader experiment/CFD correlation study. The computational pressure signatures for the three configurations are contrasted with on-ground-track near-field experimental data from the NASA Ames 9x7 Foot Supersonic Wind Tunnel. Computed pressure signatures for the LBWT are also compared with experiment at approximately 15 degrees off ground track.

Cliff, Susan E.↗

Non-linear analysis of symmetric structures with unsymmetric boundary conditions

Two computational techniques are developed analytically to generate global approximation vectors for use in the nonlinear large-deflection analysis of symmetric structures with asymmetric boundary conditions. One method is based on linear combinations of FEM-generated symmetric and antisymmetric vector components, while the other employs a preconditioned-conjugate-gradient technique. The derivation of the procedures is explained in detail, and their effectiveness is evaluated in sample computations for an elliptic toroid and a cylindrical panel; the results are presented in tables and graphs and characterized.

Noor, Ahmed K.↗

Development of equilibrium air computer programs suitable for numerical computation using time-dependent or shock-capturing methods

Computer programs were developed which compute the thermodynamic properties of equilibrium air for use in either the time-dependent or shock-capturing computational methods. For the time-dependent method, tne NASA-ARC RGAS computer program was modified to allow internal energy and density to be used as the independent variables. In addition, simplified-curve fits for p = p(e,rho), a = a(e,rho), and T = T(p,rho) were devised to reduce computer time. For the shock-capturing method a simplified curve fit for h = h(p,rho) was made. These approximate curve fits may be particularly useful when employed on advanced computers such as the Illiac 4 or the CDC Star since they avoid the cumbersome table-lookup feature of the RGAS program.

Tannehill, J. C.↗