All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Scalable TFETI based dynamic contact algorithm

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F11%3A86092851" target="_blank" >RIV/61989100:27230/11:86092851 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/11:86092851

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Scalable TFETI based dynamic contact algorithm

  • Original language description

    The TFETI based domain decomposition method is adapted in order that it can be implemented into the time stepping Newmark scheme for the solution to dynamic frictionless contact problems accompanied by geometric and material non-linear effects. Our approach stems from application of our own in a sense optimal MPGRP algorithm to solution to strictly convex bound constrained quadratic programming problems with preconditioning by the conjugate projector to the subspace defined by the trace of the rigid body modes on the fictitious interfaces between sub-domains. The time integration requires a special treatment to guarantee stability and removal of undesired non-physical oscillation of solution along the contact interfaces. We applied the contact stabilised Newmark scheme that reduces the solution to a sequence of quadratic programming problems with inequality constraints describing the non-interpenetration condition along the contact interfaces. We also show that our transient algorithm can be applied to solution to problems exhibiting both geometric and material non-linearities. Results of numerical experiments document that the proposed algorithm is robust, highly accurate and exhibit both parallel and numerical scalabilities.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA101%2F08%2F0574" target="_blank" >GA101/08/0574: Solution to very complex contact problems with other non-linearities by modern mathematical methods</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the Thirteenth International Conference on Civil, Structural and Environmental Engineering Computing

  • ISBN

    978-1-905088-45-4

  • ISSN

  • e-ISSN

  • Number of pages

    15

  • Pages from-to

    1730-1745

  • Publisher name

    Civil-Comp Press

  • Place of publication

    Kippen, Stirlingshire

  • Event location

    Chania

  • Event date

    Sep 6, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article