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 487 records · Page 27

Study of viscous flow about airfoils by the integro-differential method

An integro-differential method was used for numerically solving unsteady incompressible viscous flow problems. A computer program was prepared to solve the problem of an impulsively started 9% thick symmetric Joukowski airfoil at an angle of attack of 15 deg and a Reynolds number of 1000. Some of the results obtained for this problem were discussed and compared with related work completed previously. Two numerical procedures were used, an Alternating Direction Implicit (ADI) method and a Successive Line Relaxation (SLR) method. Generally, the ADI solution agrees well with the SLR solution and with previous results are stations away from the trailing edge. At the trailing edge station, the ADI solution differs substantially from previous results, while the vorticity profiles obtained from the SLR method there are in good qualitative agreement with previous results.

Wu, J. C.↗

Automating FEA programming

In this paper we briefly describe a combined symbolic and numeric approach for solving mathematical models on parallel computers. An experimental software system, PIER, is being developed in Common Lisp to synthesize computationally intensive and domain formulation dependent phases of finite element analysis (FEA) solution methods. Quantities for domain formulation like shape functions, element stiffness matrices, etc., are automatically derived using symbolic mathematical computations. The problem specific information and derived formulae are then used to generate (parallel) numerical code for FEA solution steps. A constructive approach to specify a numerical program design is taken. The code generator compiles application oriented input specifications into (parallel) FORTRAN77 routines with the help of built-in knowledge of the particular problem, numerical solution methods and the target computer.

Sharma, Naveen↗

Instructable autonomous agents

In contrast to current intelligent systems, which must be laboriously programmed for each task they are meant to perform, instructable agents can be taught new tasks and associated knowledge. This thesis presents a general theory of learning from tutorial instruction and its use to produce an instructable agent. Tutorial instruction is a particularly powerful form of instruction, because it allows the instructor to communicate whatever kind of knowledge a student needs at whatever point it is needed. To exploit this broad flexibility, however, a tutorable agent must support a full range of interaction with its instructor to learn a full range of knowledge. Thus, unlike most machine learning tasks, which target deep learning of a single kind of knowledge from a single kind of input, tutorability requires a breadth of learning from a broad range of instructional interactions. The theory of learning from tutorial instruction presented here has two parts. First, a computational model of an intelligent agent, the problem space computational model, indicates the types of knowledge that determine an agent's performance, and thus, that should be acquirable via instruction. Second, a learning technique, called situated explanation specifies how the agent learns general knowledge from instruction. The theory is embodied by an implemented agent, Instructo-Soar, built within the Soar architecture. Instructo-Soar is able to learn hierarchies of completely new tasks, to extend task knowledge to apply in new situations, and in fact to acquire every type of knowledge it uses during task performance - control knowledge, knowledge of operators' effects, state inferences, etc. - from interactive natural language instructions. This variety of learning occurs by applying the situated explanation technique to a variety of instructional interactions involving a variety of types of instructions (commands, statements, conditionals, etc.). By taking seriously the requirements of flexible tutorial instruction, Instructo-Soar demonstrates a breadth of interaction and learning capabilities that goes beyond previous instructable systems, such as learning apprentice systems. Instructo-Soar's techniques could form the basis for future 'instructable technologies' that come equipped with basic capabilities, and can be taught by novice users to perform any number of desired tasks.

Huffman, Scott Bradley↗

Data-intensive management and analysis for scientifc simulations.

Scientific simulations can produce enormous amounts of data, making the analysis of results and management of files a difficult task for scientists. The simulation management and analysis system (Smaash) described here is designed to allow scientists to easily capture, store, organize, monitor, and analyze simulation results. The system is automatic, standardized, and secure. Smaash was built using open-source tools and modularized to be independent of the scientific simulation. The web-based front-end allows the scientist to easily interact with the data, and has proved its usefulness in improving the efficiency of a scientific team's workflow. High performance parallel computing allows scientists to solve complex physical problems through computer simulation. However, the massive amounts of data generated and the complex computing environment can create additional complications. A recent review by Ludaescher et al.(2009) describes how scientific workflows can assist scientists in extracting knowledge from these data-intensive operations by automating components within pipelines. Within the fusion community, Klasky et al.(2008) and colleagues have developed a system that handles the storage management, data movement, metadata generation and management, and a means to analyze the results. In response to scientists needs, a simulation management and analysis system (Smaash) was developed at the University of Chicago and Argonne National Laboratory (USA). Smaash provides an integrated way to monitor simulations and analyze computational results; catalog, store, and retrieve simulations; and prepare output for publications. The system is independent of the particular simulation code, accessible from many HPC and browser-based platforms, and built around open-source software tools. Data security and provenance is considered throughout. The analysis components are hidden behind a web-based front end, enabling scientists to focus on their results and not get bogged down by information overload.

99 GENERAL AND MISCELLANEOUS↗

Lustre at Petascale: Experiences in Troubleshooting and Upgrading

Some veterans in the HPC industry semi-facetiously define supercomputers as devices that convert compute-bound problems into I/O-bound problems. Effective utilization of large high performance computing resources often requires access to large amounts of fast storage. The National Institute for Computational Sciences (NICS) operates Kraken, a 1.17 PetaFLOPS Cray XT5 for the National Science Foundation (NSF). Kraken s primary file system has migrated from Lustre 1.6 to 1.8 and is currently being moved to servers external to the machine. Additional bandwidth will be made available by mounting the NICS-wide Lustre file system. Newer versions of Lustre, beyond what Cray provides, are under evaluation for stability and performance. Over the past several years of operation, Kraken s Lustre file system has evolved to be extremely stable in an effort to better serve Kraken s users.

99 GENERAL AND MISCELLANEOUS↗

Computationally simple, analytic, closed form solution of the Coulomb self-interaction problem in Kohn–Sham density functional theory

We have developed and tested in terms of atomic calculations an exact, analytic and computationally simple procedure for determining the functional derivative of the exchange energy with respect to the density in the implementation of the Kohn–Sham formulation of density functional theory (KS-DFT), providing an analytic, closed-form solution of the self-interaction problem in KS-DFT. We demonstrate the efficacy of our method through ground-state calculations of the exchange potential and energy for atomic He and Be atoms, and comparisons with experiment and the results obtained within the optimized effective potential (OEP) method.

36 MATERIALS SCIENCE↗

Approximate Mixed-Integer Programming Solution with Machine Learning Technique and Linear Programming Relaxation

Security constrained unit commitment (SCUC) is solved in the day-ahead electricity market to determine electricity generation schedule for the following date. The associated mixed integer programming (MIP) problem is known computationally hard. Heuristics like rounding can be computationally efficient for solving large MIP problems however often produces lower quality solutions due to discrepancy between MIP solution and linear programming relaxation (LPR) solution, i.e., variables taking different discrete values between MIP and LPR solutions. In this work, we applied the machine learning-based algorithms—Classification and Regression Tree (CART) model and random forest (RF) model—to obtain an LPR-based approximation that close to an MIP solution without actually solving the MIP problem. By computing feature importance derived from the CART and RF models, we assessed the link between coefficients in the MIP model, the LPR solution, and the optimal solution of the MIP problem. We applied the CART and RF approaches to solve SCUC problems using day-ahead energy market cases from Midcontinent Independent System Operator. The results show that our method is computationally efficient and could achieve an approximation sufficiently close to the SCUC solution with <0.15% error and ~78% reduction in the discrepancies between LPR and MIP solutions.

Lin, Xinming↗

CHASM Challenge Problem: Lagrangian Hydrodynamics

Computer simulations of many science and engineering problems require modeling the equations of hydrodynamics which describe the motion of materials relative to each other induced by various forces. Many important DoD simulation problems involve complex multi-material systems that undergo large deformations. Examples include the analysis of armor defense, penetration mechanics, blast effects, structural integrity, and conventional munitions such as shaped charges and explosively formed projectiles. Indeed, the original motivation for developing codes that solve the equations of hydrodynamics, herein referred to as “hydrocodes”, was to solve problems with defense applications. The FY2010 Requirements Analysis Report issued by the DoD High Performance Computing Modernization Program (HPCMP) Office shows that a major portion of DoD HPC activities involves hydrocodes [HPCMP2010]. The report surveyed 496 projects across the Services and various Agencies, representing 4,050 HPCMP users at more than 125 locations, including government, contractors, and academia, and grouped each project into one of ten categories.

42 ENGINEERING↗

Blade Load Unsteadiness and Turbulence Statistics in an Actuator-Line Computed Turbine–Turbine Interaction Problem

The objective of this study is to investigate how different volumetric projection techniques used in actuator-line modeling affect the unsteady blade loads and wake turbulence statistics. The two techniques for the body-force projection radius are based on either (i) the grid spacing or (ii) the combination of grid spacing and an equivalent elliptic blade planform. An array of two National Renewable Energy Laboratory 5-MW turbines separated by seven rotor diameters is simulated for 2000s (about rotor 300 revolutions) within a large-eddy simulation (LES) solver of the neutral and moderately convective atmospheric boundary layer (ABL). The statistics of sectional angle of attack (AOA), blade loads, and turbine power histories are quantified. Moreover, the degree of unsteadiness of sectional blade loads in response to atmospheric and wake turbulence is computed via a reduced frequency based on the rate-of-change in sectional AOA. Finally, the goal of this work is to make the wind energy community aware of the uncertainties associated with actuator-line modeling approaches.

17 WIND ENERGY↗

Crystal ball gazing

Over the last seven years, the CPU on my desk has increased speed by two orders of magnitude, from around 1 MIP to more than 100 MIPS; more important is that it is about as fast as any uniprocessor of any type available for any price, for compute bound problems. Memory on the system is also about 100 times as big, while disk is only about 10 times as big. Local network and I/O performance have increased greatly, though not quite at the same rate as processor speed. More important, I will argue, is that the CPU's address space is 64 bits, rather than 32 bits, allowing us to rethink some time honored presumptions. The Internet has gone from a few hundred machines to a million, and now have grown to span the entire globe, and wide area networks have now becoming commercial services. 'PC's' are now real computers, bringing what was top of the line computing capability to the masses only a few years behind the leading edge. So even a year or two from now, we can anticipate commonplace desktop machines running at speeds hundreds of MIPS, with main memories in the hundreds of megabytes to a gigabyte, able to draw millions of vectors/second, and all capable of some reasonable 3D graphics. And only a few years later, this will be the $1500 PC. So the 1990's certainly brings: 64 bit processors becoming standard; BIP/BFLOP class uniprocessors; large scale multiprocessors for special purpose applications; I/O as the most significant computer engineering problem; Hierarchical data servers in everyday use; routine access to archived data around the world; and what else? What do systems such as those we will have this decade imply to those building data analysis systems today? Many of the presumptions of the 1970's and 1980's need to be reexamined in the light of 1990's technology.

Gettys, Jim↗

Asronomical refraction: Computational methods for all zenith angles

It is shown that the problem of computing astronomical refraction for any value of the zenith angle may be reduced to a simple, nonsingular, numerical quadrature when the proper choice is made for the independent variable of integration.

Computing numerical methods refractions↗

Computer modeling of electromagnetic problems using the geometrical theory of diffraction

Some applications of the geometrical theory of diffraction (GTD), a high frequency ray optical solution to electromagnetic problems, are presented. GTD extends geometric optics, which does not take into account the diffractions occurring at edges, vertices, and various other discontinuities. Diffraction solutions, analysis of basic structures, construction of more complex structures, and coupling using GTD are discussed.

Burnside, W. D.↗

Steady state computations for wave propagation problems

The behavior of difference approximations of hyperbolic partial differential equations as time t goes to infinity is studied. The rate of convergence to steady state is analyzed theoretically and experimentally for the advection equation and the linearized Euler equations. The choice of difference formulas and boundary conditions strongly influences the rate of convergence in practical steady-state calculations. In particular it is shown that upwind difference methods and characteristic boundary conditions have very attractive convergence properties.

Engquist, Bjorn↗

Computational methods for the problems of the tip vortex

The tip vortex problem for helicopter rotors in transonic flow was studied. The first model was that of potential flow past a single blade in parallel transonic flow. The incidence on the wing of a vortex sheet trailing from a blade in front was studied by modeling the incident sheet by a single vortex filament. A 3-D potential flow code was written to incorporate the usual boundary conditions at infinity together with the model of such a vortex filament and to analyze the resulting flow over the wing. The code was used to study the effect of the vortex filament on the production of shocks at the tip of the wing. Another problem studied within the framework of potential flow theory was the rollup of the vortex sheet behind the wing. A comparison was made of flow models described by the potential equation, by the Euler equations for steady flow, and by the Navier-Stokes equations. The question was also studied as to whether there is an advantage in solving the Navier-Stokes equations rather than the Euler equations for steady flow.

Garabedian, Paul R.↗

Computational solution of chemistry problems

AB initio quantum chemical techniques have been used to investigate weakly bound complexes of H2O and SO2. An energy gradient program was used to locate stable structures for the H2O, SO2 complexes, and SCF calculations were carried out to determine the binding energies of complexes with multiple water molecules. A 4-31G basis set was used for most potential energy searches. More accurate basis sets including a generally contracted basis set with d orbitals on the sulfur were used for geometry and binding energy verification. For single water complexes, five different stable geometries were located with binding energies between 4 and 11 Kcal mol(-1), suggesting a binding shell for H2O around SO2 and a mechanism for the formation of an SO2-containing water droplet. Calculations on one of the complexes utilizing a larger double zeta basis and d functions on the sulfur atom lead to adjusted binding energies in the range 3 to 8 Kcal mol(-1). Very little charge transfer between SO2 and H2O was present. Addition of more than one H2O was found to be energetically favorable although the addition of the fourth water in certain geometries did not increase the stability of the complex. An alternative mechanism for the tropospheric gas phase production of acid rain is suggested.

Ake, Robert L.↗

Analog Processor To Solve Optimization Problems

Proposed analog processor solves "traveling-salesman" problem, considered paradigm of global-optimization problems involving routing or allocation of resources. Includes electronic neural network and auxiliary circuitry based partly on concepts described in "Neural-Network Processor Would Allocate Resources" (NPO-17781) and "Neural Network Solves 'Traveling-Salesman' Problem" (NPO-17807). Processor based on highly parallel computing solves problem in significantly less time.

Duong, Tuan A.↗