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,117 records · Page 62

No Quantum Utility from Hadron Masses? No, Quantum Utility from Hadron Masses!

Is there a quantum utility in establishing the masses of hadrons? Here we show that the best response is that of Farrés, Capó, and Davis: perhaps, perhaps, perhaps. This is interesting given the general case that particle physics demands quantum computers. For stable hadrons, classical LQCD has achieved sub-percent precision with no sign problem, and quantum computers offer no advantage. For resonances, the Maiani-Testa theorem is an obstruction that quantum simulation is immune to. For nuclei, Wick contractions and signal-to-noise are genuine classical barriers. Underlying these cases is a unified picture connecting the sign problem to Wigner negativity and T gate cost. This manuscript was drafted from extensive interaction with \textsc{Claude}.

Lamm, Henry [Fermilab] (ORCID:0000000330330791)↗

UNEDF: Advanced Scientific Computing Transforms the Low-Energy Nuclear Many-Body Problem

The UNEDF SciDAC collaboration of nuclear theorists, applied mathematicians, and computer scientists is developing a comprehensive description of nuclei and their reactions that delivers maximum predictive power with quantified uncertainties. This paper illustrates significant milestones accomplished by UNEDF through integration of the theoretical approaches, advanced numerical algorithms, and leadership class computational resources.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the benefit of using both hand calculation methods and computer experiments algorithms to solve complex nuclear criticality safety problems - 14299

A companion paper shows the 'anomalies', and even the safety issues, that may be raised by the very usual problem of making safe a fissile mass inside a controlled geometry. These anomalies mainly come from the solving of such problems which belong to the mathematical family of 'robust inversion' including two inversion parameters (the fissile mass and the geometry) and one nuisance parameter (the moderation ratio of the fissile material). Since a 'brute force' method of resolution requires a lot of calculations and since a 'smart' method of resolution requires a lot of engineer time, it is tempting to solve these problems by a 'custom made' approach rather than to achieve a 'whole' resolution. The present paper shows how one can use a hand calculation method (derivation of the one-speed diffusion theory) to perform the whole resolution of such kind of problems with a minimum calculations and human efforts. The powerful capability of predicting the 'anomalies' highlighted in the companion paper is shown. Then the limitations of such a method are discussed: limitation in the geometry of the problem and bias in absolute values prediction. Finally, new algorithms of computer experiments design, dedicated to solve robust inversion problems and based on Kriging surrogates, are tested to solve these problems with limiting calculations and human efforts. The performance of these new algorithms may supplement the one-speed diffusion theory limitations. (authors)

42 ENGINEERING↗

Statistical Energy Analysis Program

Statistical Energy Analysis (SEA) is powerful tool for estimating highfrequency vibration spectra of complex structural systems and incorporated into computer program. Basic SEA analysis procedure divided into three steps: Idealization, parameter generation, and problem solution. SEA computer program written in FORTRAN V for batch execution.

Ferebee, R. C.↗

Run-time parallelization and scheduling of loops

The class of problems that can be effectively compiled by parallelizing compilers is discussed. This is accomplished with the doconsider construct which would allow these compilers to parallelize many problems in which substantial loop-level parallelism is available but cannot be detected by standard compile-time analysis. We describe and experimentally analyze mechanisms used to parallelize the work required for these types of loops. In each of these methods, a new loop structure is produced by modifying the loop to be parallelized. We also present the rules by which these loop transformations may be automated in order that they be included in language compilers. The main application area of the research involves problems in scientific computations and engineering. The workload used in our experiment includes a mixture of real problems as well as synthetically generated inputs. From our extensive tests on the Encore Multimax/320, we have reached the conclusion that for the types of workloads we have investigated, self-execution almost always performs better than pre-scheduling. Further, the improvement in performance that accrues as a result of global topological sorting of indices as opposed to the less expensive local sorting, is not very significant in the case of self-execution.

Saltz, Joel H.↗

The application of the Routh approximation method to turbofan engine models

The Routh approximation technique is applied in the frequency domain to a 16th order state variable turbofan engine model. The results obtained motivate the extension of the frequency domain formulation of the Routh method to the time domain to handle the state variable formulation directly. The time domain formulation is derived and a new characterization, which specifies all possible Routh similarity transformations, is given. This characterization is computed by the solution of two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described and some results are given. Additional computational problems are discussed including an optimization procedure which can improve the approximation accuracy by taking advantage of the transformation characterization.

Merrill, W. C.↗

Computational engine structural analysis

A significant research activity at the NASA Lewis Research Center is the computational simulation of complex multidisciplinary engine structural problems. This simulation is performed using computational engine structural analysis (CESA) which consists of integrated multidisciplinary computer codes in conjunction with computer post-processing for problem-specific application. A variety of the computational simulations of specific cases are described in some detail in this paper. These case studies include: (1) aeroelastic behavior of bladed rotors, (2) high velocity impact of fan blades, (3) blade-loss transient response, (4) rotor/stator/squeeze-film/bearing interaction, (5) blade-fragment/rotor-burst containment, and (6) structural behavior of advanced swept turboprops. These representative case studies are selected to demonstrate the breath of the problems analyzed and the role of the computer including post-processing and graphical display of voluminous output data.

Chamis, C. C.↗

Computational engine structural analysis

A significant research activity at the NASA Lewis Research Center is the computational simulation of complex multidisciplinary engine structural problems. This simulation is performed using computational engine structural analysis (CESA) which consists of integrated multidisciplinary computer codes in conjunction with computer post-processing for problem-specific application. A variety of the computational simulations of specific cases are described in some detail in this paper. These case studies include: (1) aeroelastic behavior of bladed rotors, (2) high velocity impact of fan blades, (3) blade-loss transient response, (4) rotor/stator/squeeze-film/bearing interaction, (5) blade-fragment/rotor-burst containment, and (6) structural behavior of advanced swept turboprops. These representative case studies are selected to demonstrate the breath of the problems analyzed and the role of the computer including post-processing and graphical display of voluminous output data.

Chamis, C. C.↗

Improved Hybrid Modeling of Spent Fuel Storage Facilities

This work developed a new computational method for improving the ability to calculate the neutron flux in deep-penetration radiation shielding problems that contain areas with strong streaming. The “gold standard” method for radiation transport is Monte Carlo (MC) as it samples the physics exactly and requires few approximations. Historically, however, MC was not useful for shielding problems because of the computational challenge of following particles through dense shields. Instead, deterministic methods, which are superior in term of computational effort for these problems types but are not as accurate, were used. Hybrid methods, which use deterministic solutions to improve MC calculations through a process called variance reduction, can make it tractable from a computational time and resource use perspective to use MC for deep-penetration shielding. Perhaps the most widespread and accessible of these methods are the Consistent Adjoint Driven Importance Sampling (CADIS) and Forward-Weighted CADIS (FW-CADIS) methods. For problems containing strong anisotropies, such as power plants with pipes through walls, spent fuel cask arrays, active interrogation, and locations with small air gaps or plates embedded in water or concrete, hybrid methods are still insufficiently accurate. In this work, a new method for generating variance reduction parameters for strongly anisotropic, deep penetration radiation shielding studies was developed. This method generates an alternate form of the adjoint scalar flux quantity, Φ Ω , which is used by both CADIS and FW-CADIS to generate variance reduction parameters for local and global response functions, respectively. The new method, called CADIS-Ω, was implemented in the Denovo/ADVANTG software. Results indicate that the flux generated by CADIS-Ω incorporates localized angular anisotropies in the flux more effectively than standard methods. CADIS-Ω outperformed CADIS in several test problems. This initial work indicates that CADIS- may be highly useful for shielding problems with strong angular anisotropies. This is a benefit to the public by increasing accuracy for lower computational effort for many problems that have energy, security, and economic importance.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Standardized Definitions for Code Verification Test Problems

This document contains standardized definitions for several commonly used code verification test problems. These definitions are intended to contain sufficient information to set up the test problem in a computational physics code. These definitions are intended to be used in conjunction with exact solutions to these problems generated using Exact- Pack, www.github.com/lanl/exactpack.

97 MATHEMATICS AND COMPUTING↗

Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations

To explore band structures of three-dimensional photonic crystals numerically, we need to solve the eigenvalue problems derived from the governing Maxwell equations. The solutions of these eigenvalue problems cannot be computed effectively unless a suitable combination of eigenvalue solver and preconditioner is chosen. Taking eigenvalue problems due to Yee's scheme as examples, we propose using Krylov-Schur method and Jacobi-Davidson method to solve the resulting eigenvalue problems. For preconditioning, we derive several novel preconditioning schemes based on various preconditioners, including a preconditioner that can be solved by Fast Fourier Transform efficiently. We then conduct intensive numerical experiments for various combinations of eigenvalue solvers and preconditioning schemes. We find that the Krylov-Schur method associated with the Fast Fourier Transform based preconditioner is very efficient. It remarkably outperforms all other eigenvalue solvers with common preconditioners like Jacobi, Symmetric Successive Over Relaxation, and incomplete factorizations. This promising solver can benefit applications like photonic crystal structure optimization.

36 MATERIALS SCIENCE↗

The inversion of VLF-LF sounder data to obtain D-region electron-density distributions

The direct problem is to compute reflection coefficients for an assumed electron-density profile, using a full-wave solution. The inverse problem is treated numerically, using derivatives of the reflection matrix with respect to model parameters. A technique for the rapid computation of the derivatives is described. An algorithm for determining resolution in the profile is discussed.

Shellman, C. H.↗

Convergent Close-Coupling Approach to Electron-Atom Collisions

It was with great pleasure and honour to accept the invitation to make a presentation at the symposium celebrating the life-long work of Aaron Temkin and Richard Drachman. The work of Aaron Temkin was particularly influential on our own during the development of the CCC method for electron-atom collisions. There are a number of key problems that need to be dealt with when developing a general computational approach to such collisions. Traditionally, the electron energy range was subdivided into the low, intermediate, and high energies. At the low energies only a finite number of channels are open and variational or close-coupling techniques could be used to obtain accurate results. At high energies an infinite number of discrete channels and the target continuum are open, but perturbative techniques are able to yield accurate results. However, at the intermediate energies perturbative techniques fail and computational approaches need to be found for treating the infinite number of open channels. In addition, there are also problems associated with the identical nature of electrons and the difficulty of implementing the boundary conditions for ionization processes. The beauty of the Temkin-Poet model of electron-hydrogen scattering is that it simplifies the full computational problem by neglecting any non-zero orbital angular momenta in the partial-wave expansion, without loosing the complexity associated with the above-mentioned problems. The unique nature of the problem allowed for accurate solution leading to benchmark results which could then be used to test the much more general approaches to electron-atom collision problems. The immense value of the Temkin-Poet model is readily summarised by the fact that the initial papers of Temkin and Poet have been collectively cited around 250 times to date and are still being cited in present times. Many of the citations came from our own work during the course of the development of the CCC method, which we now describe.

Bray, Igor↗

Thermal-stress analysis for wood composite blade

The thermal-stress induced by solar insolation on a wood composite blade of a Mod-OA wind turbine was investigated. The temperature distribution throughout the blade (a heat conduction problem) was analyzed and the thermal-stress distribution of the blades caused by the temperature distribution (a thermal-stress analysis problem) was then determined. The computer programs used for both problems are included along with output examples.

Fu, K. C.↗

Fast parallel algorithms that compute transitive closure of a fuzzy relation

The notion of a transitive closure of a fuzzy relation is very useful for clustering in pattern recognition, for fuzzy databases, etc. The original algorithm proposed by L. Zadeh (1971) requires the computation time O(n(sup 4)), where n is the number of elements in the relation. In 1974, J. C. Dunn proposed a O(n(sup 2)) algorithm. Since we must compute n(n-1)/2 different values s(a, b) (a not equal to b) that represent the fuzzy relation, and we need at least one computational step to compute each of these values, we cannot compute all of them in less than O(n(sup 2)) steps. So, Dunn's algorithm is in this sense optimal. For small n, it is ok. However, for big n (e.g., for big databases), it is still a lot, so it would be desirable to decrease the computation time (this problem was formulated by J. Bezdek). Since this decrease cannot be done on a sequential computer, the only way to do it is to use a computer with several processors working in parallel. We show that on a parallel computer, transitive closure can be computed in time O((log(sub 2)(n))2).

Kreinovich, Vladik YA.↗