A heuristic topological model order reduction for advection problems
Explore the source record for details and available documents.
Diaz, Candace Pauline↗
SEARCH · Engineering Papers
Results for “Advection problems”
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.
Solving Advection Problems with Isotopic Evolution with SCALE/ORIGEN
Explore the source record for details and available documents.
Bae, Jin Whan↗
Characteristic Solutions for Advection Problems with Isotopic Evolution with SCALE/ORIGEN
Explore the source record for details and available documents.
Bae, Jin Whan↗
Constrained Local Approximate Ideal Restriction for Advection-Diffusion Problems
Herein this paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, $\ell \text{AIR}$ (local approximate ideal restriction), that was developed for solving advection-dominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of $\ell \text{AIR}$ in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in $\ell \text{AIR}$. The resulting constrained $\ell \text{AIR}$ algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.
97 MATHEMATICS AND COMPUTING↗
Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators
Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.
97 MATHEMATICS AND COMPUTING↗
Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting
This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.
97 MATHEMATICS AND COMPUTING↗
Latent Space Dynamics Identification
LaSDI is a data-driven physical simulation software that forms a latent space for a given high-fidelity model and discovers a set of ordinary differential equations for the latent space dynamics. It allows a fast and accurate solution process, which is useful for multi-query decision making applications, such as design optimization and uncertainty quantification. The performance of the LaSDI framework is demonstrated on four different problems, i.e., 1D and 2D Burgers equations, nonlinear heat conduction, and radial advection problems. Both linear and nonlinear compression techniques, such as neural network and proper orthogonal decomposition, are used to form a latent space. A concept of local dynamics identification procedure is introduced to enable a parametric model, which enhances the accuracy level over a given parameter space.
Fries, William↗
LaSDI: Parametric Latent Space Dynamics Identification
Enabling fast and accurate physical simulations with data has become an important area of computational physics to aid in inverse problems, design-optimization, uncertainty quantification, and other various decision-making applications. This paper presents a data-driven framework for parametric latent space dynamics identification procedure that enables fast and accurate simulations. The parametric model is achieved by building a set of local latent space model and designing an interaction among them. An individual local latent space dynamics model achieves accurate solution in a trust region. By letting the set of trust region to cover the whole parameter space, our model shows an increase in accuracy with an increase in training data. Herein we introduce two different types of interaction mechanisms, i.e., point-wise and region-based approach. Both linear and nonlinear data compression techniques are used. We illustrate the framework of Latent Space Dynamics Identification (LaSDI) enable a fast and accurate solution process on various partial differential equations, i.e., Burgers’ equations, radial advection problem, and nonlinear heat conduction problem, achieving 0 (100)x speed-up and 0 (1)% relative error with respect to the corresponding full order models.
97 MATHEMATICS AND COMPUTING↗
High-Fidelity Simulations of Gravity Currents Using a High-Order Finite-Difference Spectral Vanishing Viscosity Approach
This numerical work investigates the potential of a high-order finite-difference spectral vanishing viscosity approach to simulate gravity currents at high Reynolds numbers. The method introduces targeted numerical dissipation at small scales through altering the discretisation of the second derivatives of the viscous terms in the incompressible Navier-Stokes equations to mimic the spectral vanishing viscosity (SVV) operator, originally designed for the regularisation of spectral element method (SEM) solutions of pure advection problems. Using a sixth-order accurate finite-difference scheme, the adoption of the SVV method is straightforward and comes with a negligible additional computational cost. In order to assess the ability of this high-order finite-difference spectral vanishing viscosity approach, we performed large-eddy simulations (LES) of a gravity current in a channelised lock-exchange set-up with our SVV model and with the well-known explicit static and dynamic Smagorinsky sub-grid scale (SGS) models. The obtained data are compared with a direct numerical simulation (DNS) based on more than 800 million mesh nodes, and with experimental measurements. A framework for the energy budget is introduced to investigate the behaviour of the gravity current. First, it is found that the DNS is in good agreement with the experimental data for the evolution of the front location and velocity field as well as for the stirring and mixing inside the gravity current. Secondly, the LES performed with less than 0.4% of the total number of mesh nodes compared to the DNS, can reproduce the main features of the gravity currents, with the SVV model yielding slightly more accurate results. It is also found that the dynamic Smagorinsky model performs better than its static version. For the present study, the static and dynamic Smagorinsky models are 1.8 and 2.5 times more expensive than the SVV model, because the latter does not require the calculation of explicit SGS terms in the Navier-Stokes equations nor spatial filtering operations.
direct numerical simulation↗
The simulation of 3D hypervelocity spallation using a hydrocode PAGOSA with FLIP+MPM
n this work, a hydrocode PAGOSA with FLIP+MPM is presented and exercised to investigate the fracture in ductile material. The merit of PAGOSA with FLIP+MPM to solve the advection problem is first illustrated by a solid piston periodically moving in a sealed tube with air. Furthermore, the ability of PAGOSA with FLIP+MPM to capture the fracture in material is shown by a simple stretching fracture in ductile material. In both of two benchmark problems, the PAGOSA results and analytical solutions are also presented for comparison. Then PAGOSA with FLIP+MPM is used to model complex spall in ductile material, which is a challenging problem in engineering applications. The convergences of PAGOSA with FLIP+MPM—based on both the mesh size and the marker density—are investigated by monitoring free surface velocity. To further show the ability of PAGOSA with FLIP+MPM to predict fracture in ductile material, the numerical results are compared with the experimental results and other published numerical results. Moreover, the effect of the spall parameter in PAGOSA with FLIP+MPM on the numerical simulation is also analyzed by investigating the free surface velocity. Finally, the effects of the peak compressive stress, the tensile strain rate, and the loading rate on the spallation are further investigated. The numerical results show that PAGOSA with FLIP+MPM can improve PAGOSA's performance when applied to predicting fracture in ductile materials, and is robust enough to accurately predict spall fracture in ductile materials.
42 ENGINEERING↗
Hierarchical model reduction driven by a proper orthogonal decomposition for parametrized advection-diffusion-reaction problems
This work combines the Hierarchical Model (HiMod) reduction technique with a standard Proper Orthogonal Decomposition (POD) to solve parametrized partial differential equations for the modeling of advection-diffusion-reaction phenomena in elongated domains (e.g., pipes). This combination leads to what we define as HiPOD model reduction, which merges the reliability of HiMod reduction with the computational efficiency of POD. Two HiPOD techniques are presented and assessed by an extensive numerical verification.
97 MATHEMATICS AND COMPUTING↗
Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data
Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.
97 MATHEMATICS AND COMPUTING↗
Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning
We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.
97 MATHEMATICS AND COMPUTING↗
AIR Algebraic Multigrid for a Space-Time Hybridizable Discontinuous Galerkin Discretization of Advection(-Diffusion)
This article investigates the efficiency, robustness, and scalability of approximate ideal restriction (AIR) algebraic multigrid as a preconditioner in the all-at-once solution of a space-time hybridizable discontinuous Galerkin discretization of advection-dominated flows. The motivation for this study is that the time-dependent advection-diffusion equation can be seen as a “steady” advection-diffusion problem in $(d+1)$-dimensions and AIR has been shown to be a robust solver for steady advection-dominated problems. Numerical examples demonstrate the effectiveness of AIR as a preconditioner for advection-diffusion problems on fixed and time-dependent domains, using both slab-by-slab and all-at-once space-time discretizations, and in the context of uniform and space-time adaptive mesh refinement. A closer look at the geometric coarsening structure that arises in AIR also explains why AIR can provide robust, scalable, space-time convergence on advective and hyperbolic problems, while most multilevel parallel-in-time schemes struggle with such problems.
97 MATHEMATICS AND COMPUTING↗
Combining DPG in space with DPG time-marching scheme for the transient advection–reaction equation
In this article, we present a general methodology to combine the Discontinuous Petrov–Galerkin (DPG) method in space and time in the context of methods of lines for transient advection–reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). Further, we also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection–reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.
42 ENGINEERING↗
Combining DPG in space with DPG time-marching scheme for the transient advection-reaction equation
In this article, we present a general methodology to combine the Discontinuous PetrovGalerkin (DPG) method in space and time in the context of methods of lines for transient advection-reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). We also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection-reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.
97 MATHEMATICS AND COMPUTING↗
Time-series learning of latent-space dynamics for reduced-order model closure
In this work, we study the performance of long short-term memory networks (LSTMs) and neural ordinary differential equations (NODEs) in learning latent-space representations of dynamical equations for an advection-dominated problem given by the viscous Burgers equation. Our formulation is devised in a nonintrusive manner with an equation-free evolution of dynamics in a reduced space with the latter being obtained through a proper orthogonal decomposition. In addition, we leverage the sequential nature of learning for both LSTMs and NODEs to demonstrate their capability for closure in systems that are not completely resolved in the reduced space. We assess our hypothesis for two advection-dominated problems given by the viscous Burgers equation. We observe that both LSTMs and NODEs are able to reproduce the effects of the absent scales for our test cases more effectively than does intrusive dynamics evolution through a Galerkin projection. This result empirically suggests that time-series learning techniques implicitly leverage a memory kernel for coarse-grained system closure as is suggested through the Mori–Zwanzig formalism.
97 MATHEMATICS AND COMPUTING↗
Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains
Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.
Bounded domains↗