Computational Technology Resources - CSETS

Keywords: preconditioning, saddle point, Krylov subspace methods, coupled consolidation.

Summary

The finite element (FE) integration of the coupled consolidation equations requires the solution of symmetric 2x2 block linear systems with an indefinite saddle point coefficient matrix. Because of ill-conditioning, the repeated solution in time of the FE linear equations may be a major computational issue requiring ad hoc preconditioning strategies to guarantee the efficient convergence of Krylov subspace methods.

The linear system to be solved at each time step can be generally written as

Ax=b where A=[{A B^T}{B -C}]

In this we review a class of block preconditioners which have been proved very efficient in the acceleration of Krylov solvers in many field such as constrained optimization, the Stokes problem, to mention a few. The inexact constraint preconditioners (ICP) are based on efficient approximations P_A of the (1,1) block A and P_B of the resulting Schur complement matrix S = B P_A^-1 B\T + C. Bergamaschi et al. [1,2] have developed an MCP (mixed constraint preconditioner) which couples two explicit-implicit approximations of the inverse of K provided by an approximate inverse preconditioner such as AINV, and the IC preconditioner, respectively. They compared MCP with a variant called mixed block triangular preconditioner (MBTP).

In this chapter, following the work in [3], we give a detailed spectral analysis of MCP and MBTP, showing that the convergence properties of these block preconditioners for iterative methods are strictly connected with the approximation introduced by P_A and P_B. It is found that the eigenvalues, most of which are complex ones, are well clustered around unity, provided that eigenvalues of P_A^-1A and P_S^-1S are too. The bounds on real and complex eigenvalues are verified on a small test case. A number of test cases from moderate to large size account for the efficiency of the proposed preconditioners. Finally the potential of the parallel MCP approach is tested on a three-dimensional problem of more than 2 million unknowns and 1.2x10⁸ nonzeros showing perfect scalability up to 256 processors.

References

[1]: L. Bergamaschi, M. Ferronato, G. Gambolati, "Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations", Comp. Methods App. Mech. Engrg., 196, 2647-2656, 2007. doi:10.1016/j.cma.2007.01.013
[2]: L. Bergamaschi, M. Ferronato, G. Gambolati, "Mixed constraint preconditioners for the solution to FE coupled consolidation equations", J. Comp. Phys., 227, 9885-9897, 2008. doi:10.1016/j.jcp.2008.08.002
[3]: L. Bergamaschi, "Eigenvalue distribution of constraint preconditioned saddle point matrices", Numer. Lin. Alg. Appl., 2010. (submitted)

purchase the full-text of this chapter (price £20)

go to the previous chapter
go to the next chapter
return to the table of contents
return to the book description
purchase this book (price £98 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Computational Science, Engineering & Technology Series ISSN 1759-3158 CSETS: 26 DEVELOPMENTS AND APPLICATIONS IN ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru and M.L. Romero Chapter 15 Numerical Methods for Saddle Point Problems arising in Geomechanics L. Bergamaschi Department of Mathematical Methods and Models for Scientific Applications, University of Padua, Italy doi:10.4203/csets.26.15 purchase the full-text of this chapter Full Bibliographic Reference for this chapter L. Bergamaschi, "Numerical Methods for Saddle Point Problems arising in Geomechanics", in B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru and M.L. Romero, (Editors), "Developments and Applications in Engineering Computational Technology", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 15, pp 337-361, 2010. doi:10.4203/csets.26.15 Keywords: preconditioning, saddle point, Krylov subspace methods, coupled consolidation. Summary The finite element (FE) integration of the coupled consolidation equations requires the solution of symmetric 2x2 block linear systems with an indefinite saddle point coefficient matrix. Because of ill-conditioning, the repeated solution in time of the FE linear equations may be a major computational issue requiring ad hoc preconditioning strategies to guarantee the efficient convergence of Krylov subspace methods. The linear system to be solved at each time step can be generally written as Ax=b where A=[{A B^T}{B -C}] In this we review a class of block preconditioners which have been proved very efficient in the acceleration of Krylov solvers in many field such as constrained optimization, the Stokes problem, to mention a few. The inexact constraint preconditioners (ICP) are based on efficient approximations P_A of the (1,1) block A and P_B of the resulting Schur complement matrix S = B P_A^-1 B\T + C. Bergamaschi et al. [1,2] have developed an MCP (mixed constraint preconditioner) which couples two explicit-implicit approximations of the inverse of K provided by an approximate inverse preconditioner such as AINV, and the IC preconditioner, respectively. They compared MCP with a variant called mixed block triangular preconditioner (MBTP). In this chapter, following the work in [3], we give a detailed spectral analysis of MCP and MBTP, showing that the convergence properties of these block preconditioners for iterative methods are strictly connected with the approximation introduced by P_A and P_B. It is found that the eigenvalues, most of which are complex ones, are well clustered around unity, provided that eigenvalues of P_A^-1A and P_S^-1S are too. The bounds on real and complex eigenvalues are verified on a small test case. A number of test cases from moderate to large size account for the efficiency of the proposed preconditioners. Finally the potential of the parallel MCP approach is tested on a three-dimensional problem of more than 2 million unknowns and 1.2x10⁸ nonzeros showing perfect scalability up to 256 processors. References [1] L. Bergamaschi, M. Ferronato, G. Gambolati, "Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations", Comp. Methods App. Mech. Engrg., 196, 2647-2656, 2007. doi:10.1016/j.cma.2007.01.013 [2] L. Bergamaschi, M. Ferronato, G. Gambolati, "Mixed constraint preconditioners for the solution to FE coupled consolidation equations", J. Comp. Phys., 227, 9885-9897, 2008. doi:10.1016/j.jcp.2008.08.002 [3] L. Bergamaschi, "Eigenvalue distribution of constraint preconditioned saddle point matrices", Numer. Lin. Alg. Appl., 2010. (submitted) purchase the full-text of this chapter (price £20) go to the previous chapter go to the next chapter return to the table of contents return to the book description purchase this book (price £98 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions