- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Advances in Numerical Analysis
Volume 2013 (2013), Article ID 974284, 8 pages
A Proper-Orthogonal Decomposition Variational Multiscale Approximation Method for a Generalized Oseen Problem
Department of Mathematics, North Carolina A & T State University, Greensboro, NC 27411, USA
Received 6 June 2013; Accepted 25 October 2013
Academic Editor: Yinnian He
Copyright © 2013 John Paul Roop. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We introduce the variational multiscale (VMS) stabilization for the reduced-order modeling of incompressible flows. It is well known that the proper orthogonal decomposition (POD) technique in reduced-order modeling experiences numerical instability when applied to complex flow problems. In this case a POD discretization naturally separates out structures which corresponding to the energy cascade on large and small scales, in order, a VMS approach is natural. In this paper, we provide the mathematical background necessary for implementing VMS to a POD-Galerkin model of a generalized Oseen problem. We provide theoretical evidence which indicates the consistency of utilizing a VMS approach in the stabilization of reduced order flows. In addition we provide numerical experiments indicating that VMS improves fidelity in reproducing the qualitative properties of the flow.
In this paper, we present an analysis and numerical experiments associated with the use of the variational multiscale (VMS) stabilization technique applied to reduced-order modeling (ROM) of a generalized Oseen problem. In producing error estimates and stability results regarding the simulation of incompressible flow problems, the Oseen problem is a model problem in that it possesses all of the features which may prove challenging in the full scale numerical simulation of turbulent flows, while at the same time being posed as a linear problem. In addition, when using an iterative method for resolving the nonlinearity in the incompressible Navier-Stokes equations, an Oseen problem is solved at each iteration.
The generalized Oseen problem may be stated as follows. Let be a domain in ( denoting the spatial dimension), and find such that In the case of fluid flow, gives the fluid velocity, is the pressure, represents the fluid viscosity, is a solenoidal vector function, , representing the associated velocity field, and is a reaction term.
One promising idea when considering the fast simulation of is the use of ROM by way of proper orthogonal decomposition (POD). The idea of applying POD to turbulent flows is nothing new. In fact, the principal components of a flow can effectively give a lot of information about flow’s coherent structure and dynamical behavior. However, what remains a mystery is the idea of using the principal components in the fast reproduction of (or variation of modeling parameters for) a fluid flow simulation, which is subject to numerical instability.
The idea behind POD based modeling is nothing new in engineering and is incorporated in many areas. It is quite natural to think of a quick model as one which takes steps in the direction of an orthogonal component which maximizes the incorporated variation. However, there are still many unanswered questions as to the underlying mathematical reasons that some flows can be easily reproduced using a POD-Galerkin approach and some cannot. In addition, the nature of POD-Galerkin lends itself to thoughts of nonlinear dynamical systems. For a more general discussion of the way POD-Galerkin is applied and can be analyzed, see [1–3].
In Section 2, we present notations and mathematical background necessary for analyzing the POD-Galerkin problem for an Oseen flow, including specific discussions of how the POD approximation is obtained and the error can be characterized. In Section 3, we introduce the POD-VMS model. In Section 4, we provide an error result which gives the consistency of the POD-VMS model in terms of both the standard finite element error analysis and the error associated with the POD approximation. In Section 5, we provide computational experiments which illustrate the theoretical results as well as the fact that the POD-VMS approach may be utilized to improve the results when applied to a complicated Oseen flow problem. Finally, Section 6 contains conclusions and future work.
In this section, we give the appropriate function space setting for the analysis and numerical approximation for the generalized Oseen problem (1). We review some key results which are necessary for the analysis and approximation of (1). Next, we review the VMS method for the standard finite element discretization of (1) and give a discussion of how these may in effect “stabilize” the finite element approximation. We note and will make use of the fact that many of these results carry over to the reduced-order case.
We make use of the standard Sobolev spaces , , , and and by utilizing bold face, we mean the same spaces for vector-valued functions. Unless denoted otherwise denotes the standard norm, the standard norm, and the standard seminorm, all taken over . In the sequel, we make use of various spaces, all of which are subspaces of . For abstractness of some definitions, we set .
To facilitate the analysis, we define the following bilinear form for arbitrary : We now introduce the variational form for (1) in terms of the previously defined scalar products.
Problem O. Find s.t.
Existence and uniqueness first follow from the Lax-Milgram lemma, as Secondly, a unique pressure in exists from the Babuska-Brezzi condition for the space .
We consider conforming finite element spaces and , . We need not be too specific about the error results pertaining to the finite element subspace utilized to provide the underlying approximation. It is sufficient to assume that the true solution’s velocity belongs to the space and that the finite element approximation affords a Ritz-projection convergence rate of with respect to the norm and with respect to the seminorm, respectively.
In the finite element space, we also define the Galerkin approximation.
Problem OH. Find s.t.
Problem OH is guaranteed to possess a unique solution provided that the space satisfies the discrete Babuska-Brezzi condition, which implies that the space of weakly divergence-free functions , is a well-defined, nontrivial, closed subspace of which leads to the fact that the pressure is unique .
Prior to giving results necessary for the study of the POD discretization of (1), let us briefly review the concepts of VMS and SUPG. The variational multiscale method is a discretization-dependent way in which artificial viscosity is applied in a clever way. Suppose that is at least a partial derefinement of ; that is, . Then we define where is the projection operator from onto (which in the case of a Lagrange basis evaluates the interpolant of a function on at the nodes corresponding to the basis in ) and .
Problem OHV. Find s.t.
Now that we have established some results regarding the variational solution to the Oseen problem, we introduce the proper orthogonal decomposition. In order to simplify the analysis, we consider as the solution to (3) and consider a finite number of realizations of the solution at various time values. That is, define where , . It is effective to think of these “snapshots” as coming from a perfect time discretization of one of the semidiscrete problems. We assume that now a POD decomposition has been performed on the snapshots, which produces an ordered basis: where is the number of positive singular values of and these values are written in descending order. In addition, we assume that , and where , . We note that the POD-Galerkin truncation is the approximation of : and thus a Ritz-Galerkin approximation is an obvious choice of a test problem in this setting.
3. The POD-VMS Model
In this section, we introduce the POD-VMS model in the appropriate function space setting and provide existence, uniqueness, and stability results corresponding to the model.
Problem POHV. Given , find s.t. We have notationally distinguished the difference between in the traditional VMS scheme and in the POD-VMS scheme as follows: where .
Instead of considering a projection as the projection on a partial derefinement of the grid, we consider the projection as the projection of onto a subspace , where . In other words, only nodes which are in the POD-Galerkin basis but correspond to “low energy” are utilized for stabilization.
We make note of the fact that in (13) the equation does not include the pressure terms, as each element of the space is weakly divergence free. Just as in a Chorin-like projection method, the actual pressure in the reduced basis model can be obtained after the fact by solving a Poisson problem using the residual.
4. Error Analysis
In this section, we provide the error result and discuss the implication of the error result within the context of practical computational problems.
Theorem 1. The solution of (13) satisfies the following error estimate:
Proof. We begin the proof by subtracting (13) from (3), testing against arbitrary , and setting . We thus get
We decompose the error as follows: , where where is the interpolant of onto , noting that, as we possess an orthogonal basis of , a projection thereof is trivial. Also, the interpolating properties of and the error estimate (11) are trivial.
Now, using the definition of , , and (16), we have
Setting , noting the positivity of , and using the Cauchy-Schwartz inequality, we have where is the constant of continuity in the bilinear form.
Using the fact that on the left-hand side and Young’s inequality twice on the right, we have the following: Now, subtracting through by the appropriate quantities, we have Now, multiplying by two, using the fact that , where by we mean the projection of onto the space and is as defined before, and the triangle inequality, we obtain Finally, an application of Gronwall’s inequality yields the desired result.
5. Computational Experiments
In this section, we present a number of computational experiments which both support the theoretical estimates obtained above and indicate the improvement achieved by utilizing the VMS stabilization in the POD-ROM approximation. We first present two computational experiments in which the true solution is known and then a third computational experiment with highly heterogeneous flow field in which the true solution is unknown.
First, when considering exact solutions of the Oseen problem (1) (for ), the velocity must satisfy the continuity equation. However, when resolving reduced-order POD-ROM problems for equations with nonzero essential boundary conditions which change with time, an unnecessary computational challenge is created. There are two main approaches to solving this problem, found in [5, 6]. Most analytical solutions which are solenoidal possess nonzero essential boundary conditions, and most analytical solutions which possess homogeneous boundary conditions are not solenoidal. For a clue about how to construct solutions which are both solenoidal and possess homogeneous boundary conditions, we refer the reader to . It is useful to avoid changing essential boundary conditions, since they have little application in the POD literature anyway.
In the first two experiments, we use solutions whose velocity fields are of the following form: where we clearly see that all choices of , give velocity fields which are solenoidal and possess homogeneous boundary conditions on the unit square.
We now present the results from the three computational experiments. For both Experiments 1 and 2 we consider solutions of the form (23) and use a computational grid with mesh parameter on the unit square. For all three computational experiments, we set and , utilize the Taylor-Hood finite element pair, and solve the problem using C++ on a 12 processor Mac Pro.
Experiment 1. In this experiment, we choose solutions of the form (23) where and . We use the POD-Galerkin approximation for and vary both the values of and utilized in the POD-VMS model. Experimental error results from this experiment are summarized in Table 1. We notice that as is decreased, the error decreases, meaning that the more modes utilized for the VMS stabilization yield a solution which is closer to the true solution. In addition, we see that more damping, that is, using four times as the modeling parameter , gives a lower error as opposed to using lower values of .
Experiment 2. In this experiment, we choose solutions of the form (23) where and . We use the POD-Galerkin approximation for and vary both the values of and utilized in the POD-VMS model. Experimental error results from this experiment are summarized in Table 2. In this experiment, we have the opposite behavior from Experiment 1. We notice that as is decreased, the error increases, meaning that the less modes utilized for the VMS stabilization yield a solution which is closer to the true solution. In addition, we see that less damping, that is, using one-fourth times as the modeling parameter , gives a lower error as opposed to using lower values of .
This pattern is further illustrated in Figure 1. Figure 1(a) gives the way that the error varies with and Figure 1(b) gives the way that error varies with . Even though the number of coefficients is increased from Experiment 1 to Experiment 2 it is clear that the way that the energy decays has more to do with the need for damping in the POD-VMS model. In Experiment 2, the energy decreases quadratically, and thus the POD-Galerkin approximation gives a reasonable approximation with no damping, and so damping only serves to pollute the solution with an unnecessary approximation error. However, in Experiment 1, the energy decreases only linearly and thus the POD-Galerkin error is improved using VMS damping, and the more damping that is applied to the approximation, the better the results. Thus although we can conclude a consistent approximation when using increasing values of and decreasing values of , we cannot conclude at this time whether there is any optimal way to choose the modeling parameters which might minimize the error of approximation.
Experiment 3. In this experiment, we consider a generalized Oseen problem with Reynolds number 300 (effective viscosity 1/300) where the solenoidal vector field is a highly heterogeneous and investigate the ability of VMS stabilization in improving the POD-Galerkin approximation. Each of the components of the field was illustrated in Figure 2 and was arrived at using a separate computational code and stored for use at each time step. The underlying mesh utilized for this experiment possesses a grid parameter of and 24,168 degrees of freedom.
Table 3 gives the experimental error results for this problem. Notice that we cannot utilize as the exact solution is unknown; thus we only measure the difference between the POD VMS approximation and the underlying finite element approximation. We see for this experiment that using more modes for the stabilization (low ) and a higher value of gives results which are closer to the underlying finite element approximation, thus indicating that a POD VMS stabilization improves the reduced-order approximation for the problem.
Figures 3 and 4 visually illustrate the improvement obtained by VMS stabilization. Each represents the and components of the flow, respectively, and in each figure, (a) gives the result (at time ) for the underling “DNS,” (b) gives the result from the POD-Galerkin approximation and (c) gives the result from the POD-VMS approximation, with . We see in this example the improvement made to the resulting flow using the VMS stabilization.
We have seen the theoretical and computational structure in which the POD-Galerkin method may be applied to a generalized Oseen problem. In addition, we have applied a VMS stabilization and shown that error estimates can be obtained as well that a complex flow can be reproduced. For future work, stabilization methods can be utilized on particular kinds of complex flows, noting that what is usually performed by researchers are computational tricks which tend to indicate improvement for simplistic examples. In particular, we are interested in understanding what occurs dynamically in a POD-Galerkin approximation for flows that are actually complicated dynamically and how POD-Galerkin can be improved using a Petrov-Galerkin approximation.
This research is partially supported by NSF Grant DMS-1016591.
- J. Borggaard, A. Duggleby, A. Hay, T. Iliescu, and Z. Wang, “Reduced-order modeling of turbulent flows,” in Proceedings of the 18th International Symposium on Mathematical Theory of Networks and Systems (MTNS '08), 2008.
- T. Iliescu and Z. Wang, “Variational multiscale proper orthogonal decomposition: convection-dominated convection-diffusion-reaction equations,” Mathematics of Computation, vol. 82, no. 283, pp. 1357–1378, 2013.
- T. Iliescu and Z. Wang, “Variational multiscale proper orthogonal decomposition: Navier-Stokes equations,” Numerical Methods for Partial Differential Equations. In press.
- V. Girault and P.-A. Raviart, Finite Element Methods for Navier-Stokes Equations, vol. 5, Springer, Berlin, Germany, 1986.
- J. Burkardt, M. Gunzburger, and H.-C. Lee, “POD and CVT-based reduced-order modeling of Navier-Stokes flows,” Computer Methods in Applied Mechanics and Engineering, vol. 196, no. 1–3, pp. 337–355, 2006.
- M. D. Gunzburger, J. S. Peterson, and J. N. Shadid, “Reduced-order modeling of time-dependent PDEs with multiple parameters in the boundary data,” Computer Methods in Applied Mechanics and Engineering, vol. 196, no. 4–6, pp. 1030–1047, 2007.
- J. Wang, Y. Wang, and X. Ye, “A robust numerical method for Stokes equations based on divergence-free finite element methods,” SIAM Journal on Scientific Computing, vol. 31, no. 4, pp. 2784–2802, 2009.