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 775 records · Page 43

RELAP-7 Level 2 Milestone Report: Demonstration of a Steady State Single Phase PWR Simulation with RELAP-7

The document contains the simulation results of a steady state model PWR problem with the RELAP-7 code. The RELAP-7 code is the next generation nuclear reactor system safety analysis code being developed at Idaho National Laboratory (INL). The code is based on INL's modern scientific software development framework - MOOSE (Multi-Physics Object-Oriented Simulation Environment). This report summarizes the initial results of simulating a model steady-state single phase PWR problem using the current version of the RELAP-7 code. The major purpose of this demonstration simulation is to show that RELAP-7 code can be rapidly developed to simulate single-phase reactor problems. RELAP-7 is a new project started on October 1 st , 2011. It will become the main reactor systems simulation toolkit for RISMC (Risk Informed Safety Margin Characterization) and the next generation tool in the RELAP reactor safety/systems analysis application series (the replacement for RELAP5). The key to the success of RELAP-7 is the simultaneous advancement of physical models, numerical methods, and software design while maintaining a solid user perspective. Physical models include both PDEs (Partial Differential Equations) and ODEs (Ordinary Differential Equations) and experimental based closure models. RELAP-7 will eventually utilize well posed governing equations for multiphase flow, which can be strictly verified. Closure models used in RELAP5 and newly developed models will be reviewed and selected to reflect the progress made during the past three decades. RELAP-7 uses modern numerical methods, which allow implicit time integration, higher order schemes in both time and space, and strongly coupled multi-physics simulations. RELAP-7 is written with object oriented programming language C++. Its development follows modern software design paradigms. The code is easy to read, develop, maintain, and couple with other codes. Most importantly, the modern software design allows the RELAP-7 code to evolve with time. RELAP-7 is a MOOSE-based application. MOOSE (Multiphysics Object-Oriented Simulation Environment) is a framework for solving computational engineering problems in a well-planned, managed, and coordinated way. By leveraging millions of lines of open source software packages, such as PETSC (a nonlinear solver developed at Argonne National Laboratory) and LibMesh (a Finite Element Analysis package developed at University of Texas), MOOSE significantly reduces the expense and time required to develop new applications. Numerical integration methods and mesh management for parallel computation are provided by MOOSE. Therefore RELAP-7 code developers only need to focus on physics and user experiences. By using the MOOSE development environment, RELAP-7 code is developed by following the same modern software design paradigms used for other MOOSE development efforts. There are currently over 20 different MOOSE based applications ranging from 3-D transient neutron transport, detailed 3-D transient fuel performance analysis, to long-term material aging. Multi-physics and multiple dimensional analyses capabilities can be obtained by coupling RELAP-7 and other MOOSE based applications and by leveraging with capabilities developed by other DOE programs. This allows restricting the focus of RELAP-7 to systems analysis-type simulations and gives priority to retain and significantly extend RELAP5's capabilities.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Machine Learning for Computational Heterogeneous Catalysis

Abstract Big data and artificial intelligence has revolutionized science in almost every field – from economics to physics. In the area of materials science and computational heterogeneous catalysis, this revolution has led to the development of scientific data repositories, as well as data mining and machine learning tools to investigate the vast materials space. The goal of using these tools is to establish a deeper understanding of the relations between materials properties and activity, selectivity and stability – the important figures of merit in catalysis. Based on these insights, catalyst design principles can be established, which hopefully lead us to discover highly efficient catalysts to solve pressing issues for a sustainable future and the synthesis of highly functional materials, chemicals and pharmaceuticals. The inherent complexity of catalytic reactions quests for machine learning methods to efficiently navigate through the high‐dimensional hyper‐surfaces in structure optimization problems to determine relevant chemical structures and transition states. In this review, we show how cutting edge data infrastructures and machine learning methods are being used to address problems in computational heterogeneous catalysis.

Schlexer Lamoureux, Philomena↗

Evaluation of numerical schemes for the analysis of sound generation by blade-gust interaction

In this investigation three different numerical algorithms have been utilized to compute the flow about a flat plate in the presence of a transverse gust described by a sinusoidal disturbance. The three schemes include the MacCormack explicit finite difference scheme which is second order accurate in both time and space, the Gottlieb and Turkel modification of MacCormack's scheme which is fourth order accurate in space and second order accurate in time, (referred to as the 2-4 scheme), and a two step scheme developed by Bayliss et al. which has second order temporal accuracy and sixth order spatial accuracy (a 2-6 scheme). The flow field results are obtained with these schemes by using the same code with the only difference being the implementation of the respective solution algorithms. The problem is set up so that the sinusoidal disturbance is imposed at the surface of the flat plate as a surface boundary condition. Thus the problem is treated as scattering problem. The computed results include the time average of the acoustic pressure squared along grid lines five points away from the boundaries; distribution throughout the computational domain is monitored at various times. The numerical results are compared with an exact solution obtained by Atassi, Dusey, and Davis.

Scott, J. N.↗

Physical Principle for Generation of Randomness

A physical principle (more precisely, a principle that incorporates mathematical models used in physics) has been conceived as the basis of a method of generating randomness in Monte Carlo simulations. The principle eliminates the need for conventional random-number generators. The Monte Carlo simulation method is among the most powerful computational methods for solving high-dimensional problems in physics, chemistry, economics, and information processing. The Monte Carlo simulation method is especially effective for solving problems in which computational complexity increases exponentially with dimensionality. The main advantage of the Monte Carlo simulation method over other methods is that the demand on computational resources becomes independent of dimensionality. As augmented by the present principle, the Monte Carlo simulation method becomes an even more powerful computational method that is especially useful for solving problems associated with dynamics of fluids, planning, scheduling, and combinatorial optimization. The present principle is based on coupling of dynamical equations with the corresponding Liouville equation. The randomness is generated by non-Lipschitz instability of dynamics triggered and controlled by feedback from the Liouville equation. (In non-Lipschitz dynamics, the derivatives of solutions of the dynamical equations are not required to be bounded.)

Zak, Michail↗

Adjoint-Based Constant-Mass Partial Derivatives

It is well known that the adjoint equation in transport theory provides an economical means of computing derivatives of a system response to system parameters. It is also well known, though not often remarked on, that adjoint-based partial derivatives with respect to mass density are constant-volume derivatives. Likewise, adjoint-based partial derivatives with respect to dimensions (i.e., internal interface locations and the outer system boundary) are constant-density derivatives. In this paper, we derive a formula for the constant-mass partial derivative of a response with respect to internal interface locations and the outer system boundary. The formula uses the partial derivatives for density and dimensions, which may be adjoint-based. This paper includes numerical comparisons for a two-dimensional (r-z) cylinder that also demonstrate the correctness of the regular adjoint-based derivatives for surface locations. Adjoint-based derivatives for the neutron problems were computed using the new SENSMG code at Los Alamos National Laboratory.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The computation of all plane/surface intersections for CAD/CAM applications

The problem of the computation and display of all intersections of a given plane with a rational bicubic surface patch for use on an interactive CAD/CAM system is examined. The general problem of calculating all intersections of a plane and a surface consisting of rational bicubic patches is reduced to the case of a single generic patch by applying a rejection algorithm which excludes all patches that do not intersect the plane. For each pertinent patch the algorithm presented computed the intersection curves by locating an initial point on each curve, and computes successive points on the curve using a tolerance step equation. A single cubic equation solver is used to compute the initial curve points lying on the boundary of a surface patch, and the method of resultants as applied to curve theory is used to determine critical points which, in turn, are used to locate initial points that lie on intersection curves which are in the interior of the patch. Examples are given to illustrate the ability of this algorithm to produce all intersection curves.

Hoitsma, D. H., Jr.↗

MELCOR Computer Code Manuals Volume 3: MELCOR Assessment Problems [Draft]

MELCOR is a fully integrated, engineering-level computer code that models the progression of severe accidents in light-water reactor nuclear power plants. MELCOR is being developed at Sandia National Laboratories (SNL) for the U.S. Nuclear Regulatory Commission (NRC) as a second-generation plant risk assessment tool and the successor to the Source Term Code package. A broad spectrum of severe accident phenomena in both boiling and pressurized water reactors is treated in MELCOR in a unified framework. These include thermal-hydraulic response in the reactor coolant system (RCS), reactor cavity, containment, and confinement buildings; core heatup, degradation, and relocation; core-concrete attack; hydrogen production, transport, and combustion; and fission product release and transport behavior. Current uses of MELCOR include estimation of severe accident source terms and their sensitivities and uncertainties in a variety of applications. This publication of the MELCOR computer code manuals corresponds to MELCOR 2.0, released to users in September 2008. Volume 1 contains a primer that describes MELCOR's phenomenological scope, organization (by package), and documentation. The remainder of Volume 1 contains the MELCOR User's Guides, which provide the input instructions and guidelines for each package. Volume 2 contains the MELCOR Reference Manuals, which describe the phenomenological models that have been implemented in each package. Volume 3, MELCOR Assessment Problems, presents a portfolio of test and sample problems consisting of both analyses of experiments and of full plant problems. These analyses will be repeated with future releases of MELCOR in order to provide a metric on code predictions as new versions are released.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

FEM-BEM coupling methods for Tokamak plasma axisymmetric free-boundary equilibrium computations in unbounded domains

Incorporating boundary conditions at infinity into simulations on bounded computational domains is a repeatedly occurring problem in scientific computing. The combination of finite element methods (FEM) and boundary element methods (BEM) is the obvious instrument, and we adapt here for the first time the two standard FEM-BEM coupling approaches to the free-boundary equilibrium problem: the Johnson–Nédélec coupling and the Bielak–MacCamy coupling. We recall also the classical approach for fusion applications, dubbed according to its first appearance von-Hagenow–Lackner coupling and present the less used alternative introduced by Albanese, Blum and de Barbieri in . We show that the von-Hagenow–Lackner coupling suffers from undesirable non-optimal convergence properties, that suggest that other coupling schemes, in particular Johnson–Nédélec or Albanese–Blum–de Barbieri are more appropriate for non-linear equilibrium problems. Moreover, we show that any of such coupling methods requires Newton-like iteration schemes for solving the corresponding non-linear discrete algebraic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Digital electron diffraction – seeing the whole picture

Computer control of beam tilt and image capture allows the collection of electron diffraction patterns over a large angular range, without any overlap in diffraction data and from a region limited only by the size of the electron beam. This results in a significant improvement in data volumes and ease of interpretation. The advantages of convergent-beam electron diffraction for symmetry determination at the scale of a few nm are well known. In practice, the approach is often limited due to the restriction on the angular range of the electron beam imposed by the small Bragg angle for high-energy electron diffraction, i.e. a large convergence angle of the incident beam results in overlapping information in the diffraction pattern. Techniques have been generally available since the 1980s which overcome this restriction for individual diffracted beams, by making a compromise between illuminated area and beam convergence. Here a simple technique is described which overcomes all of these problems using computer control, giving electron diffraction data over a large angular range for many diffracted beams from the volume given by a focused electron beam (typically a few nm or less). The increase in the amount of information significantly improves the ease of interpretation and widens the applicability of the technique, particularly for thin materials or those with larger lattice parameters.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Cost-constrained adaptive simulations of transient spray combustion in a gas turbine combustor

Predictive high-fidelity simulations of turbulent spray combustion must capture the combined effects of complex chemistry, multiphase evaporating flow and spray-flame interactions to achieve physical accuracy. Finite-rate chemistry (FRC) combined with a realistic chemical mechanism is a combustion model well-suited for this purpose, but has a high computational cost due to the large number and stiffness of transported chemical species. In contrast, flamelet-based models achieve lower cost by transporting a small number of quantities of reduced stiffness, but assumptions regarding local flame topology, boundary conditions and inter-phase coupling limit their physical accuracy. Recently, the Pareto-efficient combustion (PEC) framework was developed to dynamically assign combustion models based on local cost and accuracy metrics in gas-phase reacting flows. In this work, we extend this PEC framework to spray combustion through the rigorous analysis of the multiphase coupling terms in the governing equations. The derivation shows that spray evaporation causes errors in the prediction of species mass fractions for flamelet-based models due to the sensitivity of the local thermo-chemical state to changes in composition caused by fuel vaporization across combustion regimes present in practical spray combustion devices. Sub-model assignment is formulated as a multiple-choice knapsack problem, where computational cost is directly controlled through the fraction of the domain assigned to the FRC sub-model. The extended PEC formulation is applied to the simulation of a realistic rich-quench-lean gas turbine combustor at steady-state conditions, as well as transient operation resulting in lean blow-out (LBO). Analysis of transient simulations during LBO demonstrates the extended PEC formulation’s capacity to dynamically adapt to changing conditions within the combustor. Transient combustor dynamics are shown to approach convergence with limited increases in computational cost, while retaining substantial computational cost reduction compared to monolithic FRC simulations. Through PEC simulations with increasing fractions of the domain assigned to FRC, monolithic flamelet simulations are shown to over-predict flame stability during LBO. Finally, the extended PEC formulation is thus shown to overcome deficiencies of monolithic models by controlling modeling error for multiphase combustion modeling.

33 ADVANCED PROPULSION SYSTEMS↗

Preconditioner and Convergence Study for the Quantum Computer Aided Design (QCAD) Nonlinear Poisson Problem Posed on the Ottawa Flat 270 Design Geometry

A numerical study aimed to evaluate different preconditioners within the Trilinos Ifpack and ML packages for the Quantum Computer Aided Design (QCAD) non-linear Poisson problem implemented within the Albany code base and posed on the Ottawa Flat 270 design geometry is performed. This study led to some new development of Albany that allows the user to select an ML preconditioner with Zoltan repartitioning based on nodal coordinates, which is summarized. Convergence of the numerical solutions computed within the QCAD computational suite with successive mesh refinement is examined in two metrics, the mean value of the solution (an L 1 norm) and the field integral of the solution (L 2 norm).

99 GENERAL AND MISCELLANEOUS↗

Preliminary analysis of selected gas dynamic problems

The VAST computer code was used to analyze SSME main combustion chamber start-up transients and the IUS flow field for a damaged nozzle was investigated to better understand the gas dynamic considerations involved in vehicle problems, the effect of start transients on the nozzle flow field for the SSME, and the possibility that a damaged nozzle could account for the acceleration anomaly noted on IUS burn. The results obtained were compared with a method of characteristics prediction. Pressure solutions from both codes were in very good agreement and the Mach number solution on the nozzle centerline deviates substantially for the high expansions for the SSME. Since this deviation was unexpected, the phenomenon is being further examined.

Prozan, R. J.↗

Designing a Framework for Solving Multiobjective Simulation Optimization Problems

Multiobjective simulation optimization (MOSO) problems are optimization problems with multiple conflicting objectives, where evaluation of at least one of the objectives depends on a black-box numerical code or real-world experiment, which we refer to as a simulation. Whereas an extensive body of research is dedicated to developing new algorithms and methods for solving these and related problems, it is challenging and time-consuming to integrate these techniques into real-world production-ready solvers. This is partly because of the diversity and complexity of modern state-of-the-art MOSO algorithms and methods and partly because of the complexity and specificity of many real-world problems and their corresponding computing environments. The complexity of this problem is only compounded when introducing potentially complex and/or domain-specific surrogate-modeling techniques, problem formulations, design spaces, and data acquisition functions. Here, this paper carefully surveys the current state of the art in MOSO algorithms, techniques, and solvers, as well as problem types and computational environments where MOSO is commonly applied. We then present several key challenges in the design of a parallel multiobjective simulation optimization framework (ParMOO) and how they have been addressed. Finally, we provide two case studies demonstrating how customized ParMOO solvers can be quickly built and deployed to solve real-world MOSO problems.

engineering design optimization↗

An oscillation free shock-capturing method for compressible van der Waals supercritical fluid flows

Numerical solutions of the Euler equations using real gas equations of state (EOS) often exhibit serious inaccuracies. The focus here is the van der Waals EOS and its variants (often used in supercritical fluid computations). The problems are not related to a lack of convexity of the EOS since the EOS are considered in their domain of convexity at any mesh point and at any time. The difficulties appear as soon as a density discontinuity is present with the rest of the fluid in mechanical equilibrium and typically result in spurious pressure and velocity oscillations. This is reminiscent of well-known pressure oscillations occurring with ideal gas mixtures when a mass fraction discontinuity is present, which can be interpreted as a discontinuity in the EOS parameters. We are concerned with pressure oscillations that appear just for a single fluid each time a density discontinuity is present. As a result, the combination of density in a nonlinear fashion in the EOS with diffusion by the numerical method results in violation of mechanical equilibrium conditions which are not easy to eliminate, even under grid refinement.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reverse Computation for Rollback-based Fault Tolerance in Large Parallel Systems

Reverse computation is presented here as an important future direction in addressing the challenge of fault tolerant execution on very large cluster platforms for parallel computing. As the scale of parallel jobs increases, traditional checkpointing approaches suffer scalability problems ranging from computational slowdowns to high congestion at the persistent stores for checkpoints. Reverse computation can overcome such problems and is also better suited for parallel computing on newer architectures with smaller, cheaper or energy-efficient memories and file systems. Initial evidence for the feasibility of reverse computation in large systems is presented with detailed performance data from a particle simulation scaling to 65,536 processor cores and 950 accelerators (GPUs). Reverse computation is observed to deliver very large gains relative to checkpointing schemes when nodes rely on their host processors/memory to tolerate faults at their accelerators. A comparison between reverse computation and checkpointing with measurements such as cache miss ratios, TLB misses and memory usage indicates that reverse computation is hard to ignore as a future alternative to be pursued in emerging architectures.

Perumalla, Kalyan S↗

Simultaneous analysis and design

Optimization techniques are increasingly being used for performing nonlinear structural analysis. The development of element by element (EBE) preconditioned conjugate gradient (CG) techniques is expected to extend this trend to linear analysis. Under these circumstances the structural design problem can be viewed as a nested optimization problem. There are computational benefits to treating this nested problem as a large single optimization problem. The response variables (such as displacements) and the structural parameters are all treated as design variables in a unified formulation which performs simultaneously the design and analysis. Two examples are used for demonstration. A seventy-two bar truss is optimized subject to linear stress constraints and a wing box structure is optimized subject to nonlinear collapse constraints. Both examples show substantial computational savings with the unified approach as compared to the traditional nested approach.

Haftka, R. T.↗

Simultaneous analysis and design

Optimization techniques are increasingly being used for performing nonlinear structural analysis. The development of element by element (EBE) preconditioned conjugate gradient (CG) techniques is expected to extend this trend to linear analysis. Under these circumstances the structural design problem can be viewed as a nested optimization problem. There are computational benefits to treating this nested problem as a large single optimization problem. The response variables (such as displacements) and the structural parameters are all treated as design variables in a unified formulation which performs simultaneously the design and analysis. Two examples are used for demonstration. A seventy-two bar truss is optimized subject to linear stress constraints and a wing box structure is optimized subject to nonlinear collapse constraints. Both examples show substantial computational savings with the unified approach as compared to the traditional nested approach.

Haftka, R. T.↗

Biased Randomized Algorithm for Fast Model-Based Diagnosis

A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the minimal diagnosis. In contrast, the present approach is incomplete and fast and yields an upper bound on the size of the minimal diagnosis.

Williams, Colin↗