An adaptive time stepping algorithm for IMPES with high order polynomial extrapolation

• Published in: Applied Mathematical Modelling 2021-03, Vol.91, p.1100-1116
• Main Authors: Paz, Stevens, Jaramillo, Alfredo, Guiraldello, Rafael T., Ausas, Roberto F., Sousa, Fabricio S., Pereira, Felipe, Buscaglia, Gustavo C.
• Format: Article
• Language: English
• Subjects: Adaptive algorithms; Algorithms; Computational fluid dynamics; Conservation laws; Darcys law; Fluid flow; IMPES; Optimization; Partial differential equations; Polynomials; Saturation; Saturation transport; Skipping number; Solvers; Two phase flow; Velocity; Velocity extrapolation
• ISSN: 0307-904X; 1088-8691; 0307-904X
• DOI: 10.1016/j.apm.2020.10.045

•Step-by-step procedure to introduce an adaptive time algorithm into the IMPES method.•High order polynomial extrapolation to compute accurate fluxes and saturation fields.•Calculation of optimal time-stepping ratios in the time-marching process.•Results showing the adaptive time process in sudden transients in oil reservoirs. Two-phase flows in oil reservoirs can be modeled by a coupled system of elliptic and hyperbolic partial differential equations. The transport velocity of the multiphase fluid system is related to the pressure through Darcy’s law and it is coupled to a conservation law for the saturation variable of one of the phases. A time step of the classical IMPES (IMplicit Pressure Explicit Saturation) method consists of first solving the elliptic problem for pressure and Darcy velocity, and then updating the saturation with an explicit numerical scheme for conservation laws. This method is very computationally costly, since the time-consuming elliptic solver must be invoked at time intervals defined by the stability limit of the hyperbolic solver. A popular variant is not to update the velocity at all hyperbolic time steps, but to skip a fixed number C of them, with C determined by the user. In this work we propose a more accurate and systematic procedure for time stepping in IMPES codes. The velocity is updated at all transport time steps, though the elliptic solver is only invoked every C steps. In the time steps at which the elliptic problem is not solved, the velocity is extrapolated from previously computed values with polynomials of high degree. Further, we introduce an error estimator that allows for the number C to be adaptively determined without user intervention. The algorithm was tested in several relevant benchmark problems. This allowed for the optimization of its parameters and comparisons with previous variants. The results show that the proposed algorithm is very stable, reliable and time-cost effective. It is also easily implemented in pre-existent IMPES codes.