Logo image
Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot’s problem
Journal article   Peer reviewed

Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot’s problem

X. Chen, K.K. Phoon and K.C. Toh
Computer methods in applied mechanics and engineering, Vol.196(25), pp.2737-2750
01/05/2007

Abstract

Biot’s consolidation equations Generalized Jacobi preconditioner Modified SSOR preconditioner Symmetric indefinite linear system Symmetric quasi-minimal residual method
Finite element analysis of 3-D Biot’s consolidation problem needs fast solution of discretized large 2 × 2 block symmetric indefinite linear systems. In this paper, partitioned iterative methods and global Krylov subspace iterative methods are investigated and compared. The partitioned iterative methods considered include stationary partitioned iteration and non-stationary Prevost’s PCG procedure. The global Krylov subspace methods considered include MINRES and Symmetric QMR (SQMR). Two efficient preconditioners are proposed for global methods. Numerical experiments based on a pile-group problem and simple footing problems with varied soil profiles are carried out. Numerical results show that when used in conjunction with suitable preconditioners, global Krylov subspace iterative methods are more promising for large-scale computations, and further improvement could be possible if significant differences in the solid material properties are addressed in these preconditioned iterative methods.

Metrics

1 Record Views

Details

Logo image