Research Article | Open Access

Volume 2015 |Article ID 572198 | https://doi.org/10.1155/2015/572198

Xingwen Zhu, Lixiang Zhang, "Smoothing Analysis of Distributive Red-Black Jacobi Relaxation for Solving 2D Stokes Flow by Multigrid Method", Mathematical Problems in Engineering, vol. 2015, Article ID 572198, 7 pages, 2015. https://doi.org/10.1155/2015/572198

# Smoothing Analysis of Distributive Red-Black Jacobi Relaxation for Solving 2D Stokes Flow by Multigrid Method

Revised07 Mar 2015
Accepted08 Mar 2015
Published15 Mar 2015

#### Abstract

Smoothing analysis process of distributive red-black Jacobi relaxation in multigrid method for solving 2D Stokes flow is mainly investigated on the nonstaggered grid by using local Fourier analysis (LFA). For multigrid relaxation, the nonstaggered discretizing scheme of Stokes flow is generally stabilized by adding an artificial pressure term. Therefore, an important problem is how to determine the zone of parameter in adding artificial pressure term in order to make stabilization of the algorithm for multigrid relaxation. To end that, a distributive red-black Jacobi relaxation technique for the 2D Stokes flow is established. According to the 2-harmonics invariant subspaces in LFA, the Fourier representation of the distributive red-black Jacobi relaxation for discretizing Stokes flow is given by the form of square matrix, whose eigenvalues are meanwhile analytically computed. Based on optimal one-stage relaxation, a mathematical relation of the parameter in artificial pressure term between the optimal relaxation parameter and related smoothing factor is well yielded. The analysis results show that the numerical schemes for solving 2D Stokes flow by multigrid method on the distributive red-black Jacobi relaxation have a specified convergence parameter zone of the added artificial pressure term.

#### 1. Introduction

Multigrid methods  are generally considered as one of the fastest numerical methods which have an optimally computational complexity for solving partial differential equations (PDEs), especially for 3D steady incompressible Newtonian flow governed by Navier-Stokes equations.

In multigrid methods, smoothing relaxations play an important role. Several multigrid relaxation methods were developed for solving PDEs, which are roughly classified into two categories, collective and decoupled relaxations . The collective relaxations are considered as a straightforward generalization of the scalar case . The early decoupled relaxation is on a distributive Gauss-Seidel relaxation . Gradually, it is generalized to an incomplete LU factorization relaxation . Recently, Stokes system with distributive Gauss-Seidel relaxation based on the least squares commutator has been researched . Much of the relaxations for Stokes system is seen in [12, 13].

For multigrid methods, LFA is a very useful tool to design efficient algorithms and to predict convergence factors for solving PDEs with high order accuracy . Distributive relaxation for poroelasticity equations is optimized by LFA . Using LFA, textbook efficiency multigrid solver for compressible Navier-Stokes equations is designed . All-at-once multigrid approach for optimality systems with LFA is discussed in detail, and an analytical expression of the convergence factors is given by using symbolic computation .

The smoothing analysis of the distributive relaxations for solving 2D Stokes flow is investigated with LFA. As we know, the discretizing Stokes flow in computational domain is not stable by means of standard central differencing on nonstaggered grid. Thus, in order to overcome the stability problem, an artificial pressure term is generally added by the method in [1, 2]. The optimal one-stage relaxation parameter and related smoothing factor of the distributive relaxation with the red-black Jacobi point relaxation need to be developed. In deriving an explicit formulation of the smoothing factor for the multigrid method, the symbolic operation process is carried out by using the MATLAB and Mathematica software, especially, by the cylindrical algebraic decomposition (CAD) function in the Mathematica build-in command .

#### 2. Discretizing Stokes Flow and LFA

##### 2.1. Discrete Stokes Flow

3D steady incompressible Newtonian flow governed by Navier-Stokes equations is given as where is the velocity field, represents the pressure, is the external force field, , and is the Dirichlet boundary of the computing domain. From (1), 2D Stokes operator is written ason nonstaggered grid Discretizing Stokes operator (2) by means of standard central differencing is given aswhere denotes the uniform mesh size and , , and are the second-order difference operator with the following discrete stencils:From , the above nonstaggered schemes (4) are not stable. Stabilization may be achieved by adding an artificial elliptic pressure term to the continuity equation in (2) [1, 2, 6]. With discrete operator in (5) and parameter , the discrete Stokes operator is changed to

##### 2.2. Elements of LFA in Multigrid

In LFA, a current approximation and its corresponding error and residual are represented by a linear combination of certain exponential functions, for example, Fourier modes, which form a unitary basis in space on a bounded infinite grid functions .

From [1, 2], on nonstaggered grid (3), a unitary basis of the Fourier modes is defined byin which is called Fourier frequency, , and complex unit . Thus, a Fourier space is yielded asFrom , applying (3) and (7), for 2D scalar discrete operator with discrete stencil where and containing ; the Fourier mode of (9) is defined by with , subjected to

A main idea of LFA is to analyze relaxation properties in multigrid for (6) by evaluating their effects on the Fourier components. From [2, 14, 16], if standard coarsening in 2D is selected, each low frequency is coupled with three high frequencies in the transition from to , where , andwhere and are denoted by . In this paper, standard coarsening is to be assumed. Then, the Fourier space (8) is subdivided into 2-harmonics subspaces

#### 3. Smoothing Process

##### 3.1. Distributive Relaxation of System (6)

From [1, 2, 7], a distributive operator for the discrete system (6) is constructed aswhere is the unit operator with discrete stencil . From (14), the discrete system (6) is transformed aswhere the discrete stencils of and are From (9)–(11), the Fourier modes of the scalar discrete operators of (16) arewhere

##### 3.2. Optimal One-Stage Relaxation

For the discrete scalar operator of (15), standard coarsening and an ideal coarse grid correction operator  are applied aswhere is the Fourier representation of the operator with subspace (13), which suppresses the low frequency error components and makes the high frequency components unchanged. Then, from , the smoothing factor for discrete operator (9) is defined by It implies that the asymptotic error reduction of the high frequency error components is given by n sweeps of the relaxation method, where is the Fourier representation of the relaxation operator on subspace (13) and is the relaxation parameter.

From [2, 14], a good smoothing factor is obtained by using one-stage parameter in the relaxation operator ; the optimal smoothing factor and related smoothing parameter are given bywhere and are the max and min eigenvalues of the product matrix with the relaxation parameter for . From [2, 19], the smoothing factor of (6) with the distributive relaxation (14) is determined by the diagonal blocks of the transformed system (15), which is given by

##### 3.3. Optimal Smoothing for Stokes Flow

The red-black Jacobi point relaxation is applied to (15) to discuss the optimal smoothing problems for Stokes flow. From [1, 2, 14], the operator makes the 2-harmonics subspace (13) invariant; that is,where is the Fourier representation of with relaxation parameter and is given as in whichdenotes the Fourier mode of the point Jacobi relaxation for the discrete operator (9) on subspace (13) and is the Fourier mode of the discrete operator with the stencil in (9). For the sake of convenient discussion in the following, two variables are introduced asThus, is transformed to .

Theorem 1. For the Poisson operator , the optimal one-stage relaxation parameter and related smoothing factor of the red-black Jacobi point relaxation are stated as

Proof. For the red-black Jacobi point relaxation for the Poisson operator , substituting (12), (18), and (28) into (26) and (27), and from (5), the product of (21) and (25) is written asThus, eigenvalues of (30) are obtained asFrom (31), the max and min eigenvalues of (30) are yielded asFrom (23) and (32), (29) is obtained. Theorem 1 holds.

Next, for the red-black Jacobi point relaxation need to be computed. Meanwhile, the smoothing factor of distributive relaxation (15) is given as follows.

Theorem 2. For the discrete operator with , the optimal one-stage relaxation parameter and related smoothing factor of the red-black Jacobi point relaxation are given by

Proof. For the discrete operator from (17)–(20), the Fourier mode of (34) is given by Thus, when the red-black point relaxation is applied to (34), from (16), substituting (12), (28), and (35) into (26) and (27), the product of (21) and (25) iswhere both and are 2 × 2 square matrices, whose expressions are below:Thus, the eigenvalues of matrix (36) are obtained asBy using the MATLAB and Mathematica software with cylindrical algebraic decomposition function , for , there is no extreme value for (39); when , one of extreme values of (38) is obtained asThus, for , besides (40), the possible extreme values of the eigenvalues of matrix (36) are placed on the boundary of . From with , then . Noting that (40) exists with . From (38)–(40), when , for , the max and min eigenvalues of (36) are yielded asSubstituting (41) into (23), (33) is obtained. Theorem 2 holds.

From (33), holds with . Therefore, from Theorems 1 and 2, when , the smoothing factor of (6) with the distributive relaxation (14) is as

#### 4. Conclusions

The smoothing analysis process of the distributive red-black Jacobi point relaxation for solving 2D Stokes flow is analytically presented. Applying (28), the Fourier modes with the trigonometric functions for the discrete operator and relaxation are mapped to rational functions. So, it is possible to apply the cylindrical algebraic decomposition function in the Mathematica software to realize complex smoothing analysis, and the computation process is simplified. The analytical expressions of the smoothing factor for the distributive red-black Jacobi point relaxation are obtained, which is an upper bound for the smoothing rates and is independent of the mesh size with the parameter . Obviously, it is valuable to understand numerical experiments in multigrid method.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The authors were supported by the National Natural Science Foundation of China (NSFC) (Grant no. 51279071) and the Doctoral Foundation of Ministry of Education of China (Grant no. 20135314130002).

1. U. Trottenberg, C. W. Oosterlee, and A. Schuller, Multigrid, Academic Press, San Diego, Calif, USA, 2001. View at: MathSciNet
2. R. Wienands and W. Joppich, Practical Fourier Analysis for Multigrid Methods, Chapman & Hall, CRC Press, 2005. View at: MathSciNet
3. W. L. Briggs, V. E. Henson, and S. McCormick, A Multigrid Tutorial, Society for Industrial and Applied Mathematics, 2nd edition, 2000. View at: Publisher Site | MathSciNet
4. W. Hackbusch, Multigrid Methods and Applications, Springer, Berlin, Germany, 1985. View at: Publisher Site | MathSciNet
5. P. Wesseling, An Introduction to Multigrid Methods, John Wiley & Sons, Chichester, UK, 1992. View at: MathSciNet
6. K. Stuben and U. Trottenberg, “Multigrid methods: fundamental algorithms, model problem analysis and applications,” in Multigrid Methods, W. Hackbusch and U. Trottenberg, Eds., vol. 960 of Lectwe Notes in Mathematics, pp. 1–176, Springer, Berlin, Germany, 1982. View at: Google Scholar | MathSciNet
7. A. Brandt and O. E. Livne, 1984 Guide to Multigrid Development in Multigrid Methods, Society for Industrial and Applied Mathematics, 2011, http://www.wisdom.weizmann.ac.il/~achi/classics.pdf. View at: Publisher Site
8. C. W. Oosterlee and F. J. G. Lorenz, “Multigrid methods for the stokes system,” Computing in Science and Engineering, vol. 8, no. 6, Article ID 1717313, pp. 34–43, 2006. View at: Publisher Site | Google Scholar
9. A. Brandt and N. Dinar, Multigrid Solutions to Elliptic Llow Problems, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1979.
10. G. Wittum, “Multi-grid methods for stokes and navier-stokes equations,” Numerische Mathematik, vol. 54, no. 5, pp. 543–563, 1989. View at: Publisher Site | Google Scholar | MathSciNet
11. M. Wang and L. Chen, “Multigrid methods for the Stokes equations using distributive Gauss-Seidel relaxations based on the least squares commutator,” Journal of Scientific Computing, vol. 56, no. 2, pp. 409–431, 2013. View at: Publisher Site | Google Scholar | MathSciNet
12. M. ur Rehman, T. Geenen, C. Vuik, G. Segal, and S. P. MacLachlan, “On iterative methods for the incompressible Stokes problem,” International Journal for Numerical Methods in Fluids, vol. 65, no. 10, pp. 1180–1200, 2011. View at: Publisher Site | Google Scholar | MathSciNet
13. C. Bacuta, P. S. Vassilevski, and S. Zhang, “A new approach for solving Stokes systems arising from a distributive relaxation method,” Numerical Methods for Partial Differential Equations, vol. 27, no. 4, pp. 898–914, 2011. View at: Publisher Site | Google Scholar | MathSciNet
14. R. Wienands, F. J. Gaspar, F. J. Lisbona, and C. W. Oosterlee, “An efficient multigrid solver based on distributive smoothing for poroelasticity equations,” Computing, vol. 73, no. 2, pp. 99–119, 2004. View at: Publisher Site | Google Scholar | MathSciNet
15. W. Liao, B. Diskin, Y. Peng, and L.-S. Luo, “Textbook-efficiency multigrid solver for three-dimensional unsteady compressible Navier-Stokes equations,” Journal of Computational Physics, vol. 227, no. 15, pp. 7160–7177, 2008. View at: Publisher Site | Google Scholar | MathSciNet
16. V. Pillwein and S. Takacs, “A local Fourier convergence analysis of a multigrid method using symbolic computation,” Journal of Symbolic Computation, vol. 63, pp. 1–20, 2014. View at: Publisher Site | Google Scholar | MathSciNet
17. S. Takacs, All-at-once multigrid methods for optimality systems arising from optimal control problems [Ph.D. thesis], Johannes Kepler University Linz, Doctoral Program Computational Mathematics, 2012.
18. V. Pillwein and S. Takacs, “Smoothing analysis of an all-at-once multigrid approach for optimal control problems using symboli ccomputation,” in Numerical and Symbolic Scientific Computing: Progress and Prospects, U. Langer and P. Paule, Eds., Springer, Wien, Austria, 2011. View at: Google Scholar
19. M. Kauers, “How to use cylindrical algebraic decomposition,” Seminaire Lotharingien de Combinatoire, vol. 65, article B65a, pp. 1–16, 2011. View at: Google Scholar | MathSciNet

#### More related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.