Abstract
Hierarchical matrices provide a technique for the data-sparse approximation and matrix arithmetic of large, fully populated matrices. In particular, approximate inverses as well as approximate LU factorizations of finite element stiffness matrices may be computed and stored in nearly optimal complexity. In this paper, we develop efficient \(\mathcal{H}\)-matrix preconditioners for the Oseen equations. In particular, \(\mathcal{H}\)-matrices will provide efficient preconditioners for the auxiliary (scalar) discrete convection–diffusion and pressure Schur complement problems. We will provide various numerical tests comparing the resulting preconditioners with each other.
Similar content being viewed by others
References
Bank R.E., Welfert B.D. and Yserentant H. (1990). A class of iterative methods for solving saddle point problems.. Numer. Math. 56: 645–666
Bebendorf, M., Hackbusch, W.: Existence of \(\mathcal{H}\)-matrix approximants to the inverse FE-matrix of elliptic operators with L ∞-coefficients. Numer. Math. 95:1–28 (2003)
Bebendorf, M.: Why approximate LU decompositions of finite element discretizations of elliptic operators can be computed with almost linear complexity. Technical Report 8. Max-Planck-Institute for Mathematics in the Sciences, Leipzig (2005)
Benzi M., Golub G.H. and Liesen J. (2005). Numerical solution of saddle point problems. Acta Numerica 14: 1–137
Börm, S., Grasedyck, L., Hackbusch, W.: Hierarchical Matrices. Lecture Notes No. 21. Max-Planck-Institute for Mathematics in the Sciences, Leipzig (2003)
Braess D. and Sarazin R. (1997). An efficient smoother for the Stokes problem. Appl. Numer. Math. 23: 1–19
De Sturler E. and Liesen J. (2005). Block-diagonal and constraint preconditioners for nonsymmetric indefinite linear systems. Part I: Theory. SIAM J. Sci. Comput. 26: 1598–1619
Grasedyck, L., Hackbusch,W.: Construction and arithmetics of \(\mathcal{H}\)-matrices. Computing 70: 295–334 (2003)
Grasedyck, L., Hackbusch, W., Le Borne, S.: Adaptive geometrically balanced clustering of \(\mathcal{H}\)-matrices. Computing 73: 1–23 (2003)
Grasedyck, L., Kriemann, R., Le Borne, S.: Parallel Black Box Domain Decomposition Based \(\mathcal{H}\)-LU Preconditioning, Preprint No. 115. Max-Planck-Institute for Mathematics in the Sciences, Leipzig (2005)
Grasedyck, L., Le Borne, S.: \({\mathcal{H}}\) -matrix preconditioners in convection-dominated problems. SIAM J. Math. Anal. 27:1172–1183 (2006)
Hackbusch, W.: A sparse matrix arithmetic based on \(\mathcal{H}\)-matrices. Part I: Introduction to \(\mathcal{H}\)-matrices. Computing 62, 89–108 (1999)
Hackbusch,W., Khoromskij, B.: A sparse \(\mathcal{H}\)-matrix arithmetic. Part II: Application to multi-dimensional problems. Computing 64,21–47 (2000)
Hackbusch W., Grasedyck L. and Börm S. (2002). An introduction to hierarchical matrices. Math. Bohem. 127: 229–241
Le Borne, S., Grasedyck, L., Kriemann, R.: Domain-decomposition based H-LU preconditioners. In: Lecture Notes in Computational Science and Engineering. Springer, Heidelberg (2005) (to appear). Online avalaible at www.ddm.org
Murphy M.F., Golub G.H. and Wathen A.J. (2000). A note on preconditioning for indefinite linear systems. SIAM J. Sci. Comput. 21: 1969–1972
Roos, H.G., Stynes, M., Tobiska, L.: Numerical methods for singularly perturbed differential equations: convection–diffusion and flow problems. Comput. Math. 24 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. Oosterlee.
This work was supported in part by the US Department of Energy under Grant No. DE-FG02-04ER25649 and in part by the National Science Foundation under grant No. DMS-0408950.
Rights and permissions
About this article
Cite this article
Le Borne, S. Hierarchical matrix preconditioners for the Oseen equations. Comput. Visual Sci. 11, 147–157 (2008). https://doi.org/10.1007/s00791-007-0065-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00791-007-0065-x