Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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,531 records · Page 85

Drag Prediction and Transition in Hypersonic Flow

This paper discusses progress on issues such as instability studies, nose-bluntness and angle-of-attack effects, and leading-edge-contamination problems from theoretical, computational, and experimental points of view. Also included is a review of wind-tunnel and flight data, including high-Re flight transition data, the levels of noise in flight and in wind tunnels, and how noise levels can affect parametric trends. A review of work done on drag accounting and the role of viscous drag for hypersonic vehicles is also provided.

Reed, Helen L.↗

Trenholm State (AL) Technical College High School Science Enrichment Program 1996-1997 Evaluation Report

This document presents findings based on a third-year evaluation of Trenholm State (AL) Technical College's National Aeronautics and Space Administration (NASA) - supported High School Science Enrichment Program (HSSEP). HSSEP is an external (to school) program for area students from groups that are underrepresented in the mathematics, science, engineering and technology (MSET) professions. In addition to gaining insight into scientific careers, HSSEP participants learn about and deliver presentations that focus on mathematics applications, scientific problem-solving and computer programming during a seven-week summer or 10-week Academic-Year Saturday session.

Ross, Elizabeth G.↗

Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver

A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring minimal additional communication overhead. Good scalability is demonstrated on a 128 processor SGI Origin 2000 machine and on a 512 processor CRAY T3E machine for reasonably fine grids. The feasibility of performing large-scale unstructured grid calculations with the parallel multigrid algorithm is demonstrated by computing the flow over a partial-span flap wing high-lift geometry on a highly resolved grid of 13.5 million points in approximately 4 hours of wall clock time on the CRAY T3E.

Mavriplis, Dimitri J.↗

On Convergence Acceleration Techniques for Unstructured Meshes

A discussion of convergence acceleration techniques as they relate to computational fluid dynamics problems on unstructured meshes is given. Rather than providing a detailed description of particular methods, the various different building blocks of current solution techniques are discussed and examples of solution strategies using one or several of these ideas are given. Issues relating to unstructured grid CFD problems are given additional consideration, including suitability of algorithms to current hardware trends, memory and cpu tradeoffs, treatment of non-linearities, and the development of efficient strategies for handling anisotropy-induced stiffness. The outlook for future potential improvements is also discussed.

Mavriplis, Dimitri J.↗

Prediction of Hyper-X Stage Separation Aerodynamics Using CFD

The NASA X-43 "Hyper-X" hypersonic research vehicle will be boosted to a Mach 7 flight test condition mounted on the nose of an Orbital Sciences Pegasus launch vehicle. The separation of the research vehicle from the Pegasus presents some unique aerodynamic problems, for which computational fluid dynamics has played a role in the analysis. This paper describes the use of several CFD methods for investigating the aerodynamics of the research and launch vehicles in close proximity. Specifically addressed are unsteady effects, aerodynamic database extrapolation, and differences between wind tunnel and flight environments.

Buning, Pieter G.↗

Finding the Closest Surface Point

To find the closest surface point to a given point is one of the most frequently used operations in geometric computation. Traditionally, this problem has been formulated by a linear Newton method. To improve robustness for this operation, I present a different formulation, with a second order method, for the general cases, and ways to handle the degeneracy at the apex of a cone, a commonly occurring surface degeneracy.

Chou, Jin J.↗

Discovering Planetary Nebula Geometries: Explorations with a Hierarchy of Models

Astronomical objects known as planetary nebulae (PNe) consist of a shell of gas expelled by an aging medium-sized star as it makes its transition from a red giant to a white dwarf. In many cases this gas shell can be approximately described as a prolate ellipsoid. Knowledge of the physics of ionization processes in this gaseous shell enables us to construct a model in three dimensions (3D) called the Ionization-Bounded Prolate Ellipsoidal Shell model (IBPES model). Using this model we can generate synthetic nebular images, which can be used in conjunction with Hubble Space Telescope (HST) images of actual PNe to perform Bayesian model estimation. Since the IBPES model is characterized by thirteen parameters, model estimation requires the search of a 13-dimensional parameter space. The 'curse of dimensionality,' compounded by a computationally intense forward problem, makes forward searches extremely time-consuming and frequently causes them to become trapped in local solutions. We find that both the speed and of the search can be improved by judiciously reducing the dimensionality of the search space. Our basic approach employs a hierarchy of models of increasing complexity that converges to the IBPES model. Earlier studies establish that a hierarchical sequence converges more quickly, and to a better solution, than a search relying only on the most complex model. Here we report results for a hierarchy of five models. The first three models treat the nebula as a 2D image, while the last two models explore its characteristics as a 3D object and enable us to characterize the physics of the nebula. This five-model hierarchy is applied to HST images of ellipsoidal PNe to estimate their geometric properties and gas density profiles.

Huyser, Karen A.↗

Multidisciplinary Optimization Methods for Aircraft Preliminary Design

This paper describes a research program aimed at improved methods for multidisciplinary design and optimization of large-scale aeronautical systems. The research involves new approaches to system decomposition, interdisciplinary communication, and methods of exploiting coarse-grained parallelism for analysis and optimization. A new architecture, that involves a tight coupling between optimization and analysis, is intended to improve efficiency while simplifying the structure of multidisciplinary, computation-intensive design problems involving many analysis disciplines and perhaps hundreds of design variables. Work in two areas is described here: system decomposition using compatibility constraints to simplify the analysis structure and take advantage of coarse-grained parallelism; and collaborative optimization, a decomposition of the optimization process to permit parallel design and to simplify interdisciplinary communication requirements.

Kroo, Ilan↗

Demonstration of Self-Training Autonomous Neural Networks in Space Vehicle Docking Simulations

Neural Networks have been under examination for decades in many areas of research, with varying degrees of success and acceptance. Key goals of computer learning, rapid problem solution, and automatic adaptation have been elusive at best. This paper summarizes efforts at NASA's Marshall Space Flight Center harnessing such technology to autonomous space vehicle docking for the purpose of evaluating applicability to future missions.

Patrick, M. Clinton↗

Optical Imaging and Radiometric Modeling and Simulation

OPTOOL software is a general-purpose optical systems analysis tool that was developed to offer a solution to problems associated with computational programs written for the James Webb Space Telescope optical system. It integrates existing routines into coherent processes, and provides a structure with reusable capabilities that allow additional processes to be quickly developed and integrated. It has an extensive graphical user interface, which makes the tool more intuitive and friendly. OPTOOL is implemented using MATLAB with a Fourier optics-based approach for point spread function (PSF) calculations. It features parametric and Monte Carlo simulation capabilities, and uses a direct integration calculation to permit high spatial sampling of the PSF. Exit pupil optical path difference (OPD) maps can be generated using combinations of Zernike polynomials or shaped power spectral densities. The graphical user interface allows rapid creation of arbitrary pupil geometries, and entry of all other modeling parameters to support basic imaging and radiometric analyses. OPTOOL provides the capability to generate wavefront-error (WFE) maps for arbitrary grid sizes. These maps are 2D arrays containing digital sampled versions of functions ranging from Zernike polynomials to combination of sinusoidal wave functions in 2D, to functions generated from a spatial frequency power spectral distribution (PSD). It also can generate optical transfer functions (OTFs), which are incorporated into the PSF calculation. The user can specify radiometrics for the target and sky background, and key performance parameters for the instrument s focal plane array (FPA). This radiometric and detector model setup is fairly extensive, and includes parameters such as zodiacal background, thermal emission noise, read noise, and dark current. The setup also includes target spectral energy distribution as a function of wavelength for polychromatic sources, detector pixel size, and the FPA s charge diffusion modulation transfer function (MTF).

Ha, Kong Q.↗

Docking Offset Between the Space Shuttle and the International Space Station and Resulting Impacts to the Transfer of Attitude Reference and Control

The Space Shuttle does not dock at an exact 90 degrees to the International Space Station (ISS) x-body axis. This offset from 90 degrees, along with error sources within their respective attitude knowledge, causes the two vehicles to never completely agree on their attitude, even though they operate as a single, mated stack while docked. The docking offset can be measured in flight when both vehicles have good attitude reference and is a critical component in calculations to transfer attitude reference from one vehicle to another. This paper will describe how the docking offset and attitude reference errors between both vehicles are measured and how this information would be used to recover Shuttle attitude reference from ISS in the event of multiple failures. During STS-117, ISS on-board Guidance, Navigation and Control (GNC) computers began having problems and after several continuous restarts, the systems failed. The failure took the ability for ISS to maintain attitude knowledge. This paper will also demonstrate how with knowledge of the docking offset, the contingency procedure to recover Shuttle attitude reference from ISS was reversed in order to provide ISS an attitude reference from Shuttle. Finally, this paper will show how knowledge of the docking offset can be used to speed up attitude control handovers from Shuttle to ISS momentum management. By taking into account the docking offset, Shuttle can be commanded to hold a more precise attitude which better agrees with the ISS commanded attitude such that start up transients with the ISS momentum management controllers are reduced. By reducing start-up transients, attitude control can be transferred from Shuttle to ISS without the use of ISS thrusters saving precious on-board propellant, crew time and minimizing loads placed upon the mated stack.

Helms, W. Jason↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

surface management↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

taxi scheduler↗

Extrusion of Complex Surface Meshes Utilizing Face Offsetting and Mean Curvature Smoothing

Grids for three-dimensional Computational Fluid Dynamics problems frequently require a prismatic layer of cells, typically extruded in the off-body direction from a two-dimensional surface mesh to properly resolve boundary layers. When the surface geometry is complex, the extrusion process can fail, resulting in the physical boundary layer being thicker than the prismatic layer, leading to under-resolved boundary layers. To address the shortcomings of existing grid generation tools, a new tool has been developed as part of the Mesh Tools suite, that is capable of extruding complex surface meshes. The new tool uses a face offsetting method to preserve surface curvature and a mean curvature smoothing algorithm to prevent the cells from self-intersecting in concave regions. Testing of the new tool found that not only were complex surface meshes able to be extruded to the desired thickness, but extrusion of simple surface meshes was also improved, due to the face offsetting method.

mesh extrusion↗

Models of Earth's Atmosphere (120 to 1000 Km)

Atmospheric conditions encountered by a spacecraft in orbit about the Earth are important factors in space vehicle design, mission planning, and mission operations. Density is the primary atmospheric property that affects the spacecraft's orbital altitude, lifetime, and motion in the altitude range of 120 to 1000 kilometers. Near the lower limit of this range where density is greatest, a spacecraft will generally remain in orbit for a very short time; near the upper limit, the density effect on orbital lifetime is almost negligible. Density directly affects the torques which result from aerodynamic interaction between the space vehicle and the atmosphere; such torques must be considered in design of spacecraft attitude control systems. Density scale height is required in heating calculations for space vehicles re-entering the Earth's upper atmosphere. Density as well as chemical composition and temperature are needed in calculating a spacecraft's drag coefficient. Chemical composition and temperature also are required in the design of experiment sensors to be flown in this altitude range. Because of variability of atmospheric conditions with spatial location and solar condition, invariant models of the Earth's atmosphere (120 to 1000 kilometers) would not be useful for most engineering applications. Therefore, this monograph presents a computerized version of Jacchia's prediction method to provide models of the Earth's atmosphere which vary with solar condition and location. The resulting atmospheric models, which are predicted for particular times and locations, provide atmospheric density, chemical composition, temperature, molecular mass, and density scale height between 120 and 1000 kilometers altitude. In addition to the computerized method, a quick-look prediction method is given that may be used to obtain an estimate of atmospheric density for any time and spatial location without the use of a computer. A sample problem illustrates this method. Both methods provide models of mean density and models having reasonable upper extremes for density. The analytical approaches in both methods are considered to be the best available, but they could be refined considerably by additional data and study. Information contained in this monograph applies to altitudes between 120 and 1000 kilometers; other design criteria monographs in this series will provide atmospheric information below this altitude region.

Weidner, D. K.↗

Polynomial time blackbox identity testers for depth-3 circuits : the field doesn't matter.

Let C be a depth-3 circuit with n variables, degree d and top fanin k (called {Sigma}{Pi}{Sigma}(k, d, n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically zero. Klivans & Spielman (STOC 2001) observed that the problem is open even when k is a constant. This case has been subjected to a serious study over the past few years, starting from the work of Dvir & Shpilka (STOC 2005). We give the first polynomial time blackbox algorithm for this problem. Our algorithm runs in time poly(n)d{sup k}, regardless of the base field. The only field for which polynomial time algorithms were previously known is F = Q (Kayal & Saraf, FOCS 2009, and Saxena & Seshadhri, FOCS 2010). This is the first blackbox algorithm for depth-3 circuits that does not use the rank based approaches of Karnin & Shpilka (CCC 2008). We prove an important tool for the study of depth-3 identities. We design a blackbox polynomial time transformation that reduces the number of variables in a {Sigma}{Pi}{Sigma}(k, d, n) circuit to k variables, but preserves the identity structure. Polynomial identity testing (PIT) is a major open problem in theoretical computer science. The input is an arithmetic circuit that computes a polynomial p(x{sub 1}, x{sub 2},..., x{sub n}) over a base field F. We wish to check if p is the zero polynomial, or in other words, is identically zero. We may be provided with an explicit circuit, or may only have blackbox access. In the latter case, we can only evaluate the polynomial p at various domain points. The main goal is to devise a deterministic blackbox polynomial time algorithm for PIT.

99 GENERAL AND MISCELLANEOUS↗

BGK-MD, Version 1.0

The software implements a heterogeneous multiscale method (HMM), which involves solving a classical molecular dynamics (MD) problem and then computes the entropy production in order to compute the relaxation times towards equilibrium for use in a Bhatnagar-Gross-Krook (BGK) solver.

Haack, Jeffrey↗

Probabilistic Forecasting of Generators Startups and Shutdowns in the MISO System Based on Random Forest

Solving security constrained unit commitment (SCUC) problems to plan an economical generation schedule for day-head electricity market has been an important research topic in recent years. Mixed integer programming method (MIP), the-state-of-art approach for solving SCUC problem, is known computationally hard when the number of binary status variables is large. In this paper, a machine learning-based algorithm - random forest (RF), was applied to forecast the startups (SU) and shutdowns (SD) hours of generators, based on historical hourly system condition observations in the Midcontinent Independent System Operator (MISO) system. The main purpose is to reduce the number of binary status variables, by fixing the SU/SD hours to a narrow range of high confidence. This would significantly reduce the size of the decision space, and therefore speed up SCUC solutions with reduced uncertainty.

Lin, Xinming↗