ترغب بنشر مسار تعليمي؟ اضغط هنا

On multi-time-step monolithic coupling algorithms for elastodynamics

49   0   0.0 ( 0 )
 نشر من قبل Kalyana Babu Nakshatrala
 تاريخ النشر 2013
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

We present a way of constructing multi-time-step monolithic coupling methods for elastodynamics. The governing equations for constrained multiple subdomains are written in dual Schur form and enforce the continuity of velocities at system time levels. The resulting equations will be in the form of differential-algebraic equations. To crystallize the ideas we shall employ Newmark family of time-stepping schemes. The proposed method can handle multiple subdomains, and allows different time-steps as well as different time stepping schemes from the Newmark family in different subdomains. We shall use the energy method to assess the numerical stability, and quantify the influence of perturbations under the proposed coupling method. We also discuss the conditions under which the proposed method will be energy preserving, and the conditions under which the method will be energy conserving. Several numerical examples are presented to illustrate the accuracy and stability properties of the proposed method. We shall also compare the proposed multi-time-step coupling method with some other similar methods available in the literature.



قيم البحث

اقرأ أيضاً

In this paper, we explore the suitability of upcoming novel computing technologies, in particular adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applicat ions. We start with simple flows with well-studied flow properties, and provide a framework to convert such systems to a form amenable for deployment on such quantum annealers. We analyze the solutions obtained both qualitatively and quantitatively as well as the sensitivities of the various solution selection schemes on the obtained solution.
246 - Tomoaki Okayama 2016
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined with a prop er variable transformation. The convergence rate has been analyzed for typical cases including finite, semi-infinite, and infinite intervals. Recently, for verified numerical computations, a more explicit, computable error bound has been given in the case of a finite interval. In this paper, such explicit error bounds are derived for other cases.
In this paper, we study the global convergence of majorization minimization (MM) algorithms for solving nonconvex regularized optimization problems. MM algorithms have received great attention in machine learning. However, when applied to nonconvex o ptimization problems, the convergence of MM algorithms is a challenging issue. We introduce theory of the Kurdyka- Lojasiewicz inequality to address this issue. In particular, we show that many nonconvex problems enjoy the Kurdyka- Lojasiewicz property and establish the global convergence result of the corresponding MM procedure. We also extend our result to a well known method that called CCCP (concave-convex procedure).
In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial differential equation s on polytopal meshes. Here, the sequence of spaces that stands at the basis of the multigrid scheme is possibly non nested and is obtained based on employing agglomeration with possible edge/face coarsening. We prove that the method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large.
The paper surveys recent progress in establishing uniqueness and developing inversion formulas and algorithms for the thermoacoustic tomography. In mathematical terms, one deals with a rather special inverse problem for the wave equation. In the case of constant sound speed, it can also be interpreted as a problem concerning the spherical mean transform.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا