Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “High-Order methods”

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.

821 records · Page 46

CosmosDG: An hp -adaptive Discontinuous Galerkin Code for Hyper-resolved Relativistic MHD

We have extended Cosmos++, a multidimensional unstructured adaptive mesh code for solving the covariant Newtonian and general relativistic radiation magnetohydrodynamic (MHD) equations, to accommodate both discrete finite volume and arbitrarily high-order finite element structures. The new finite element implementation, called CosmosDG, is based on a discontinuous Galerkin (DG) formulation, using both entropy-based artificial viscosity and slope limiting procedures for the regularization of shocks. High-order multistage forward Euler and strong-stability preserving Runge–Kutta time integration options complement high-order spatial discretization. We have also added flexibility in the code infrastructure allowing for both adaptive mesh and adaptive basis order refinement to be performed separately or simultaneously in a local (cell-by-cell) manner. We discuss in this report the DG formulation and present tests demonstrating the robustness, accuracy, and convergence of our numerical methods applied to special and general relativistic MHD, although we note that an equivalent capability currently also exists in CosmosDG for Newtonian systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗

Diffusion Synthetic Acceleration for High-Order Discontinuous Finite Element SN Transport Schemes and Application to Locally Refined Unstructured Meshes

Diffusion synthetic acceleration (DSA) schemes compatible with adaptive mesh refinement (AMR) grids are derived for the SN transport equations discretized using high-order discontinuous finite elements. These schemes are directly obtained from the discretized transport equations by assuming a linear dependence in angle of the angular flux along with an exact Fick's law and, therefore, are categorized as partially consistent. These schemes are akin to the symmetric interior penalty technique applied to elliptic problems and are all based on a second-order discontinuous finite element discretization of a diffusion equation (as opposed to a mixed or P1 formulation). Therefore, they only have the scalar flux as unknowns. A Fourier analysis has been carried out to determine the convergence properties of the three proposed DSA schemes for various cell optical thicknesses and aspect ratios. Out of the three DSA schemes derived, the modified interior penalty (MIP) scheme is stable and effective for realistic problems, even with distorted elements, but loses effectiveness for some highly heterogeneous configurations. The MIP scheme is also symmetric positive definite and can be solved efficiently with a preconditioned conjugate gradient method. Its implementation in an AMR SN transport code has been performed for both source iteration and GMRes-based transport solves, with polynomial orders up to 4. Numerical results are provided and show good agreement with the Fourier analysis results. Results on AMR grids demonstrate that the cost of DSA can be kept low on locally refined meshes.

42 ENGINEERING↗

Homogenization for Periodic Heterogeneous Materials with Arbitrary Position-Dependent Material Properties

We present a rigorous homogenization approach for efficient computation of a class of physical problems in a one-dimensional periodic heterogeneous material. This material is represented by a spatially periodic array of unit cells with a length of e. More specifically, the method is applied to the diffusion, heat conduction, and wave propagation problems. Heterogeneous materials can have arbitrary position-dependent continuous or discontinuous materials properties (for example heat conductivity) within the unit cell. The final effective model includes both effective properties at the leading order and high-order contributions due to the microscopic heterogeneity. A dimensionless heterogeneity parameter ß is defined to represent high-order contributions, shown to be in the range of [-1/12, 0], and has a universal expression for all three problems. Both effective properties and heterogeneity parameter ß are independent of e, the microscopic scale of heterogeneity. The homogenized solution describing macroscopic variations can be obtained from the effective model. Solution with sub-unit-cell accuracy can be constructed based on the homogenized solution and its spatial derivatives. The paper represents a general approach to obtain the effective model for arbitrary periodic heterogeneous materials with position-dependent properties.

conduction↗

EFFECT OF DISCRETIZATION ERROR ON THE QUANTIFICATION OF MODEL UNCERTAINTY IN TWO-PHASE FLOW SIMULATIONS

Verification, validation and uncertainty quantification (VVUQ) have become a common practice in thermal-hydraulics analysis. In general, these activities deal with propagations of uncertainties in computer code simulations, e.g., through system analysis codes. However, most existing such activities in thermal-hydraulics analysis have been primarily focused on input and model uncertainties, while numerical errors were largely overlooked. Numerical errors can appear in many different forms, e.g., round-off error, statistical sampling error, and discretization error. In thermal-hydraulics analysis, especially two-phase flow simulations commonly encountered in reactor safety analysis, the lack of consideration of discretization error is mainly due to the difficulty in estimating them. Accurate estimations of discretization error require continuous mesh refinement and/or implementation of high-order numerical schemes in system analysis code, both of which are difficult to achieve in existing codes. In this work, we will build a computer code that incorporates both first-order and second-order numerical methods to solve the two-phase flow problems. The first-order method resembles the one used in many existing system analysis codes; and the second-order method works as the reference to estimate numerical errors. Numerical verification of spatial discretization schemes will be presented in the form of mesh convergence study. It will also be demonstrated via case studies that, in practical scenarios, discretization errors can be as large as, or even larger than, model uncertainties.

42 ENGINEERING↗

A High-Order Nonlinear Diffusion Acceleration for the SN Equations Discretized with the Discontinuous FEM II: Fourier Analysis

In this paper, a Fourier Analysis (FA) of a new high order Nonlinear Diffusion Acceleration Method (NDA) for the $S_N$ equations discretized with the Discontinuous Finite Element Method (DFEM) is presented. In contrast to coarse mesh finite difference methods (CMFD), the associated diffusion system is discretized using DFEM with a function space identical to the $S_N$ equations. The utilized $S_N$ solver is the latest addition to the Rattlesnake\cite{Wang2013} radiation transport code that is based on the MOOSE\cite{Gaston2009} framework.

97 MATHEMATICS AND COMPUTING↗

An angularly refineable phase space finite element method with approximate sweeping procedure

An angularly refineable phase space finite element method is proposed to solve the neutron transport equation. The method combines the advantages of two recently published schemes. The angular domain is discretized into small patches and patch-wise discontinuous angular basis functions are restricted to these patches, i.e. there is no overlap between basis functions corresponding to different patches. This approach yields block diagonal Jacobians with small block size and retains the possibility for S{sub n}-like approximate sweeping of the spatially discontinuous elements in order to provide efficient preconditioners for the solution procedure. On the other hand, the preservation of the full FEM framework (as opposed to collocation into a high-order S{sub n} scheme) retains the possibility of the Galerkin interpolated connection between phase space elements at arbitrary levels of discretization. Since the basis vectors are not orthonormal, a generalization of the Riemann procedure is introduced to separate the incoming and outgoing contributions in case of unstructured meshes. However, due to the properties of the angular discretization, the Riemann procedure can be avoided at a large fraction of the faces and this fraction rapidly increases as the level of refinement increases, contributing to the computational efficiency. In this paper the properties of the discretization scheme are studied with uniform refinement using an iterative solver based on the S{sub 2} sweep order of the spatial elements. The fourth order convergence of the scalar flux is shown as anticipated from earlier schemes and the rapidly decreasing fraction of required Riemann faces is illustrated. (authors)

97 MATHEMATICS AND COMPUTING↗

A new, coupled transport-diffusion method for radiative transfer calculations

We derive and present a new frequency- and angle-integrated low-order system of equations designed to enhance the accuracy of a coupled, high-order (transport) solution of the thermal radiative transfer equations. In particular, our new low-order system is designed to use intensity-weighted opacities and anisotropic diffusion coefficients generated by a solution of the Implicit Monte Carlo (IMC) equations in order to predict the spatial dependence of the material temperature and radiation energies in the ensuing time cycle. The predicted temperature solution can then be exploited to generate appropriately time-centered opacities, specific heats, and Planck emission spectra for the upcoming IMC solution. Additionally, the relatively inexpensive solution of the low-order system can be iteratively solved to recommend an adaptive time step size before the IMC solution is computed. A test implementation has been implemented using existing software available from the Jayenne and Capsaicin projects at Los Alamos National Laboratory. We present initial results from a new driver code that has integrated these stochastic and deterministic software packages. (authors)

97 MATHEMATICS AND COMPUTING↗

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗

Numerical Uncertainties vs. Model Uncertainties in Two-phase Flow Simulations

In recent years, verification, validation and uncertainty quantification (VVUQ) have become a common practice in thermal-hydraulics analysis. In general, these activities deal with propagations of uncertainties in computer code simulations, e.g., through system analysis codes. However, most existing such activities in thermal-hydraulics analysis have been primarily focused on model uncertainties, while numerical uncertainties were largely overlooked. Numerical uncertainties (or numerical errors) can appear in many different forms, e.g., round-off error, statistical sampling error, and discretization error. As pointed out by Oberkampf and Roy, discretization error is usually the largest however the most difficult type of error to estimate reliably. In thermal-hydraulics analysis, especially two-phase flow simulations commonly encountered in reactor safety analysis, the lack of consideration on discretization error is mainly due to the difficulty in estimating them. Accurate estimations on discretization error require continuous mesh refinement and/or implementation of high-order numerical schemes in system analysis code, both of which are unfortunately difficult to achieve for existing codes. At first, it should be emphasized that mesh refinement (or mesh sensitivity study) is a well-understood concept in the thermal-hydraulics field. However, it is not commonly practiced for many reasons, e.g., lack of understanding on numerical errors by code users, consideration on computational cost, deteriorated numerical stability performance with refined meshes, and etc. Secondly, high-order (e.g., second-order) numerical schemes are simply unavailable in almost any existing system analysis code. Implementation of high-order numerical schemes in these codes is difficult, if not impossible, given the complexity of these codes. On the other hand, people tend to argue that numerical uncertainties (or discretization error as we have emphasized) are not as important as the commonly large uncertainties in two-phase flow models, e.g., closure correlations. As a result, nodalization is sometimes played unintentionally, or maybe intentionally, to match experimental data, which is referred as 'user effects' or 'compensating errors' in thermal-hydraulics community. Such a practice is highly criticized by Levy. In this work, we will at first build a computer code that incorporates both first-order and second-order numerical methods to solve the two-phase flow problems. The first-order method resembles the one used in many existing system analysis codes; and the second-order method works as the reference to estimate numerical errors. Numerical verifications on spatial discretization schemes will be presented in the form of mesh convergence study. It will also be demonstrated that, in practical scenarios, discretization errors can be as large as, or even larger than, model uncertainties via case studies.

42 ENGINEERING↗

High-order diamond differencing schemes for the Boltzmann Fokker-Planck equation in 3D Cartesian geometries

The Boltzmann Fokker-Planck, an approximate form of the linear Boltzmann equation is commonly used to treat efficiently the transport of charged particles in matter. This paper introduces the application of high-order diamond differencing schemes (HODD), specifically the DD1 and DD2 schemes which are 4- and 6-order accurate respectively, to handle the spatial discretization of that equation in 3D Cartesian geometries. The energy deposition solutions for the coupled transport of electrons and photons presented in this work shows that HODD, compared to classical DD scheme, provides correction to the oscillations and a reduced propensity to yield negative fluxes. They are useful tools to minimize local error, notably in regions with abrupt variations of the flux solution. They also can be used to reduced execution time by decreasing the needed number of voxels to obtain a fixed accuracy. On the tested benchmarks, the DD1 scheme is 87%- 92%-91% more accurate than the classical DD scheme for total, mean per-voxels and maximum deviation of energy deposition values respectively. For comparison, a calculation with 8 times more voxels, requiring roughly 2.5 times more time to execute, is 92%-90%-77% more accurate. (authors)

97 MATHEMATICS AND COMPUTING↗