Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.compstruc.2004.04.012
DC FieldValue
dc.titleBlock constrained versus generalized Jacobi preconditioners for iterative solution of large-scale Biot's fem equations
dc.contributor.authorPhoon, K.K.
dc.contributor.authorToh, K.C.
dc.contributor.authorChen, X.
dc.date.accessioned2014-10-07T06:28:14Z
dc.date.available2014-10-07T06:28:14Z
dc.date.issued2004-11
dc.identifier.citationPhoon, K.K., Toh, K.C., Chen, X. (2004-11). Block constrained versus generalized Jacobi preconditioners for iterative solution of large-scale Biot's fem equations. Computers and Structures 82 (28 SPEC. ISS.) : 2401-2411. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compstruc.2004.04.012
dc.identifier.issn00457949
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/84705
dc.description.abstractGeneralized Jacobi (GJ) diagonal preconditioner coupled with symmetric quasi-minimal residual (SQMR) method has been demonstrated to be efficient for solving the 2 × 2 block linear system of equations arising from discretized Biot's consolidation equations. However, one may further improve the performance by employing a more sophisticated non-diagonal preconditioner. This paper proposes to employ a block constrained preconditioner Pc that uses the same 2 × 2 block matrix but its (1, 1) block is replaced by a diagonal approximation. Numerical results on a series of 3-D footing problems show that the SQMR method preconditioned by Pc is about 55% more efficient time-wise than the counterpart preconditioned by GJ when the problem size increases to about 180,000 degrees of freedom. Over the range of problem sizes studied, the Pc-preconditioned SQMR method incurs about 20% more memory than the GJ-preconditioned counterpart. The paper also addresses crucial computational and storage issues in constructing and storing P c efficiently to achieve superior performance over GJ on the commonly available PC platforms. © 2004 Elsevier Ltd. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.compstruc.2004.04.012
dc.sourceScopus
dc.subjectBiot's consolidation equations
dc.subjectBlock constrained preconditioner Generalized Jacobi preconditioner
dc.subjectSymmetric quasi-minimal residual (SQMR) method
dc.subjectThree-dimensional finite-element discretization
dc.typeConference Paper
dc.contributor.departmentCIVIL ENGINEERING
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.compstruc.2004.04.012
dc.description.sourcetitleComputers and Structures
dc.description.volume82
dc.description.issue28 SPEC. ISS.
dc.description.page2401-2411
dc.description.codenCMSTC
dc.identifier.isiut000225010700005
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

8
checked on Jan 18, 2022

WEB OF SCIENCETM
Citations

7
checked on Jan 18, 2022

Page view(s)

148
checked on Jan 13, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.