Search NASA⌕ Search

SEARCH · Search NASA

Results for “Galerkin projection”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

The P1-RKDG method for two-dimensional Euler equations of gas dynamics

A class of nonlinearly stable Runge-Kutta local projection discontinuous Galerkin (RKDG) finite element methods for conservation laws is investigated. Two dimensional Euler equations for gas dynamics are solved using P1 elements. The generalization of the local projections, which for scalar nonlinear conservation laws was designed to satisfy a local maximum principle, to systems of conservation laws such as the Euler equations of gas dynamics using local characteristic decompositions is discussed. Numerical examples include the standard regular shock reflection problem, the forward facing step problem, and the double Mach reflection problem. These preliminary numerical examples are chosen to show the capacity of the approach to obtain nonlinearly stable results comparable with the modern nonoscillatory finite difference methods.

Cockburn, Bernardo↗
DOE OSTI2021

Physics-constrained, low-dimensional models for magnetohydrodynamics: First-principles and data-driven approaches

Plasmas are highly nonlinear and multiscale, motivating a hierarchy of models to understand and describe their behavior. However, there is a scarcity of plasma models of lower fidelity than magnetohydrodynamics (MHD), although these reduced models hold promise for understanding key physical mechanisms, efficient computation, and real-time optimization and control. Galerkin models, obtained by projection of the MHD equations onto a truncated modal basis, and data-driven models, obtained by modern machine learning and system identification, can furnish this gap in the lower levels of the model hierarchy. This work develops a reduced-order modeling framework for compressible plasmas, leveraging decades of progress in projection-based and data-driven modeling of fluids. We begin by formalizing projection-based model reduction for nonlinear MHD systems. To avoid separate modal decompositions for the magnetic, velocity, and pressure fields, we introduce an energy inner product to synthesize all of the fields into a dimensionally consistent, reduced-order basis. Next, we obtain an analytic model by Galerkin projection of the Hall-MHD equations onto these modes. We illustrate how global conservation laws constrain the model parameters, revealing symmetries that can be enforced in data-driven models, directly connecting these models to the underlying physics. We demonstrate the effectiveness of this approach on data from high-fidelity numerical simulations of a three-dimensional spheromak experiment. Finally, this manuscript builds a bridge to the extensive Galerkin literature in fluid mechanics and facilitates future principled development of projection-based and data-driven models for plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Forward sensitivity approach for estimating eddy viscosity closures in nonlinear model reduction

In this paper, we propose a variational approach to estimate eddy viscosity using forward sensitivity method (FSM) for closure modeling in nonlinear reduced order models. FSM is a data assimilation technique that blends model's predictions with noisy observations to correct initial state and/or model parameters. We apply this approach on a projection based reduced order model (ROM) of the one-dimensional viscous Burgers equation with a square wave defining a moving shock, and the two-dimensional vorticity transport equation formulating a decay of Kraichnan turbulence. We investigate the capability of the approach to approximate an optimal value for eddy viscosity with different measurement configurations. Specifically, we show that our approach can sufficiently assimilate information either through full field or sparse noisy measurements to estimate eddy viscosity closure to cure standard Galerkin reduced order model (GROM) predictions. Therefore, our approach provides a modular framework to correct forecasting error from a sparse observational network on a latent space. We highlight that the proposed GROM-FSM framework is promising for emerging digital twin applications, where real-time sensor measurements can be used to update and optimize surrogate model's parameters.

42 ENGINEERING↗
DOE OSTI2020

A long short-term memory embedding for hybrid uplifted reduced order models

In this paper, we introduce an uplifted reduced order modeling (UROM) approach through the integration of standard projection based methods with long short-term memory (LSTM) embedding. Our approach has three modeling layers or components. In the first layer, we utilize an intrusive projection approach to model dynamics represented by the largest modes. The second layer consists of an LSTM model to account for residuals beyond this truncation. This closure layer refers to the process of including the residual effect of the discarded modes into the dynamics of the largest scales. However, the feasibility of generating a low rank approximation tails off for higher Kolmogorov n -width systems due to the underlying nonlinear processes. The third uplifting layer, called super-resolution, addresses this limited representation issue by expanding the span into a larger number of modes utilizing the versatility of LSTM. Therefore, our model integrates a physics-based projection model with a memory embedded LSTM closure and an LSTM based super-resolution model. In several applications, we exploit the use of Grassmann manifold to construct UROM for unseen conditions. We performed numerical experiments by using the Burgers and Navier-Stokes equations with quadratic nonlinearity. Finally, our results show robustness of the proposed approach in building reduced order models for parameterized systems and confirm the improved trade-off between accuracy and efficiency.

42 ENGINEERING↗
DOE OSTI2024

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗
NASA NTRS2000

An Application of the Quadrature-Free Discontinuous Galerkin Method

The process of generating a block-structured mesh with the smoothness required for high-accuracy schemes is still a time-consuming process often measured in weeks or months. Unstructured grids about complex geometries are more easily generated, and for this reason, methods using unstructured grids have gained favor for aerodynamic analyses. The discontinuous Galerkin (DG) method is a compact finite-element projection method that provides a practical framework for the development of a high-order method using unstructured grids. Higher-order accuracy is obtained by representing the solution as a high-degree polynomial whose time evolution is governed by a local Galerkin projection. The traditional implementation of the discontinuous Galerkin uses quadrature for the evaluation of the integral projections and is prohibitively expensive. Atkins and Shu introduced the quadrature-free formulation in which the integrals are evaluated a-priori and exactly for a similarity element. The approach has been demonstrated to possess the accuracy required for acoustics even in cases where the grid is not smooth. Other issues such as boundary conditions and the treatment of non-linear fluxes have also been studied in earlier work This paper describes the application of the quadrature-free discontinuous Galerkin method to a two-dimensional shear layer problem. First, a brief description of the method is given. Next, the problem is described and the solution is presented. Finally, the resources required to perform the calculations are given.

Lockard, David P.↗
DOE OSTI2020

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Numerical solution of large Lyapunov equations

A few methods are proposed for solving large Lyapunov equations that arise in control problems. The common case where the right hand side is a small rank matrix is considered. For the single input case, i.e., when the equation considered is of the form AX + XA(sup T) + bb(sup T) = 0, where b is a column vector, the existence of approximate solutions of the form X = VGV(sup T) where V is N x m and G is m x m, with m small is established. The first class of methods proposed is based on the use of numerical quadrature formulas, such as Gauss-Laguerre formulas, applied to the controllability Grammian. The second is based on a projection process of Galerkin type. Numerical experiments are presented to test the effectiveness of these methods for large problems.

Saad, Youcef↗
DOE OSTI2023

Forward sensitivity analysis and mode dependent control for closure modeling of Galerkin systems

Model reduction by projection-based approaches is often associated with losing some of the important features that contribute towards the dynamics of the retained scales. As a result, a mismatch occurs between the predicted trajectories of the original system and the truncated one. We put forth a framework to apply a continuous time control signal in the latent space of the reduced order model (ROM) to account for the effect of truncation. We set the control input using parameterized models by following energy transfer principles. Our methodology relies on observing the system behavior in the physical space and using the projection operator to restrict the feedback signal into the latent space. Then, we leverage the forward sensitivity method (FSM) to derive relationships between the feedback and the desired mode-dependent control. We test the performance of the proposed approach using two test cases, corresponding to viscous Burgers and vortex merger problems at high Reynolds number. Results show that the ROM trajectory with the applied FSM control closely matches its target values in both the data-dense and data-sparse regimes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Scalable Reduced Order Model with Discontinuous Galerkin Domain Decomposition

scaleupROM is a scalable, physics-constrained reduced order model (ROM). It aims to provide robust, accelerated physics predictions at extrapolated scales, based on the small, component-level data. This is implemented by combining projection-based ROM with discontinuous Galerkin domain decomposition, in the framework of MFEM and libROM. It currently supports the Poisson equation and Stokes flow equation, and more work is in progress toward general, nonlinear physics systems.

Chung, Seung Whan↗
NASA NTRS2004

Relaxation and Preconditioning for High Order Discontinuous Galerkin Methods with Applications to Aeroacoustics and High Speed Flows

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. Other related issues in high order WENO finite difference and finite volume methods have also been investigated. methods are two classes of high order, high resolution methods suitable for convection dominated simulations with possible discontinuous or sharp gradient solutions. In [18], we first review these two classes of methods, pointing out their similarities and differences in algorithm formulation, theoretical properties, implementation issues, applicability, and relative advantages. We then present some quantitative comparisons of the third order finite volume WENO methods and discontinuous Galerkin methods for a series of test problems to assess their relative merits in accuracy and CPU timing. In [3], we review the development of the Runge-Kutta discontinuous Galerkin (RKDG) methods for non-linear convection-dominated problems. These robust and accurate methods have made their way into the main stream of computational fluid dynamics and are quickly finding use in a wide variety of applications. They combine a special class of Runge-Kutta time discretizations, that allows the method to be non-linearly stable regardless of its accuracy, with a finite element space discretization by discontinuous approximations, that incorporates the ideas of numerical fluxes and slope limiters coined during the remarkable development of the high-resolution finite difference and finite volume schemes. The resulting RKDG methods are stable, high-order accurate, and highly parallelizable schemes that can easily handle complicated geometries and boundary conditions. We review the theoretical and algorithmic aspects of these methods and show several applications including nonlinear conservation laws, the compressible and incompressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Shu, Chi-Wang↗
DOE OSTI2021

Nonlinear proper orthogonal decomposition for convection-dominated flows

Autoencoder techniques find increasingly common use in reduced order modeling as a means to create a latent space. This reduced order representation offers a modular data-driven modeling approach for nonlinear dynamical systems when integrated with a time series predictive model. In this Letter, we put forth a nonlinear proper orthogonal decomposition (POD) framework, which is an end-to-end Galerkin-free model combining autoencoders with long short-term memory networks for dynamics. By eliminating the projection error due to the truncation of Galerkin models, a key enabler of the proposed nonintrusive approach is the kinematic construction of a nonlinear mapping between the full-rank expansion of the POD coefficients and the latent space where the dynamics evolve. We test our framework for model reduction of a convection-dominated system, which is generally challenging for reduced order models. Our approach not only improves the accuracy, but also significantly reduces the computational cost of training and testing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1990

The semidiscrete Galerkin finite element modeling of compressible viscous flow past an airfoil

The primary project was the numerical simulation, by a finite element/finite difference method, of the viscous flow about an airfoil. The secondary project involved the numerical simulation of the three-dimensional separated and vortex-dominated flow about a hemispherically capped cylinder in the transonic regime. Preliminary calculations were started for the hemisphere-cylinder at 0 and 5 degree angle of attack. The solution of the flow field about airfoils and wings is required to determine the important parameters of lift, moment, and drag. Viscous effects must be accounted for if the drag is to be accurately calculated. At present there are basically two approaches to the numerical simulation of the flow field, the use of fully viscous models and the inviscid/viscous models. The fully viscous models require the solution of an approximation of the Navier-Stokes equations and therefore should simulate most of the physical mechanisms. A fast, accurate, and computationally efficient inviscid flow solver was recently developed by Hartwich. It is thought that Hartwich's program coupled to a fast, accurate, and computationally efficient boundary layer code, will make an excellent tool for airfoil design. The purpose of the primary project was to develop a compressible boundary layer code using the semidiscrete Galerkin finite element method. The numerical scheme employed used the combination of a Dorodnitsyn formulation of the boundary layer equations, with a finite difference/finite element procedure (semidiscrete Galerkin method), in the solution of the compressible two-dimensional boundary layer equations. A laminar compressible boundary layer code was developed and tested for a NACA 0012 airfoil at a Mach number of 0.5, a Reynolds number of 5000, and zero angle of attack. At present the boundary layer program solves up to, but not beyond, separation.

Meade, Andrew J.↗
DOE OSTI2026

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗
DOE OSTI2020

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗
DOE OSTI2024

Conservative discontinuous Galerkin interpolation: Sheared boundary conditions

Local studies of accretion disks and laboratory magnetized plasmas employ analytical coordinate mappings that introduce sheared boundary conditions (BCs). Here, we present a discontinuous Galerkin (DG) algorithm to apply such BCs based on projections and quadrature-free integration. The procedure is high-order accurate, preserves moments exactly and works in multiple dimensions. Tests of increasing complexity are provided, beginning with translations of one and two dimensional fields, followed by 3D and 5D simulations with sheared (twist-shift) BCs. Results show that the algorithm is (p + 1)-order accurate in the DG representation and (p + 2) -order accurate in the cell averages, with p being the order of the polynomial basis. Quantification of the algorithm's hyperdiffusion and discussion of aliasing errors are given. This technique enables conservative local simulations of plasma turbulence with DG, not possible until now.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗