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,243 records · Page 69

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↗

MAGSAT scalar anomalies

To facilitate processing large data arrays, elements of spherical Earth analysis programs NVERTSM, SMFLD, NVERTG and GLFD were implemented and tested on the LARS IBM 4341 computer. Currently, the problem of inverting 2 deg MAGSAT scalar anomalies for the region (80 W, 60 E) longitude and (40 S, 70 N) latitude is being implemented on the LARS-computer for quantitative comparison with free air gravity anomaly, geothermal and tectonic data. Gravity and MAGSAT anomalies from a subset of this region (30 W, 60 E), (40 S, 70 N) were already processed for a paper on satellite magnetic anomalies of Africa and Europe.

Braile, L. W.↗

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗

Compound classification by computer treatment of low resolution mass spectra - Application to geochemical and environmental problems.

A description is given of a development of computer analysis of low-resolution chromatographic-mass spectrometric data, which provides a preliminary classification of an unknown spectrum as a listing of candidate classes of compounds. This procedure, referred to as COMSOC (Classification of Mass Spectra on Computers), operates by converting an incoming unknown mass spectrum into a simplified key word which is then compared with each of the key words held in its reference file. The advantages of COMSOC in characterizing complex mixtures are emphasized.

Smith, D. H.↗

Provable bounds for noise-free expectation values computed from noisy samples

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.

97 MATHEMATICS AND COMPUTING↗

A decade of computer simulations for space shuttle aerodynamics

Ten years ago computer simulations of the flow field around the Space Shuttle Orbiter were limited to inviscid calculations for the windward side of the forebody and viscous calculations for selected 2-D problems. Advances in computer hardware and numerical methods during the past ten years made it possible to calculate viscous flow over the complete orbiter configuration at angle of attack. The equations solved are the Reynolds-averaged, Navier-Stokes equation, simplified by either the thin-layer or parabolized approximation. An algebraic eddy viscosity model is used for turbulent flow. The free stream is assumed to be a perfect gas for wind tunnel conditions and a real gas in thermodynamic equilibrium for flight conditions. Four examples of recent computer simulations are presented. Flow field results include oil flow patterns on the surface and Mach number contours, isobars, and cross-flow velocity vectors in the shock layer.

Inouye, Mamoru↗

A decade of computer simulations for Space Shuttle aerodynamics

Ten years ago computer simulations of the flow field around the Space Shuttle Orbiter were limited to inviscid calculations for the windward side of the forebody and viscous calculations for selected 2-D problems. Advances in computer hardware and numerical methods during the past ten years made it possible to calculate viscous flow over the complete orbiter configuration at angle of attack. The equations solved are the Reynolds-averaged, Navier-Stokes equation, simplified by either the thin-layer or parabolized approximation. An algebraic eddy viscosity model is used for turbulent flow. The free stream is assumed to be a perfect gas for wind tunnel conditions and a real gas in thermodynamic equilibrium for flight conditions. Four examples of recent computer simulations are presented. Flow field results include oil flow patterns on the surface and Mach number contours, isobars, and cross-flow velocity vectors in the shock layer.

Inouye, Mamoru↗

Assessment of numerical techniques for unsteady flow calculations

The characteristics of unsteady flow motions have long been a serious concern in the study of various fluid dynamic and combustion problems. With the advancement of computer resources, numerical approaches to these problems appear to be feasible. The objective of this paper is to assess the accuracy of several numerical schemes for unsteady flow calculations. In the present study, Fourier error analysis is performed for various numerical schemes based on a two-dimensional wave equation. Four methods sieved from the error analysis are then adopted for further assessment. Model problems include unsteady quasi-one-dimensional inviscid flows, two-dimensional wave propagations, and unsteady two-dimensional inviscid flows. According to the comparison between numerical and exact solutions, although second-order upwind scheme captures the unsteady flow and wave motions quite well, it is relatively more dissipative than sixth-order central difference scheme. Among various numerical approaches tested in this paper, the best performed one is Runge-Kutta method for time integration and six-order central difference for spatial discretization.

Hsieh, Kwang-Chung↗

A Long History of Supercomputing

As part of its national security science mission, Los Alamos National Laboratory and HPC have a long, entwined history dating back to the earliest days of computing. From bringing the first problem to the nation’s first computer to building the first machine to break the petaflop barrier, Los Alamos holds many “firsts” in HPC breakthroughs. Today, supercomputers are integral to stockpile stewardship and the Laboratory continues to work with vendors in developing the future of HPC.

97 MATHEMATICS AND COMPUTING↗

Quantum Information: Opportunities and Challenges

Modern society is shaped by the ability to transmit, manipulate, and store large amounts of information. Although we tend to think of information as abstract, information is physical, and computing is a physical process. How then should we understand information in a quantum world, in which physical systems may exist in multiple states at once and are altered by the very act of observation? This question has evolved into an exciting new field of research called Quantum Information (QI). QI challenges many accepted rules and practices in computer science. For example, a quantum computer would turn certain hard problems into soft problems, and would render common computationally-secure encryption methods (such as RSA) insecure. At the same time, quantum communication would provide an unprecedented kind of intrinsic information security at the level of the smallest physical objects used to store or transmit the information. This talk provides a general introduction to the subject of quantum information and its relevance to cyber security. In the first part, two of the stranger aspects of quantum physics namely, superposition and uncertainty are explained, along with their relation to the concept of information. These ideas are illustrated with a few examples: quantum ID cards, quantum key distribution, and Grover s quantum search algorithm. The state-of-the-art in quantum computing and communication hardware is then discussed, along with the daunting technological challenges that must be overcome. Relevant experimental and theoretical efforts at ORNL are highlighted. The talk concludes with speculations on the short- and long-term impact of quantum information on cyber security.

97 MATHEMATICS AND COMPUTING↗

Prospects for computational aerodynamics

The integral representations approach, for the solution of the Navier-Stokes equations is discussed as well as experience in its development and in applying available finite-difference and finite-element techniques to the treatment of three-dimensional problems, and the computation of turbulent flow. The magnitude of efforts required to develop turbulence models and three-dimensional algorithms indicates that the computational fluid dynamics research must have a broad base. Broader access to modern computing facilities that are in existence within NASA should be promoted for active researchers not directly affiliated with that agency.

Wu, J. C.↗

Large deflection elastic-plastic dynamic response of stiffened shells of revolution

This paper presents the formulation and check-out problems for a computer code DYNAPLAS, which analyzes the large deflection elastic-plastic dynamic response of stiffened shells of revolution. The formulation for spacial discretization is by the finite element method with finite differences being used for the evaluation of the pseudo forces due to material and geometric nonlinearities. Time integration is by the Houbolt method or central differences. The stiffeners may be due to concentrated or distributed eccentric rings and spring supports at arbitrary angles around the circumference of the elements. Check-out problems include the comparison of solutions from DYNAPLAS with experimental and other computer solutions for rings and conical and cylindrical shells. A hypothetical submarine including stiffeners and missile tube is studied under a combination of hydrostatic and dynamically applied asymmetrical pressure loadings.

Stricklin, J. A.↗

Semi-analytical sensitivity analysis for nonlinear transient problems

Efficient analytical sensitivity computations are essential elements of gradient-based optimization schemes; however, they can be difficult to implement. This implementation issue is often resolved by adopting the semi-analytical method which exhibits the efficiency of the analytical methods and the ease of implementation of the finite difference method. However, care must be taken as semi-analytical sensitivities may exhibit errors due to truncation and round-off. Additional errors are introduced if the convergence tolerance of the primal analysis is not sufficiently small. This paper gives a general overview and some new developments of the analytical and semi-analytical sensitivity analyses for nonlinear steady-state, transient, and dynamic problems. We discuss the restrictive assumptions, accuracy, and consistency of these methods. Both adjoint and direct differentiation methods are studied. Numerical examples are provided.

42 ENGINEERING↗

Dynamic Cooling on Contemporary Quantum Computers

We study the problem of dynamic cooling whereby a target qubit is cooled at the expense of heating up N − 1 further identical qubits by means of a global unitary operation. A standard back-of-the-envelope high-temperature estimate establishes that the target qubit temperature can be dynamically cooled by at most a factor of 1 / N . Here we provide the exact expression for the minimum temperature to which the target qubit can be cooled and reveal that there is a crossover from the high initial temperature regime, where the scaling is 1 / N , to a low initial temperature regime, where a much faster scaling of 1 / N occurs. This slow, 1 / N scaling, which was relevant for early high-temperature NMR quantum computers, is the reason dynamic cooling was dismissed as ineffectual around 20 years ago; the fact that current low-temperature quantum computers fall in the fast, 1 / N scaling regime, reinstates the appeal of dynamic cooling today. We further show that the associated work cost of cooling is exponentially more advantageous in the low-temperature regime. We discuss the implementation of dynamic cooling in terms of quantum circuits and examine the effects of hardware noise. We successfully demonstrate dynamic cooling in a three-qubit system on a real quantum processor. Since the circuit size grows quickly with N , scaling dynamic cooling to larger systems on noisy devices poses a challenge. We therefore propose a suboptimal cooling algorithm, whereby relinquishing a small amount of cooling capability results in a drastically reduced circuit complexity, greatly facilitating the implementation of dynamic cooling on near-future quantum computers. Published by the American Physical Society2024

Physics↗