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 55 records · Page 3

Benchmark problems in computational aeroacoustics

A recent directive at NASA Langley is aimed at numerically predicting principal noise sources. During my summer stay, I worked with high-order ENO code, developed by Dr. Harold Atkins, for solving the unsteady compressible Navier-Stokes equations, as it applies to computational aeroacoustics (CAA). A CAA workshop, composed of six categories of benchmark problems, has been organized to test various numerical properties of code. My task was to determine the robustness of Atkins' code for these test problems. In one category, we tested the nonlinear wave propagation of the code for the one-dimensional Euler equations, with initial pressure, density, and velocity conditions. Using freestream boundary conditions, our results were plausible. In another category, we solved the linearized two-dimensional Euler equations to test the effectiveness of radiation boundary conditions. Here we utilized MAPLE to compute eigenvalues and eigenvectors of the Jacobian given variable and flux vectors. We experienced a minor problem with inflow and outflow boundary conditions. Next, we solved the quasi one dimensional unsteady flow equations with an incoming acoustic wave of amplitude 10(exp -6). The small amplitude sound wave was incident on a convergent-divergent nozzle. After finding a steady-state solution and then marching forward, our solution indicated that after 30 periods the acoustic wave had dissipated (a period is time required for sound wave to traverse one end of nozzle to other end).

Porter-Locklear, Freda↗

The Calculation of Diffusion Properties for Open Shell Molecules

- Navier-Stokes requires as input various collision integrals for gases - Diffusion, - Viscosity - Thermal conductivity - Thermal diffusion ... - Levin, Stallcop and Partridge state-of-the-art - Non-Relativistic Born-Oppenheimer Approximation (freeze nuclei first, let them move second) - Solve electron problem: Compute realistic Potential Curves (PC) from first principles, - Solve nuclei problem: Compute scattering properties for each PC using sophisticated semi-classical method - Compute cross sections - Compute appropriate thermal collision integrals

STMD↗

External Boundary Conditions for Three-Dimensional Problems of Computational Aerodynamics

We consider an unbounded steady-state flow of viscous fluid over a three-dimensional finite body or configuration of bodies. For the purpose of solving this flow problem numerically, we discretize the governing equations (Navier-Stokes) on a finite-difference grid. The grid obviously cannot stretch from the body up to infinity, because the number of the discrete variables in that case would not be finite. Therefore, prior to the discretization we truncate the original unbounded flow domain by introducing some artificial computational boundary at a finite distance of the body. Typically, the artificial boundary is introduced in a natural way as the external boundary of the domain covered by the grid. The flow problem formulated only on the finite computational domain rather than on the original infinite domain is clearly subdefinite unless some artificial boundary conditions (ABC's) are specified at the external computational boundary. Similarly, the discretized flow problem is subdefinite (i.e., lacks equations with respect to unknowns) unless a special closing procedure is implemented at this artificial boundary. The closing procedure in the discrete case is called the ABC's as well. In this paper, we present an innovative approach to constructing highly accurate ABC's for three-dimensional flow computations. The approach extends our previous technique developed for the two-dimensional case; it employs the finite-difference counterparts to Calderon's pseudodifferential boundary projections calculated in the framework of the difference potentials method (DPM) by Ryaben'kii. The resulting ABC's appear spatially nonlocal but particularly easy to implement along with the existing solvers. The new boundary conditions have been successfully combined with the NASA-developed production code TLNS3D and used for the analysis of wing-shaped configurations in subsonic (including incompressible limit) and transonic flow regimes. As demonstrated by the computational experiments and comparisons with the standard (local) methods, the DPM-based ABC's allow one to greatly reduce the size of the computational domain while still maintaining high accuracy of the numerical solution. Moreover, they may provide for a noticeable increase of the convergence rate of multigrid iterations.

Tsynkov, Semyon V.↗

Algebraic multigrid methods applied to problems in computational structural mechanics

The development of algebraic multigrid (AMG) methods and their application to certain problems in structural mechanics are described with emphasis on two- and three-dimensional linear elasticity equations and the 'jacket problems' (three-dimensional beam structures). Various possible extensions of AMG are also described. The basic idea of AMG is to develop the discretization sequence based on the target matrix and not the differential equation. Therefore, the matrix is analyzed for certain dependencies that permit the proper construction of coarser matrices and attendant transfer operators. In this manner, AMG appears to be adaptable to structural analysis applications.

Mccormick, Steve↗

Critical problems of computational aeroacoustics

The aeroacoustics of rigid boundaries is discussed. Lighthill gave a formulation of this problem in which he showed that the sources of the acoustic field were quadrupole in nature. We have preferred a different formulation of the problem, in which the quadrupoles are sources for a nonlinear wave equation, as opposed to the linear one used by Lighthill. This is given here in a figure which also gives further details of a solution procedure for the Euler equations appropriate for the aeroelastic problem and motivated by the analysis of Crow. In accordance with our formulation, we contend that an algorithm for accurate solutions of an inhomogeneous nonlinear wave equation is of prime importance.

Rogers, Joel C. W.↗

Solution of structural analysis problems on a parallel computer

The problems of a blade-stiffened panel with a hole subjected to compression, and a deployable space mast subjected to tip loads, are treated through the application of FEM to model generation followed by the solution of a linear system of equations. Direct and iterative approaches to the solution of the linear systems are solved in turn; for the panel problems using varying numbers of processors, the incomplete Cholesky-conjugate gradient method was the fastest iterative method on all but two instances in which the number of processors was large.

Storaasli, Olaf↗

Application of PML Absorbing Boundary Conditions to the Benchmark Problems of Computational Aeroacoustics

Accurate numerical non-reflecting boundary conditions are important in all the proposed benchmark problems of the Second Workshop. Recently, a new absorbing boundary condition has been developed using Perfectly Matched Layer (PML) equations for the Euler equations. In this approach, a region with a width of a few grid points is introduced adjacent to the non-reflecting boundaries. In the added region, Perfectly Matched Layer equations are constructed and applied so that the out-going waves are absorbed inside the layer with little reflection to the interior domain. It will be demonstrated in the present paper that the proposed absorbing boundary condition is quite general and versatile, applicable to radiation boundaries as well as inflow and outflow boundaries. It is also easy to implement. The emphasis of the paper will be on the application of the PML absorbing boundary condition to problems in Categories 1, 2, and 3. In Category 1, solutions of problems 1 and 2 are presented. Both problems are solved using a multi-domain polar grid system. Perfectly Matched Layer equations for a circular boundary are constructed and their effectiveness assessed. In Category 2, solutions of problem 2 are presented. Here, in addition to the radiation boundary conditions at the far field in the axisymmetric coordinate system, the inflow boundary condition at the duct inlet is also dealt with using the proposed Perfectly Match Layer equations. At the inlet, a PML domain is introduced in which the incident duct mode is simulated while the waves reflected from the open end of the duct are absorbed at the same time. In Category 3, solutions of all three problems are presented. Again, the PML absorbing boundary condition is used at the inflow boundary so that the incoming vorticity wave is simulated while the outgoing acoustic waves are absorbed with very little numerical reflection. All the problems are solved using central difference schemes for spatial discretizations and the optimized Low-Dissipation and Low-Dispersion Runge-Kutta scheme for the time integration. Issues of numerical accuracy and efficiency are also addressed.

Hu, Fang Q.↗

Approximate method for calculating transonic flow about lifting wing-body configurations

The three-dimensional problem of transonic flow about lifting wing-body configurations is reduced to a two-variable computational problem with the method of matched asymptotic expansions. The computational problem is solved with the method of relaxation. The method accounts for leading-edge separation, the presence of shock waves, and the presence of solid, slotted, or porous tunnel walls. The Mach number range of the method extends from zero to the supersonic value at which the wing leading edge becomes sonic. A modified form of the transonic area rule which accounts for the effect of lift is developed. This effect is explained from simple physical considerations.

Barnwell, R. W.↗

Practical computation of the mixed mu problem

The computational aspects of the recently developed upper and lower bounds for the mixed mu problem are examined. In particular, a practical algorithm is developed to compute the bounds. This has been implemented as a Matlab function (m-file) and will be available in a test version in conjunction with the mu-Tools toolbox. The algorithm performance is very encouraging, in terms of both accuracy of the resulting bounds and growth rate in required computation with problem size. In particular, it appears that one can handle medium-size problems (less than 100 perturbations) with reasonable computational requirements.

Young, Peter M.↗

Application of low dissipation and dispersion Runge-Kutta schemes to benchmark problems in computational aeroacoustics

We investigate accurate and efficient time advancing methods for computational aeroacoustics, where non-dissipative and non-dispersive properties are of critical importance. Our analysis pertains to the application of Runge-Kutta methods to high-order finite difference discretization. In many CFD applications, multi-stage Runge-Kutta schemes have often been favored for their low storage requirements and relatively large stability limits. For computing acoustic waves, however, the stability consideration alone is not sufficient, since the Runge-Kutta schemes entail both dissipation and dispersion errors. The time step is now limited by the tolerable dissipation and dispersion errors in the computation. In the present paper, it is shown that if the traditional Runge-Kutta schemes are used for time advancing in acoustic problems, time steps greatly smaller than that allowed by the stability limit are necessary. Low Dissipation and Dispersion Runge-Kutta (LDDRK) schemes are proposed, based on an optimization that minimizes the dissipation and dispersion errors for wave propagation. Optimizations of both single-step and two-step alternating schemes are considered. The proposed LDDRK schemes are remarkably more efficient than the classical Runge-Kutta schemes for acoustic computations. Numerical results of each Category of the Benchmark Problems are presented. Moreover, low storage implementations of the optimized schemes are discussed. Special issues of implementing numerical boundary conditions in the LDDRK schemes are also addressed.

Hu, F. Q.↗

Cumulative reports and publications through December 31, 1991

A reports and publications list is given from the Institute for Computer Applications in Science and Engineering (ICASE) through December 31, 1991. The major categories of the current ICASE research program are; numerical methods, control and parameter identification problems, computational problems in engineering and the physical sciences, and computer systems and software. Since ICASE reports are intended to be preprints of articles that will appear in journals or conference proceedings, the published reference is included when available.

Mathematics↗

Finite element solution techniques for large-scale problems in computational fluid dynamics

Element-by-element approximate factorization, implicit-explicit and adaptive implicit-explicit approximation procedures are presented for the finite-element formulations of large-scale fluid dynamics problems. The element-by-element approximation scheme totally eliminates the need for formation, storage and inversion of large global matrices. Implicit-explicit schemes, which are approximations to implicit schemes, substantially reduce the computational burden associated with large global matrices. In the adaptive implicit-explicit scheme, the implicit elements are selected dynamically based on element level stability and accuracy considerations. This scheme provides implicit refinement where it is needed. The methods are applied to various problems governed by the convection-diffusion and incompressible Navier-Stokes equations. In all cases studied, the results obtained are indistinguishable from those obtained by the implicit formulations.

Liou, J.↗

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗

The mixture problem in computer mapping of terrain: Improved techniques for establishing spectral signature, atmospheric path radiance, and transmittance

The results of LANDSAT and Skylab research programs on the effects of the atmosphere on computer mapping of terrain include: (1) the concept of a ground truth map needs to be drastically revised; (2) the concept of training areas and test areas is not as simple as generally thought because of the problem of pixels that represent a mixture of terrain classes; (3) this mixture problem needs to be more widely recognized and dealt with by techniques of calculating spectral signatures of mixed classes, or by other methods; (4) atmospheric effects should be considered in computer mapping of terrain and in monitoring changes; and (5) terrain features may be used as calibration panels on the ground, from which atmospheric conditions can be determined and monitored. Results are presented of a test area in mountainous terrain of south-central Colorado for which an initial classification was made using simulated mixture-class spectral signatures and actual LANDSAT-1-MSS data.

Smedes, H. W.↗

Self-adaptive difference method for the effective solution of computationally complex problems of boundary layer theory

An implicit difference procedure for the solution of equations for a chemically reacting hypersonic boundary layer is described. Difference forms of arbitrary error order in the x and y coordinate plane were used to derive estimates for discretization error. Computational complexity and time were minimized by the use of this difference method and the iteration of the nonlinear boundary layer equations was regulated by discretization error. Velocity and temperature profiles are presented for Mach 20.14 and Mach 18.5; variables are velocity profiles, temperature profiles, mass flow factor, Stanton number, and friction drag coefficient; three figures include numeric data.

Schoenauer, W.↗

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire.

Quantum computing↗