Quasi-Newton methods for the acceleration of multi-physics codes

Abstract

Often in nature different physical systems interact which translates to coupled mathematical models. Even if powerful solvers often already exist for problems in a single physical domain (e.g. structural or fluid problems), the development of similar tools for multi-physics problems is still ongoing. When the interaction (or coupling) between the two systems is strong, many methods still fail or are computationally very expensive. Approaches for solving these multi-physics problems can be broadly put in two categories: monolithic or partitioned. While we are not claiming that the partitioned approach is panacea for all coupled problems, here we will only focus our attention on studying methods to solve (strongly) coupled problems with a partitioned approach in which each of the physical problems is solved with a specialized code that we consider to be a black box solver and of which the Jacobian is unknown. We also assume that calling these black boxes is the most expensive part of any algorithm, so that performance is judged by the number of times these are called. Running these black boxes one after another, until convergence is reached, is a standard solution technique and can be considered as a non-linear Gauss-Seidel iteration. It is easy to implement but comes at the cost of slow or even conditional convergence. A recent interpretation of this approach as a rootfinding problem has opened the door to acceleration techniques based on quasi-Newton methods. These quasi-Newton methods can easily be "strapped onto" the original iteration loop without the need to modify the underlying code and with little extra computational cost. In this paper, we analyze the performance of ten acceleration techniques that can be applied to accelerate the convergence of a non-linear Gauss-Seidel iteration, on different multi-physics problems.