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 with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86084365" target="_blank" >RIV/61989100:27240/12:86084365 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/12:86084365

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.cma.2012.08.003" target="_blank" >http://dx.doi.org/10.1016/j.cma.2012.08.003</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cma.2012.08.003" target="_blank" >10.1016/j.cma.2012.08.003</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity

  • Original language description

    The FETI based domain decomposition method is adapted to implement the time step of the Newmark scheme for the solution of dynamic contact problems without friction. If the ratio of the decomposition and discretization parameters is kept uniformly bounded, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our in a sense optimal MPRGP algorithm for the solution of strictly convex bound constrained quadratic programming problems with optionalpreconditioning by the conjugate projector to the subspace defined by the trace of the rigid body motions on the artificial subdomain interfaces. The proof of optimality combines the convergence theory of our MPRGP algorithm, the classical bounds on thespectrum of the mass and stiffness matrices, and our theory of the preconditioning by a conjugate projector for nonlinear problems. The results are confirmed by numerical solution of 2D and 3D dynamic contact problems.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2012

  • 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

  • Name of the periodical

    Computer Methods in Applied Mechanics and Engineering

  • ISSN

    0045-7825

  • e-ISSN

  • Volume of the periodical

    247

  • Issue of the periodical within the volume

    Neuveden

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    14

  • Pages from-to

    37-50

  • UT code for WoS article

    000310944400003

  • EID of the result in the Scopus database