@inproceedings{SchraderKoenke,
author = {Schrader, Kai and K{\"o}nke, Carsten},
title = {SPARSE APPROXIMATE COMPUTATION OF SADDLE POINT PROBLEMS ARISING FROM FETI-DP DISCRETIZATION},
editor = {G{\"u}rlebeck, Klaus and K{\"o}nke, Carsten},
organization = {Bauhaus-Universit{\"a}t Weimar},
issn = {1611-4086},
doi = {10.25643/bauhaus-universitaet.2887},
url = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20170314-28874},
pages = {12},
abstract = {The numerical simulation of microstructure models in 3D requires, due to enormous d.o.f., significant resources of memory as well as parallel computational power. Compared to homogeneous materials, the material hetrogeneity on microscale induced by different material phases demand for adequate computational methods for discretization and solution process of the resulting highly nonlinear problem. To enable an efficient/scalable solution process of the linearized equation systems the heterogeneous FE problem will be described by a FETI-DP (Finite Element Tearing and Interconnecting - Dual Primal) discretization. The fundamental FETI-DP equation can be solved by a number of different approaches. In our approach the FETI-DP problem will be reformulated as Saddle Point system, by eliminating the primal and Lagrangian variables. For the reduced Saddle Point system, only defined by interior and dual variables, special Uzawa algorithms can be adapted for iteratively solving the FETI-DP saddle-point equation system (FETI-DP SPE). A conjugate gradient version of the Uzawa algorithm will be shown as well as some numerical tests regarding to FETI-DP discretization of small examples using the presented solution technique. Furthermore the inversion of the interior-dual Schur complement operator can be approximated using different techniques building an adequate preconditioning matrix and therewith leading to substantial gains in computing time efficiency.},
subject = {Angewandte Informatik},
language = {en}
}