Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | A128-A145 |
| Number of pages | 18 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 38 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 12 Jan 2016 |
Keywords
- topology optimization
- domain decomposition
- Newton–Krylov
- preconditioning
- interior point