.png){kind=icon}
.png){kind=icon}
Return
Parallel primal-dual active-set algorithm with nonlinear and linear preconditioners
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2024.113630.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The primal-dual active-set (PDAS) algorithm is a well-established and efficient method for addressing complementarity problems. However, the majority of existing approaches primarily concentrate on solving this non-smooth system with linear cases, and the straightforward extension of the primal-dual active-set method for solving nonlinear large-scale engineering problems does not work as well as expected, due to the unbalanced nonlinearities that bring about the difficulty of the slow convergence or stagnation. In the paper, we present the primal- dual active-set method with backtracking on the parallel computing framework for solving the nonlinear complementarity problem (NCP) arising from the discretization of partial differential equations. Some adaptive nonlinear preconditioning strategies based on nonlinear elimination are presented to handle the high nonlinearity of the nonsmooth system, and a family of linear preconditioners based on domain decomposition is developed to enhance the efficiency and scalability of this Newton-type method. Moreover, rigorous proof to establish both the monotone and superlinear convergence of the primal-dual active-set algorithm is also provided for the theoretical analysis. A series of numerical experiments for a family of multiphase reservoir problems, i.e., the CO2 injection model, are carried out to demonstrate the robustness and efficiency of the proposed parallel algorithm.
Keywords:
Reservoir simulation
Primal-dual active-set algorithm
Nonlinear preconditioning
Parallel computing
CO2 storage
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W