TFETI Scalable Solvers for Transient Contact Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86087931" target="_blank" >RIV/61989100:27240/13:86087931 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/13:86087931 RIV/61989100:27230/13:86087931
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-35275-1_38" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-35275-1_38</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-35275-1_38" target="_blank" >10.1007/978-3-642-35275-1_38</a>
Alternative languages
Result language
angličtina
Original language name
TFETI Scalable Solvers for Transient Contact Problems
Original language description
We review our results obtained by application of the TFETI domain decomposition method to implement the time step of the Newmark scheme for the solution of transient contact problems without friction. If the ratio of the decomposition and discretizationparameters is kept uniformly bounded as well as the ratio of the time and space discretization, then the cost of the time step is proved to be proportional to the number of nodal variables. The algorithm uses our MPRGP algorithm for the solution of strictly convex bound constrained quadratic programming problems with optional preconditioning by the conjugate projector to the subspace defined by the trace of the rigid body motions on the artificial subdomain interfaces. The optimality relies on our results on quadratic programming, the theory of the preconditioning by a conjugate projector for nonlinear problems, and the classical bounds on the spectrum of the mass and stiffness matrices. The results are confirmed by numerical solution o
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/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
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
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
Lecture Notes in Computational Science and Engineering. Volume 91
ISSN
1439-7358
e-ISSN
—
Volume of the periodical
91
Issue of the periodical within the volume
2013
Country of publishing house
DE - GERMANY
Number of pages
8
Pages from-to
329-336
UT code for WoS article
—
EID of the result in the Scopus database
—