Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discrete element method”

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 685 records · Page 38

Coupled momentum balance and phase-field solver with fenicsx module

Code solves momentum balance and phase-field equations simultaneously. The differential equations are solved on a discretized domain with appropriate boundary and initial conditions using finite element method. Primary purpose of the code is to simulate brittle fracture under dynamic loading. Constitutive equations are that of linear elasticity with degradation of stress due to fracture. Small strain formulation is used.

Zecevic, Milovan↗

Recent advances in numerical analysis of structural eigenvalue problems

A wide range of eigenvalue problems encountered in practical structural engineering analyses is defined, in which the structures are assumed to be discretized by any suitable technique such as the finite-element method. A review of the usual numerical procedures for the solution of such eigenvalue problems is presented and is followed by an extensive account of recently developed eigenproblem solution procedures. Particular emphasis is placed on the new numerical algorithms and associated computer programs based on the Sturm sequence method. Eigenvalue algorithms developed for efficient solution of natural frequency and buckling problems of structures are presented, as well as some eigenvalue procedures formulated in connection with the solution of quadratic matrix equations associated with free vibration analysis of structures. A new algorithm is described for natural frequency analysis of damped structural systems.

Gupta, K. K.↗

Analysis of structures with rotating, flexible substructures applied to rotorcraft aeroelasticity in GRASP

Application to the General Rotorcraft Aeromechanical Stability Program (GRASP) of new methodology for structural dynamic analysis, including substructuring, frames of reference, nodes, finite elements, and constraints, is discussed. The structure is decomposed into a hierarchy of substructures, and discrete relative motion between substructures is analyzed exactly. The finite element method is used to treat deformation of continua, and the library of finite elements includes a nonlinear beam element incorporating aeroelastic effects. Analytical bases for the aeroelastic beam element and the screw constraint are considered, and the important role of geometric stiffness in the formulation is shown.

Hodges, Dewey H.↗

Distortion of the vortex core during blade-vortex interaction

The effect of vortex distortion on the flow arising from the interaction of a convecting vortex and an airfoil is analyzed for two-dimensional, incompressible, inviscid flow. Significant distortion of the vortex structure, owing to interaction with the airfoil, can occur, especially during close interactions. The vorticity field is represented by multiple vortices. Vortex instability and diffusion, resulting from discretization in space and time, are discussed. An integral boundary element method is used to represent the airfoil surface. The body panels are re-distributed on the surface as the vortices are convected past to calculate the effect of the vorticity field more accurately. The method is applied to several cases to examine effects of vortex strength, distribution, initial separation position, and airfoil angle of attack. Calculations of vortex trajectory and distortion, and airfoil surface-pressure distribution, lift, drag, and circulation as functions of time are presented.

Lee, G. J.↗

A combined finite element-boundary integral formulation for solution of two-dimensional scattering problems via CGFFT

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary-integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principal advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Collins, Jeffery D.↗

Design of Unstructured Adaptive (UA) NAS Parallel Benchmark Featuring Irregular, Dynamic Memory Accesses

We describe the design of a new method for the measurement of the performance of modern computer systems when solving scientific problems featuring irregular, dynamic memory accesses. The method involves the solution of a stylized heat transfer problem on an unstructured, adaptive grid. A Spectral Element Method (SEM) with an adaptive, nonconforming mesh is selected to discretize the transport equation. The relatively high order of the SEM lowers the fraction of wall clock time spent on inter-processor communication, which eases the load balancing task and allows us to concentrate on the memory accesses. The benchmark is designed to be three-dimensional. Parallelization and load balance issues of a reference implementation will be described in detail in future reports.

Feng, Hui-Yu↗

Quasi-heterogeneous efficient 3-D discrete ordinates CANDU calculations using Attila

In this paper, 3-D quasi-heterogeneous large scale parallel Attila calculations of a generic CANDU test problem consisting of 42 complete fuel channels and a perpendicular to fuel reactivity device are presented. The solution method is that of discrete ordinates SN and the computational model is quasi-heterogeneous, i.e. fuel bundle is partially homogenized into five homogeneous rings consistently with the DRAGON code model used by the industry for the incremental cross-section generation. In calculations, the HELIOS-generated 45 macroscopic cross-sections library was used. This approach to CANDU calculations has the following advantages: 1) it allows detailed bundle (and eventually channel) power calculations for each fuel ring in a bundle, 2) it allows the exact reactivity device representation for its precise reactivity worth calculation, and 3) it eliminates the need for incremental cross-sections. Our results are compared to the reference Monte Carlo MCNP solution. In addition, the Attila SN method performance in CANDU calculations characterized by significant up scattering is discussed. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Multiscale Analysis of Pebble Bed Reactors

– The PEBBED code was developed at the Idaho National Laboratory for design and analysis of pebble-bed high temperature reactors. The diffusion-depletion-pebble-mixing algorithm of the original PEBBED code was enhanced through coupling with the THERMIX-KONVEK code for thermal fluid analysis and by the COMBINE code for online cross section generation. The COMBINE code solves the B-1 or B-3 approximations to the transport equation for neutron slowing down and resonance interactions in a homogeneous medium with simple corrections for shadowing and thermal self-shielding. The number densities of materials within specified regions of the core are averaged and transferred to COMBINE from PEBBED for updating during the burnup iteration. The simple treatment of self-shielding in previous versions of COMBINE led to inaccurate results for cross sections and unsatisfactory core performance calculations. A new version of COMBINE has been developed that treats all levels of heterogeneity using the 1D transport code ANISN. In a 3-stage calculation, slowing down is performed in 167 groups for each homogeneous subregion (kernel, particle layers, graphite shell, control rod absorber annulus, etc.) Particles in a local average pebble are homogenized using ANISN then passed to the next (pebble) stage. A 1D transport solution is again performed over the pebble geometry and the homogenized pebble cross sections are passed to a 1-d radial model of a wedge of the pebble bed core. This wedge may also include homogeneous reflector regions and a control rod region composed of annuli of different absorbing regions. Radial leakage effects are therefore captured with discrete ordinates transport while axial and azimuthal effects are captured with a transverse buckling term. In this paper, results of various PBR models will be compared with comparable models from literature. Performance of the code will be assessed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Comparative Study of Finite Element Methods Using the Time-Accuracy-Size(TAS) Spectrum Analysis

We present a performance analysis appropriate for comparing algorithms using different numerical discretizations. By taking into account the total time-to-solution, numerical accuracy with respect to an error norm, and the computation rate, a cost-benefit analysis can be performed to determine which algorithm and discretization are particularly suited for an application. This work extends the performance spectrum model in for interpretation of hardware and algorithmic tradeoffs in numerical PDE simulation. As a proof-of-concept, popular finite element software packages are used to illustrate this analysis for Poisson’s equation.

97 MATHEMATICS AND COMPUTING↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

A semi-local spectral/hp element solver for linear elasticity problems:

We develop an efficient semi-local method for speeding up the solution of linear systems arising in spectral/hp element discretization of the linear elasticity equations. The main idea is to approximate the element-wise residual distribution with a localization operator we introduce in this paper, and subsequently solve the local linear system. Additionally, we decouple the three directions of displacement in the localization operator, hence enabling the use of an efficient low energy preconditioner for the conjugate gradient solver. This approach is effective for both nodal and modal bases in the spectral/hp element method, but here, we focus on the modal hierarchical basis. In numerical tests, we verify that there is no loss of accuracy in the semi-local method, and we obtain good parallel scalability and substantial speed-up compared to the original formulation. In particular, our tests include both structure-only and fluid-structure interaction problems, with the latter modeling a 3D patient-specific brain aneurysm. Copyright © 2014 John Wiley & Sons, Ltd.

Engineering↗

Coupling a nano-particle with isothermal fluctuating hydrodynamics: Coarse-graining from microscopic to mesoscopic dynamics

We derive a coarse-grained description of the dynamics of a nanoparticle immersed in an isothermal simple fluid by performing a systematic coarse graining of the underlying microscopic dynamics. As coarse-grained or relevant variables, we select the position of the nanoparticle and the total mass and momentum density field of the fluid, which are locally conserved slow variables because they are defined to include the contribution of the nanoparticle. The theory of coarse graining based on the Zwanzing projection operator leads us to a system of stochastic ordinary differential equations that are closed in the relevant variables. We demonstrate that our discrete coarse-grained equations are consistent with a Petrov-Galerkin finite-element discretization of a system of formal stochastic partial differential equations which resemble previously used phenomenological models based on fluctuating hydrodynamics. Key to this connection between our “bottom-up” and previous “top-down” approaches is the use of the same dual orthogonal set of linear basis functions familiar from finite element methods (FEMs), both as a way to coarse-grain the microscopic degrees of freedom and as a way to discretize the equations of fluctuating hydrodynamics. Another key ingredient is the use of a “linear for spiky” weak approximation which replaces microscopic “fields” with a linear FE interpolant inside expectation values. For the irreversible or dissipative dynamics, we approximate the constrained Green-Kubo expressions for the dissipation coefficients with their equilibrium averages. Under suitable approximations, we obtain closed approximations of the coarse-grained dynamics in a manner which gives them a clear physical interpretation and provides explicit microscopic expressions for all of the coefficients appearing in the closure. Our work leads to a model for dilute nanocolloidal suspensions that can be simulated effectively using feasibly short molecular dynamics simulations as input to a FEM fluctuating hydrodynamic solver.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Design, analysis and preliminary numerical results for the nonconforming VEM for parabolic problems

The virtual element method (VEM) is a numerical methodology for solving partial differential equations on unstructured polytopal meshes. In this work, we extend the nonconforming high-order formulation suitable to time-dependent diffusion problems with possibly nonlinear forcing terms. Coupling high-order virtual element formulations in space with time-marching schemes based on Backward Differention Formulas (BDFs) makes a fully discrete method with optimal order of convergence in the Method of Lines framework. We investigate and assess the performance of the method through theoretical analysis and a set of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Spatially adaptive stochastic methods for fluid–structure interactions subject to thermal fluctuations in domains with complex geometries

We develop stochastic mixed finite element methods for spatially adaptive simulations of fluid–structure interactions when subject to thermal fluctuations. To account for thermal fluctuations, we introduce a discrete fluctuation–dissipation balance condition to develop compatible stochastic driving fields for our discretization. We perform analysis that shows our condition is sufficient to ensure results consistent with statistical mechanics. We show the Gibbs–Boltzmann distribution is invariant under the stochastic dynamics of the semi-discretization. To generate efficiently the required stochastic driving fields, we develop a Gibbs sampler based on iterative methods and multigrid to generate fields with O(N) computational complexity. Our stochastic methods provide an alternative to uniform discretizations on periodic domains that rely on Fast Fourier Transforms. To demonstrate in practice our stochastic computational methods, we investigate within channel geometries having internal obstacles and no-slip walls how the mobility/diffusivity of particles depends on location. Our methods extend the applicability of fluctuating hydrodynamic approaches by allowing for spatially adaptive resolution of the mechanics and for domains that have complex geometries relevant in many applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-level adaptive finite element methods. 1: Variation problems

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

Brandt, A.↗

The virtual element method for linear elastodynamics models: Design, analysis, and implementation

We design the conforming virtual element method for the numerical simulation of two dimensional time-dependent elastodynamics problems. We investigate the performance of the method both theoretically and numerically. We prove the stability and the convergence of the semi-discrete approximation in the energy norm and derive optimal error estimates. We also show the convergence in the L 2 norm. The performance of the virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally seen in the p-refinement setting.

97 MATHEMATICS AND COMPUTING↗

Modular Finite Element Methods

MFEM is a free, lightweight, scalable C++ library for finite element methods. The goal of MFEM is to enable research and development of scalable finite element discretization and solver algorithms through general finite element abstractions, accurate and flexible visualization, and tight integration with the hypre library. Conceptually, MFEM can be viewed as a finite element toolbox that provides the building blocks for developing finite element algorithms in a manner similar to that of MATLAB for linear algebra methods.

ECP↗

A quadratic programming flux correction method for high-order DG discretizations of S transport

In this work, we present a new flux-fixup approach for arbitrarily high-order discontinuous Galerkin (DG) discretizations of the S N transport equation, and we demonstrate the compatibility of this approach with the Variable Eddington Factor (VEF) method. The new fixup approach is sweep-compatible: during a transport sweep (block Gauss-Seidel iteration in which the scattering source is lagged), a local quadratic programming (QP) problem is solved in each spatial element to ensure that the solution satisfies certain physical constraints, including local particle balance. In this paper, we describe two choices of physical constraints, resulting in two variants of the method: QP Zero (QPZ) and QP Maximum Principle (QPMP). In QPZ, the finite element coefficients of the solution are constrained to be nonnegative. In QPMP, they are constrained to adhere to an approximate discrete maximum principle. There are two primary takeaways in this paper. First, when the positive Bernstein basis is used for DG discretization, the QPMP method eliminates negativities, preserves high-order accuracy for smooth problems, and significantly dampens unphysical oscillations in the solution. The latter feature – the dampening of unphysical oscillations – is an improvement upon standard, simpler fixup approaches such as the approach described in (denoted as the “zero and rescale” (ZR) method in this paper). This improvement comes at a moderate computational cost, but it is not prohibitive. Our results show that, even in an unrealistic worst-case scenario where 83% of the spatial elements require a fixup, the computational cost of performing a transport sweep with fixup is only ~31% greater than performing one without fixup. The second takeaway is that the VEF method can be used to accelerate the convergence of transport sweeps even when a fixup is applied. When optically thick regions are present, transport sweeps converge slowly, regardless of whether a fixup is applied, and acceleration is needed. However, attempting to apply standard diffusion synthetic acceleration (DSA) to fixed-up transport sweeps results in divergence for optically thick problems. Our results show that the same is not true for VEF. When VEF is combined with fixed-up transport sweeps, the result is a scheme that produces a nonnegative solution, converges independently of the mean free path, and, in the case of the QPMP fixup, adheres to an approximate discrete maximum principle.

97 MATHEMATICS AND COMPUTING↗