A matrix‐free approach for finite‐strain hyperelastic problems using geometric multigrid
نویسندگان
چکیده
منابع مشابه
A stabilized multigrid solver for hyperelastic image registration
Correspondence Lars Ruthotto, Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr, Atlanta, GA 30322, USA. Email: [email protected] Summary Image registration is a central problem in a variety of areas involving imaging techniques and is known to be challenging and ill-posed. Regularization functionals based on hyperelasticity provide a powerful mechanism for limit...
متن کاملGeometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Because the application of algebraic multigrid is usually constrained by an M -matrix condition which does not hold for discretizations of high-order problems, a geometric multigrid framework is developed for the efficient ...
متن کاملA representation for some groups, a geometric approach
In the present paper, we are going to use geometric and topological concepts, entities and properties of the integral curves of linear vector fields, and the theory of differential equations, to establish a representation for some groups on $R^{n} (ngeq 1)$. Among other things, we investigate the surjectivity and faithfulness of the representation. At the end, we give some app...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولParallel Geometric Multigrid
Multigrid methods are among the fastest numerical algorithms for the solution of large sparse systems of linear equations. While these algorithms exhibit asymptotically optimal computational complexity, their efficient parallelisation is hampered by the poor computation-to-communication ratio on the coarse grids. Our contribution discusses parallelisation techniques for geometric multigrid meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2020
ISSN: 0029-5981,1097-0207
DOI: 10.1002/nme.6336