Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 1,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Evaluation of Operational Procedures for Using a Time-Based Airborne Inter-arrival Spacing Tool

An airborne tool has been developed based on the concept of an aircraft maintaining a time-based spacing interval from the preceding aircraft. The Advanced Terminal Area Approach Spacing (ATAAS) tool uses Automatic Dependent Surveillance-Broadcast (ADS-B) aircraft state data to compute a speed command for the ATAAS-equipped aircraft to obtain a required time interval behind another aircraft. The tool and candidate operational procedures were tested in a high-fidelity, full mission simulator with active airline subject pilots flying an arrival scenario using three different modes for speed control. The objectives of this study were to validate the results of a prior Monte Carlo analysis of the ATAAS algorithm and to evaluate the concept from the standpoint of pilot acceptability and workload. Results showed that the aircraft was able to consistently achieve the target spacing interval within one second (the equivalent of approximately 220 ft at a final approach speed of 130 kt) when the ATAAS speed guidance was autothrottle-coupled, and a slightly greater (4-5 seconds), but consistent interval with the pilot-controlled speed modes. The subject pilots generally rated the workload level with the ATAAS procedure as similar to that with standard procedures, and also rated most aspects of the procedure high in terms of acceptability. Although pilots indicated that the head-down time was higher with ATAAS, the acceptability of head-down time was rated high. Oculometer data indicated slight changes in instrument scan patterns, but no significant change in the amount of time spent looking out the window between the ATAAS procedure versus standard procedures.

Oseguera-Lohr, Rosa M.↗
NASA NTRS2016

Normalization and Implementation of Three Gravitational Acceleration Models

Unlike the uniform density spherical shell approximations of Newton, the consequence of spaceflight in the real universe is that gravitational fields are sensitive to the asphericity of their generating central bodies. The gravitational potential of an aspherical central body is typically resolved using spherical harmonic approximations. However, attempting to directly calculate the spherical harmonic approximations results in at least two singularities that must be removed to generalize the method and solve for any possible orbit, including polar orbits. Samuel Pines, Bill Lear, and Robert Gottlieb developed three unique algorithms to eliminate these singularities. This paper documents the methodical normalization of two of the three known formulations for singularity-free gravitational acceleration (namely, the Lear and Gottlieb algorithms) and formulates a general method for defining normalization parameters used to generate normalized Legendre polynomials and Associated Legendre Functions (ALFs) for any algorithm. A treatment of the conventional formulation of the gravitational potential and acceleration is also provided, in addition to a brief overview of the philosophical differences between the three known singularity-free algorithms.

Eckman, Randy A.↗
NASA NTRS2018

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↗
NASA NTRS2000

A statistical model of the human core-temperature circadian rhythm

We formulate a statistical model of the human core-temperature circadian rhythm in which the circadian signal is modeled as a van der Pol oscillator, the thermoregulatory response is represented as a first-order autoregressive process, and the evoked effect of activity is modeled with a function specific for each circadian protocol. The new model directly links differential equation-based simulation models and harmonic regression analysis methods and permits statistical analysis of both static and dynamical properties of the circadian pacemaker from experimental data. We estimate the model parameters by using numerically efficient maximum likelihood algorithms and analyze human core-temperature data from forced desynchrony, free-run, and constant-routine protocols. By representing explicitly the dynamical effects of ambient light input to the human circadian pacemaker, the new model can estimate with high precision the correct intrinsic period of this oscillator ( approximately 24 h) from both free-run and forced desynchrony studies. Although the van der Pol model approximates well the dynamical features of the circadian pacemaker, the optimal dynamical model of the human biological clock may have a harmonic structure different from that of the van der Pol oscillator.

NASA Discipline Regulatory Physiology↗
NASA NTRS1979

An implicit algorithm for the conservative, transonic full-potential equation with effective rotated differencing

A new differencing scheme for the conservative full potential equation which effectively simulates rotated differencing is presented. The scheme was implemented by an appropriate upwind bias of the density coefficient along coordinate directions. A fast, fully implicit, approximate factorization iteration scheme was then used to solve the resulting difference equations. Solutions for a number of traditionally difficult transonic airfoil test cases are presented.

Holst, T. L.↗
NASA NTRS1980

Discrete-continuous variable structural synthesis using dual methods

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Schmit, L. A.↗
NASA NTRS1987

A three-dimensional dual potential procedure with applications to wind tunnel inlets and interacting boundary layers

A dual potential decomposition of the velocity field into a scalar and a vector potential function is extended to three dimensions and used in the finite-difference simulation of steady three-dimensional inviscid rotational flows and viscous flow. The finite-difference procedure was used to simulate the flow through the 80 by 120 ft wind tunnel at NASA Ames Research Center. Rotational flow produced by the stagnation pressure drop across vanes and screens which are located at the entrance of the inlet is modeled using actuator disk theory. Results are presented for two different inlet vane and screen configurations. The numerical predictions are in good agreement with experimental data. The dual potential procedure was also applied to calculate the viscous flow along two and three dimensional troughs. Viscous effects are simulated by injecting vorticity which is computed from a boundary layer algorithm. For attached flow over a three dimensional trough, the present calculations are in good agreement with other numerical predictions. For separated flow, it is shown from a two dimensional analysis that the boundary layer approximation provides an accurate measure of the vorticity in regions close to the wall; whereas further away from the wall, caution has to be exercised in using the boundary-layer equations to supply vorticity to the dual potential formulation.

Rao, K. V.↗
NASA NTRS1989

Benchmark solutions for the galactic ion transport equations: Energy and spatially dependent problems

Nontrivial benchmark solutions are developed for the galactic ion transport (GIT) equations in the straight-ahead approximation. These equations are used to predict potential radiation hazards in the upper atmosphere and in space. Two levels of difficulty are considered: (1) energy independent, and (2) spatially independent. The analysis emphasizes analytical methods never before applied to the GIT equations. Most of the representations derived have been numerically implemented and compared to more approximate calculations. Accurate ion fluxes are obtained (3 to 5 digits) for nontrivial sources. For monoenergetic beams, both accurate doses and fluxes are found. The benchmarks presented are useful in assessing the accuracy of transport algorithms designed to accommodate more complex radiation protection problems. In addition, these solutions can provide fast and accurate assessments of relatively simple shield configurations.

Ganapol, Barry D.↗
NASA NTRS1991

Investigation of vortex development on a pitching slender body of revolution

A computational study of the unsteady flow about a pitching 3.5 caliber tangent ogive forebody is presented. The flow is simulated using the full 3D unsteady Navier-Stokes equations and a time-accurate implicit algorithm. Comparison to available experimental data for a steady 20 deg case is presented as validation. Effects of grid resolution and a comparison of solutions using full Navier-Stokes and the thin-layer approximation are included. The forebody is simulated in a 'pitch-up to 20 deg and hold' maneuver, and two different pitch axis locations are used in the study. Examination of the unsteady vorticity field for the pitch-up cases reveals the formation of strong shear layers as the body decelerates, and their roll-up into vortical structures in a process similar to that observed in airfoil dynamic stall. Pronounced vortex/surface interactions are seen which produce multiple secondary separation regions, ejection of vorticity from the surface, and embedded regions of high suction.

Stanek, M. J.↗
NASA NTRS1990

Temporal and spatial variability of the tropical radiation budget from ERBS measurements (March 1985 to February 1986)

The diurnal and regional variations of the top-of-atmosphere radiation budget in the tropics are examined and the relative importance of these variations are assessed. The variations of the radiation components with scene type and the radiative effects of clouds are investigated. The LW emission shows the strongest diurnal variation over clear desert and land scenes, with domain-averaged diurnal ranges of approximately 50 W/sq m and 35 W/sq m, respectively. The LW emission over clear and tropical oceans show a small diurnal range of less than 1 W/sq m. A bias in the ERBE scene ID algorithm against clear tropical scenes at night is evident in the LW diurnal variation results for clear scenes. The effect of tropical water vapor resulting in low LW emission to space is diagnosed as the principal source of uncertainty in scene identification at night. Regional cloud forcing results show a strong dependence of net forcing on cloud type. While high cirrus clouds largely contribute to a small positive net forcing, low stratiform clouds primarily account for a large negative net forcing.

Chang, T. Y.↗
NASA NTRS1996

High Performance Parallel Multigrid Algorithms for Unstructured Grids

We describe a high performance parallel multigrid algorithm for a rather general class of unstructured grid problems in two and three dimensions. The algorithm PUMG, for parallel unstructured multigrid, is related in structure to the parallel multigrid algorithm PSMG introduced by McBryan and Frederickson, for they both obtain a higher convergence rate through the use of multiple coarse grids. Another reason for the high convergence rate of PUMG is its smoother, an approximate inverse developed by Baumgardner and Frederickson.

Frederickson, Paul O.↗
NASA NTRS1999

Generation of Level 3 SMMR and SSM/I Brightness Temperatures for the Period 1978-1999

The NOAA/NASA Pathfinder Program was initially designed to assure that certain key remote sensing data sets of particular significance to global change research were scientifically validated, consistently processed and made readily available to the research community at minimal cost. Through this Program the National Snow and Ice Data Center (NSIDC), University of Colorado has successfully processed, archived and distributed the Scanning Multichannel Microwave Radiometer (SMMR) and Special Sensor Microwave/Imager (SSM/I) Level 3 (EASE-Grid format) Pathfinder data sets for the period 1978 to 1999. These data are routinely distributed to approximately 150 researchers through various media including CD-ROM, 8 mm tape, ftp and the EOS Information Management System (IMS). At NSIDC these data are currently being applied in the development and validation of algorithms to derive snow water equivalent (NASA NAG5-6636), the mapping of frozen ground and the detection of the onset of melt over ice sheets, sea ice and snow cover. The EASE-Grid format, developed at NSIDC in conjunction with the SMMR-SSM/I Pathfinder project has also been applied to Advanced Very High Resolution Radiometer (AVHRR) and TOVS Pathfinder data, as well as ancillary data such as digital elevation, land cover classification and several in situ data sets. EASE-Grid will also be used for all land products derived from the NASA EOS AMSR-E instrument.

Partington, Kim↗
NASA NTRS2002

Algorithms for Autonomous GPS Orbit Determination and Formation Flying: Investigation of Initialization Approaches and Orbit Determination for HEO

This report summarizes the efforts to date in processing GPS measurements in High Earth Orbit (HEO) applications by the Colorado Center for Astrodynamics Research (CCAR). Two specific projects were conducted; initialization of the orbit propagation software, GEODE, using nominal orbital elements for the IMEX orbit, and processing of actual and simulated GPS data from the AMSAT satellite using a Doppler-only batch filter. CCAR has investigated a number of approaches for initialization of the GEODE orbit estimator with little a priori information. This document describes a batch solution approach that uses pseudorange or Doppler measurements collected over an orbital arc to compute an epoch state estimate. The algorithm is based on limited orbital element knowledge from which a coarse estimate of satellite position and velocity can be determined and used to initialize GEODE. This algorithm assumes knowledge of nominal orbital elements, (a, e, i, omega, omega) and uses a search on time of perigee passage (tau(sub p)) to estimate the host satellite position within the orbit and the approximate receiver clock bias. Results of the method are shown for a simulation including large orbital uncertainties and measurement errors. In addition, CCAR has attempted to process GPS data from the AMSAT satellite to obtain an initial estimation of the orbit. Limited GPS data have been received to date, with few satellites tracked and no computed point solutions. Unknown variables in the received data have made computations of a precise orbit using the recovered pseudorange difficult. This document describes the Doppler-only batch approach used to compute the AMSAT orbit. Both actual flight data from AMSAT, and simulated data generated using the Satellite Tool Kit and Goddard Space Flight Center's Flight Simulator, were processed. Results for each case and conclusion are presented.

Axelrad, Penina↗
NASA NTRS1991

Modeling the spatiotemporal organization of velocity storage in the vestibuloocular reflex by optokinetic studies

1. A generalized three-dimensional state space model of visual vestibular interaction was developed. Matrix and dynamical system operators associated with inputs from the semicircular canals, otolith velocity estimator, and the visual system have been incorporated into the model, which focus on their relationship to the velocity storage integrator. 2. A relationship was postulated between the eigenvalues and the direction of the eigenvectors of the system matrix and the orientation of the spatial vertical. It was assumed that the system matrix for a tilted position was a composition of two linear transformations of the system matrix for the upright position. One transformation modifies the eigenvalues of the system matrix, whereas another rotates the eigenvectors of the system matrix. The pitch and roll eigenvectors rotate with the head, whereas the yaw axis eigenvector remains approximately spatially invariant. 3. Based on the three-dimensional model, a computational procedure was formulated to identify the eigenvalues and eigenvectors of the system matrix with the use of a modification of the marquardt algorithm. With the use of data obtained from a monkey, it was shown that the three-dimensional behavior of velocity storage cannot be predicted solely in terms of its time constants, i.e., the inverse of its eigenvalues. With the use of the same eigenvalues the data could either be fit or not fit, depending on the eigenvector directions. Therefore, it is necessary to specify eigenvector directions when characterizing velocity storage in three dimensions. 4. Parameters found with the use of the Marquardt algorithm were incorporated into the model. Diagonal matrices in a head coordinate frame were introduced for coupling the visual system to the integrator and to the direct optokinetic pathway. Simulations of optokinetic nystagmus (OKN) and optokinetic after-nystagmus (OKAN) were run. The model predicted the behavior of yaw and pitch OKN and OKAN when the animal is upright. It also predicted the cross-coupling in the side down position. The trajectories in velocity space were also accurately simulated. 5. One of the predictions of the model is that when the stimulus direction is along an eigenvector, the trajectory in velocity space is a straight line. Using the "spectral width" of the residuals from a straight line sequence during OKAN, we developed a methodology to estimate how close the OKAN decay was to an eigenvector trajectory. 6. Thus we have developed a model-based approach for studying and interpreting the response characteristics of velocity storage in three dimensions.(ABSTRACT TRUNCATED AT 400 WORDS).

Non-NASA Center↗
NASA NTRS2009

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗
NASA NTRS1975

On the cost of approximating and recognizing a noise perturbed straight line or a quadratic curve segment in the plane

Approximation of noisy data in the plane by straight lines or elliptic or single-branch hyperbolic curve segments arises in pattern recognition, data compaction, and other problems. The efficient search for and approximation of data by such curves were examined. Recursive least-squares linear curve-fitting was used, and ellipses and hyperbolas are parameterized as quadratic functions in x and y. The error minimized by the algorithm is interpreted, and central processing unit (CPU) times for estimating parameters for fitting straight lines and quadratic curves were determined and compared. CPU time for data search was also determined for the case of straight line fitting. Quadratic curve fitting is shown to require about six times as much CPU time as does straight line fitting, and curves relating CPU time and fitting error were determined for straight line fitting. Results are derived on early sequential determination of whether or not the underlying curve is a straight line.

Cooper, D. B.↗
NASA NTRS1975

Multidimensional Hermite-Gaussian quadrature formulae and their application to nonlinear estimation

A simplified technique is proposed for calculating multidimensional Hermite-Gaussian quadratures that involves taking the square root of a matrix by the Cholesky algorithm rather than computation of the eigenvectors of the matrix. Ways of reducing the dimension, number, and order of the quadratures are set forth. If the function f(x) under the integral sign is not well approximated by a low-order algebraic expression, the order of the quadrature may be reduced by factoring f(x) into an expression that is nearly algebraic and one that is Gaussian.

Mcreynolds, S. R.↗
NASA NTRS1981

An algorithm for the rapid location of an extreme of a function subject only to geometric restrictions

The requirements of symmetry and convexity in the application of algorithms for the minimization or maximization of a function are discussed. It is argued that if a function of a single variable is convex and symmetric in a neighborhood of an extremum, the extremum may be approximated to the precision that increases by at least a power of two per functional evaluation. The procedure may be used to drive a complex optimization procedure in the multivariate area estimation problem encountered in remote sensing.

Terrell, G. R.↗