This paper presents a preconditioner-based parallel-in-time (PinT) method for solving the quasi-static Biot’s consolidation model in poroelasticity, a problem characterized by stiff coupling and saddle-point structures. To address the computational challenges of the resulting large-scale linear systems, we design two physics-based Schur-complement approximation preconditioners that ensure robust Krylov convergence. Crucially, the method achieves a pipelined space-time architecture by introducing an inverted time-stepping mechanism: Instead of sequential time marching, time steps are traversed in the inner loop, while the outer loop applies an iterative solve across the entire space-time trajectory. This structure relaxes the strict dependency on fully converged solutions at each time step, enabling approximate solutions to be iteratively refined in parallel. Implemented as a pipelined wavefront scheme with strictly nearest-neighbor communication, the algorithm achieves strong scalability. Algorithmic verification conducted on systems with up to 200 thousand degrees of freedom demonstrates stable convergence and sustained strong scaling with up to 128 cores. The proposed approach maintains the accuracy of the underlying finite element discretization while alleviating the “time bottleneck,” making it highly effective for large-scale, long-duration poroelastic simulations.
18 September 2026 in Advances in Computational Mathematics
In this work, we propose and analyze Crank-Nicolson-type iterative decoupled algorithms for a three-field formulation of Biot’s consolidation model using total pressure. These algorithms are derived from an equivalent, reformulated fully coupled system based on the Crank-Nicolson method, which is then decomposed using an iterative decoupled strategy. Two variants are introduced, differing in the solving order of temporal computation and iteration: a time-stepping and a global-in-time approach. The latter is particularly notable for its potential for parallel-in-time computing, offering an efficient approach for long-time simulations. Capitalizing on the properties of the underlying methods, both algorithms are proven to achieve second-order accuracy in time and unconditional stability. Through numerical experiments, we validate theoretical predictions and demonstrate the effectiveness and efficiency of these novel approaches.
This paper focuses on the efficient numerical algorithms of a three-field Biot's consolidation model. The approach begins with the introduction of innovative monolithic and global-in-time iterative decoupled algorithms, which incorporate the backward differentiation formulas for time discretization. In each iteration, these algorithms involve solving a diffusion subproblem over the entire temporal domain, followed by solving a generalized Stokes subproblem over the same time interval. To accelerate the global-in-time iterative process, we present a reduced order modeling approach based on proper orthogonal decomposition, aimed at reducing the primary computational cost from the generalized Stokes subproblem. The effectiveness of this novel method is validated both theoretically and through numerical experiments.