The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 5 of 11
Back to Result List

SPARSE APPROXIMATE COMPUTATION OF SADDLE POINT PROBLEMS ARISING FROM FETI-DP DISCRETIZATION

  • 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.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.show moreshow less

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Document Type:Conference Proceeding
Author: Kai Schrader, Carsten KönkeORCiDGND
DOI (Cite-Link):https://doi.org/10.25643/bauhaus-universitaet.2887Cite-Link
URN (Cite-Link):https://nbn-resolving.org/urn:nbn:de:gbv:wim2-20170314-28874Cite-Link
URL:http://euklid.bauing.uni-weimar.de/ikm2009/paper.html
ISSN:1611-4086
Editor: Klaus GürlebeckGND, Carsten KönkeORCiDGND
Language:English
Date of Publication (online):2017/03/14
Date of first Publication:2010/07/14
Release Date:2017/03/14
Publishing Institution:Bauhaus-Universität Weimar
Creating Corporation:Bauhaus-Universität Weimar
Institutes and partner institutions:Fakultät Bauingenieurwesen / Institut für Strukturmechanik (ISM)
Pagenumber:12
Tag:Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing
GND Keyword:Angewandte Informatik; Angewandte Mathematik; Architektur <Informatik>; Computerunterstütztes Verfahren
Dewey Decimal Classification:000 Informatik, Informationswissenschaft, allgemeine Werke / 000 Informatik, Wissen, Systeme
500 Naturwissenschaften und Mathematik / 510 Mathematik
BKL-Classification:31 Mathematik / 31.80 Angewandte Mathematik
56 Bauwesen / 56.03 Methoden im Bauingenieurwesen
Collections:Bauhaus-Universität Weimar / Internationales Kolloquium über Anwendungen der Informatik und Mathematik in Architektur und Bauwesen, IKM, Weimar / Internationales Kolloquium über Anwendungen der Informatik und Mathematik in Architektur und Bauwesen, IKM, Weimar, 18. 2009
Licence (German):License Logo Creative Commons 4.0 - Namensnennung-Nicht kommerziell (CC BY-NC 4.0)