Advances in an r-adaptive high-order method for high-speed flows: multi-domain coupling and uncertainty quantification
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Obtaining stable and high-order numerical solutions for multi-material hydrodynamics is an open challenge. Although slope limiters are widely used to maintain monotonicity near discontinuities, typical limiting procedures violate closure laws at the discrete level when applied to multi-material hydrodynamics equations. Due to this, the high-order expansions of quantities related by the closure laws are no longer consistent. The commonly observed symptom of this consistency-violation is that the numerical method fails to maintain constant pressure and velocity across material interfaces. This leads to sub-optimal convergence rates for smooth multi-material problems as well. Specialized limiting procedures that satisfy consistency while maintaining conservation need to be developed for such equations. A novel procedure that re-instates consistency into slope-limited high-order discretizations applied to the multi-material hydrodynamics equations is presented here. Using simple examples, it is demonstrated that the presented method satisfies closure laws at the discrete level, while maintaining conservative properties of the high-order method. Furthermore, this procedure involves a projection step which relies on the compact basis of the underlying spatial discretization, i.e. for discontinuous schemes (viz. DG and FV) the projection is local, and does not involve global matrix solves. Comparisons with conventional approaches emphasizes the necessity of the consistent closure-law preserving limiting approach, in order to maintain design order of accuracy for smooth multi-material problems.
The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. This milestone represents an effort to increase the fidelity of Nalu-Wind at a fixed resolution through the implementation of a tensor-product based, matrix-free high order scheme. High order finite element methods have increased local work per datum communicated and have the potential to provide significantly more accurate solutions at a fixed number of degrees of freedom. Previous to this milestone, Nalu-Wind had an arbitrary order Control Volume Finite Element Method discretization as a solver option, but it required too much memory and was too slow to be of practical use. The work in this milestone addresses these issues by first implementing an implicit, high order solver that only partially assembles the global system. This reduces the memory footprint of the high-order scheme by orders of magnitude for higher polynomial orders. Second, a faster, tensor-product based method for evaluating the action of the left-hand side was implemented. This reduces the amount of computational work required by the scheme and dramatically enhanced the time-to-solution on example problems. Finally, this milestone is an evaluation of the value of high order methods in the wind application space. With the enhancements to memory and computational cost, accuracy vs. time-to-solution was evaluated for several resolutions on an under-resolved Taylor Green vortex test case. Results show that the high order scheme is cost-competitive with the production low-order schemes in Nalu-Wind, being moderately more expensive than the production edge-based vertex centered finite volume scheme. The evaluation of accuracy on the test case shows a potential benefit to high order at the highest resolution while not deteriorating accuracy on the lowest tested resolution. More work is needed to show value in the wind application, but positive strides have been made.
Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.
Two troubled-cell indicators based on polynomial range estimation methods are used to flag cells that may violate positivity constraints. One method uses interval extension, and the second uses the range enclosure property of the Bernstein polynomial basis. Furthermore, both methods reduce compute time for the positivity preserver by limiting its application to a subset of cells. The Bernstein polynomial method remains effective as the problem dimensionality increases. Interval extension applied to the internal energy equation permits the use of the troubled-cell indicators for rational functions, though performance suffers compared to directly applying the indicators to polynomial functions.
Projection-based reduced-order models (ROMs) comprise a promising set of data-driven approaches for accelerating the simulation of high-fidelity numerical simulations. Standard projection-based ROM approaches, however, suffer from several drawbacks when applied to the complex nonlinear dynamical systems commonly encountered in science and engineering. These limitations include a lack of stability, accuracy, and sharp a posteriori error estimators. This work addresses these limitations by leveraging multiscale modeling, least-squares principles, and machine learning to develop novel reduced-order modeling approaches, along with data-driven a posteriori error estimators, for dynamical systems. Theoretical and numerical results demonstrate that the two ROM approaches developed in this work - namely the windowed least-squares method and the Adjoint Petrov - Galerkin method - yield substantial improvements over state-of-the-art approaches. Additionally, numerical results demonstrate the capability of the a posteriori error models developed in this work.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.
The use of limiting methods for high-order numerical approximations of hyperbolic conservation laws generally requires defining an admissible region/bounds for the solution. In this work, we present a novel approach for computing solution bounds and limiting for the Euler equations through the kinetic representation provided by the Boltzmann equation, which allows for extending limiters designed for linear advection directly to the Euler equations. Given an arbitrary set of solution values to compute bounds over (e.g., numerical stencil) and a desired linear advection limiter, the proposed approach yields an analytic expression for the admissible region of particle distribution function values, which may be numerically integrated to yield a set of bounds for the density, momentum, and total energy. Further, these solution bounds are shown to preserve positivity of density/pressure/internal energy and, when paired with a limiting technique, can robustly resolve strong discontinuities while recovering high-order accuracy in smooth regions without any ad hoc corrections (e.g., relaxing the bounds). This approach is demonstrated in the context of an explicit unstructured high-order discontinuous Galerkin/flux reconstruction scheme for a variety of difficult problems in gas dynamics, including cases with extreme shocks and shock-vortex interactions. Furthermore, this work presents a foundation for limiting techniques for more complex macroscopic governing equations that can be derived from an underlying kinetic representation for which admissible solution bounds are not well-understood.
High order strong stability preserving time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs in a wide variety of application areas including fluid dynamics, magnetohydrodynamics, semiconductor devices, electromagnetics, and astrophysics. Over the past decade multiderivative time-stepping have been increasingly used for the time-evolution hyperbolic PDEs, so that the strong stability properties of these methods have become important. In this work we review sufficient conditions for a two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and different conditions on the second derivative. In particular we present the strong stability preserving theory for explicit and implicit two-derivative Runge–Kutta schemes, including a special condition on the second derivative under which these implicit methods may be unconditionally strong stability preserving. This special condition is natural for the stiff component of wide range of plasma physics problems, and can be useful in the context of strong stability preserving implicit-explicit multi-derivative Runge–Kutta schemes, where the time-step restriction is then independent of the stiff term. Lastly, we present the strong stability preserving theory for implicit-explicit multi-derivative general linear methods, and some novel second and third order methods where the time-step restriction is independent of the stiff term.
Isosurface visualization is fundamental for exploring and analyzing 3D volumetric data. Marching cubes (MC) algorithms with linear interpolation are commonly used for isosurface extraction and visualization. Although linear interpolation is easy to implement, it has limitations when the underlying data is complex and high-order, which is the case for most real-world data. Linear interpolation can output vertices at the wrong location. Its inability to deal with sharp features and features smaller than grid cells can lead to an incorrect isosurface with holes and broken pieces. Despite these limitations, isosurface visualizations typically do not include insight into the spatial location and the magnitude of these errors. We utilize high-order interpolation methods with MC algorithms and interactive visualization to highlight these uncertainties. Our visualization tool helps identify the regions of high interpolation errors. It also allows users to query local areas for details and compare the differences between isosurfaces from different interpolation methods. In addition, we employ high-order methods to identify and reconstruct possible features that linear methods cannot detect. We showcase how our visualization tool helps explore and understand the extracted isosurface errors through synthetic and real-world data.
We present a scheme implementing an a posteriori refinement strategy in the context of a high-order meshless method for problems involving point singularities and fluid–solid interfaces. The generalized moving least squares (GMLS) discretization used in this work has been previously demonstrated to provide high-order compatible discretization of the Stokes and Darcy problems, offering a high-fidelity simulation tool for problems with moving boundaries. The meshless nature of the discretization is particularly attractive for adaptive h -refinement, especially when resolving the near-field aspects of variables and point singularities governing lubrication effects in fluid–structure interactions. We demonstrate that the resulting spatially adaptive GMLS method is able to achieve optimal convergence in the presence of singularities for both the div-grad and Stokes problems. Furthermore, we present a series of simulations for flows of colloid suspensions, in which the refinement strategy efficiently achieved highly accurate solutions, particularly for colloids with complex geometries.
Not provided.
High-order methods have recently been shown to be an effective tool for high-fidelity flow computations like direct numerical simulations and large-eddy simulations because of their strong balance between accuracy and computational cost. In this work, a high-order discontinuous Galerkin spectral element method (DGSEM) is developed to solve the chemically reacting Navier-Stokes equations. To handle the disparate length and time scales associated with these equations, we develop a novel method which combines the spectral accuracy of the SEM with the flexibility of the DG approach. The framework, implemented in the spectral element code Nek5000, is well suited to capture turbulence in smooth regions of the flow, while maintaining numerical stability in the presence of shocks. An entropy-residual based artificial viscosity is added to smooth shocked regions of flow, and a positivity-preserving limiter is implemented to suppress non-physical oscillations. These enhancements support the numerical stability of the hydrodynamic sub-step, which is decoupled from the chemistry integration through a second-order operator splitting method. Here, a series of smooth and discontinuous validation cases are presented in increasing physical and computational complexity for both inviscid and viscous flows. In particular, simulations of canonical one-dimensional and two-dimensional detonations are performed, and the high-order numerical results are validated against available literature data. Additional validation studies are carried out for classical three-dimensional numerical simulations of incompressible and compressible turbulent flows.
In this work, we investigate high-order accuracy in time integration by examining two operator splitting methods for poroelastic problems: the two-pass and the spectral deferred correction (SDC) methods. To enhance the order of accuracy, the two-pass method partitions a coupled operator symmetrically, whereas the SDC method corrects truncation errors by establishing an error equation. These high-order methods are applied to underlying solution strategies, i.e., monolithic, fixed-stress sequential, and undrained sequential methods. We observe that semi-discretized systems from spatial discretization have forms similar to those of index-1 differential algebraic equations (DAEs), causing order reduction against the two-pass method when it is used in conjunction with either the monolithic or sequential method. On the other hand, the SDC in conjunction with the monolithic method exhibits the desired second-order accuracy in poroelastic problems while increasing the order of accuracy for index-1 DAEs. However, the SDC in conjunction with either of the two sequential methods does not achieve the desired order of accuracy, and maintains first order because the flow equation for poroelasticity has an additional approximation associated with the volumetric strain rate term, which does not yield exactly the same forms as those of conventional DAEs. Thus, the monolithic SDC method can achieve higher-order accuracy, but may require higher computational costs because it involves solving matrix systems larger than those for the sequential methods.