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 667 records · Page 37

A spectral numerical method for the Navier-Stokes equations with applications to Taylor-Couette flow

A new spectral method for solving the incompressible Navier-Stokes equations in a plane channel and between concentric cylinders is presented. The method uses spectral expansions which inherently satisfy the boundary conditions and the continuity equation and yield banded matrices which are efficiently solved at each time step. In addition, the number of dependent variables is reduced, resulting in a reduction in computer memory requirements. Several test problems have been computed for the channel flow and for flow between concentric cylinders, including Taylor-Couette flow with axisymmetric Taylor vortices and wavy vortices. In all cases, agreement with available experimental and theoretical results is very good.

Moser, R. D.↗

Monitoring robot actions for error detection and recovery

Reliability is a serious problem in computer controlled robot systems. Although robots serve successfully in relatively simple applications such as painting and spot welding, their potential in areas such as automated assembly is hampered by programming problems. A program for assembling parts may be logically correct, execute correctly on a simulator, and even execute correctly on a robot most of the time, yet still fail unexpectedly in the face of real world uncertainties. Recovery from such errors is far more complicated than recovery from simple controller errors, since even expected errors can often manifest themselves in unexpected ways. Here, a novel approach is presented for improving robot reliability. Instead of anticipating errors, researchers use knowledge-based programming techniques so that the robot can autonomously exploit knowledge about its task and environment to detect and recover from failures. They describe preliminary experiment of a system that they designed and constructed.

Gini, M.↗

Extension of a three-dimensional viscous wing flow analysis user's manual: VISTA 3-D code

Three-dimensional unsteady viscous effects can significantly influence the performance of fixed and rotary wing aircraft. These effects are important in both flows about helicopter rotors in forward flight and flows about three-dimensional (swept and tapered) supercritical wings. A computational procedure for calculating such flow field was developed. The procedure is based upon an alternating direction technique employing the Linearized Block Implicit method for solving three-dimensional viscous flow problems. In order to demonstrate the viability of this method, two- and three-dimensional problems are computed. These include the flow over a two-dimensional NACA 0012 airfoil under steady and oscillating conditions, and the steady, skewed, three-dimensional flow on a flat plate. Although actual three-dimensional flows over wings were not obtained, the ground work was laid for considering such flows. In this report a description of the computer code is given.

Weinberg, Bernard C.↗

NETRA: A parallel architecture for integrated vision systems. 1: Architecture and organization

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is considered to be a system that uses vision algorithms from all levels of processing for a high level application (such as object recognition). A model of computation is presented for parallel processing for an IVS. Using the model, desired features and capabilities of a parallel architecture suitable for IVSs are derived. Then a multiprocessor architecture (called NETRA) is presented. This architecture is highly flexible without the use of complex interconnection schemes. The topology of NETRA is recursively defined and hence is easily scalable from small to large systems. Homogeneity of NETRA permits fault tolerance and graceful degradation under faults. It is a recursively defined tree-type hierarchical architecture where each of the leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide for desired flexibility. A qualitative evaluation of NETRA is presented. Then general schemes are described to map parallel algorithms onto NETRA. Algorithms are classified according to their communication requirements for parallel processing. An extensive analysis of inter-cluster communication strategies in NETRA is presented, and parameters affecting performance of parallel algorithms when mapped on NETRA are discussed. Finally, a methodology to evaluate performance of algorithms on NETRA is described.

Choudhary, Alok N.↗

A comparative study of Conroy and Monte Carlo methods applied to multiple quadratures and multiple scattering

An efficient numerical method of multiple quadratures, the Conroy method, is applied to the problem of computing multiple scattering contributions in the radiative transfer through realistic planetary atmospheres. A brief error analysis of the method is given and comparisons are drawn with the more familiar Monte Carlo method. Both methods are stochastic problem-solving models of a physical or mathematical process and utilize the sampling scheme for points distributed over a definite region. In the Monte Carlo scheme the sample points are distributed randomly over the integration region. In the Conroy method, the sample points are distributed systematically, such that the point distribution forms a unique, closed, symmetrical pattern which effectively fills the region of the multidimensional integration. The methods are illustrated by two simple examples: one, of multidimensional integration involving two independent variables, and the other, of computing the second order scattering contribution to the sky radiance.

Deepak, A.↗

Computational nuclear quantum many-body problem: The UNEDF project

The UNEDF project was a large-scale collaborative effort that applied high-performance computing to the nuclear quantum many-body problem. The primary focus of the project was on constructing, validating, and applying an optimized nuclear energy density functional, which entailed a wide range of pioneering developments in microscopic nuclear structure and reactions, algorithms, high-performance computing, and uncertainty quantification. UNEDF demonstrated that close associations among nuclear physicists, mathematicians, and computer scientists can lead to novel physics outcomes built on algorithmic innovations and computational developments. This review showcases a wide range of UNEDF science results to illustrate this interplay.

Configuration interaction↗

Computational nuclear quantum many-body problem: The UNEDF project

The UNEDF project was a large-scale collaborative effort that applied high-performance computing to the nuclear quantum many-body problem. The primary focus of the project was on constructing, validating, and applying an optimized nuclear energy density functional, which entailed a wide range of pioneering developments in microscopic nuclear structure and reactions, algorithms, high-performance computing, and uncertainty quantification. UNEDF demonstrated that close associations among nuclear physicists, mathematicians, and computer scientists can lead to novel physics outcomes built on algorithmic innovations and computational developments. This review showcases a wide range of UNEDF science results to illustrate this interplay.

Configuration interaction↗

Plug-and-Play Methods for Integrating Physical and Learned Models in Computational Imaging: Theory, algorithms, and applications

Plug-and-play (PnP) priors constitute one of the most widely used frameworks for solving computational imaging problems through the integration of physical models and learned models. PnP leverages high-fidelity physical sensor models and powerful machine learning methods for prior modeling of data to provide state-of-the-art reconstruction algorithms. PnP algorithms alternate between minimizing a data fidelity term to promote data consistency and imposing a learned regularizer in the form of an image denoiser. Recent highly successful applications of PnP algorithms include biomicroscopy, computerized tomography (CT), magnetic resonance imaging (MRI), and joint ptychotomography. This article presents a unified and principled review of PnP by tracing its roots, describing its major variations, summarizing main results, and discussing applications in computational imaging. Additionally, we also point the way toward further developments by discussing recent results on equilibrium equations that formulate the problem associated with PnP algorithms.

97 MATHEMATICS AND COMPUTING↗

The Method of Characteristics for 2-D Multigroup and Pointwise Transport Calculations in SCALE/CENTRM

SCALE 6 computes problem-dependent multigroup (MG) cross sections through a combination of the conventional Bondarenko shielding-factor method and a deterministic pointwise (PW) transport calculation of the fine-structure spectra in the resolved resonance and thermal energy ranges. The PW calculation is performed by the CENTRM code using a 1-D cylindrical Wigner-Seitz model with the white boundary condition instead of the real rectangular cell shape to represent a lattice unit cell. The pointwise fluxes computed by CENTRM are not exact because a 1-D model is used for the transport calculation, which introduces discrepancies in the MG self-shielded cross sections, resulting in some deviation in the eigenvalue. In order to solve this problem, the method of characteristics (MOC) has been applied to enable the CENTRM PW transport calculation for a 2-D square pin cell. The computation results show that the new BONAMI/CENTRM-MOC procedure produces very precise self-shielded cross sections compared to MCNP reaction rates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Developments in REDES: The rocket engine design expert system

The Rocket Engine Design Expert System (REDES) is being developed at the NASA-Lewis to collect, automate, and perpetuate the existing expertise of performing a comprehensive rocket engine analysis and design. Currently, REDES uses the rigorous JANNAF methodology to analyze the performance of the thrust chamber and perform computational studies of liquid rocket engine problems. The following computer codes were included in REDES: a gas properties program named GASP, a nozzle design program named RAO, a regenerative cooling channel performance evaluation code named RTE, and the JANNAF standard liquid rocket engine performance prediction code TDK (including performance evaluation modules ODE, ODK, TDE, TDK, and BLM). Computational analyses are being conducted by REDES to provide solutions to liquid rocket engine thrust chamber problems. REDES is built in the Knowledge Engineering Environment (KEE) expert system shell and runs on a Sun 4/110 computer.

Davidian, Kenneth O.↗

Developments in REDES: The Rocket Engine Design Expert System

The Rocket Engine Design Expert System (REDES) was developed at NASA-Lewis to collect, automate, and perpetuate the existing expertise of performing a comprehensive rocket engine analysis and design. Currently, REDES uses the rigorous JANNAF methodology to analyze the performance of the thrust chamber and perform computational studies of liquid rocket engine problems. The following computer codes were included in REDES: a gas properties program named GASP; a nozzle design program named RAO; a regenerative cooling channel performance evaluation code named RTE; and the JANNAF standard liquid rocket engine performance prediction code TDK (including performance evaluation modules ODE, ODK, TDE, TDK, and BLM). Computational analyses are being conducted by REDES to provide solutions to liquid rocket engine thrust chamber problems. REDES was built in the Knowledge Engineering Environment (KEE) expert system shell and runs on a Sun 4/110 computer.

Davidian, Kenneth O.↗

An Efficient Algorithm for Automatic Structure Optimization in X-ray Standing-Wave Experiments

We present that x-ray standing-wave photoemission experiments involving multilayered samples are emerging as unique probes of the buried interfaces that are ubiquitous in current device and materials research. Such data require for their analysis a structure optimization process comparing experiment to theory that is not straightforward. In this work, we present a new computer program for optimizing the analysis of standing-wave data, called SWOPT, that automates this trial-and-error optimization process. The program includes an algorithm that has been developed for computationally expensive problems: so-called black-box simulation optimizations. It also includes a more efficient version of the Yang X-ray Optics Program (YXRO) [Yang, S.-H., Gray, A.X., Kaiser, A.M., Mun, B.S., Sell, B.C., Kortright, J.B., Fadley, C.S., J. Appl. Phys. 113, 1 (2013)] which is about an order of magnitude faster than the original version. Human interaction is not required during optimization. We tested our optimization algorithm on real and hypothetical problems and show that it finds better solutions significantly faster than a random search approach. The total optimization time ranges, depending on the sample structure, from minutes to a few hours on a modern laptop computer, and can be up to 100x faster than a corresponding manual optimization. Finally, these speeds make the SWOPT program a valuable tool for realtime analyses of data during synchrotron experiments.

36 MATERIALS SCIENCE↗

Probabilistic finite elements for fatigue and fracture analysis

Attenuation is focused on the development of Probabilistic Finite Element Method (PFEM), which combines the finite element method with statistics and reliability methods, and its application to linear, nonlinear structural mechanics problems and fracture mechanics problems. The computational tool based on the Stochastic Boundary Element Method is also given for the reliability analysis of a curvilinear fatigue crack growth. The existing PFEM's have been applied to solve for two types of problems: (1) determination of the response uncertainty in terms of the means, variance and correlation coefficients; and (2) determination the probability of failure associated with prescribed limit states.

Belytschko, Ted↗

MODELING HEAT TRANSFER IN SPENT FUEL TRANSFER CASK NEUTRON SHIELDS – A CHALLENGING PROBLEM IN NATURAL CONVECTION

In the United States, commercial spent nuclear fuel is typically moved from spent fuel pools to outdoor dry storage pads within a transfer cask system that provides radiation shielding to protect personnel and the surrounding environment. The transfer casks are cylindrical steel enclosures with integral gamma and neutron radiation shields. Since the transfer cask system must be passively cooled, decay heat removal from spent nuclear fuel canister is limited by the rate of heat transfer through the cask components, and natural convection from the transfer cask surface. The primary mode of heat transfer within the transfer cask system is conduction, but some cask designs incorporate a liquid neutron shield tank surrounding the transfer cask structural shell. In these systems, accurate prediction of natural convection within the neutron shield tank is an important part of assessing the overall thermal performance of the transfer cask system. The large-scale geometry of the neutron shield tank, which is typically an annulus approximately 2 meters in diameter but only 10-15 cm in thickness, and the relatively small scale velocities (typically less than 5 cm/s) represent a wide range of spatial and temporal scales that contribute to making this a challenging problem for computational fluid dynamics (CFD) modeling. Relevant experimental data at these scales are not available in the literature, but some recent modeling studies offer insights into numerical issues and solutions; however, the geometries in these studies, and for the experimental data in the literature at smaller scales, all have large annular gaps that are not prototypic of the transfer cask neutron shield. This paper proposes that there may be reliable CFD approaches to the transfer cask problem, specifically coupled steady-state solvers or unsteady simulations; however, both of these solutions take significant computational effort. Segregated (uncoupled) steady state solvers that were tested did not accurately capture the flow field and heat transfer distribution in this application. Mesh resolution, turbulence modeling, and the tradeoff between steady state and transient solutions are addressed. Because of the critical nature of this application, the need for new experiments at representative scales is clearly demonstrated.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Hypercomplex Automatic Differentiation in the Eulerian Hydrocode PAGOSA

Enabling the computation of partial derivatives or sensitivities in production hydrocodes is beneficial for design, optimization, sensitivity analysis, and uncertainty quantification. Traditional finite difference approximations of these sensitivities are inefficient since convergence studies of the step size is required for each parameter of interest. For these reasons, HYPercomplex Automatic Differentiation (HYPAD) was implemented in the Eulerian hydrocode PAGOSA. HYPAD is analogous to forward-mode automatic differentiation except hypercomplex numbers (numbers with multiple imaginary parts) are used instead of dual numbers. Accurate partial derivatives can be computed of all state variables with respect to multiple input variables in a single run. The method was implemented using operator overloading to handle hypercomplex algebra. HYPAD was demonstrated and verified on Sod’s shock tube problem to compute derivatives of the state variables with respect to a material parameter, initial conditions, and geometry.

97 MATHEMATICS AND COMPUTING↗

Sparsity and Nullity: Paradigms for Analysis Dictionary Learning

Sparse models in dictionary learning have been successfully applied in a wide variety of machine learning and computer vision problems, and as a result have recently attracted increased research interest. Another interesting related problem based on linear equality constraints, namely the sparse null space (SNS) problem, first appeared in 1986 and has since inspired results on sparse basis pursuit. In this work, we investigate the relation between the SNS problem and the analysis dictionary learning (ADL) problem, and show that the SNS problem plays a central role, and may be utilized to solve dictionary learning problems. Moreover, we propose an efficient algorithm of sparse null space basis pursuit (SNS-BP) and extend it to a solution of ADL. Lastly, experimental results on numerical synthetic data and real-world data are further presented to validate the performance of our method.

97 MATHEMATICS AND COMPUTING↗

Hybrid-VPIC: An open-source kinetic/fluid hybrid particle-in-cell code

Hybrid-VPIC is an extension of the open-source high-performance particle-in-cell (PIC) code VPIC incorporating hybrid kinetic ion/fluid electron solvers. This paper describes the models that are available in the code and gives an overview of applications of the code to space and laboratory plasma physics problems. Particular choices in how the hybrid solvers were implemented are documented for reference by users. A few solutions for handling numerical complications particular to hybrid codes are also described. Finally, special emphasis is given to the computationally taxing problem of modeling mix in collisional high-energy-density regimes, for which more accurate electron fluid transport coefficients have been implemented for the first time in a hybrid PIC code.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗