Search NASA⌕ Search

SEARCH · Search NASA

Results for “standard problem”

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 937 records · Page 52

Coilgun Acceleration Model Containing Multiple Interacting Coils

A coilgun operates by pulsing current through an axially-arranged series of independently-controlled coils inductively interacting with a small, electrically-conductive, azimuthally-symmetric projectile to accelerate it to high velocities. The electrical circuits are programmed to pulse current through the coils in such a way so as to impart further electromagnetic acceleration in each stage. A method is developed to calculate the mutual inductance between the coils and between each coil and the projectile. These terms are used to write a system of first-order ordinary differential equations governing the projectile velocity and the current flow in each coil. While the inclusion of the electromagnetic interactions between coils significantly complicates the equation set as more coil sets are included in the problem, casting the problem symbolically in mass matrix form permits solution using standard numerical Runge-Kutta techniques. Comparing a projectile with a single-turn to that comprised of nine-turns, the inductance of the former is much smaller, but this leads to a greater induced projectile current. The lower inductance and greater current appear to offset each other with little difference in the acceleration profile for the two cases. For the limited cases studied, coils with a discharge half-cycle equal to the time for a projectile to transit from one coil to the next yield increased efficiency.

Polzin, Kurt A.↗

Large Data Visualization on Distributed Memory Mulit-GPU Clusters

Data sets of immense size are regularly generated on large scale computing resources. Even among more traditional methods for acquisition of volume data, such as MRI and CT scanners, data which is too large to be effectively visualization on standard workstations is now commonplace. One solution to this problem is to employ a 'visualization cluster,' a small to medium scale cluster dedicated to performing visualization and analysis of massive data sets generated on larger scale supercomputers. These clusters are designed to fit a different need than traditional supercomputers, and therefore their design mandates different hardware choices, such as increased memory, and more recently, graphics processing units (GPUs). While there has been much previous work on distributed memory visualization as well as GPU visualization, there is a relative dearth of algorithms which effectively use GPUs at a large scale in a distributed memory environment. In this work, we study a common visualization technique in a GPU-accelerated, distributed memory setting, and present performance characteristics when scaling to extremely large data sets.

97 MATHEMATICS AND COMPUTING↗

Discrete diffusion Monte Carlo for frequency-dependent radiative transfer

Discrete Diffusion Monte Carlo (DDMC) is a technique for increasing the efficiency of Implicit Monte Carlo radiative-transfer simulations. In this paper, we develop an extension of DDMC for frequency-dependent radiative transfer. We base our new DDMC method on a frequency-integrated diffusion equation for frequencies below a specified threshold. Above this threshold we employ standard Monte Carlo. With a frequency-dependent test problem, we confirm the increased efficiency of our new DDMC technique.

97 MATHEMATICS AND COMPUTING↗

BOUT++

The BOUT++ is a C++ framework for developing plasma fluid simulation codes, and has been developed by the University of York/UK and the LLNL Fusion Energy Program from the original 3D boundary turbulence 2-fluid edge simulation code BOUT. The aim of BOUT++ is to automate the common tasks needed for simulation codes, and to separate the complicated details such as differential geometry, parallel communication, and file input/output from the user-specified equations to be solved. The BOUT++ consists of BOUT++ library and physics modules. BOUT++ modules contains the coding for the specific set of physics equations and boundary conditions for particular physics problems using defined functions in BOUT++ library to perform standard differential operators.

Source record↗

Unsupervised Resource Allocation with Graph Neural Networks

We present an approach for maximizing a global utility function by learning how to allocate resources in an unsupervised way. We expect interactions between allocation targets to be important and therefore propose to learn the reward structure for near-optimal allocation policies with a GNN. By relaxing the resource constraint, we can employ gradient-based optimization in contrast to more standard evolutionary algorithms. Our algorithm is motivated by a problem in modern astronomy, where one needs to select-based on limited initial information-among $10^9$ galaxies those whose detailed measurement will lead to optimal inference of the composition of the universe. Our technique presents a way of flexibly learning an allocation strategy by only requiring forward simulators for the physics of interest and the measurement process. We anticipate that our technique will also find applications in a range of resource allocation problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Accuracy and stability in incompressible SPH (ISPH) based on the projection method and a new approach

The stability and accuracy of three methods which enforce either a divergence-free velocity field, density invariance, or their combination are tested here through the standard Taylor-Green and spin-down vortex problems. While various approaches to incompressible SPH (ISPH) have been proposed in the past decade, the present paper is restricted to the projection method for the pressure and velocity coupling. It is shown that the divergence-free ISPH method cannot maintain stability in certain situations although it is accurate before instability sets in. The density-invariant ISPH method is stable but inaccurate with random-noise like disturbances. The combined ISPH, combining advantages in divergence-free ISPH and density-invariant ISPH, can maintain accuracy and stability although at a higher computational cost. Redistribution of particles on a fixed uniform mesh is also shown to be effective but the attraction of a mesh-free method is lost. A new divergence-free ISPH approach is proposed here which maintains accuracy and stability while remaining mesh free without increasing computational cost by slightly shifting particles away from streamlines, although the necessary interpolation of hydrodynamic characteristics means the formulation ceases to be strictly conservative. This avoids the highly anisotropic particle spacing which eventually triggers instability. Importantly pressure fields are free from spurious oscillations, up to the highest Reynolds numbers tested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IMPROVED PERFORMANCES IN SUBSONIC FLOWS OF AN SPH SCHEME WITH GRADIENTS ESTIMATED USING AN INTEGRAL APPROACH

In this paper, we present results from a series of hydrodynamical tests aimed at validating the performance of a smoothed particle hydrodynamics (SPH) formulation in which gradients are derived from an integral approach. We specifically investigate the code behavior with subsonic flows, where it is well known that zeroth-order inconsistencies present in standard SPH make it particularly problematic to correctly model the fluid dynamics. In particular, we consider the Gresho–Chan vortex problem, the growth of Kelvin–Helmholtz instabilities, the statistics of driven subsonic turbulence and the cold Keplerian disk problem. We compare simulation results for the different tests with those obtained, for the same initial conditions, using standard SPH. We also compare the results with the corresponding ones obtained previously with other numerical methods, such as codes based on a moving-mesh scheme or Godunov-type Lagrangian meshless methods. We quantify code performances by introducing error norms and spectral properties of the particle distribution, in a way similar to what was done in other works. We find that the new SPH formulation exhibits strongly reduced gradient errors and outperforms standard SPH in all of the tests considered. In fact, in terms of accuracy, we find good agreement between the simulation results of the new scheme and those produced using other recently proposed numerical schemes. These findings suggest that the proposed method can be successfully applied for many astrophysical problems in which the presence of subsonic flows previously limited the use of SPH, with the new scheme now being competitive in these regimes with other numerical methods.

79 ASTRONOMY AND ASTROPHYSICS↗

A variance deconvolution estimator for efficient uncertainty quantification in Monte Carlo radiation transport applications

Monte Carlo simulations are at the heart of many high-fidelity simulations and analyses for radiation transport systems. As is the case with any complex computational model, it is important to propagate sources of input uncertainty and characterize how they affect model output. Unfortunately, uncertainty quantification (UQ) is made difficult by the stochastic variability that Monte Carlo transport solvers introduce. The standard method to avoid corrupting the UQ statistics with the transport solver noise is to increase the number of particle histories, resulting in very high computational costs. In this contribution, we propose and analyze a sampling estimator based on the law of total variance to compute UQ variance even in the presence of residual noise from Monte Carlo transport calculations. Here, we rigorously derive the statistical properties of the new variance estimator, compare its performance to that of the standard method, and demonstrate its use on neutral particle transport model problems involving both attenuation and scattering physics. We illustrate, both analytically and numerically, the estimator’s statistical performance as a function of available computational budget and the distribution of that budget between UQ samples and particle histories. We show analytically and corroborate numerically that the new estimator is unbiased, unlike the standard approach, and is more accurate and precise than the standard estimator for the same computational budget.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the Computational Viability of Quantum Optimization for PMU Placement

Using optimal phasor measurement unit placement as a prototypical problem, we assess the computational viability of the current generation D-Wave Systems 2000Q quantum annealer for power systems design problems. We reformulate minimum dominating set for the annealer hardware, solve the reformulation for a standard set of IEEE test systems, and benchmark solution quality and time to solution against the CPLEX optimizer and simulated annealing. For some problem instances the 2000Q outpaces CPLEX. For instances where the 2000Q underperforms with respect to CPLEX and simulated annealing, we suggest hardware improvements for the next generation of quantum annealers.

hardware↗

Classification of weld defect based on information fusion technology for radiographic testing system

Improving the efficiency and accuracy of weld defect classification is an important technical problem in developing the radiographic testing system. This paper proposes a novel weld defect classification method based on information fusion technology, Dempster–Shafer evidence theory. First, to characterize weld defects and improve the accuracy of their classification, 11 weld defect features were defined based on the sub-pixel level edges of radiographic images, four of which are presented for the first time in this paper. Second, we applied information fusion technology to combine different features for weld defect classification, including a mass function defined based on the weld defect feature information and the quartile-method-based calculation of standard weld defect class which is to solve a sample problem involving a limited number of training samples. A steam turbine weld defect classification case study is also presented herein to illustrate our technique. The results show that the proposed method can increase the correct classification rate with limited training samples and address the uncertainties associated with weld defect classification.

42 ENGINEERING↗

Symmetry Breaking, Unification, and Theories Beyond the Standard Model

A model was constructed in which the supersymmetric fine-tuning problem is solved without extending the Higgs sector at the weak scale. We have demonstrated that the model can avoid all the phenomenological constraints, while avoiding excessive fine-tuning. We have also studied implications of the model on dark matter physics and collider physics. I have proposed in an extremely simple construction for models of gauge mediation. We found that the {mu} problem can be simply and elegantly solved in a class of models where the Higgs fields couple directly to the supersymmetry breaking sector. We proposed a new way of addressing the flavor problem of supersymmetric theories. We have proposed a new framework of constructing theories of grand unification. We constructed a simple and elegant model of dark matter which explains excess flux of electrons/positrons. We constructed a model of dark energy in which evolving quintessence-type dark energy is naturally obtained. We studied if we can find evidence of the multiverse.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Incompressible Navier-Stokes Computations with Heat Transfer

The existing pseudocompressibility method for the system of incompressible Navier-Stokes equations is extended to heat transfer problems by including the energy equation. The solution method is based on the pseudo compressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. Current computations use one-equation Baldwin-Barth turbulence model which is derived from a simplified form of the standard k-epsilon model equations. Both forced and natural convection problems are examined. Numerical results from turbulent reattaching flow behind a backward-facing step will be compared against experimental measurements for the forced convection case. The validity of Boussinesq approximation to simplify the buoyancy force term will be investigated. The natural convective flow structure generated by heat transfer in a vertical rectangular cavity will be studied. The numerical results will be compared by experimental measurements by Morrison and Tran.

Kiris, Cetin↗

Monte Carlo inversion of seismic data

The analytic solution to the linear inverse problem provides estimates of the uncertainty of the solution in terms of standard deviations of corrections to a particular solution, resolution of parameter adjustments, and information distribution among the observations. It is shown that Monte Carlo inversion, when properly executed, can provide all the same kinds of information for nonlinear problems. Proper execution requires a relatively uniform sampling of all possible models. The expense of performing Monte Carlo inversion generally requires strategies to improve the probability of finding passing models. Such strategies can lead to a very strong bias in the distribution of models examined unless great care is taken in their application.

Wiggins, R. A.↗

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗

International Evaluation of Neutron Cross Section Standards

Neutron cross section standards are the basis for the determination of most neutron cross sections. They are used for both measurements and evaluations of neutron cross sections. Not many cross sections can be obtained absolutely - most cross sections are measured relative to the cross section standards and converted using evaluations of the standards. The previous complete evaluation of the neutron cross section standards was finished in 1987 and disseminated as the NEANDC/INDC and ENDF/B-VI standards. R-matrix model fits for the light elements and non-model least-squares fits for all the cross sections in the evaluation were the basis of the combined fits for all of the data. Some important reactions and constants are not standards, but they assist greatly in the determination of the standard cross sections and reduce their uncertainties - these data were also included in the combined fits. The largest experimental database used in the evaluation was prepared by Poenitz and included about 400 sets of experimental data with covariance matrices of uncertainties that account for all cross-energy, cross-reaction and cross-material correlations. For the evaluation GMA, a least-squares code developed by Poenitz, was used to fit all types of cross sections (absolute and shape), their ratios, spectrum-averaged cross sections and thermal constants in one full analysis. But, the uncertainties derived in this manner, and especially those obtained in the R-matrix model fits, have been judged to be too low and unrealistic. These uncertainties were substantially increased prior to their release in the recommended data files of 1987. Modified percentage uncertainties were reassigned by the United States Cross Section Evaluation Working Group's Standards Subcommittee for a wide range of energies, and no covariance (or correlation) matrices were supplied at that time. The need to re-evaluate the cross section standards is based on the appearance of a significant amount of precise experimental data and improved developments in the methodology of analysis and evaluation. Initial efforts to produce a new evaluation were made by the United States Cross Section Evaluation Working Group which formed a Task Force. It was realized that international cooperation would be needed to produce the evaluation. The Working Party on International Evaluation Cooperation of the Nuclear Energy Agency Nuclear Science Committee formed a Subgroup, and the International Atomic Energy Agency formed a Coordinated Research Project (CRP). These groups worked cooperatively to improve the evaluation process. The major effort in producing the evaluation was through the CRP. The evaluations of the neutron cross section standards were finalized in October 2005. Previous difficulties experienced with a data evaluation problem known as 'Peelle's Pertinent Puzzle' create biases in the fit of correlated data, and they have been addressed to reduce this phenomenon. The new evaluations of the cross section standards also include covariance matrices of the uncertainties that contain fully justifiable values. The product of this international effort has been adopted as the neutron standards for ENDF/B-VII.0.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗