%0 Book %1 Wohlmuth2001Discretization %A Wohlmuth, Barbara I. %B Lecture Notes in Computational Science and Engineering %C Berlin %D 2001 %I Springer %K 65n55-pdes-bvps-multigrid-methods-domain-decomposition %R 10.1007/978-3-642-56767-4 %T Discretization methods and iterative solvers based on domain decomposition %U https://link.springer.com/book/10.1007%2F978-3-642-56767-4#about %X Domain decomposition methods provide powerful and flexible tools for the numerical approximation of partial differential equations arising in the modeling of many interesting applications in science and engineering. This book deals with discretization techniques on non-matching triangulations and iterative solvers with particular emphasis on mortar finite elements, Schwarz methods and multigrid techniques. New results on non-standard situations as mortar methods based on dual basis functions and vector field discretizations are analyzed and illustrated by numerical results. The role of trace theorems, harmonic extensions, dual norms and weak interface conditions is emphasized. Although the original idea was used successfully more than a hundred years ago, these methods are relatively new for the numerical approximation. The possibilites of high performance computations and the interest in large- scale problems have led to an increased research activity. %@ 354041083

@book{Wohlmuth2001Discretization, abstract = {Domain decomposition methods provide powerful and flexible tools for the numerical approximation of partial differential equations arising in the modeling of many interesting applications in science and engineering. This book deals with discretization techniques on non-matching triangulations and iterative solvers with particular emphasis on mortar finite elements, Schwarz methods and multigrid techniques. New results on non-standard situations as mortar methods based on dual basis functions and vector field discretizations are analyzed and illustrated by numerical results. The role of trace theorems, harmonic extensions, dual norms and weak interface conditions is emphasized. Although the original idea was used successfully more than a hundred years ago, these methods are relatively new for the numerical approximation. The possibilites of high performance computations and the interest in large- scale problems have led to an increased research activity.}, added-at = {2019-03-01T00:11:50.000+0100}, address = {Berlin}, author = {Wohlmuth, Barbara I.}, biburl = {https://www.bibsonomy.org/bibtex/2cbb5af670de5feb2e45fc60f326d63d4/gdmcbain}, citeulike-article-id = {14649534}, citeulike-linkout-0 = {http://www.worldcat.org/isbn/354041083}, citeulike-linkout-1 = {http://books.google.com/books?vid=ISBN354041083}, citeulike-linkout-2 = {http://www.amazon.com/gp/search?keywords=354041083\&index=books\&linkCode=qs}, citeulike-linkout-3 = {http://www.librarything.com/isbn/354041083}, citeulike-linkout-4 = {http://www.worldcat.org/oclc/468572999}, doi = {10.1007/978-3-642-56767-4}, interhash = {dfd256b782aba6fd557b5ba24ae75138}, intrahash = {cbb5af670de5feb2e45fc60f326d63d4}, isbn = {354041083}, keywords = {65n55-pdes-bvps-multigrid-methods-domain-decomposition}, posted-at = {2018-10-30 19:02:30}, priority = {4}, publisher = {Springer}, series = {Lecture Notes in Computational Science and Engineering}, timestamp = {2022-01-02T10:50:11.000+0100}, title = {{Discretization methods and iterative solvers based on domain decomposition}}, url = {https://link.springer.com/book/10.1007%2F978-3-642-56767-4#about}, year = 2001 }