کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6918566 | 862974 | 2012 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
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 optional preconditioning 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 the spectrum 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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Methods in Applied Mechanics and Engineering - Volumes 247â248, 1 November 2012, Pages 37-50
Journal: Computer Methods in Applied Mechanics and Engineering - Volumes 247â248, 1 November 2012, Pages 37-50
نویسندگان
ZdenÄk Dostál, TomáÅ¡ Kozubek, TomáÅ¡ Brzobohatý, Alexandros Markopoulos, OldÅich Vlach,