Please use this identifier to cite or link to this item:
|Title:||Preconditioners for iterative solutions of large-scale linear systems arising from Biot's consolidation equations||Authors:||CHEN XI||Keywords:||Biot's consolidation, iterative solution, QMR, modified SSOR preconditioner, symmetric indefinite linear system, block preconditioner||Issue Date:||21-Apr-2006||Citation:||CHEN XI (2006-04-21). Preconditioners for iterative solutions of large-scale linear systems arising from Biot's consolidation equations. ScholarBank@NUS Repository.||Abstract:||The solution of the linear systems of equation is the most time-consuming part in large-scale finite element analysis. The development of fast preconditioned iterative solution methods are therefore of utmost importance to the field of scientific computing. The objective of this thesis was to investigate the efficient preconditioned iterative strategies as well as to develop robust preconditioning methods in conjunction with suitable iterative methods to solve very large symmetric or weakly nonsymmetric indefinite linear systems arising from the coupled Biot's consolidation equations. More specifically, the comparison study between a block constrained preconditioner (Pc) and a Generalized Jacobi (GJ) preconditioner was carried out and a new robust modified SSOR (MSSOR) preconditioner was proposed. Numerical examples showed that Pc can reduce CPU time about 40% compared to GJ, and MSSOR preconditioner may be extremely robust for large-scale consolidation problems with highly varied soil properties.||URI:||http://scholarbank.nus.edu.sg/handle/10635/15201|
|Appears in Collections:||Ph.D Theses (Open)|
Show full item record
Files in This Item:
|ChenXiThesis.pdf||4.14 MB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.