Abstract

A new finite element algorithm for solving elastic and elastoplastic coupled consolidation problems is described. The procedure treats the governing consolidation relations as a system of first-order differential equations and is based on the backward Euler and Thomas and Gladwell schemes with automatic subincrementation of a prescribed series of time increments. The prescribed time increments, which are called coarse time steps, serve to start the procedure and are chosen by the user. The automatic consolidation algorithm attempts to select the time subincrements such that, for a given mesh, the time-stepping (or temporal discretisation) error in the displacements lies close to a specified tolerance. Unlike existing solution techniques, the new algorithm computes not only the displacements and pore pressures, but also their derivatives with respect to time. These extra variables permit a family of unconditionally stable integration algorithms to be constructed which automatically provide an estimate of the local truncation error for each time step. This error estimate is inexpensive to compute and may be used to develop a simple and efficient automatic time stepping mechanism. For the elastic case, the displacements and pore pressures at the end of each subincrement may be solved directly without the need for iteration. For elastoplastic behaviour, however, the governing relationships are non-linear and a system of non-linear equations must be solved to compute the updates. Copyright © 1999 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.