Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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,585 records · Page 88

A Kosloff/Basal method, 3D migration program implemented on the CYBER 205 supercomputer

Conventional finite difference migration has relied on approximations to the acoustic wave equation which allow energy to propagate only downwards. Although generally reliable, such approaches usually do not yield an accurate migration for geological structures with strong lateral velocity variations or with steeply dipping reflectors. An earlier study by D. Kosloff and E. Baysal (Migration with the Full Acoustic Wave Equation) examined an alternative approach based on the full acoustic wave equation. The 2D, Fourier type algorithm which was developed was tested by Kosloff and Baysal against synthetic data and against physical model data. The results indicated that such a scheme gives accurate migration for complicated structures. This paper describes the development and testing of a vectorized, 3D migration program for the CYBER 205 using the Kosloff/Baysal method. The program can accept as many as 65,536 zero offset (stacked) traces.

Pyle, L. D.↗

Subsonic flight test evaluation of a performance seeking control algorithm on an F-15 airplane

The subsonic flight test evaluation phase of the NASA4 F-15 (powered by F100 engines) performance-seeking control program was completed for single-engine operation at part- and military-power settings. The subsonic performance-seeking control algorithm optimizes the quasi-steady-state performance of the propulsion system for three modes of operation: the minimum-fuel-flow mode, the minimum-temperature mode, and the maximum-thrust mode. Decreases in thrust-specific fuel consumption of 1 to 2 percent were measured in the minimum-fuel-flow mode; these fuel savings are significant especially for supersonic cruise aircraft. Decreases of up to approximately 100 R in fan turbine inlet temperature were measured in the minimum-temperature mode. Temperature reductions of this magnitude would more than double turbine life if inlet temperature was the only life factor. Measured thrust increases of up to approximately 15 percent in the maximum-thrust mode cause substantial increases in aircraft acceleration. The subsonic flight phase has validated the performance-seeking control technology which can significantly benefit the next generation of fighter and transport aircraft.

Gilyard, Glenn B.↗

Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

Ground-Based GPS as a Calibration/Validation Tool for Tropospheric Sensing Instruments

The tropospheric sensing capabilities of ground-based GPS have been the subject of intensive validation efforts in recent years. But a maturing GPS technology is now rapidly becoming a valuable calibration/validation tool in its own right. We will describe two applications where ground-based GPS receivers have been used as a calibration/validation tool. The first such case is the Cassini gravitational wave media calibration project. A water vapor radiometer (WVR) will calibrate the telemetry signal from the Cassini spacecraft for line-of-sight wet tropospheric fluctuations. The demanding mission specifications require that the WVR's retrieval of wet delay from measurements of brightness temperature be precisely calibrated. We will describe the results from a special campaign to calibrate the WVR's retrieval algorithm with GPS. The second case involves the Topex/Poseidon microwave radiometer (TMR) which is used to calibrate the altimetric measurement for the effect of tropospheric water vapor. Using GPS data from 1992 to 1997 we detected an anomalous drift in columnar water vapor measurements from the TMR. The TMR's spurious drift implies that the uncalibrated estimate of global mean sea level change from Topex/Poseidon is too low by approximately 1 mm/yr. We will discuss the challenges of using long-term time series and problems relating to using the global GPS network as a calibration tool.

Bar-Sever, Y. E.↗

Optimal Configurations for Rotating Spacecraft Formations

In this paper a new class of formations that maintain a constant shape as viewed from the Earth is introduced. An algorithm is developed to place n spacecraft in a constant shape formation spaced equally in time using the classical orbital elements. To first order, the dimensions of the formation are shown to be simple functions of orbit eccentricity and inclination. The performance of the formation is investigated over a Keplerian orbit using a performance measure based on a weighted average of the angular separations between spacecraft in formation. Analytic approximations are developed that yield optimum configurations for different values of n. The analytic approximations are shown to be in excellent agreement with the exact solutions.

Hughes, Steven P.↗

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗

A Proposed Clock Synchronization Method for the Solar System Internet

Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.

Michael Moy↗

Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes

This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.

ARMD↗

Two-dimensional Euler and Navier-Stokes Time accurate simulations of fan rotor flows

Two numerical methods are presented which describe the unsteady flow field in the blade-to-blade plane of an axial fan rotor. These methods solve the compressible, time-dependent, Euler and the compressible, turbulent, time-dependent, Navier-Stokes conservation equations for mass, momentum, and energy. The Navier-Stokes equations are written in Favre-averaged form and are closed with an approximate two-equation turbulence model with low Reynolds number and compressibility effects included. The unsteady aerodynamic component is obtained by superposing inflow or outflow unsteadiness to the steady conditions through time-dependent boundary conditions. The integration in space is performed by using a finite volume scheme, and the integration in time is performed by using k-stage Runge-Kutta schemes, k = 2,5. The numerical integration algorithm allows the reduction of the computational cost of an unsteady simulation involving high frequency disturbances in both CPU time and memory requirements. Less than 200 sec of CPU time are required to advance the Euler equations in a computational grid made up of about 2000 grid during 10,000 time steps on a CRAY Y-MP computer, with a required memory of less than 0.3 megawords.

Boretti, A. A.↗

A comparative study of an ABC and an artificial absorber for truncating finite element meshes

The type of mesh termination used in the context of finite element formulations plays a major role on the efficiency and accuracy of the field solution. The performance of an absorbing boundary condition (ABC) and an artificial absorber (a new concept) for terminating the finite element mesh was evaluated. This analysis is done in connection with the problem of scattering by a finite slot array in a thick ground plane. The two approximate mesh truncation schemes are compared with the exact finite element-boundary integral (FEM-BI) method in terms of accuracy and efficiency. It is demonstrated that both approximate truncation schemes yield reasonably accurate results even when the mesh is extended only 0.3 wavelengths away from the array aperture. However, the artificial absorber termination method leads to a substantially more efficient solution. Moreover, it is shown that the FEM-BI method remains quite competitive with the FEM-artificial absorber method when the FFT is used for computing the matrix-vector products in the iterative solution algorithm. These conclusions are indeed surprising and of major importance in electromagnetic simulations based on the finite element method.

Oezdemir, T.↗

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.↗

Modeling the Proton Radiation Belt With Van Allen Probes Relativistic Electron-Proton Telescope Data

An empirical model of the proton radiation belt is constructed from data taken during 2013-2017 by the Relativistic Electron-Proton Telescopes on the Van Allen Probes satellites. The model intensity is a function of time, kinetic energy in the range 18-600 megaelectronvolts, equatorial pitch angle, and L shell of proton guiding centers. Data are selected, on the basis of energy deposits in each of the nine silicon detectors, to reduce background caused by hard proton energy spectra at low L. Instrument response functions are computed by Monte Carlo integration, using simulated proton paths through a simplified structural model, to account for energy loss in shielding material for protons outside the nominal field of view. Overlap of energy channels, their wide angular response, and changing satellite orientation require the model dependencies on all three independent variables be determined simultaneously. This is done by least squares minimization with a customized steepest descent algorithm. Model uncertainty accounts for statistical data error and systematic error in the simulated instrument response. A proton energy spectrum is also computed from data taken during the 8 January 2014 solar event, to illustrate methods for the simpler case of an isotropic and homogeneous model distribution. Radiation belt and solar proton results are compared to intensities computed with a simplified, on-axis response that can provide a good approximation under limited circumstances.

Selesnick, R. S.↗

U.S. IMERG Status

The U.S. Science Team’s Integrated Multi-satellitE Retrievals for the Global Precipitation Measurement (GPM) mission (IMERG) product provides estimates of surface precipitation rate and related information on a global 0.1° half-hour grid. It is run three times at increasingly longer latency and higher information input to serve different communities. This presentation will briefly summarize the major upgrades included in Version 07. The Goddard Profiling (GPROF) algorithm (applied to passive microwave sensor data from the GPM virtual constellation) and the Combined Radar-Radiometer Algorithm (CORRA) that provide input to IMERG V07 are both improved, and the new Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks–Dynamic Infrared Rain Rate (PDIR) algorithm is being applied to infrared data, which employs an additional, warmer infrared temperature threshold than the previous infrared scheme and a deep neural network. V07 has improved bias performance as a result of calibrations that now employ the entire swath widths of CORRA and GPROF GPM Microwave Imager precipitation estimates. As well, time continuity in precipitation features is improved as a result of changes to the Kalman filter that approximately preserve the local histogram of precipitation rates (Scheme for Histogram Adjustment with Ranked Precipitation Estimates in the Neighborhood, or SHARPEN), and that better account for differences in sensor performance. A long-standing bug in the geolocation that shifted grid values 0.1° to the east in the latitude band 70°N-S has been corrected. Other changes in V07 include a hierarchical selection among motion vector sources to address deficiencies in the precipitation propagation near orography, an update to the precipitation phase specification for improved consistency with current inputs, and a renewed effort to implement climatological gauge adjustment to the near-real-time Runs. Early evaluations of V07 IMERG show interesting behavior across the TRMM orbit boost that is highly relevant to the planned orbit boost for the GPM Core observatory.

GPM↗

An evaluation of rise time characterization and prediction methods

One common method of extrapolating sonic boom waveforms from aircraft to ground is to calculate the nonlinear distortion, and then add a rise time to each shock by a simple empirical rule. One common rule is the '3 over P' rule which calculates the rise time in milliseconds as three divided by the shock amplitude in psf. This rule was compared with the results of ZEPHYRUS, a comprehensive algorithm which calculates sonic boom propagation and extrapolation with the combined effects of nonlinearity, attenuation, dispersion, geometric spreading, and refraction in a stratified atmosphere. It is shown there that the simple empirical rule considerably overestimates the rise time estimate. In addition, the empirical rule does not account for variations in the rise time due to humidity variation or propagation history. It is also demonstrated that the rise time is only an approximate indicator of perceived loudness. Three waveforms with identical characteristics (shock placement, amplitude, and rise time), but with different shock shapes, are shown to give different calculated loudness. This paper is based in part on work performed at the Applied Research Laboratories, the University of Texas at Austin, and supported by NASA Langley.

Robinson, Leick D.↗

Impact of Emerging Computing Architectures and Opportunities for Process Systems Engineering Applications

Moore’s “law” was the observation that the number of transistors in an integrated circuit doubled approximately every two years. This trend has distinctly failed to hold in recent years. The death of Moore’s law has left researchers and practitioners in the computational sciences searching for technologies to provide the speedups formerly supported by Moore’s law. Previously overlooked chip architectures and other computing technologies are now receiving more development resources. Critically, these technologies are gaining more mature software support, opening their adoption by researchers in algorithms and applications. In this article, we review some of these computing technologies, their relationship with various algorithms and applications, and their potential benefits (or pitfalls). We close with recommendations for future work by the process systems engineering community specifically.

Emerging hardware↗

Convergence acceleration for a three-dimensional Euler/Navier-Stokes zonal approach

A fast diagonal algorithm is coupled with a zonal approach to solve the three-dimensional Euler/Navier-Stokes equations. Transonic viscous solutions are obtained on a 150,000 point mesh for a NACA 0012 wing. The new computational approach yields a speedup by as much as a factor of 40 over the standard Beam-Warming algorithm/zonal method originally coded. A three-order-of-magnitude drop in the L2-norm of the residual requires approximately 500 iterations, which takes about 45 min of CPU time on a Cray-XMP. The numerically computed solutions are in good agreement with experimental results. Effects on convergence rate owing to increasing the zonal boundary overlap regions, different stretching distributions in the viscous regions, and different CFL values are also explored.

Flores, J.↗

Effects of noise on modal parameters identified by the Eigensystem Realization Algorithm

The basic concept of the Eigensystem Realization Algorithm for modal parameter identification and model reduction is extended to minimize the distortion of the identified parameters caused by noise. The mathematical foundation for the properties of accuracy indicators, such as the singular values of the data matrix and modal amplitude coherence, is provided, based on knowledge of the noise characteristics. These indicators quantitatively discriminate noise from system information and are used to reduce the realized system model to a better approximation of the true model. Monte Carlo Simulations are included to support the analytical studies.

Juang, J.-N.↗