A domain decomposition strategy to efficiently solve structures containing repeated patterns

From MaRDI portal
Publication:3549784

DOI10.1002/NME.2517zbMATH Open1183.74277arXiv1208.6387OpenAlexW3124183544MaRDI QIDQ3549784FDOQ3549784

Daniel Rixen, Pierre Gosselet, Christian Rey

Publication date: 29 March 2010

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Abstract: This paper presents a strategy for the computation of structures with repeated patterns based on domain decomposition and block Krylov solvers. It can be seen as a special variant of the FETI method. We propose using the presence of repeated domains in the problem to compute the solution by minimizing the interface error on several directions simultaneously. The method not only drastically decreases the size of the problems to solve but also accelerates the convergence of interface problem for nearly no additional computational cost and minimizes expensive memory accesses. The numerical performances are illustrated on some thermal and elastic academic problems.


Full work available at URL: https://arxiv.org/abs/1208.6387




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: A domain decomposition strategy to efficiently solve structures containing repeated patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549784)