Efficient contact solvers based on domain decomposition techniques
نویسندگان
چکیده
منابع مشابه
Towards space-time iterative solvers based on balancing domain decomposition
The usual approach to transient problems is to exploit sequentiality in time, and solve one space problemevery time step. This approach has recently been re-considered, motivated by the forthcoming exascalesupercomputers with billions of cores. This sequential approach has a clear problem, parallelization cannotbe exploited in time. Many key computational engineering problems, e...
متن کاملDiscretization Methods and Iterative Solvers Based on Domain Decomposition
In what case do you like reading so much? What about the type of the discretization methods and iterative solvers based on domain decomposition book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story book, and other entertaining boo...
متن کاملDomain Decomposition Solvers for Frequency-Domain Finite Element Equations
1 Institute for Applied Mathematics and Computational Science, Texas A&M University, College Station, USA, [email protected] 2 Institute of Computational Mathematics, Johannes Kepler University, Linz, Austria, [email protected]; [email protected] 3 Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Linz, Austria, ulrich.lan...
متن کاملHash-Storage Techniques for Adaptive Multilevel Solvers and Their Domain Decomposition Parallelization
Partial differential equations can be solved efficiently by adaptive multigrid methods on a parallel computer. We report on the concepts of hash-table storage techniques and space-filling curves to set up such a code. The hash-table storage requires substantial less amount of memory and is easier to code than tree data structures used in traditional adaptive multigrid codes, already for the seq...
متن کاملParallel 3 D Maxwell Solvers based on Domain Decomposition Data Distribution
The most efficient solvers for finite element (fe) equations are certainly multigrid, or multilevel methods, and domain decomposition methods using local multigrid solvers. Typically, the multigrid convergence rate is independent of the mesh size parameter, and the arithmetical complexity grows linearly with the number of unknowns. However, the standard multigrid algorithms fail for the Maxwell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2001
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(01)00234-6