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 1,225 records · Page 68

Enforcing global constraints for the dispersion closure problem: τ 2 -SIMPLE algorithm

Permeability and effective dispersion tensors are critical parameters to characterize flow and transport in porous media at the continuum scale. Homogenization theory defines a framework in which such effective properties are first computed from solving a closure problem in a repeating unit cell of the periodic microstructure and then used in a macroscopic formulation for efficient computation. The closure problem is formulated as a local boundary value problem subjected to global constraints, which guarantee the uniqueness of the solution and can be difficult to satisfy for complex geometries and at high flow conditions. These constraints also ensure that pore-scale pressure, velocity, and concentration fields can be accurately reconstructed from the closure variable. Building on a previous work, here we present a framework that allows to satisfy global constraints associated to both the permeability and the dispersion closure problems by introducing two artificial time scales. The algorithm, called τ 2 -SIMPLE, computes both permeability and effective dispersion given an arbitrarily complex geometry and flow condition. Furthermore, this algorithm is demonstrated to be accurate for both 2D and 3D geometries across varying flow conditions, and thus it can be used to quickly characterize effective properties from porous media images in many applications.

97 MATHEMATICS AND COMPUTING↗

Analysis, approximation, and computation of a coupled solid/fluid temperature control problem

An optimization problem is formulated motivated by the desire to remove temperature peaks, i.e., 'hot spots', along the bounding surfaces of containers of fluid flows. The heat equation of the solid container is coupled to the energy equations for the fluid. Heat sources can be located in the solid body, the fluid, or both. Control is effected by adjustments to the temperature of the fluid at the inflow boundary. Both mathematical analyses and computational experiments are given.

Gunzburger, Max D.↗

Ultrafast effective multilevel atom method for primordial hydrogen recombination

Cosmological hydrogen recombination has recently been the subject of renewed attention because of its importance for predicting the power spectrum of cosmic microwave background anisotropies. It has become clear that it is necessary to account for a large number n > or approx. 100 of energy shells of the hydrogen atom, separately following the angular momentum substates in order to obtain sufficiently accurate recombination histories. However, the multilevel atom codes that follow the populations of all these levels are computationally expensive, limiting recent analyses to only a few points in parameter space. In this paper, we present a new method for solving the multilevel atom recombination problem, which splits the problem into a computationally expensive atomic physics component that is independent of the cosmology and an ultrafast cosmological evolution component. The atomic physics component follows the network of bound-bound and bound-free transitions among excited states and computes the resulting effective transition rates for the small set of 'interface' states radiatively connected to the ground state. The cosmological evolution component only follows the populations of the interface states. By pretabulating the effective rates, we can reduce the recurring cost of multilevel atom calculations by more than 5 orders of magnitude. The resulting code is fast enough for inclusion in Markov chain Monte Carlo parameter estimation algorithms. It does not yet include the radiative transfer or high-n two-photon processes considered in some recent papers. Further work on analytic treatments for these effects will be required in order to produce a recombination code usable for Planck data analysis.

74 ATOMIC AND MOLECULAR PHYSICS↗

Convolutional Dictionary Regularizers for Tomographic Inversion

There has been a growing interest in the use of data-driven regularizers to solve inverse problems associated with computational imaging systems. The convolutional sparse representation model has recently gained attention, driven by the development of fast algorithms for solving the dictionary learning and sparse coding problems for sufficiently large images and data sets. Nevertheless, this model has seen very limited application to tomographic reconstruction problems. In this paper, we present a model-based tomographic reconstruction algorithm using a learnt convolutional dictionary as a regularizer. The key contribution is the use of a data-dependent weighting scheme for the l 1 regularization to construct an effective denoising method that is integrated into the inversion using the Plug-and-Play reconstruction framework. Using simulated data sets we demonstrate that our approach can improve performance over traditional regularizers based on a Markov random field model and a patch-based sparse representation model for sparse and limited-view tomographic data sets.

Singanallur Vaidyanathan, Venkatakrishnan↗

Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations

The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing a nonorthogonal basis for ab initio electronic structure calculations. We propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative diagonalization of such eigenvalue problems. In partition-of-unity finite-element (PUFE) pseudopotential density-functional calculations, employing a nonorthogonal basis, we show that the hybrid preconditioned block steepest descent method is a cost-effective eigensolver, outperforming current state-of-the-art global preconditioning schemes, and comparably efficient for the ill-conditioned generalized eigenvalue problems produced by PUFE as the locally optimal block preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.

74 ATOMIC AND MOLECULAR PHYSICS↗

Nyström type exponential integrators for strongly magnetized charged particle dynamics

Solving for charged particle motion in electromagnetic fields (i.e. the particle pushing problem) is a computationally intensive component of particle-in-cell (PIC) methods for plasma physics simulations. This task is especially challenging when the plasma is strongly magnetized due numerical stiffness arising from the wide range of time scales between highly oscillatory gyromotion and long term macroscopic behavior. A promising approach to solve these problems is by a class of methods known as exponential integrators that can solve linear problems exactly and are A-stable. This work extends the standard exponential integration framework to derive Nyström-type exponential integrators that integrates the Newtonian equations of motion as a second-order differential equation directly. In particular, we derive second-order and third-order Nyström-type exponential integrators for strongly magnetized particle pushing problems. Numerical experiments show that the Nyström-type exponential integrators exhibit significant improvement in computation speed over the standard exponential integrators.

general physics↗

Postprocessing Mixed Finite Element Methods For Solving Cahn–Hilliard Equation: Methods and Error Analysis

A postprocessing technique for mixed finite element methods for the Cahn-Hilliard equation is developed and analyzed. Once the mixed finite element approximations have been computed at a fixed time on the coarser mesh, the approximations are postprocessed by solving two decoupled Poisson equations in an enriched finite element space (either on a finer grid or a higher-order space) for which many fast Poisson solvers can be applied. The nonlinear iteration is only applied to a much smaller size problem and the computational cost using Newton and direct solvers is negligible compared with the cost of the linear problem. The analysis presented here shows that this technique remains the optimal rate of convergence for both the concentration and the chemical potential approximations. The corresponding error estimate obtained in our paper, especially the negative norm error estimates, are non-trivial and different with the existing results in the literatures.

97 MATHEMATICS AND COMPUTING↗

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗

Neural nets on the MPP

The Massively Parallel Processor (MPP) is an ideal machine for computer experiments with simulated neural nets as well as more general cellular automata. Experiments using the MPP with a formal model neural network are described. The results on problem mapping and computational efficiency apply equally well to the neural nets of Hopfield, Hinton et al., and Geman and Geman.

Hastings, Harold M.↗

Fusion of monocular cues to detect man-made structures in aerial imagery

The extraction of buildings from aerial imagery is a complex problem for automated computer vision. It requires locating regions in a scene that possess properties distinguishing them as man-made objects as opposed to naturally occurring terrain features. It is reasonable to assume that no single detection method can correctly delineate or verify buildings in every scene. A cooperative-methods paradigm is useful in approaching the building extraction problem. Using this paradigm, each extraction technique provides information which can be added or assimilated into an overall interpretation of the scene. Thus, the main objective is to explore the development of computer vision system that integrates the results of various scene analysis techniques into an accurate and robust interpretation of the underlying three dimensional scene. The problem of building hypothesis fusion in aerial imagery is discussed. Building extraction techniques are briefly surveyed, including four building extraction, verification, and clustering systems. A method for fusing the symbolic data generated by these systems is described, and applied to monocular image and stereo image data sets. Evaluation methods for the fusion results are described, and the fusion results are analyzed using these methods.

Shufelt, Jefferey↗

mu analysis with real parametric uncertainty

The authors give a broad overview, from a LFT (linear fractional transformation)/mu perspective, of some of the theoretical and practical issues associated with robustness in the presence of real parametric uncertainty, with a focus on computation. Recent results on the properties of mu in the mixed case are reviewed, including issues of NP completeness, continuity, computation of bounds, the equivalence of mu and its bounds, and some direct comparisons with Kharitonov-type analysis methods. In addition, some advances in the computational aspects of the problem, including a novel branch and bound algorithm, are briefly presented together with numerical results. The results suggest that while the mixed mu problem may have inherently combinatoric worst-case behavior, practical algorithms with modest computational requirements can be developed for problems of medium size (less than 100 parameters) that are of engineering interest.

Young, Peter M.↗

The nonequilibrium quantum many-body problem as a paradigm for extreme data science

Generating big data pervades much of physics. But some problems, which we call extreme data problems, are too large to be treated within big data science. The nonequilibrium quantum many-body problem on a lattice is just such a problem, where the Hilbert space grows exponentially with system size and rapidly becomes too large to fit on any computer (and can be effectively thought of as an infinite-sized data set). Nevertheless, much progress has been made with computational methods on this problem, which serve as a paradigm for how one can approach and attack extreme data problems. In addition, viewing these physics problems from a computer-science perspective leads to new approaches that can be tried to solve more accurately and for longer times. In this work, we review a number of these different ideas.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Random functions via Dyson Brownian Motion: progress and problems

We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C{sup 2} locally. We further explain that random functions generated via DBM show an unstable growth as the traversed distance increases. This feature restricts the use of such functions considerably if they are to be used to model globally defined ones. The latter is the case if one uses random functions to model landscapes in string theory. We provide a concrete example, based on a simple axionic potential often used in cosmology, to highlight this problem and also offer an ad hoc modification of DBM that suppresses this growth to some degree.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than "building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of MCNP, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) confirm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results analysis methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exemplified through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than "building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of the Monte Carlo N-Particle radiation transport simulation tool, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) confirm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results assessment methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exemplified through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than "building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of the Monte Carlo N-Particle radiation transport simulation tool, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) con firm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results assessment methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exempli fied through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Low-Rank Incremental Methods for Computing Dominant Singular Subspaces

Computing the singular values and vectors of a matrix is a crucial kernel in numerous scientific and industrial applications. As such, numerous methods have been proposed to handle this problem in a computationally efficient way. This paper considers a family of methods for incrementally computing the dominant SVD of a large matrix A. Specifically, we describe a unification of a number of previously disparate methods for approximating the dominant SVD via a single pass through A. We tie the behavior of these methods to that of a class of optimization-based iterative eigensolvers on A'*A. An iterative procedure is proposed which allows the computation of an accurate dominant SVD via multiple passes through A. We present an analysis of the convergence of this iteration, and provide empirical demonstration of the proposed method on both synthetic and benchmark data.

99 GENERAL AND MISCELLANEOUS↗

Verification of the AGREE and Serpent for the steady state HTR-10 benchmark problems

This paper provides results from steady state HTR-10 benchmark calculations performed using AGREE and Serpent that are compared to experimental results as well as calculations performed by INET. The purpose of completing this benchmark is to validate AGREE and Serpent for the prediction of HTGR operation so that they may ultimately be used to support licensing and deployment efforts of advanced reactors. The benchmark consists of several problems ranging from control rod worth calculations to k{sub eff} calculations at various temperatures. Overall, AGREE and Serpent show good agreement with the reference solutions and are effectively able to predict HTGR operation for a variety of steady state cases. The largest difference from the reference was for the initial core single rod worth, which is possibly due to the larger core helium cavity causing inaccuracies in the diffusion calculation whereas the control rod worth determined by Serpent and AGREE is much closer to the reference result for the full core loading. Moreover, in every benchmark problem, increasing the number of energy groups in the cross sections results in improved agreement of the AGREE result with the reference, although it also causes an increase in computation time. For problems with experimental data available, the accuracy of results generated by Serpent and AGREE is comparable to results obtained by other benchmark participants. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗