๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computational Science and Engineering] Domain Decomposition Methods in Science and Engineering XVII Volume 60 || Domain Decomposition Algorithms for Mortar Discretizations

โœ Scribed by Langer, Ulrich; Discacciati, Marco; Keyes, David E.; Widlund, Olof B.; Zulehner, Walter


Book ID
120062804
Publisher
Springer Berlin Heidelberg
Year
2008
Weight
234 KB
Category
Article
ISBN
3540751998

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computational Science
โœ Mathew, Tarek Poonithara Abraham ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 415 KB

Domain decomposition methods are divide and conquer computational methods for the parallel solution of partial differential equations of elliptic or parabolic type. The methodology includes iterative algorithms, and techniques for non-matching grid discretizations and heterogeneous approximations. T

[Lecture Notes in Computational Science
โœ Barth, Timothy J.; Griebel, Michael; Keyes, David E.; Nieminen, Risto M.; Roose, ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer-Verlag ๐ŸŒ German โš– 297 KB

domain Decomposition Is An Active, Interdisciplinary Research Area That Is Devoted To The Development, Analysis And Implementation Of Coupling And Decoupling Strategies In Mathematics, Computational Science, Engineering And Industry. A Series Of International Conferences Starting In 1987 Set The Sta