A non-overlapping optimization-based domain decomposition approach to model reduction of coupled problems
Please login to view abstract download link
We present a model order reduction procedure to efficiently and accurately solve parameterized coupled problems. Our approach leverages a non-overlapping optimization-based domain decomposition technique to determine the control variable that minimizes jumps across the interfaces between sub-domains. To solve the resulting constrained optimization problem, we propose both Gauss-Newton and sequential quadratic programming methods, which effectively transform the constrained problem into an unconstrained formulation. Furthermore, we integrate model order reduction techniques into the optimization framework, to speed up computations. Numerical results are presented to demonstrate the validity and effectiveness of the overall methodology.