Search NASA⌕ Search

SEARCH · Search NASA

Results for “Robust solver”

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 289 records · Page 16

Self-consistent solution of cosmological radiation-hydrodynamics and chemical ionization

We consider a PDE system comprising compressible hydrodynamics, flux-limited diffusion radiation transport and chemical ionization kinetics in a cosmologically-expanding universe. Under an operator-split framework, the cosmological hydrodynamics equations are solved through the piecewise parabolic method, as implemented in the Enzo community hydrodynamics code. The remainder of the model, including radiation transport, chemical ionization kinetics, and gas energy feedback, form a stiff coupled PDE system, which we solve using a fully-implicit inexact Newton approach, and which forms the crux of this paper. The inner linear Newton systems are solved using a Schur complement formulation, and employ a multigrid-preconditioned conjugate gradient solver for the inner Schur systems. We describe this approach and provide results on a suite of test problems, demonstrating its accuracy, robustness, and scalability to very large problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient mixed-precision, hybrid CPU-GPU implementation of a nonlinearly implicit one-dimensional particle-in-cell algorithm

Recently, a fully implicit, energy- and charge-conserving particle-in-cell method has been developed for multi-scale, full-f kinetic simulations [G. Chen, et al., J. Comput. Phys. 230, 18 (2011)]. The method employs a Jacobian-free Newton-Krylov (JFNK) solver and is capable of using very large timesteps without loss of numerical stability or accuracy. A fundamental feature of the method is the segregation of particle orbit integrations from the field solver, while remaining fully self-consistent. This provides great flexibility, and dramatically improves the solver efficiency by reducing the degrees of freedom of the associated nonlinear system. However, it requires a particle push per nonlinear residual evaluation, which makes the particle push the most time-consuming operation in the algorithm. This paper describes a very efficient mixed-precision, hybrid CPU-GPU implementation of the implicit PIC algorithm. The JFNK solver is kept on the CPU (in double precision), while the inherent data parallelism of the particle mover is exploited by implementing it in single-precision on a graphics processing unit (GPU) using CUDA. Performance-oriented optimizations, with the aid of an analytical performance model, the roofline model, are employed. Despite being highly dynamic, the adaptive, charge-conserving particle mover algorithm achieves up to 300 400 GOp/s (including single-precision floating-point, integer, and logic operations) on a Nvidia GeForce GTX580, corresponding to 20 25% absolute GPU efficiency (against the peak theoretical performance) and 50-70% intrinsic efficiency (against the algorithm s maximum operational throughput, which neglects all latencies). This is about 200-300 times faster than an equivalent serial CPU implementation. When the single-precision GPU particle mover is combined with a double-precision CPU JFNK field solver, overall performance gains 100 vs. the double-precision CPU-only serial version are obtained, with no apparent loss of robustness or accuracy when applied to a challenging long-time scale ion acoustic wave simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A robust and efficient generalized real cascade model

This paper describes a new separation cascade model that allows for arbitrary cascade connectivity and includes the effects of mixing, material losses and generalized separation element performance. The model also accommodates mixtures with an arbitrary number of component species. The mathematical and numerical framework of this model includes both time-dependent and steady state cascade simulation. Robust numerical approximations of the continuous mathematical model are accomplished using the Sundials suite of nonlinear algebraic and differential-algebraic equation solvers. Verification of the model is accomplished using manufactured solutions while validation is demonstrated by comparison to published experimental results and benchmarks.

36 MATERIALS SCIENCE↗

A new Lagrangian method for three-dimensional steady supersonic flows

In this report, the new Lagrangian method introduced by Loh and Hui is extended for three-dimensional, steady supersonic flow computation. The derivation of the conservation form and the solution of the local Riemann solver using the Godunov and the high-resolution TVD (total variation diminished) scheme is presented. This new approach is accurate and robust, capable of handling complicated geometry and interactions between discontinuous waves. Test problems show that the extended Lagrangian method retains all the advantages of the two-dimensional method (e.g., crisp resolution of a slip-surface (contact discontinuity) and automatic grid generation). In this report, we also suggest a novel three dimensional Riemann problem in which interesting and intricate flow features are present.

Loh, Ching-Yuen↗

An unstructured-grid software system for solving complex aerodynamic problems

A coordinated effort has been underway over the past four years to elevate unstructured-grid methodology to a mature level. The goal of this endeavor is to provide a validated capability to non-expert users for performing rapid aerodynamic analysis and design of complex configurations. The Euler component of the system is well developed, and is impacting a broad spectrum of engineering needs with capabilities such as rapid grid generation and inviscid flow analysis, inverse design, interactive boundary layers, and propulsion effects. Progress is also being made in the more tenuous Navier-Stokes component of the system. A robust grid generator is under development for constructing quality thin-layer tetrahedral grids, along with a companion Navier-Stokes flow solver. This paper presents an overview of this effort, along with a perspective on the present and future status of the methodology.

Frink, Neal T.↗

Coupling of the FUN3D Unstructured Flow Solver and the LASTRAC Stability Code to Model Transition

We develop an iterative automated method to predict transition locations in boundary-layer flows by using the FUN3D solver to perform flow simulations and the LASTRAC code for linear stability computations. The coupling of FUN3D and LASTRAC allows for a robust physics-based approach to model boundary-layer transition by analyzing the growth of different instability waves and then using that information to iteratively update the resulting transition location. There is no user involvement during the iterative computations. We apply this automated method to subsonic flow over a flat plate with a sharp leading edge. The final solution has regions of laminar and turbulent flow with a transition onset location that agrees with experiments and stability-based correlations. This iterative automated method is also applied to an NLF(1)-0416 airfoil for conditions with and without a separation bubble. Along with predicting transition locations, we compare the streamwise distributions of surface-pressure and skin-friction coefficients to a transport-equation-based model. We consider a 6:1 prolate spheroid at three angles of attack, namely, five, ten, and fifteen degrees, where mixed-mode transition occurs due to both Tollmien-Schlichting and crossflow instabilities. The skin-friction contours and transition fronts at every angle of attack from our iterative automated method show good agreement with past experimental and computational results in the literature for the 6:1 prolate spheroid.

Transition↗

Verification of High-Fidelity Neutronics Code PROTEUS for C5G7 Benchmark Problems

Under the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the 3D whole core transport code PROTEUS has been developed at Argonne National Laboratory to perform the detailed 3D transport calculation for various reactor types including irregular or complex geometric reactors. PROTEUS includes two distinct transport solvers: SN and MOC. Among them, the MOC solver based on the extruded geometry, thus named MOCEX, can produce the faithful 3-D transport solutions by employing the rigorous and robust 2D/3D MOC formulation. This formulation overcomes the drawbacks of a full 3D MOC method requiring enormous memory and computational resources and resolves the instability issues of the 2D/1D method as well. The solution of MOCEX converges to that of a Monte Carlo code as the discretization of angle, space and energy is refined, unlike the 2D/1D method. As a verification and validation (V and V) effort of PROTEUS-MOCEX, this paper presents verification test results using the well-known 3D C5G7 benchmark problems by solving and comparing eigenvalues and pin powers with MCNP solutions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Reducing spurious mesh motion in Lagrangian finite volume and discontinuous Galerkin hydrodynamic methods

The Lagrangian finite volume (FV) cell-centered hydrodynamic (CCH) method and the Lagrangian discontinuous Galerkin (DG) CCH method have been demonstrated to be quite stable and capable of producing very accurate solutions on many mesh topologies. However, some challenges can arise with higher-order elements and polygonal elements that have many deformational degrees of freedom. With these types of meshes, elements can deform in unphysical ways and the mesh can tangle. In this study, we present methods for obtaining more robust Lagrangian solutions on polygonal and higher-order elements. The robustness is achieved by (1) incorporating a new iterative method that modifies the velocity reconstructions in the corners of the elements, and (2) a new multidirectional approximate Riemann solver that, when coupled with the iterative method, reduces spurious mesh motion. Lastly, the details of the numerical methods are discussed and their utility is demonstrated on a diverse suite of test problems using higher-order and polygonal elements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗

High Fidelity BWR Fuel Simulations

This report describes the Consortium for Advanced Simulation of Light Water Reactors (CASL) work conducted for completion of the Thermal Hydraulics Methods (THM) Level 3 milestone THM.CFD.P13.03: High Fidelity BWR Fuel Simulation. High fidelity computational fluid dynamics (CFD) simulation for Boiling Water Reactor (BWR) was conducted to investigate the applicability and robustness performance of BWR closures. As a preliminary study, a CFD model with simplified Ferrule spacer grid geometry of NUPEC BWR Full-size Fine-mesh Bundle Test (BFBT) benchmark has been implemented. Performance of multiphase segregated solver with baseline boiling closures has been evaluated. Although the mean values of void fraction and exit quality of CFD result for BFBT case 4101-61 agreed with experimental data, the local void distribution was not predicted accurately. The mesh quality was one of the critical factors to obtain converged result. The stability and robustness of the simulation was mainly affected by the mesh quality, combination of BWR closure models. In addition, the CFD modeling of fully-detailed spacer grid geometry with mixing vane is necessary for improving the accuracy of CFD simulation.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Some Approaches Towards Constructing Optimally Efficient Multigrid Solvers for the Inviscid Flow Equations

Some important advances took place during the last several years in the development of genuinely multidimensional upwind schemes for the compressible Euler equations. In particular, a robust, high-resolution genuinely multidimensional scheme which can be used for any of the flow regimes computations was constructed. This paper summarizes briefly these developments and outlines the fundamental advantages of this approach.

Sidilkover, David↗

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗

Fast and accurate implementation of Fourier spectral approximations of nonlocal diffusion operators and its applications

This work is concerned with the Fourier spectral approximation of various integral differential equations associated with some linear nonlocal diffusion and peridynamic operators under periodic boundary conditions. For radially symmetric kernels, the nonlocal operators under consideration are diagonalizable in the Fourier space so that the main computational challenge is on the accurate and fast evaluation of their eigenvalues or Fourier symbols consisting of possibly singular and highly oscillatory integrals. For a large class of fractional power-like kernels, we propose a new approach based on reformulating the Fourier symbols both as coefficients of a series expansion and solutions of some simple ODE models. We then propose a hybrid algorithm that utilizes both truncated series expansions and high order Runge–Kutta ODE solvers to provide fast evaluation of Fourier symbols in both one and higher dimensional spaces. It is shown that this hybrid algorithm is robust, efficient and accurate. As applications, we combine this hybrid spectral discretization in the spatial variables and the fourth-order exponential time differencing Runge–Kutta for temporal discretization to offer high order approximations of some nonlocal gradient dynamics including nonlocal Allen–Cahn equations, nonlocal Cahn–Hilliard equations, and nonlocal phase-field crystal models. Numerical results show the accuracy and effectiveness of the fully discrete scheme and illustrate some interesting phenomena associated with the nonlocal models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗

Sierra/Solid Mechanics 4.48 User's Guide

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes. This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗

Sierra/SolidMechanics 4.46 User's Guide

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes. This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗

Sierra/SolidMechanics 4.50 User's Guide

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes. This document describes the functionality and input syntax for Sierra/SM.

42 ENGINEERING↗

Sierra/SolidMechanics 4.52 User's Guide

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes. This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗