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 451 records · Page 25

Summary of the Tandem Cylinder Solutions from the Benchmark Problems for Airframe Noise Computations-I Workshop

Fifteen submissions in the tandem cylinders category of the First Workshop on Benchmark problems for Airframe Noise Computations are summarized. Although the geometry is relatively simple, the problem involves complex physics. Researchers employed various block-structured, overset, unstructured and embedded Cartesian grid techniques and considerable computational resources to simulate the flow. The solutions are compared against each other and experimental data from 2 facilities. Overall, the simulations captured the gross features of the flow, but resolving all the details which would be necessary to compute the noise remains challenging. In particular, how to best simulate the effects of the experimental transition strip, and the associated high Reynolds number effects, was unclear. Furthermore, capturing the spanwise variation proved difficult.

Lockard, David P.↗

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

For many problems in computational science and engineering, the so-called forward problem—solution of the underlying mathematical model to yield output quantities of interest, given input parameters—is difficult enough for frontier complex models, which are often characterized by coupled multiphysics and possibly stochastic behavior over a wide range of length and time scales. However, we face the need to move beyond the forward problem, to address what is often the ultimate goal of CS&E: decision making. This requires us to tackle a spectrum of mathematical problems that subsume, and are thus even more difficult than, the forward problem. First, given experimental data, we wish to estimate unknown parameters characterizing a model of a natural or engineered system by solving an inverse problem. Second, we seek the optimal configuration of the system (or experiments) by solving an optimal design problem. Third, the optimal operation of the system must be determined by solving an optimal control problem. And fourth, we must quantify uncertainties as they propagate through all of the preceding problems, from data to model inference to prediction and finally to optimal design and control. Optimal mathematical methods and algorithms for such end-to-end, data-to-decisions modeling and simulation of complex problems—requiring integrated solution of forward, inverse, optimization, and UQ problems for large, multiphysics, multiscale models—entails challenges of the highest order, while also presenting great opportunities for applied mathematics research. Unfortunately, research on forward, inverse, optimization, and UQ problems has all-too-often progressed in isolation. This has led to mathematical methods that perform well when considering the forward simulation in isolation, but are prohibitive or suboptimal or unstable when combined with other methods within the framework of inversion, optimization, or UQ. The reverse is also true: general-purpose methods developed within the inversion, optimization, and UQ fields often become prohibitive when applied to complex CS&E problems since they do not exploit their structure.

58 GEOSCIENCES↗

Algorithm For Optimal Control Of Large Structures

Cost of computation appears competitive with other methods. Problem to compute optimal control of forced response of structure with n degrees of freedom identified in terms of smaller number, r, of vibrational modes. Article begins with Hamilton-Jacobi formulation of mechanics and use of quadratic cost functional. Complexity reduced by alternative approach in which quadratic cost functional expressed in terms of control variables only. Leads to iterative solution of second-order time-integral matrix Volterra equation of second kind containing optimal control vector. Cost of algorithm, measured in terms of number of computations required, is of order of, or less than, cost of prior algoritms applied to similar problems.

Salama, Moktar A.↗

Algorithms for the Electronic and Vibrational Properties of Nanocrystals

Solving the electronic structure problem for nanoscale systems remains a computationally challenging problem. The numerous degrees of freedom, both electronic and nuclear, make the problem impossible to solve without some effective approximations. Here we illustrate some advances in algorithm developments to solve the Kohn-Sham eigenvalue problem, i.e., we solve the electronic structure problem within density functional theory using pseudopotentials expressed in real space. Our algorithms are based on a nonlinear Chebyshev-filtered subspace iteration method, which avoids computing explicit eigenvectors except at the first self-consistent-field iteration. Our method may be viewed as an approach to solve the original nonlinear Kohn-Sham equation by a nonlinear subspace iteration technique, without emphasizing the intermediate linearized Kohn-Sham eigenvalue problems. Replacing the standard iterative diagonalization at each self-consistent-field iteration by a Chebyshev subspace filtering step results in a significant speedup, often an order of magnitude or more, over methods based on standard diagonalization. We illustrate this method by predicting the electronic and vibrational states for silicon nanocrystals.

Chelikowsky, James↗

Real parameter margin computation for uncertain structural dynamic systems

This paper is concerned with the problem of computing real parameter margins for stabilized, structural dynamic systems with the masses, spring constants, and damping constants as uncertain parameters. Numerical algorithms for uncertain systems with multilinear parameters are investigated. It is shown that for a certain class of structural dynamic systems with small passive damping (e.g., flexible structures in space), the computational complexity of the problem can be avoided by modeling the system as a conservative plant, without loss of any practical significance.

Wie, Bong↗

GDSA framework, a computational framework for complex modeling problems in radioactive waste management

This paper details a computational framework to produce automated, graphical workflows, and how this framework can be deployed to support complex modeling problems like those in nuclear engineering. Key benefits of the framework include: automating previously manual workflows; intuitive construction and communication of workflows through a graphical interface; and automated file transfer and handling for workflows deployed across heterogeneous computing resources. This paper demonstrates the framework's application to probabilistic post-closure performance assessment of systems for deep geologic disposal of nuclear waste. However, the framework is a general capability that can help users running a variety of computational studies.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

For many problems in computational science and engineering, the so-called forward problem-solution of the underlying mathematical model to yield output quantities of interest, given input parameters--is difficult enough for frontier complex models, which are often characterized by coupled multiphysics and possibly stochastic behavior over a wide range of length and time scales. However, we face the need to move beyond the forward problem, to address what is often the ultimate goal of CS&E: decision-making. This requires us to tackle a spectrum of mathematical problems that subsume, and are thus even more difficult than, the forward problem. First, given experimental data, we wish to estimate unknown parameters characterizing a model of a natural or engineered system by solving an inverse problem. Second, we seek the optimal con figuration of the system (or experiments) by solving an optimal design problem. Third, the optimal operation of the system must be determined by solving an optimal control problem. And fourth, we must quantify uncertainties as they propagate through all of the preceding problems, from data to model inference to prediction and finally to optimal design and control. Optimal mathematical methods and algorithms for such end-to-end, data-to-decisions modeling and simulation of complex problems--requiring integrated solution of forward, inverse, optimization, and UQ problems for large, multiphysics, multiscale models--entails challenges of the highest order, while also presenting great opportunities for applied mathematics research. Unfortunately, research on forward, inverse, optimization, and UQ problems has all-too-often progressed in isolation. This has led to mathematical methods that perform well when considering the forward simulation in isolation, but are prohibitive or suboptimal or unstable when combined with other methods within the framework of inversion, optimization, or UQ. The reverse is also true: general-purpose methods developed within the inversion, optimization, and UQ fields often become prohibitive when applied to complex CS&E problems since they do not exploit their structure. DiaMonD is a multi-institutional DOE MMICC effort that aims to address the challenges of end-to-end, data-to-decisions modeling and simulation for complex CS&E problems in a unifi ed, systematic, and integrated fashion. Institutions involved are Colorado State, Florida State, Los Alamos, MIT, Oak Ridge, Stanford, and UT-Austin. The goals of DiaMonD are (1) to develop advanced mathematical methods and analysis for multimodel, multiphysics, multiscale model problems driven by frontier DOE applications, including those in subsurface energy and environmental flows, materials for energy storage and conversion, and ice sheet dynamics; (2) to create theory and algorithms for integrated inversion, optimization, and uncertainty quantification for these complex problems; and (3) to disseminate the philosophy of an integrated end-to-end, data-to-decisions approach to modeling and simulation of complex problems to the broader applied math and computational science communities through workshops and other outreach.

97 MATHEMATICS AND COMPUTING↗

A Posteriori Error Analysis of Two-Stage Computation Methods with Application to Efficient Discretization and the Parareal Algorithm

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute “dual-weighted” a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

97 MATHEMATICS AND COMPUTING↗

Validation of time-dependent shift using the pulsed sphere benchmarks

The detailed behavior of neutrons in a rapidly changing time-dependent physical system is a challenging computational physics problem, particularly when using Monte Carlo methods on heterogeneous high-performance computing architectures. A small number of algorithms and code implementations have been shown to be performant for time-independent (fixed source and k-eigenvalue) Monte Carlo, and there are existing simulation tools that successfully solve the time-dependent Monte Carlo problem on smaller computing platforms. To bridge this gap, a time-dependent version of ORNL’s Shift code has been recently developed. Shift’s history-based algorithm on CPUs, and its event-based algorithm on GPUs, have both been observed to scale well to very large numbers of processors, which motivated the extension of this code to solve time-dependent problems. The validation of this new capability requires a comparison with time-dependent neutron experiments. Lawrence Livermore National Laboratory’s (LLNL) pulsed sphere benchmark experiments were simulated in Shift to validate both the time-independent as well as new time-dependent features recently incorporated into Shift. A suite of pulsed-sphere models was simulated using Shift and compared to the available experimental data and simulations with MCNP. Overall results indicate that Shift accurately simulates the pulsed sphere benchmarks, and that the new time-dependent modifications of Shift are working as intended. Validated exascale neutron transport codes are essential for a wide variety of future multiphysics applications.

Palmer, Camille J.↗

Specialized computer architectures for computational aerodynamics

In recent years, computational fluid dynamics has made significant progress in modelling aerodynamic phenomena. Currently, one of the major barriers to future development lies in the compute-intensive nature of the numerical formulations and the relative high cost of performing these computations on commercially available general purpose computers, a cost high with respect to dollar expenditure and/or elapsed time. Today's computing technology will support a program designed to create specialized computing facilities to be dedicated to the important problems of computational aerodynamics. One of the still unresolved questions is the organization of the computing components in such a facility. The characteristics of fluid dynamic problems which will have significant impact on the choice of computer architecture for a specialized facility are reviewed.

Stevenson, D. K.↗

VLSI neuroprocessors

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques. The concurrent processing architectures developed are derived from a variety of advanced computing paradigms including neural network models, fuzzy logic, and cellular automata. Hardware implementation technologies range from state-of-the-art digital/analog custom-VLSI to advanced optoelectronic devices such as computer-generated holograms and e-beam fabricated Dammann gratings. JPL's concurrent processing devices group has developed a broad technology base in hardware implementable parallel algorithms, low-power and high-speed VLSI designs and building block VLSI chips, leading to application-specific high-performance embeddable processors. Application areas include high throughput map-data classification using feedforward neural networks, terrain based tactical movement planner using cellular automata, resource optimization (weapon-target assignment) using a multidimensional feedback network with lateral inhibition, and classification of rocks using an inner-product scheme on thematic mapper data. In addition to addressing specific functional needs of DOD and NASA, the JPL-developed concurrent processing device technology is also being customized for a variety of commercial applications (in collaboration with industrial partners), and is being transferred to U.S. industries. This viewgraph p resentation focuses on two application-specific processors which solve the computation intensive tasks of resource allocation (weapon-target assignment) and terrain based tactical movement planning using two extremely different topologies. Resource allocation is implemented as an asynchronous analog competitive assignment architecture inspired by the Hopfield network. Hardware realization leads to a two to four order of magnitude speed-up over conventional techniques and enables multiple assignments, (many to many), not achievable with standard statistical approaches. Tactical movement planning (finding the best path from A to B) is accomplished with a digital two-dimensional concurrent processor array. By exploiting the natural parallel decomposition of the problem in silicon, a four order of magnitude speed-up over optimized software approaches has been demonstrated.

Kemeny, Sabrina E.↗

Metal Artifact Reduction for CT-based Luggage Screening

This report describes research on active problems in computed tomography (CT) scanning applications. The problems are metal artifact reduction in CT images for medical imaging and luggage screening, and methods to evaluate segmentation of CT images. The research forms the basis of a PhD dissertation topic at UCSD, and is sponsored by LLNL.

42 ENGINEERING↗

Perceptual organization in computer vision - A review and a proposal for a classificatory structure

The evolution of perceptual organization in biological vision, and its necessity in advanced computer vision systems, arises from the characteristic that perception, the extraction of meaning from sensory input, is an intelligent process. This is particularly so for high order organisms and, analogically, for more sophisticated computational models. The role of perceptual organization in computer vision systems is explored. This is done from four vantage points. First, a brief history of perceptual organization research in both humans and computer vision is offered. Next, a classificatory structure in which to cast perceptual organization research to clarify both the nomenclature and the relationships among the many contributions is proposed. Thirdly, the perceptual organization work in computer vision in the context of this classificatory structure is reviewed. Finally, the array of computational techniques applied to perceptual organization problems in computer vision is surveyed.

Sarkar, Sudeep↗

Working toward a three-dimensional fatigue closure model for surface cracks

The first reliable elastic fracture mechanics solutions for a surface crack in a plate were obtained by Newman and Raju. The authors, both from the Mechanics of Materials Branch at NASA-Langley, used a highly detailed finite element solution requiring substantial computational resources. Computers have since become more powerful and available; however, many important related problems remain computationally expensive. The problem of three-dimensional fatigue crack growth taking into account plasticity-induced crack closure is one such problem. It is the goal of this research to provide an efficient method to account for three-dimensional crack closure in fatigue. Newman developed a two-dimensional plasticity-induced crack closure model for center cracked specimens. This model requires iterations to determine both the contact solution at each growth step and the extent of the plastic zone at the crack tip. A three-dimensional version of this model would require obtaining these nonlinear variables all along the crack front. This model must be efficient so that repeated calculations can be performed during crack growth simulations. The highly versatile line spring model (LSM) with contact, fatigue, and plasticity will form the basis of the closure model. There are several required additions to past work to address the three-dimensional crack closure problem. Initially, these additions will include (1) an improved LSM to more accurately obtain the crack opening displacement, stress intensity factors, and elastic T-stress near the ends of the surface crack; (2) a method to determine the extent of the plastic zone all along the crack front; (3) a method to determine the contact zone given a perfectly plastic layer of material on the crack surfaces; (4) a method to determine the magnitude of the compressive contact stress; and (5) a way to implement the degree of constraint along the curved crack front. During the summer ASEE program an enhanced LSM was developed. A method similar to that of 'strip synthesis' first introduced by Fujimoto was used. Briefly, the crack opening displacements of 'slices' of the surface crack in a direction parallel to the plate surface are considered in addition to the standard LSM approach that makes use of springs obtained from slices perpendicular to the plate surface. This enhancement is necessary so that an accurate three-dimensional representation of quantities such as contact zone size, plastic zone size, stress intensity factors, T-stress, and crack opening displacement can be determined. By combining results of previous investigations with the LSM, the problem of three-dimensional crack closure will be addressed. In addition to a closure model, the enhanced LSM can be used for many other problems including interacting surface cracks and fatigue crack growth of a through crack with a curved crack front.

Joseph, Paul F.↗