Daniel Loghin

James Turner, Michal Kocvara, Daniel Loghin

In this paper, we aim to solve the system of equations governing linear elasticity in parallel using domain decomposition. Through a non-overlapping decomposition of the domain, our approach aims to target the resulting interface problem, allowing for the parallel computation of solutions in an efficient manner. As a major application of our work, we apply our results to the field of topology optimization, where typical solvers require repeated solutions of linear elasticity problems resulting from the use of a Picard approach.

Michal Kocvara, Daniel Loghin, James Turner

The discretization of constrained nonlinear optimization problems arising in the field of topology optimization yields algebraic systems which are challenging to solve in practice, due to pathological ill-conditioning, strong nonlinearity and size. In this work we propose a methodology which brings together existing fast algorithms, namely, interior-point for the optimization problem and a novel substructuring domain decomposition method for the ensuing large-scale linear systems. The main contribution is the choice of interface preconditioner which allows for the acceleration of the domain decomposition method, leading to performance independent of problem size.