270 likes | 387 Views
A Preconditioned Domain Decomposition Algorithm for Contact Problem. HARRACHOV 2007 A. Lotfi. Abstract: The purpose of this work is to study, the quasistatic two-body contact problem for small strains without friction.
E N D
A Preconditioned Domain Decomposition Algorithm for Contact Problem HARRACHOV 2007 A. Lotfi
Abstract: • The purpose of this work is to study, the quasistatic two-body contact problem for small strains without friction. • To obtain an approximation of this problem, we use the finite element method • Non-overlapping DD method is used to solve the resulting finite element system • Preconditioner construction to solve the interface problem: • The schur complement operator is spectrally equivalent to H1/2 seminorm [3] [4] • The circulant matrix representations of H1/2 seminorm [3] [4] A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
References: • [1] Kikuchi, N. and Oden, J. T.: Contact Problems in Elasticity: A Study of Variational Inequalities and Finite Element Methods. SIAM, Philadelphia (1988). • [2] B. Kiss, G. Molnárka: A preconditioned Domain Decomposition Algorithm for the Solution of the Elliptic Neumann Problem. In: W. Hackbush ed., Parallel Algorithm for PDE, Proceeding of 6th GAMM Seminar, Kiel, 119-129, 1990. • [3] B. Kiss, A. Krebsz.: On the Schur Complement Preconditioners. Computers and Structures, Vol. 73, 537--544, 1999. • [4] B. Kiss, A. Krebsz, K. Szalay.: On the Separability of the H1/2 Seminorm on Convex Polyhedral Domains. HEJ (http: hej.szif.hu) vol(1) ANM-010227-B, 20. A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
OUTLINE • Continuos problem • Variational problem • Finite element discretisation • Domain Decomposition Method and Algorithm • The interface problem • Numerical results A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
Continuos problem A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
Algorithm A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007
Thank you for your attention A Preconditioned DD Algorithm for Contact Problem / HARRACHOV 2007