Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit”

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 1,153 records · Page 64

An embedded variable step IMEX scheme for the incompressible Navier–Stokes equations

This report presents a series of implicit–explicit (IMEX) variable stepsize algorithms for the incompressible Navier–Stokes equations (NSE). Here, IMEX means the nonlinear term is treated fully explicitly while the remaining terms are treated implicitly. With the advent of new computer architectures there has been growing demand for low memory solvers of this type. The addition of time adaptivity improves the accuracy and greatly enhances the efficiency of the algorithm. We prove energy stability of an embedded first–second order IMEX pair. For the first order member of the pair, we prove stability for variable stepsizes, and analyze convergence. We believe this to be the first proof of this type for a variable stepsize IMEX scheme for the incompressible NSE. We then define and test a variable stepsize, variable order IMEX scheme using these methods. Our work contributes several firsts for IMEX NSE schemes, including an energy argument and error analysis of a two-step, variable stepsize method, and embedded error estimation for an IMEX multi-step method.

42 ENGINEERING↗

Geometric prior of multi-resolution yielding manifolds and the local closest point projection for nearly non-smooth plasticity

Elastoplasticity models often introduce a scalar-valued yield function to implicitly represent the boundary between elastic and plastic material states. Here this paper introduces a new alternative where the yield envelope is represented by a manifold of which the topology and the geometry are learned from a set of data points in a parametric space (e.g. principal stress space, π-plane). Here, deep geometric learning enables us to reconstruct a highly complex yield envelope by breaking it down into multiple coordinate charts. The global atlas that consists of these coordinate charts in return allows us to represent the yield surface via multiple overlapping patches, each with a specific local parametrization. This setup provides several advantages over the classical implicit function representation approach. For instance, the availability of coordinate charts enables us to introduce an alternative stress integration algorithm where the trial stress may project directly on a local patch and hence circumvent the issues related to non-smoothness and the lack of convexity of yield surfaces. Meanwhile, the local parametric approach also enables us to predict hardening/softening locally in the parametric space, even without complete knowledge of the yield surface. Comparisons between the classical yield function approach on the non-smooth plasticity and anisotropic cam-clay plasticity model are provided to demonstrate the capacity of the models for highly precise yield surface and the feasibility of the implementation of the learned model in the local stress integration algorithm.

42 ENGINEERING↗

Order parameter re-mapping algorithm for 3D phase field model of grain growth using FEM

Phase field modeling (PFM) is a well-known technique for simulating microstructural evolution. To model grain growth using PFM, typically each grain is assigned a unique non-conserved order parameter and each order parameter field is evolved in time. Traditional approaches using a one-to-one mapping of grains to order parameters present a challenge when modeling large numbers of grains due to the computational expense of using many order parameters. This problem is exacerbated when using an implicit finite element method (FEM), as the global matrix size is proportional to the number of order parameters. While previous work has developed methods to reduce the number of required variables and thus computational complexity and run time, none of the existing approaches can be applied for an implicit FEM implementation of PFM. Here, we present a modular, dynamic, scalable reassignment algorithm suitable for use in such a system. Polycrystal modeling with grain growth and stress require careful tracking of each grain’s position and orientation which is lost when using a reduced order parameter set. In conclusion, the method presented in this paper maintains a unique ID for each grain even after reassignment, to allow the PFM to be tightly coupled to calculations of the stress throughout the polycrystal. Implementation details and comparative results of our approach are presented.

36 MATERIALS SCIENCE↗

FELIX-2.0: New version of the finite element solver for the time dependent generator coordinate method with the Gaussian overlap approximation

The time-dependent generator coordinate method (TDGCM) is a powerful method to study the largeamplitude collective motion of quantum many-body systems such as atomic nuclei. Under the GaussianOverlap Approximation (GOA), the TDGCM leads to a local, time-dependent Schrödinger equation in amulti-dimensional collective space. In this paper, we present the version 2.0 of the code FELIX that solvesthe collective Schrödinger equation in a finite element basis. This new version features: (i) the ability tosolve a generalized TDGCM+GOA equation with a metric term in the collective Hamiltonian, (ii) supportfor new kinds of finite elements and different types of quadrature to compute the discretized Hamiltonianand overlap matrices, (iii) the possibility to leverage the spectral element scheme, (iv) an explicit Krylovapproximation of the time propagator for time integration instead of the implicit Crank–Nicolson methodimplemented in the first version, (v) an entirely redesigned workflow. We benchmark this release on ananalytic problem as well as on realistic two-dimensional calculations of the low-energy fission of240Puand256Fm. Low to moderate numerical precision calculations are most efficiently performed with simplexelements with a degree 2 polynomial basis. Higher precision calculations should instead use the spectralelement method with a degree 4 polynomial basis. We emphasize that in a realistic calculation of fissionmass distributions of240Pu, FELIX-2.0 is about 20 times faster than its previous release (within a numericalprecision of a few percents).

Regnier, D.↗

Fast solvers for tokamak fluid models with PETSc

Multigrid (MG) is widely recognized as a highly effective solver for the model problem, the Laplacian, but textbook MG fails on most problems of interest. MG methods have been applied to complex, real-world applications with careful consideration of the physical model and discretization. In this work we develop the first step in applying MG methods to science and engineering relevant magnetohydrodynamics (MHD) tokamak models in the M3D-C1 (https://m3dc1.pppl.gov) fusion energy science code. The semi-implicit time integrator in M3D-C1 is composed of many linear solves. The implicit advance of the momentum equation is the most challenging and is the focus of this work. The current production solver in M3D-C1 is a block Jacobi (BJ) preconditioner within a Krylov solver, where blocks group degrees of freedom on planes of constant toroidal coordinate. BJ convergence degrades as the number of planes increases due to the spectral properties of the matrix preconditioned with BJ. The partially magnetic field-aligned, regular toroidal grid structure in M3D-C1 is amenable to semi-coarsening geometric MG in the toroidal direction. This paper develops such a solver and demonstrates competitive performance on a runaway electron model of a SPARC (https://cfs.energy/technology/sparc) disruption, and superior robustness on a stellarator model on which the BJ solver fails to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Unconditionally convergent nonlinear solver for hyperbolic conservation laws with S-shaped flux functions

This paper addresses the convergence properties of implicit numerical solution algorithms for nonlinear hyperbolic transport problems. It is shown that the Newton-Raphson (NR) method converges for any time step size, if the flux function is convex, concave, or linear, which is, in general, the case for CFD problems. In some problems, e.g., multiphase flow in porous media, the nonlinear flux function is S-shaped (not uniformly convex or concave); as a result, a standard NR iteration can diverge for large time steps, even if an implicit discretization scheme is used to solve the nonlinear system of equations. In practice, when such convergence difficulties are encountered, the current time step is cut, previous iterations are discarded, a smaller time step size is tried, and the NR process is repeated. The criteria for time step cutting and selection are usually based on heuristics that limit the allowable change in the solution over a time step and/or NR iteration. Here, we propose a simple modification to the NR iteration scheme for conservation laws with S-shaped flux functions that converges for any time step size. The new scheme allows one to choose the time step size based on accuracy consideration only without worrying about the convergence behavior of the nonlinear solver. The proposed method can be implemented in an existing simulator, e.g., for CO{sub 2} sequestration or reservoir flow modeling, quite easily. The numerical analysis is confirmed with simulation studies using various test cases of nonlinear multiphase transport in porous media. The analysis and numerical experiments demonstrate that the modified scheme allows for the use of arbitrarily large time steps for this class of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculations of two-fluid magnetohydrodynamic axisymmetric steady-states

M3D-C{sup 1} is an implicit, high-order finite element code for the solution of the time-dependent nonlinear two-fluid magnetohydrodynamic equations [S.C. Jardin, J. Breslau, N. Ferraro, A high-order implicit finite element method for integrating the two-fluid magnetohydrodynamic equations in two dimensions, J. Comp. Phys. 226 (2) (2007) 2146-2174]. This code has now been extended to allow computations in toroidal geometry. Improvements to the spatial integration and time-stepping algorithms are discussed. Steady-states of a resistive two-fluid model, self-consistently including flows, anisotropic viscosity (including gyroviscosity) and heat flux, are calculated for diverted plasmas in geometries typical of the National Spherical Torus Experiment (NSTX) [M. Ono et al., Exploration of spherical torus physics in the NSTX device, Nucl. Fusion 40 (3Y) (2000) 557-561]. These states are found by time-integrating the dynamical equations until the steady-state is reached, and are therefore stationary or statistically steady on both magnetohydrodynamic and transport time-scales. Resistively driven cross-surface flows are found to be in close agreement with Pfirsch-Schlueter theory. Poloidally varying toroidal flows are in agreement with comparable calculations [A.Y. Aydemir, Shear flows at the tokamak edge and their interaction with edge-localized modes, Phys. Plasmas 14]. New effects on core toroidal rotation due to gyroviscosity and a local particle source are observed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A linear stability analysis for nonlinear, grey, thermal radiative transfer problems

We present a new linear stability analysis of three time discretizations and Monte Carlo interpretations of the nonlinear, grey thermal radiative transfer (TRT) equations: the widely used 'Implicit Monte Carlo' (IMC) equations, the Carter Forest (CF) equations, and the Ahrens-Larsen or 'Semi-Analog Monte Carlo' (SMC) equations. Using a spatial Fourier analysis of the 1-D Implicit Monte Carlo (IMC) equations that are linearized about an equilibrium solution, we show that the IMC equations are unconditionally stable (undamped perturbations do not exist) if {alpha}, the IMC time-discretization parameter, satisfies 0.5 < {alpha} {<=} 1. This is consistent with conventional wisdom. However, we also show that for sufficiently large time steps, unphysical damped oscillations can exist that correspond to the lowest-frequency Fourier modes. After numerically confirming this result, we develop a method to assess the stability of any time discretization of the 0-D, nonlinear, grey, thermal radiative transfer problem. Subsequent analyses of the CF and SMC methods then demonstrate that the CF method is unconditionally stable and monotonic, but the SMC method is conditionally stable and permits unphysical oscillatory solutions that can prevent it from reaching equilibrium. This stability theory provides new conditions on the time step to guarantee monotonicity of the IMC solution, although they are likely too conservative to be used in practice. Theoretical predictions are tested and confirmed with numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Algebraic Stabilization of Explicit Numerical Integration for Extremely Stiff Reaction Networks

In contrast to the prevailing view in the literature, it is shown that even extremely stiff sets of ordinary differential equations may be solved efficiently by explicit methods if limiting algebraic solutions are used to stabilize the numerical integration. The stabilizing algebra differs essentially for systems well removed from equilibrium and those near equilibrium. Explicit asymptotic and quasi-steady-state methods that are appropriate when the system is only weakly equilibrated are examined first. These methods are then extended to the case of close approach to equilibrium through a new implementation of partial equilibrium approximations. Using stringent tests with astrophysical thermonuclear networks, evidence is provided that these methods can deal with the stiffest networks, even in the approach to equilibrium, with accuracy and integration timestepping comparable to that of implicit methods. Because explicit methods can execute a timestep faster and scale more favorably with network size than implicit algorithms, our results suggest that algebraically stabilized explicit methods might enable integration of larger reaction networks coupled to fluid dynamics than has been feasible previously for a variety of disciplines.

differential equations↗

Time integration for diffuse interface models for two-phase flow

We propose a variant of the θ-scheme for diffuse interface models for two-phase flow, together with three new linearization techniques for the surface tension. These involve either additional stabilizing force terms, or a fully implicit coupling of the Navier–Stokes and Cahn–Hilliard equation. In the common case that the equations for interface and flow are coupled explicitly, we find a time step restriction which is very different to other two-phase flow models and in particular is independent of the grid size. We also show that the proposed stabilization techniques can lift this time step restriction. Even more pronounced is the performance of the proposed fully implicit scheme which is stable for arbitrarily large time steps. We demonstrate in a Taylor-flow application that this superior coupling between flow and interface equation can decrease the computation time by several orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit integration with GPU acceleration for large kinetic networks

We demonstrate the first implementation of recently-developed fast explicit kinetic integration algorithms on modern graphics processing unit (GPU) accelerators. Taking as a generic test case a Type Ia supernova explosion with an extremely stiff thermonuclear network having 150 isotopic species and 1604 reactions coupled to hydrodynamics using operator splitting, we demonstrate the capability to solve of order 100 realistic kinetic networks in parallel in the same time that standard implicit methods can solve a single such network on a CPU. This orders-of-magnitude decrease in computation time for solving systems of realistic kinetic networks implies that important coupled, multiphysics problems in various scientific and technical fields that were intractable, or could be simulated only with highly schematic kinetic networks, are now computationally feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stabilized FE simulation of prototype thermal-hydraulics problems with integrated adjoint-based capabilities

A critical aspect of applying modern computational solution methods to complex multiphysics systems of relevance to nuclear reactor modeling, is the assessment of the predictive capability of specific proposed mathematical models. In this respect the understanding of numerical error, the sensitivity of the solution to parameters associated with input data, boundary condition uncertainty, and mathematical models is critical. Additionally, the ability to evaluate and or approximate the model efficiently, to allow development of a reasonable level of statistical diagnostics of the mathematical model and the physical system, is of central importance. In this study we report on initial efforts to apply integrated adjoint-based computational analysis and automatic differentiation tools to begin to address these issues. The study is carried out in the context of a Reynolds averaged Navier–Stokes approximation to turbulent fluid flow and heat transfer using a particular spatial discretization based on implicit fully-coupled stabilized FE methods. Initial results are presented that show the promise of these computational techniques in the context of nuclear reactor relevant prototype thermal-hydraulics problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

On the performance of exponential integrators for problems in magnetohydrodynamics

Exponential integrators have been introduced as an efficient alternative to explicit and implicit methods for integrating large stiff systems of differential equations. Over the past decades these methods have been studied theoretically and their performance was evaluated using a range of test problems. While the results of these investigations showed that exponential integrators can provide significant computational savings, the research on validating this hypothesis for large scale systems and understanding what classes of problems can particularly benefit from the use of the new techniques is in its initial stages. Resistive magnetohydrodynamic (MHD) modeling is widely used in studying large scale behavior of laboratory and astrophysical plasmas. In many problems numerical solution of MHD equations is a challenging task due to the temporal stiffness of this system in the parameter regimes of interest. In this paper we evaluate the performance of exponential integrators on large MHD problems and compare them to a state-of-the-art implicit time integrator. Both the variable and constant time step exponential methods of EPIRK-type are used to simulate magnetic reconnection and the Kevin–Helmholtz instability in plasma. Performance of these methods, which are part of the EPIC software package, is compared to the variable time step variable order BDF scheme included in the CVODE (part of SUNDIALS) library. We study performance of the methods on parallel architectures and with respect to magnitudes of important parameters such as Reynolds, Lundquist, and Prandtl numbers. We find that the exponential integrators provide superior or equal performance in most circumstances and conclude that further development of exponential methods for MHD problems is warranted and can lead to significant computational advantages for large scale stiff systems of differential equations such as MHD.

97 MATHEMATICS AND COMPUTING↗

Adaptive local basis set for Kohn–Sham density functional theory in a discontinuous Galerkin framework II: Force, vibration, and molecular dynamics calculations

Recently, we have proposed the adaptive local basis set for electronic structure calculations based on Kohn–Sham density functional theory in a pseudopotential framework. The adaptive local basis set is efficient and systematically improvable for total energy calculations. In this paper, we present the calculation of atomic forces, which can be used for a range of applications such as geometry optimization and molecular dynamics simulation. We demonstrate that, under mild assumptions, the computation of atomic forces can scale nearly linearly with the number of atoms in the system using the adaptive local basis set. We quantify the accuracy of the Hellmann–Feynman forces for a range of physical systems, benchmarked against converged planewave calculations, and find that the adaptive local basis set is efficient for both force and energy calculations, requiring at most a few tens of basis functions per atom to attain accuracies required in practice. Since the adaptive local basis set has implicit dependence on atomic positions, Pulay forces are in general nonzero. However, we find that the Pulay force is numerically small and systematically decreasing with increasing basis completeness, so that the Hellmann–Feynman force is sufficient for basis sizes of a few tens of basis functions per atom. We verify the accuracy of the computed forces in static calculations of quasi-1D and 3D disordered Si systems, vibration calculation of a quasi-1D Si system, and molecular dynamics calculations of H{sub 2} and liquid Al–Si alloy systems, where we show systematic convergence to benchmark planewave results and results from the literature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A stable and accurate partitioned algorithm for conjugate heat transfer

We describe a new partitioned approach for solving conjugate heat transfer (CHT) problems where the governing temperature equations in different material domains are time-stepped in a implicit manner, but where the interface coupling is explicit. The new approach, called the CHAMP scheme (Conjugate Heat transfer Advanced Multi-domain Partitioned), is based on a discretization of the interface coupling conditions using a generalized Robin (mixed) condition. The weights in the Robin condition are determined from the optimization of a condition derived from a local stability analysis of the coupling scheme. The interface treatment combines ideas from optimized-Schwarz methods for domain-decomposition problems together with the interface jump conditions and additional compatibility jump conditions derived from the governing equations. For many problems (i.e. for a wide range of material properties, grid-spacings and time-steps) the CHAMP algorithm is stable and second-order accurate using no sub-time-step iterations (i.e. a single implicit solve of the temperature equation in each domain). In extreme cases (e.g. very fine grids with very large time-steps) it may be necessary to perform one or more sub-iterations. Each sub-iteration generally increases the range of stability substantially and thus one sub-iteration is likely sufficient for the vast majority of practical problems. The CHAMP algorithm is developed first for a model problem and analyzed using normal-mode the- ory. The theory provides a mechanism for choosing optimal parameters in the mixed interface condition. A comparison is made to the classical Dirichlet-Neumann (DN) method and, where applicable, to the optimized- Schwarz (OS) domain-decomposition method. For problems with different thermal conductivities and dif- fusivities, the CHAMP algorithm outperforms the DN scheme. For domain-decomposition problems with uniform conductivities and diffusivities, the CHAMP algorithm performs better than the typical OS scheme with one grid-cell overlap. Lastly, the CHAMP scheme is also developed for general curvilinear grids and CHT ex- amples are presented using composite overset grids that confirm the theory and demonstrate the effectiveness of the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A compatible high-order meshless method for the Stokes equations with applications to suspension flows

A stable numerical solution of the steady Stokes problem requires compatibility between the choice of velocity and pressure approximation that has traditionally proven problematic for meshless methods. Here in this work, we present a discretization that couples a staggered scheme for pressure approximation with a divergence-free velocity reconstruction to obtain an adaptive, high-order, finite difference-like discretization that can be efficiently solved with conventional algebraic multigrid techniques. We use analytic benchmarks to demonstrate equal-order convergence for both velocity and pressure when solving problems with curvilinear geometries. In order to study problems in dense suspensions, we couple the solution for the flow to the equations of motion for freely suspended particles in an implicit monolithic scheme. The combination of high-order accuracy with fully-implicit schemes allows the accurate resolution of stiff lubrication forces directly from the solution of the Stokes problem without the need to introduce sub-grid lubrication models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A massively-parallel, unstructured overset method to simulate moving bodies in turbulent flows

An unstructured overset method capable of performing direct numerical simulation (DNS) and large eddy simulation (LES) of many (O(10 5 )) moving bodies, utilizing many computational cores (O(10 5 )), in turbulent, incompressible fluid flow is presented. Unstructured meshes are attached to bodies and placed within a fixed background domain. Body meshes are allowed to arbitrarily overlap and move throughout the domain. Within each mesh a high resolution, unstructured, non-dissipative finite volume method is used to solve for the flow field. Boundary conditions for each mesh are provided by interpolation from flow solutions on overlapping meshes. When many unstructured meshes of different resolution overlap, care is required in the connection between the different flow solutions. An interpolant is created which seeks to preserve volume conservation of flow quantities between meshes regardless of overlapping mesh differences. An implicit fractional step method is used for time advancement, requiring the calculation of a predicted fluid velocity and corrector pressure field. For the predictor step, the resulting interpolation is directly introduced into the implicit equations for the predicted flow field. For the corrected pressure field, the continuity between meshes is weakly enforced using a penalty formulation. The pressure formulation is symmetric, positive-definite and non-singular resulting in a formulation which is readily solvable using traditional iterative matrix inversion techniques. An Arbitrary Euler-Lagrangian (ALE) method coupled to a 6 degrees of freedom rigid body equation system (6-DOF) is used for body motion. For rotation, a quaternion representation is used to solve Euler's equations of rigid body motion. A linear spring damper model, which uses geometry information readily available from the overset assembly process, is used for collisions. Validation of the method for canonical flow fields is presented including assessment of order of accuracy and kinetic energy conservation properties. Particle-resolved direct numerical simulation (PR-DNS) of single particles in various flow fields are presented for validation. PR-DNS results of 50,000 spherical particles freely moving within turbulent channel flow are shown as a demonstration of the method at full scale. LES results of a marine propeller under crashback conditions are shown to demonstrate the ability to simulate highly unsteady turbulent flows over complex, moving geometries.

97 MATHEMATICS AND COMPUTING↗