Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,495 records · Page 83

The spectral green's function nodal method for multigroup slab-geometry fixed-source S{sub N} problems with anisotropic scattering

A generalization of the spectral Green's function (SGF) method is developed for multigroup, fixed-source, slab-geometry discrete ordinates (S{sub N}) problems with anisotropic scattering. The offered SGF method with the one-node block inversion (NBI) iterative scheme converges numerical solutions that are completely free from spatial truncation errors for multigroup slab-geometry S{sub N} problems with scattering anisotropy of order L, provided L < N. As a coarse-mesh numerical method, the SGF method generates numerical solutions that generally do not give detailed information on the problem solution profile, as the grid points can be located considerably away from each other. Therefore, presented here is a technique for the spatial reconstruction of the coarse-mesh solution generated by the multigroup SGF method. Numerical results are given to illustrate the method's accuracy. (authors)

97 MATHEMATICS AND COMPUTING↗

The Reactor Graphite Handling. Problems and Solutions - 17208

The problem of industrial uranium-graphite reactors and NPP units decommissioning is one of the urgent tasks that require efficient and cost-effective solutions. To date, only Russia has already shut down and subject to decommissioning more than 120 objects. World-wide, more than 260,000 ton of irradiated graphite have arisen from the commercial nuclear power operations, research reactors, and defense production reactors. Under the circumstances the problem to develop cost-effective methods of the irradiated graphite management has appeared. Alternative disposal options for the irradiated graphite were discussed for at least 25-30 years. To date, various methods of irradiated graphite reprocessing have been proposed. They are based on the application of different physical and chemical processes, most of which involve incineration of the entire mass of graphite. However, they all have disadvantages, and do not solve the whole complex of problems. The primary goal of the research presented here was to carry out a study aimed at the development of a more simple technology (as compared to the incineration of the entire mass of graphite) that would provide for the graphite purification and allow the possibility of its transfer to the less hazardous waste category followed by the disposal of it in a near-surface repository. To achieve it is proposed to consider two directions, each of them reducing the cost of graphite reprocessing and the waste volume disposed of in the repository. The first alternative is based on the principle of partitioning radionuclides of different nature from the graphite, thus allowing to transfer it into the LLW category and minimize the volume of secondary waste products. The second option to change the reprocessing technology is the idea to use reactor graphite as the starting material to produce stable final waste form compositions intended for the long-term storage of radioactive waste including transuranic elements. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Results from the assessment of COBRA-IE multidimensional flow capability with selected canonical problems

A systematic assessment of the capabilities of thermal-hydraulic codes such as RELAP5-3D and COBRA-IE to handle multi-dimensional flow is ongoing. The assessment is being performed in hierarchical fashion by isolating simple processes first and building complexity along the way. The first stage in the process has been to develop simple and fundamental canonical problems which challenge key aspects of the multidimensional flow process while removing other complex processes such as interfacial mass and heat transfer. Results of this work have been presented for RELAP5-3D at the NURETH-16 conference [1], [2], [3]. The purpose of this paper is to illustrate similar results obtained using COBRA-IE. The results are presented for two canonical problems. The first pertains to the simulation of Faraday waves (CP06) in an annulus. The second problem compares the solution of 2D single-phase, inviscid, frictionless, incompressible, irrotational flow (CP07) to the potential flow solution. Results from COBRA-IE are compared with similar results obtained with RELAP5-3D which were previously published in the 2015 NURETH papers series on this topic. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fluor Idaho's Technical and Programmatic Approach That Resolved the Problems with the Integrated Waste Treatment Unit - 19290

The Integrated Waste Treatment Unit (IWTU) is a facility designed to treat approximately 900,000 gallons of radioactive liquid waste, referred to as Sodium Bearing Waste (SBW). IWTU is a Fluidized Bed Steam Reforming process that will be used to treat the SBW to produce a granular sodium carbonate and sodium aluminate product. The product is planned to be managed as remote handled transuranic waste. Construction of the IWTU was completed in 2011 and Critical Decision 4 was achieved in 2012 with the expectation that the treatment of the SBW would be completed in 2012. However, process instabilities and equipment problems prevented the safe and reliable operation of the facility. All of the nonradiological tests of the IWTU had to be stopped prematurely because each time the IWTU was operated, the process would become unstable within a few days of initiating the operation. The instabilities were associated with the primary fluidized bed reaction vessel, the Denitration Mineralization Reformer (DMR). The instabilities included difficulties maintaining fluidization conditions and scale formation within the DMR. Design inadequacies and equipment reliability problems in other parts of the facility also hampered the testing the IWTU. The U.S. Department of Energy (DOE) awarded the Idaho Clean-up contract to Fluor Idaho (Fluor) in 2016. To resolve the issues with the IWTU, Fluor assembled a dedicated team to develop the technical and programmatic strategy to resolve the issues with the IWTU and get it operational. Fluor's approach has successfully resolved the primary issues with the IWTU. As a result of modifications of equipment and operating strategies implemented by Fluor, the core part of the IWTU process now works reliably when processing simulated Sodium Bearing Waste over a wide range of operating conditions. This paper describes Fluor's approach and summarize key steps in the process to resolve the issues with the IWTU. Fluor has used strong fundamentals including a first principles approach and unique program management techniques to solve the technical problems with the IWTU. The successful approach has provided renewed confidence in the IWTU process enabling the troubled project to move forward. Important factors in the success of the project include using a dedicated project team separate from the IWTU line organization, a Technical Review Group, the Chemistry Team and a diverse set of supporting contractors and National Laboratories. Fluor typically used multiple means to validate solutions before testing them in the IWTU. Fluor's successful full-scale demonstration runs of the IWTU confirm the process will reliably produce a compliant, treated waste product over a wide range of operating conditions.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Penalty-free method for multi-constrained optimization problems based on parallel simulated annealing

A method is presented for addressing constraints within the context of large-scale combinatorial optimization problems. The method, based on constraint annealing, eliminates the use of traditional constraint penalty factors by treating each constraint as separate and concurrently solved minimization problems within a global optimization search framework. Results are demonstrated for a core loading pattern optimization problem. (authors)

97 MATHEMATICS AND COMPUTING↗

Monte Carlo Direct Simulation Method for Initiation Probability Problems

During the early period of a supercritical system, the growth of fission chains shows a significant stochastic feature. In multiplying medium, it is a probability issue of fail-pass type for a single neutron to sponsor a divergent fission chain, and the probability of success is named as single neutron initiation probability. Meanwhile, in the presence of a weak neutron source, the time at which fission burst occurs also exhibits a stochastic nature, which can be observed on experiments of pulsed reactors such as GODIVA I and GODIVA II. The initiation probability and burst waiting time reflect the dynamic feature of a supercritical system, which are very important for nuclear criticality safety concerns. It is desirable that a supercritical system has an initiation probability very close to zero and releases limited energy in case of criticality accidents. The stochastic process of neutron population evolution in early age in a multiplying system is governed by Bell's equation in the form of an adjoint neutron transport equation with a non-linear fission term. In order to solve this stochastic neutron transport equation, the deterministic method discretizing the phase space was proposed long ago and has been implemented in several SN codes such as Partisn, Ardra and PANDA. However, the deterministic method is of limited usage, due to its poor ability to precisely describe real-world 3D complex geometries and continuous energy neutron spectrum. Recently, Monte Carlo methods have gradually gained attention for solving Bell's equation. Greenman from LLNL proposed an analog Monte Carlo forward-transport method for calculating initiation probability in 2007. He implemented this method by introducing the maximum age parameter, the time sub-interval and the neutron progenitor tag into Mercury in time-dependent fixed-source simulation mode. This method is only suitable for initiation probability calculations, however not for analyzing the randomness of burst waiting time. Later, GANG in 2011 developed the GSMP (Generalized Semi-Markov Process method) Monte Carlo method according to Bell's equation. While the GSMP method, which can deal with both initiation probability and burst waiting time, is flexible and powerful for zero-dimensional problems, it is not favorable when extended to 3D and continuous energy problems due to severe lack of computational efficiency. In 2015, a direct Monte Carlo simulation method for stochastic systems problems was implemented in MCATK, yet this method has not been applied specifically to the burst waiting time. In this work, a new and efficient 3D Monte Carlo direct simulation method for calculating both the initiation probability and the burst waiting time is developed. By taking random factors during evolvement of fission chains into account in dynamic Monte Carlo simulation, this new method has the potential of simulating the whole process from source neutron injection to exponential growth of the neutron population, and finally to extinction of the neutron pulse. This capability is useful in criticality accidents evaluation and pulsed reactor experiments explanation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

MOCUM Verification with a Heterogeneous MOX Whole Core C5G7 Benchmark Problem

Recent advancements in computer technology has allowed for the possibility to solve complex reactor problems without homogenization, but the present benchmark problems are all limited to small scale with few fuel assemblies and homogeneity at the core level. Therefore, to verify the capabilities of the advanced neutronics codes, heterogeneous full core model shall be developed. Recently several whole-core benchmark problems such as BEAVRS and VERA are developed with measured data to which computational codes can be compared. With a particular research interest on the MOX fuel, this study develops a two-dimensional (2-D) whole core MOX neutronics benchmark based on the C5G7 benchmark concept. The developed MOX core benchmark will then be used to verify the accuracy of the MOCUM code, which is developed using the method of characteristic (MOC) as the flux solver with an advanced geometry processor designed for arbitrary core geometries. MOCUM results will be compared against MCNP5 results as the reference solutions. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Spherical Kernel Density Estimators For Monte Carlo Radiation Transport Problems

Recently, there has been interest in creating alternatives to histograms (mesh tallies) for estimating spatially-distributed quantities such as scalar flux and reaction rate densities. Kernel Density Estimators (KDEs) are non-parametric estimators that obtain estimates of the underlying distribution at user-defined points without having to specify an underlying mesh, and the uncertainty at those points is independent of the number of tally points used in the simulation. This has led to the investigation of KDEs as an attractive potential alternative to histogram tallies in Monte Carlo radiation transport simulations for reactor physics problems and shielding applications. A KDE was recently created specifically for cylindrical geometries that is capable of producing smooth and accurate estimates of flux and reaction rate densities in reactor physics problems. This work extends the cylindrical KDE and cylindrical Mean Free Path (MFP) KDE to spherical geometries and verifies the spherical KDE on bare and reflected critical benchmark problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluation of Rapid for a UNF cask benchmark problem

To ensure criticality safety and maintain a high level of security of Used Nuclear Fuel (UNF), it is necessary to perform detailed Particle Transport simulations. The commonly used technique is the 3-D, continuous energy Monte Carlo method that is time-consuming and, for eigenvalue calculations, may have difficulties with the source convergence. Wenner and Haghighat and Dufek demonstrated that in criticality problems with high dominance ratio and/or under-sampling possibilities, the fission matrix (FM) methodology should be used in order to be able to obtain unbiased solution. The RAPID (Real-time Analysis for Particle transport and In-situ Detection) code system is based on the Multi-stage Response-function Transport (MRT) methodology, and uses the FM formulation to determine eigenvalue, subcritical multiplication and fission density distribution of nuclear systems. This paper uses a benchmark problem similar to the GBC-32 Cask to evaluate the accuracy and performance of RAPID against the results of a reference MCNP solution. We performed a detailed sensitivity analysis on a single-assembly model in order to determine the MCNP eigenvalue parameters necessary to obtain a reliable reference solution. These results provided a guide for the selection of an appropriate set of parameters for the eigenvalue calculation for the whole cask. The paper is organized as follows: initially, the RAPID code system is briefly discussed; then, the benchmark problem is introduced. The methodology used to analyze results is proposed and some of the results of different cases are analyzed to identify the best set of eigenvalue parameters for a reference MCNP calculation. The selected case is then compared with the RAPID calculation for both a single assembly and a full cask model. In the end some conclusions and future work perspectives are drawn.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Extending Power of Nature from Binary Problems to Real-Valued Graph Learning in Real World

Nature performs complex computations constantly at clearly lower cost and higher performance than digital computers. It is crucial to understand how to harness the unique computational power of nature in Machine Learning (ML). In the past decade, besides the development of Neural Networks (NNs), the community has also relentlessly explored nature-powered ML paradigms. Although most of them are still predominantly theoretical, a new practical paradigm enabled by the recent advent of CMOS-compatible room-temperature nature-based computers has emerged. By harnessing the nature's power of entropy increase, this paradigm can solve binary learning problems delivering immense speedup and energy savings compared with NNs, while maintaining comparable accuracy. Regrettably, its values to the real world are highly constrained by its binary nature. A clear pathway to its extension to real-valued problems remains elusive. This paper aims to unleash this pathway by proposing a novel end-to-end Nature-Powered Graph Learning (NP-GL) framework. Specifically, through a three-dimensional co-design, NP-GL can leverage the nature's power of entropy increase to efficiently solve real-valued graph learning problems. Experimental results across 4 real-world applications with 6 datasets demonstrate that NP-GL delivers, on average, 6970X speedup and 10^5x energy consumption reduction with comparable or even higher accuracy than Graph Neural Networks (GNNs).

artificial intelligence↗

A Case Study to Test Mozaik for Different Optimization Problems

We present four different shape optimization problems based on the existing beam port facility of the Penn State Breazeale Reactor and their results obtained by the modular optimization code package, MOZAIK. Each model problem has a different beam tube configuration with the same optimization goal: to determine an optimal D2O moderator tank shape for the given beam tube arrangement that maximizes the thermal neutron beam intensity at the beam tube exit end. In this study, the power of the automated search process was demonstrated and its capabilities were tested. In addition, the performance of the beam port was analyzed using alternative beam tube arrangements. All alternative arrangements indicate that higher thermal neutron beam intensity can be obtained at the beam tube exit end using a smaller volume of D2O in the system than is used in the existing beam port configuration. Moreover, the results show that MOZAIK is ready for deployment to address shape optimization problems involving radiation transport in nuclear engineering applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Levermore-Pomraning Model Results for an Interior Source Binary Stochastic Medium Benchmark Problem

The accuracy of the Levermore-Pomraning model for particle transport through a binary stochastic medium is investigated using an interior source benchmark problem. As in previous comparisons of the model for incident angular flux benchmark problems, the model accurately computes the leakage and the scalar flux distributions for optically thin slabs. The model is less accurate for more optically thick slabs but has a maximum relative error in the leakage of approximately 10% for the problems examined. The maximum root-mean-squared relative errors for the total and material scalar flux distributions approach 65% for the more optically thick slabs. Consistent with previous benchmark comparisons, the results of these interior source benchmark comparisons demonstrate that the Levermore-Pomraning model produces qualitatively correct and semi-quantitatively correct results for both leakage values and scalar flux distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Van Benthem, Mark H↗

Nonlinear eigenvalue problems in Density Functional Theory calculations

Developed in the 1960's by W. Kohn and coauthors, Density Functional Theory (DFT) is a very popular quantum model for First-Principles simulations in chemistry and material sciences. It allows calculations of systems made of hundreds of atoms. Indeed DFT reduces the 3N-dimensional Schroedinger electronic structure problem to the search for a ground state electronic density in 3D. In practice it leads to the search for N electronic wave functions solutions of an energy minimization problem in 3D, or equivalently the solution of an eigenvalue problem with a non-linear operator.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm

Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC algorithm has been found in which the fermion determinant may not necessarily factorizable, but can instead be expressed as a product of complex conjugate pairs of eigenvalues, thus eliminating the sign problem for a much wider class of models. In this paper, we present general conditions for the applicability of this algorithm and point out that it is deeply related to the time reversal symmetry of the fermion matrix. We apply this method to various models of strongly correlated systems at all doping levels and lattice geometries, and show that many novel phases can be simulated without the sign problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reputation mechanism: From resolution for truthful online auctions to the model of optimal one-gambler problem

In this paper we study reputation mechanisms, and show how the notion of reputation can help us in building truthful online auction mechanisms. From the mechanism design prospective, we derive the conditions on and design a truthful online auction mechanism. Moreover, in the case when some agents may lay or cannot have the real knowledge about the other agents reputations, we derive the resolution of the auction, such that the mechanism is truthful. Consequently, we move forward to the optimal one-gambler/one-seller problem, and explain how that problem is refinement of the previously discussed online auction design in the presence of reputation mechanism. In the setting of the optimal one-gambler problem, we naturally rise and solve the specific question: What is an agent's optimal strategy, in order to maximize his revenue? We would like to stress that our analysis goes beyond the scope, which game theory usually discusses under the notion of reputation. We model one-player games, by introducing a new parameter (reputation), which helps us in predicting the agent's behavior, in real-world situations, such as, behavior of a gambler, real-estate dealer, etc.

97 MATHEMATICS AND COMPUTING↗

A Distance Measure Comparison to Improve Crowding in Multi-Modal Problems.

Solving multi-modal optimization problems are of interest to researchers solving real world problems in areas such as control systems and power engineering tasks. Extensions of simple Genetic Algorithms, particularly types of crowding, have been developed to help solve these types of problems. This paper examines the performance of two distance measures, Mahalanobis and Euclidean, exercised in the processing of two different crowding type implementations against five minimization functions. Within the context of the experiments, empirical evidence shows that the statistical based Mahalanobis distance measure when used in Deterministic Crowding produces equivalent results to a Euclidean measure. In the case of Restricted Tournament selection, use of Mahalanobis found on average 40% more of the global optimum, maintained a 35% higher peak count and produced an average final best fitness value that is 3 times better.

97 MATHEMATICS AND COMPUTING↗

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗