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 883 records · Page 49

Computational solution of atmospheric chemistry problems

Extensive studies were performed on problems of interest in atmospheric chemistry. In addition to several minor projects, four major projects were performed and described (theoretical studies of ground and low-lying excited states of ClO2; ground and excited state potential energy surfaces of the methyl peroxy radical; electronic states ot the FO radical; and theoretical studies S02 (H2O) (sub n)).

Jafri, J.↗

A numerical method for vortex sheet roll-up

The problem of computing vortex sheet roll-up from periodic analytic initial data is studied. Previous theoretical and numerical work is reviewed. Computational difficulties arising from ill posedness and singularity formation are discussed. A desingularization method is proposed to diminish these difficulties. Computations indicate that this approach converges past the time at which previous numerical investigations have failed to converge.

Krasny, R.↗

Gas scintillation drift chambers with wave shifter read-out for hard X-ray astronomy

A major improvement in hard X-ray and gamma ray astrophysics could be provided by high pressure xenon time projection chambers where gas scintillation is used both for the measurement of the time of interaction and for the detection of the extracted electrons. This allows three dimensional imaging of naturally complex events (photoelectric interaction with escape photon, Compton scatter, and pair production). A novel read-out system based on wave shifter fibers, which is well suited to the high pressures and large areas required of a hard X-ray telescope is proposed. Expected performances are computed, potential problems are outlined, and the experimental effort to solve these problems are described.

Sadoulet, Bernard↗

Optimal placement of excitations and sensors for verification of large dynamical systems

The computationally difficult problem of the optimal placement of excitations and sensors to maximize the observed measurements is studied within the framework of combinatorial optimization, and is solved numerically using a variation of the simulated annealing heuristic algorithm. Results of numerical experiments including a square plate and a 960 degrees-of-freedom Control of Flexible Structure (COFS) truss structure, are presented. Though the algorithm produces suboptimal solutions, its generality and simplicity allow the treatment of complex dynamical systems which would otherwise be difficult to handle.

Salama, M.↗

Artificial Intelligence (AI), Operations Research (OR), and Decision Support Systems (DSS): A conceptual framework

In recent years there has been increasing interest in applying the computer based problem solving techniques of Artificial Intelligence (AI), Operations Research (OR), and Decision Support Systems (DSS) to analyze extremely complex problems. A conceptual framework is developed for successfully integrating these three techniques. First, the fields of AI, OR, and DSS are defined and the relationships among the three fields are explored. Next, a comprehensive adaptive design methodology for AI and OR modeling within the context of a DSS is described. These observations are made: (1) the solution of extremely complex knowledge problems with ill-defined, changing requirements can benefit greatly from the use of the adaptive design process, (2) the field of DSS provides the focus on the decision making process essential for tailoring solutions to these complex problems, (3) the characteristics of AI, OR, and DSS tools appears to be converging rapidly, and (4) there is a growing need for an interdisciplinary AI/OR/DSS education.

Parnell, Gregory S.↗

Gaussian maximum likelihood and contextual classification algorithms for multicrop classification

The paper reviews some of the ways in which context has been handled in the remote-sensing literature, and additional possibilities are introduced. The problem of computing exhaustive and normalized class-membership probabilities from the likelihoods provided by the Gaussian maximum likelihood classifier (to be used as initial probability estimates to start relaxation) is discussed. An efficient implementation of probabilistic relaxation is proposed, suiting the needs of actual remote-sensing applications. A modified fuzzy-relaxation algorithm using generalized operations between fuzzy sets is presented. Combined use of the two relaxation algorithms is proposed to exploit context in multispectral classification of remotely sensed data. Results on both one artificially created image and one MSS data set are reported.

Di Zenzo, Silvano↗

An investigation of turbulence models

The accuracy to which a turbulent boundary layer or wake can be predicted numerically depends on the validity of the turbulence closure model used. The modeling of turbulence physics is one of the most difficult problems in computational fluid dynamics (CFD). In fact, it is one of the pacing factors in the development of CFD. In general, there are three main approaches to the description of trubulence physics. First is turbulence modeling in which the Reynolds averaged Navier-Stokes equations are used and some closure approximation is made for the Reynolds stresses. A second approach to turbulence is large eddy simulation (LES) in which the computational mesh is taken to be fine enough that the large scale structure of the turbulence can be calculated directly. An empirical assumption must be made for the small scale sub-grid turbulence. The third approach is direct simulation. In this technique the Navier-Strokes equations are solved directly on a mesh which if fine enough to resolve the smallest length scale of the turbulence. The Reynolds averaged equations are not used and no closure assumption is required. These last two approaches require extensive computer resources and as such are not engineering tools. The purpose of the work was to investigate the various engineering turbulence models for accuracy and ease of programming. This involved comparison of the models with each other and with experimental data.

Doria, Michael L.↗

Overlapping grids for flow field calculations

Many problems in computational fluid dynamics (CFD) involve the calculation of flow fields within or around complex geometric configurations. The flow solution is computed on a computational grid. The construction of the grid is one of the major difficulties in the application of CFD to the analysis of flow about actual aircraft configurations. Due to geometric complexity, the grid has to be constructed in simple subregions and then all of these subgrids have to be pieced together to form a complete grid for the entire flow field. The entire grid, which is called a composite grid because it is formed from many parts, may have common regions. In either case, the computation of the flow field, using any numerical algorithm, will require the transfer of information between individual subgrids. The transfer of information is more difficult with overlapping grids. Algorithms have been developed and tested for automating the transfer of information between two overlapping grids.

Mastin, Charles Wayne↗

The use of 3-D sensing techniques for on-line collision-free path planning

The state of the art in collision prevention for manipulators with revolute joints, showing that it is a particularly computationally hard problem, is discussed. Based on the analogy with other hard or undecidable problems such as theorem proving, an extensible multi-resolution architecture for path planning, based on a collection of weak methods is proposed. Finally, the role that sensors can play for an on-line use of sensor data is examined.

Hayward, V.↗

A computational challenge - Euler solution for ellipses

The Euler equations for flow past an ellipse are solved numerically. A computationally complex problem involving inviscid flow past an elliptical two-dimensional surface at subcritical Mach number and angle of attack is introduced. A lifting solution for any combination of grid and/or angle of attack which is nonsymmetric is obtained.

Pulliam, Thomas H.↗

Adaptive implicit-explicit finite element algorithms for fluid mechanics problems

The adaptive implicit-explicit (AIE) approach is presented for the finite-element solution of various problems in computational fluid mechanics. In the AIE approach, the elements are dynamically (adaptively) arranged into differently treated groups. The differences in treatment could be based on considerations such as the cost efficiency, the type of spatial or temporal discretization employed, the choice of field equations, etc. Several numerical tests are performed to demonstrate that this approach can achieve substantial savings in CPU time and memory.

Tezduyar, T. E.↗

The late behavior of supernova 1987A. I - The light curve. II - Gamma-ray transparency of the ejecta

Observations of the late (t = 20-1500 days) bolometric light curve and the gamma-lines and X-rays from supernova 1987A are compared to theoretical models. It is found that 0.073 + or - 0.015 solar masses of freshly synthesized Ni-56 must be present to fit the bolometric light curve. The results place limits on the luminosity and presumed period of the newly formed pulsar/neutron star. In the second half of the paper, the problem of computing the luminosities in gamma-ray lines and in X-rays from supernova 1987A is addressed. High-energy observations suggest the development of large-scale clumping and bubbling of radioactive material in the ejecta. A model is proposed with a hydrogen envelope mass of about 7 solar masses, homologous scale expansion velocities of about 3000 km/s, and an approximately uniform mass distribution.

Arnett, W. David↗

Hypercube-Computer Analysis Of Electromagnetic Scattering

Capabilities of hypercube and parallel processing demonstrated. Report describes use of Mark III Hypercube computer to analyze scattering of electromagnetic waves. Purpose of study to assess utility of parallel computing in such computation-intensive problems as large-scale electromagnetic scattering. Two electromagnetic codes based on different algorithms converted to run on Mark III Hypercube. First code implements finite-difference, time-domain solution of Maxwell's curl equations. Second code is Numerical Electromagnetics Code (NEC-2) which embodies frequency-domain method and developed to analyze electromagnetic responses of antennas and other metallic structures. On Mark III Hypercube with 32 active nodes, largest lattice contains about 2,048,000 unit cells.

Patterson, J. E.↗

Parallel Architectures and Parallel Algorithms for Integrated Vision Systems

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is a system that uses vision algorithms from all levels of processing to perform for a high level application (e.g., object recognition). An IVS normally involves algorithms from low level, intermediate level, and high level vision. Designing parallel architectures for vision systems is of tremendous interest to researchers. Several issues are addressed in parallel architectures and parallel algorithms for integrated vision systems.

Choudhary, Alok Nidhi↗

Formalisms for user interface specification and design

The application of formal methods to the specification and design of human-computer interfaces is described. A broad outline of human-computer interface problems, a description of the field of cognitive engineering and two relevant research results, the appropriateness of formal specification techniques, and potential NASA application areas are described.

Auernheimer, Brent J.↗

Adaptive implicit-explicit and parallel element-by-element iteration schemes

Adaptive implicit-explicit (AIE) and grouped element-by-element (GEBE) iteration schemes are presented for the finite element solution of large-scale problems in computational mechanics and physics. The AIE approach is based on the dynamic arrangement of the elements into differently treated groups. The GEBE procedure, which is a way of rewriting the EBE formulation to make its parallel processing potential and implementation more clear, is based on the static arrangement of the elements into groups with no inter-element coupling within each group. Various numerical tests performed demonstrate the savings in the CPU time and memory.

Tezduyar, T. E.↗

Improved Panel-Method/Potential-Flow Code

Panel code PMARC (Panel Method Ames Research Center) numerically simulates flow field around complex three-dimensional bodies, such as complete aircraft models. Based on potential-flow theory. Written in FORTRAN 77, with exception of namelist extension used for input. Structure facilitates addition of new features to code and tailoring of code to specific problems and computer hardware constraints.

Ashby, Dale L.↗

The inviscid stability of supersonic flow past heated or cooled axisymmetric bodies

The inviscid, linear, nonaxisymmetric, temporal stability of the boundary layer associated with the supersonic flow past axisymmetric bodies (with particular emphasis on long thin, straight circular cylinders), subject to heated or cooled wall conditions is investigated. The eigenvalue problem is computed in some detail for a particular Mach number or 3.8, revealing that the effect of curvature and the choice of wall conditions both have a significant effect on the stability of the flow. Both the asymptotic, large azimuthal wavenumber solution and the asymptotic, far downstream solution are obtained for the stability analysis and compared with numerical results. Additionally, asymptotic analyses valid for large radii of curvature with cooled/heated wall conditions, are presented. In general, important differences were found to exist between the wall temperature conditions imposed and the adiabatic wall conditions considered previously.

Shaw, Stephen J.↗