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 73 records · Page 4

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

Topologically protected Grover's oracle for the partition problem

The number partitioning problem (NPP) is one of the NP-complete (nondeterministic polynomial-time complete) computational problems. Its definite exact solution generally requires a check of all $N$ solution candidates, which is exponentially large. Here we describe a path to the fast solution of this problem in $\sqrt{N}$ quasi-adiabatic quantum annealing steps. We argue that the errors due to the finite duration of the quantum annealing can be suppressed if the annealing time scales with $N$ only logarithmically. Moreover, our adiabatic oracle is topologically protected, in the sense that it is robust against small uncertainty and slow time dependence of the physical parameters or the choice of the annealing protocol. In conclusion, we also argue that our approach can solve many other famous NP-complete computational problems in $\sqrt{N}$ steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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

Building problem solving environments with the arches framework

The computational problems that scientists face are rapidly escalating in size and scope. Moreover, the computer systems used to solve these problems are becoming significantly more complex than the familiar, well-understood sequential model on their desktops. While it is possible to re-train scientists to use emerging high-performance computing (HPC) models, it is much more effective to provide them with a higher-level programming environment that has been specialized to their particular domain. By fostering interaction between HPC specialists and the domain scientists, problem-solving environments (PSEs) provide a collaborative environment. A PSE environment allows scientists to focus on expressing their computational problem while the PSE and associated tools support mapping that domain-specific problem to a high-performance computing system. This article describes Arches, an object-oriented framework for building domain-specific PSEs. The framework was designed to support a wide range of problem domains and to be extensible to support very different high-performance computing targets. To demonstrate this flexibility, two PSEs have been developed from the Arches framework to solve problem in two different domains and target very different computing platforms. The Coven PSE supports parallel applications that require large-scale parallelism found in cost-effective Beowulf clusters. In contrast, RCADE targets FPGA-based reconfigurable computing and was originally designed to aid NASA Earth scientists studying satellite instrument data.

99 GENERAL AND MISCELLANEOUS↗

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

Distributed non-equilibrium Green’s function algorithms for the simulation of nanoelectronic devices with scattering

Through the non-equilibrium Green’s function (NEGF) formalism, quantum-scale device simulation can be performed with the inclusion of electron-phonon scattering. Yet, the simulation of realistically sized devices under the NEGF formalism typically requires prohibitive amounts of memory and computation time. Two of the most demanding computational problems for NEGF simulation involve mathematical operations with structured matrices called semiseparable matrices. In this work, we present parallel approaches for these computational problems which allow for efficient distribution of both memory and computation based upon the underlying device structure. This is vital when simulating realistically sized devices due to the aforementioned computational burdens. First, we consider determining a distributed compact representation for the retarded Green’s function matrix G R . This compact representation is exact and allows for any entry in the matrix to be generated through the inherent semiseparable structure. The second parallel operation allows for the computation of electron density and current characteristics for the device. Specifically, matrix products between the distributed representation for the semiseparable matrix G R and the self-energy scattering terms in Σ < produce the less-than Green’s function G < . As an illustration of the computational efficiency of our approach, we stably generate the mobility for nanowires with cross-sectional sizes as large as 4.5 nm, assuming an atomistic model with scattering.

47 OTHER INSTRUMENTATION↗

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

On Undecidability Aspects of Resilient Computations and Implications to Exascale

Future Exascale computing systems with a large number of processors, memory elements and interconnection links, are expected to experience multiple, complex faults, which affect both applications and operating-runtime systems. A variety of algorithms, frameworks and tools are being proposed to realize and/or verify the resilience properties of computations that guarantee correct results on failure-prone computing systems. We analytically show that certain resilient computation problems in presence of general classes of faults are undecidable, that is, no algorithms exist for solving them. We first show that the membership verification in a generic set of resilient computations is undecidable. We describe classes of faults that can create infinite loops or non-halting computations, whose detection in general is undecidable. We then show certain resilient computation problems to be undecidable by using reductions from the loop detection and halting problems under two formulations, namely, an abstract programming language and Turing machines, respectively. These two reductions highlight different failure effects: the former represents program and data corruption, and the latter illustrates incorrect program execution. These results call for broad-based, well-characterized resilience approaches that complement purely computational solutions using methods such as hardware monitors, co-designs, and system- and application-specific diagnosis codes.

Exascale systems↗

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↗

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. (Update of 2022 slides)

Quantum computing↗

Convergence acceleration and shock fitting for transonic aerodynamics computations

Two problems in computational fluid dynamics are studied in the context of transonic small-disturbance theory - namely, (1) how to speed up the convergence for currently available iterative procedures, and (2) how a shock-fitting method may be adapted to existing relaxation procedures with minimal alterations in computer programming and storage requirements. The paper contributes to a clarification of error analyses for sequence transformations based on the power method (including also the nonlinear transforms of Aitken, Shanks, and Wilkinson), and to developing a cyclic iterative procedure applying the transformations. Examples testing the procedure for a model Dirichlet problem and for a transonic airfoil problem show that savings in computer time by a factor of three to five are generally possible, depending on accuracy requirements and the particular iterative procedure used.-

Hafez, M. M.↗