Darcy-Forchheimer mixed finite element problems are recast as nearly semicoercive convex programs and solved by a multilevel additive Schwarz method with epsilon-robust convergence.
Transformed Primal-Dual Methods with Variable-Preconditioners
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper introduces a novel Transformed Primal-Dual with variable-metric/preconditioner (TPDv) algorithm, designed to efficiently solve affine constrained optimization problems common in nonlinear partial differential equations (PDEs). Diverging from traditional methods, TPDv iteratively updates time-evolving preconditioning operators, enhancing adaptability. The algorithm is derived and analyzed, demonstrating global linear convergence rates under mild assumptions. Numerical experiments on challenging nonlinear PDEs, including the Darcy-Forchheimer model and a nonlinear electromagnetic problem, showcase the algorithm's superiority over existing methods in terms of iteration numbers and computational efficiency. The paper concludes with a comprehensive convergence analysis.
citation-role summary
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Parallel multilevel methods for solving the Darcy--Forchheimer model based on a nearly semicoercive formulation
Darcy-Forchheimer mixed finite element problems are recast as nearly semicoercive convex programs and solved by a multilevel additive Schwarz method with epsilon-robust convergence.