Augmented Quadratures for the Discrete Ordinates Method Using Reduced Order Modeling Approaches.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Paper led by Kapil Khanal (summer intern) to be presented at the UMERC+METS conference. This paper shows the ability to differentiate our BEM code.
The study discusses high-order finite-volume numerical modeling of drift waves, which is an ubiquitous phenomenon in magnetized plasmas. It is found that some standard discretization methods applied to the conservative form of the governing equations can lead to a numerical instability. A method to stabilize high-order discretization is proposed and demonstrated to work in numerical simulations performed with the fourth-order finite-volume code COGENT. As practical examples, a stable drift-wave solution with adiabatic electrons and the collisionless (universal) drift-wave instability driven by electron kinetic effects are considered. Finally, application of the present analysis to a broader range of computational fluid dynamics systems is discussed.
The discrete generalized multigroup (DGM) method provides a way to treat the energy dependence of neutron transport similarly to the standard multigroup approximation. However, DGM uses an orthogonal basis to retain the energy dependence in higher-order terms. Using correction factors similar to traditional Superhomogénéisation (SPH) factors, the DGM method may be extended to produce cross sections that are homogenized over both space and energy. Additionally, since some fine-group energy dependence is retained, the resulting homogenized cross sections are more problem-independent than cross sections homogenized by SPH factors alone. In particular, a 44-group set of cross sections is collapsed to approximately a 1% error in the pincell fission densities for a test problem using three DOF per coarse energy group.
Explore the source record for details and available documents.
In the recent years, there has been a tremendous interest to numerical methods that approximate partial differential equations (PDEs) on computational meshes with arbitrarily-shaped polygonal/polyhedral (polytopal, for short) elements. A nonexhaustive list of such methods include the Mimetic Finite Difference method [4, 9, 21, 24, 28, 33, 35, 62, 64–67], the Polygonal Finite Element Method [68, 73, 74], the polygonal Discontinuous Galerkin Finite Element Methods [5, 7, 8, 10, 13–15, 18, 36, 38, 39, 41, 50], the Hybridizable Discontinuous Galerkin and Hybrid High-Order Methods [46–48, 51], the Gradient Discretization method [49, 53, 54], the Finite Volume Method [52], and the BEM-based FEM [71]. An alternative approach that also proved to be very successful is provided by the Virtual Element method (VEM), which was originally proposed in [19] for the numerical treatment of second-order elliptic problems [43, 44], and readily extended to linear and nonlinear elasticity [22, 25, 56], plate bending problems [37], Cahn-Hilliard equation [3], Stokes equations [2], Laplace-Beltrami equation [55], Darcy-Brinkam equation [76], discrete topology optimization problems [6], fracture networks problems [29], eigenvalue problems [59, 75]. The mixed virtual element formulation was proposed in [20, 34]; the nonconforming Virtual element formulations was proposed for second-order elliptic problems in [16], and later extended to general advection-reaction-diffusion problems, Stokes equation, the biharmonic problems, the iegenvalue problem, and the Schrodinger equation in [11, 30, 42, 45, 58, 80]. The p- and hp-version of the VEM were developed in [26, 27] and efficient multigrid methods for the resulting linear system of equations in [12]. A posteriori error estimates can be found in [40].
Abstract. Selecting a wind farm layout optimization method is difficult. Comparisons between optimization methods in different papers can be uncertain due to the difficulty of exactly reproducing the objective function. Comparisons by just a few authors in one paper can be uncertain if the authors do not have experience using each algorithm. In this work we provide an algorithm comparison for a wind farm layout optimization case study between eight optimization methods applied, or directed, by researchers who developed those algorithms or who had other experience using them. We provided the objective function to each researcher to avoid ambiguity about relative performance due to a difference in objective function. While these comparisons are not perfect, we try to treat each algorithm more fairly by having researchers with experience using each algorithm apply each algorithm and by having a common objective function provided for analysis. The case study is from the International Energy Association (IEA) Wind Task 37, based on the Borssele III and IV wind farms with 81 turbines. Of particular interest in this case study is the presence of disconnected boundary regions and concave boundary features. The optimization methods studied represent a wide range of approaches, including gradient-free, gradient-based, and hybrid methods; discrete and continuous problem formulations; single-run and multi-start approaches; and mathematical and heuristic algorithms. We provide descriptions and references (where applicable) for each optimization method, as well as lists of pros and cons, to help readers determine an appropriate method for their use case. All the optimization methods perform similarly, with optimized wake loss values between 15.48 % and 15.70 % as compared to 17.28 % for the unoptimized provided layout. Each of the layouts found were different, but all layouts exhibited similar characteristics. Strong similarities across all the layouts include tightly packing wind turbines along the outer borders, loosely spacing turbines in the internal regions, and allocating similar numbers of turbines to each discrete boundary region. The best layout by annual energy production (AEP) was found using a new sequential allocation method, discrete exploration-based optimization (DEBO). Based on the results in this study, it appears that using an optimization algorithm can significantly improve wind farm performance, but there are many optimization methods that can perform well on the wind farm layout optimization problem, given that they are applied correctly.
This paper describes a new discrete method for inverting X-ray pole figures to estimate the orientation distribution function (ODF). The method employs the equal-volume `cubochoric' representation for uniform discretization of orientation space, SO(3). The forward-projection model is combined with an anisotropic total variation term to iteratively determine the ODF. Here, the efficacy of the new method is evaluated with both model and experimental data and compared with existing discrete and series expansion methods.
The Discrete Generalized Multigroup (DGM) method uses discrete Legendre orthogonal polynomials to expand the energy dependence of the multigroup neutron transport equation. This allows a solution on a fine energy mesh to be approximated for a cost comparable to a solution on a coarse energy mesh. The DGM method is applied to an ultra-fine energy mesh (14,767 groups) to avoid using self-shielding methodologies without introducing the cost usually associated with such energy discretization. Results show DGM to converge to the reference ultra-fine solution after a small number of recondensation steps for multiple infinite medium compositions. (authors)
Here we briefly outline main results of the Wave-Packet Continuum Discretization method. The formalism uses the complete continuum discretization scheme in terms of the momentum stationary wave-packet basis, which leads to formulation of the scattering problem on a lattice in the momentum space.
The work investigates the applicability of the unresolved Computational Fluid Dynamics and Discrete Element Method (CFDDEM) technique based on empirical equations for fluid-particle coupling. We first carry out a series of representative volume element simulations using the high-resolution particle-resolved Lattice Boltzmann method and Discrete Element Method (LBMDEM) coupled by an Immersed Moving Boundary (IMB) scheme. Then, we compare the results obtained by both LBMDEM and empirical equations used in unresolved CFDDEM with analytical solutions. It is found that the existing empirical equations used in solving fluid-particle interactions in 2D CFDDEM fail to accurately calculate the hydrodynamic force applied to solid particles. The underlying reason is that the existing empirical models are obtained based on 3D experimental results and thus are not applicable to 2D problems. Based on the simulation results, a new drag coefficient model is then proposed. The estimated drag forces using the new model are compared favourably with the simulated ones, indicating the good performance of the proposed model.
A Galerkin weak form for the monoenergetic neutron transport equation with a continuous finite element method and discrete ordinate method is developed based on self-adjoint angular flux formulation. This weak form is modified for treating void regions. A consistent diffusion scheme is developed with projection. Correction terms of the diffusion scheme are derived to reproduce the transport scalar flux. A source iteration that decouples the solution of all directions with both linear and nonlinear diffusion accelerations is developed and demonstrated. One-dimensional Fourier analysis is conducted to demonstrate the stability of the linear and nonlinear diffusion accelerations. Numerical results of these schemes are presented.
The consequence of earthquake is usually catastrophic. Currently, we cannot determine when a fault is approaching failure due to either anthropogenic activities or tectonic movement. In an anthropogenically perturbed setting, the rate of physical changes on faults far exceeds most natural processes with currently unpredictable and unmeasurable results. In a tectonic setting we generally do not know where a fault is in the earthquake cycle beyond noting how long has passed since the last rupture, which is itself sometimes unknown. The Laboratory has therefore funded a multi million multi-year LDRD-DR program that comprises experiments, numerical modeling, and machine learning in order to develop and test a highly novel approach to probe the earthquake cycle and in particular, to detect and locate stressed faults that are approaching failure. For this program, modeling of a series of sheared granular layers undergoing stick-slip behavior using the EES-17’s Combined Finite-Discrete Element Method (FDEM) based code HOSS (Hybrid Optimization Software Suite) plays a pivotal role since numerical simulations of granular fault gouge allow for analysis of the mechanical behavior of the system at a level of spatial and temporal resolution not accessible experimentally, and also offer the possibility of identifying the most important parameters governing earthquake dynamics. The simulated data also provide very detailed stress, strain and motion information for machine learning purpose to predict earthquake. The code – HOSS – has been developed in Geophysics Group in LANL during the past ten years and is used to simulate the stick-slip behavior of granular fault gouge. One of the key feature of HOSS is that it is superior to pure finite element method and discrete element method and can provide very detailed evolvement information of granular fault gouge. Additionally, its parallel computing capability makes large scale earthquake gouge simulation possible. Taking these facts into account, and also because few other fully parallel FDEM code exists, this IC project allows LANL to stay at the forefront of earthquake gouge and granular material simulation in the world.
Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.
Immersed methods discretize boundary conditions for complex geometries on background Cartesian grids. Here, this makes such methods especially suitable for two-way coupled flow-body problems, where the body mechanics are partially driven by hydrodynamic forces. However, for the vorticity-velocity form of the Navier-Stokes equations, existing immersed geometry discretizations for two-way coupled problems only achieve first order spatial accuracy near solid boundaries. Here we introduce a sharp-interface approach based on the immersed interface method to handle the one- and two-way coupling between an incompressible flow and one or more rigid bodies using the 2D vorticity-velocity Navier-Stokes equations. Our main contributions are three-fold. First, we develop and analyze a moving boundary treatment for sharp immersed methods that can be applied to PDEs with implicitly defined boundary conditions, such as those commonly imposed on the vorticity field. Second, we develop a two-way coupling methodology for the vorticity-velocity Navier-Stokes equations based on control-volume momentum balance that does not require the pressure field. Third, we show through extensive testing and validation that our resulting flow-body solver reaches second-order accuracy for most practical scenarios, and provides significant efficiency benefits compared to a representative first-order approach.
Mimetic methods discretize divergence by restricting the Gauss theorem to mesh cells. Because point clouds lack such geometric entities, construction of a compatible meshfree divergence remains a challenge. In this work, we define an abstract Meshfree Mimetic Divergence (MMD) operator on point clouds by contraction of field and virtual face moments. This MMD satisfies a discrete divergence theorem, provides a discrete local conservation principle, and is first-order accurate. We consider two MMD instantiations. The first one assumes a background mesh and uses generalized moving least squares (GMLS) to obtain the necessary field and face moments. This MMD instance is appropriate for settings where a mesh is available but its quality is insufficient for a robust and accurate mesh-based discretization. The second MMD operator retains the GMLS field moments but defines virtual face moments using computationally efficient weighted graph-Laplacian equations. This MMD instance does not require a background grid and is appropriate for applications where mesh generation creates a computational bottleneck. It allows one to trade an expensive mesh generation problem for a scalable algebraic one, without sacrificing compatibility with the divergence operator. We demonstrate the approach by using the MMD operator to obtain a virtual finite-volume discretization of conservation laws on point clouds. Finally, numerical results in the paper confirm the mimetic properties of the method and show that it behaves similarly to standard finite volume methods.