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”

Non-linear scalable TFETI domain decomposition based contact algorithm

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86091987" target="_blank" >RIV/61989100:27240/10:86091987 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/10:86091987

  • Result on the web

    <a href="http://iopscience.iop.org/1757-899X/10/1/012161/pdf/1757-899X_10_1_012161.pdf" target="_blank" >http://iopscience.iop.org/1757-899X/10/1/012161/pdf/1757-899X_10_1_012161.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1088/1757-899X/10/1/012161" target="_blank" >10.1088/1757-899X/10/1/012161</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Non-linear scalable TFETI domain decomposition based contact algorithm

  • Original language description

    The paper is concerned with the application of our original variant of the Finite Element Tearing and Interconnecting (FETI) domain decomposition method, called the Total FETI (TFETI), to solve solid mechanics problems exhibiting geometric, material, andcontact non-linearities. The TFETI enforces the prescribed displacements by the Lagrange multipliers, so that all the subdomains are 'floating', the kernels of their stiffness matrices are known a priori, and the projector to the natural coarse grid ismore effective. The basic theory and relationships of both FETI and TFETI are briefly reviewed and a new version of solution algorithm is presented. It is shown that application of TFETI methodology to the contact problems converts the original problem to the strictly convex quadratic programming problem with bound and equality constraints, so that the effective, in a sense optimal algorithms is to be applied. Numerical experiments show that the method exhibits both numerical and paralle

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2010

  • 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

    IOP Conference Series: Materials Science and Engineering. Volume 10

  • ISBN

  • ISSN

    1757-8981

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    "Article Number: 012161"

  • Publisher name

    IOP Publishing

  • Place of publication

    Bristol

  • Event location

    Sydney

  • Event date

    Jul 19, 2010

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000290445000162