Discretization Methods and Iterative Solvers Based on Domain Decomposition:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001
|
Schriftenreihe: | Lecture Notes in Computational Science and Engineering
17 |
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | 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 |
Beschreibung: | 1 Online-Ressource (X, 199p. 82 illus) |
ISBN: | 9783642567674 9783540410836 |
ISSN: | 1439-7358 |
DOI: | 10.1007/978-3-642-56767-4 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV042422657 | ||
003 | DE-604 | ||
005 | 20180116 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s2001 |||| o||u| ||||||eng d | ||
020 | |a 9783642567674 |c Online |9 978-3-642-56767-4 | ||
020 | |a 9783540410836 |c Print |9 978-3-540-41083-6 | ||
024 | 7 | |a 10.1007/978-3-642-56767-4 |2 doi | |
035 | |a (OCoLC)1184364152 | ||
035 | |a (DE-599)BVBBV042422657 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
082 | 0 | |a 004 |2 23 | |
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Wohlmuth, Barbara |d 1967- |e Verfasser |0 (DE-588)11316520X |4 aut | |
245 | 1 | 0 | |a Discretization Methods and Iterative Solvers Based on Domain Decomposition |c by Barbara I. Wohlmuth |
264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2001 | |
300 | |a 1 Online-Ressource (X, 199p. 82 illus) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Lecture Notes in Computational Science and Engineering |v 17 |x 1439-7358 | |
500 | |a 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 | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Computer science | |
650 | 4 | |a Engineering | |
650 | 4 | |a Computational Science and Engineering | |
650 | 4 | |a Math Applications in Computer Science | |
650 | 4 | |a Computational Intelligence | |
650 | 4 | |a Informatik | |
650 | 4 | |a Ingenieurwissenschaften | |
650 | 4 | |a Mathematik | |
650 | 0 | 7 | |a Partielle Differentialgleichung |0 (DE-588)4044779-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Diskretisierung |0 (DE-588)4012469-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Iteration |0 (DE-588)4123457-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Gebietszerlegungsmethode |0 (DE-588)4309232-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Randwertproblem |0 (DE-588)4048395-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Partielle Differentialgleichung |0 (DE-588)4044779-0 |D s |
689 | 0 | 1 | |a Randwertproblem |0 (DE-588)4048395-2 |D s |
689 | 0 | 2 | |a Diskretisierung |0 (DE-588)4012469-1 |D s |
689 | 0 | 3 | |a Iteration |0 (DE-588)4123457-1 |D s |
689 | 0 | 4 | |a Gebietszerlegungsmethode |0 (DE-588)4309232-9 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-56767-4 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
999 | |a oai:aleph.bib-bvb.de:BVB01-027858074 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804153097722789888 |
---|---|
any_adam_object | |
author | Wohlmuth, Barbara 1967- |
author_GND | (DE-588)11316520X |
author_facet | Wohlmuth, Barbara 1967- |
author_role | aut |
author_sort | Wohlmuth, Barbara 1967- |
author_variant | b w bw |
building | Verbundindex |
bvnumber | BV042422657 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)1184364152 (DE-599)BVBBV042422657 |
dewey-full | 004 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004 |
dewey-search | 004 |
dewey-sort | 14 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
doi_str_mv | 10.1007/978-3-642-56767-4 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03326nmm a2200613zcb4500</leader><controlfield tag="001">BV042422657</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180116 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642567674</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-56767-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540410836</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-540-41083-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-56767-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184364152</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042422657</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wohlmuth, Barbara</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)11316520X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discretization Methods and Iterative Solvers Based on Domain Decomposition</subfield><subfield code="c">by Barbara I. Wohlmuth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 199p. 82 illus)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lecture Notes in Computational Science and Engineering</subfield><subfield code="v">17</subfield><subfield code="x">1439-7358</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Science and Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Math Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ingenieurwissenschaften</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Partielle Differentialgleichung</subfield><subfield code="0">(DE-588)4044779-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskretisierung</subfield><subfield code="0">(DE-588)4012469-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gebietszerlegungsmethode</subfield><subfield code="0">(DE-588)4309232-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randwertproblem</subfield><subfield code="0">(DE-588)4048395-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Partielle Differentialgleichung</subfield><subfield code="0">(DE-588)4044779-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Randwertproblem</subfield><subfield code="0">(DE-588)4048395-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Diskretisierung</subfield><subfield code="0">(DE-588)4012469-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Gebietszerlegungsmethode</subfield><subfield code="0">(DE-588)4309232-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-56767-4</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027858074</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
id | DE-604.BV042422657 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:21:11Z |
institution | BVB |
isbn | 9783642567674 9783540410836 |
issn | 1439-7358 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027858074 |
oclc_num | 1184364152 |
open_access_boolean | |
owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
physical | 1 Online-Ressource (X, 199p. 82 illus) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer Berlin Heidelberg |
record_format | marc |
series2 | Lecture Notes in Computational Science and Engineering |
spelling | Wohlmuth, Barbara 1967- Verfasser (DE-588)11316520X aut Discretization Methods and Iterative Solvers Based on Domain Decomposition by Barbara I. Wohlmuth Berlin, Heidelberg Springer Berlin Heidelberg 2001 1 Online-Ressource (X, 199p. 82 illus) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computational Science and Engineering 17 1439-7358 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 Mathematics Computer science Engineering Computational Science and Engineering Math Applications in Computer Science Computational Intelligence Informatik Ingenieurwissenschaften Mathematik Partielle Differentialgleichung (DE-588)4044779-0 gnd rswk-swf Diskretisierung (DE-588)4012469-1 gnd rswk-swf Iteration (DE-588)4123457-1 gnd rswk-swf Gebietszerlegungsmethode (DE-588)4309232-9 gnd rswk-swf Randwertproblem (DE-588)4048395-2 gnd rswk-swf Partielle Differentialgleichung (DE-588)4044779-0 s Randwertproblem (DE-588)4048395-2 s Diskretisierung (DE-588)4012469-1 s Iteration (DE-588)4123457-1 s Gebietszerlegungsmethode (DE-588)4309232-9 s 1\p DE-604 https://doi.org/10.1007/978-3-642-56767-4 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Wohlmuth, Barbara 1967- Discretization Methods and Iterative Solvers Based on Domain Decomposition Mathematics Computer science Engineering Computational Science and Engineering Math Applications in Computer Science Computational Intelligence Informatik Ingenieurwissenschaften Mathematik Partielle Differentialgleichung (DE-588)4044779-0 gnd Diskretisierung (DE-588)4012469-1 gnd Iteration (DE-588)4123457-1 gnd Gebietszerlegungsmethode (DE-588)4309232-9 gnd Randwertproblem (DE-588)4048395-2 gnd |
subject_GND | (DE-588)4044779-0 (DE-588)4012469-1 (DE-588)4123457-1 (DE-588)4309232-9 (DE-588)4048395-2 |
title | Discretization Methods and Iterative Solvers Based on Domain Decomposition |
title_auth | Discretization Methods and Iterative Solvers Based on Domain Decomposition |
title_exact_search | Discretization Methods and Iterative Solvers Based on Domain Decomposition |
title_full | Discretization Methods and Iterative Solvers Based on Domain Decomposition by Barbara I. Wohlmuth |
title_fullStr | Discretization Methods and Iterative Solvers Based on Domain Decomposition by Barbara I. Wohlmuth |
title_full_unstemmed | Discretization Methods and Iterative Solvers Based on Domain Decomposition by Barbara I. Wohlmuth |
title_short | Discretization Methods and Iterative Solvers Based on Domain Decomposition |
title_sort | discretization methods and iterative solvers based on domain decomposition |
topic | Mathematics Computer science Engineering Computational Science and Engineering Math Applications in Computer Science Computational Intelligence Informatik Ingenieurwissenschaften Mathematik Partielle Differentialgleichung (DE-588)4044779-0 gnd Diskretisierung (DE-588)4012469-1 gnd Iteration (DE-588)4123457-1 gnd Gebietszerlegungsmethode (DE-588)4309232-9 gnd Randwertproblem (DE-588)4048395-2 gnd |
topic_facet | Mathematics Computer science Engineering Computational Science and Engineering Math Applications in Computer Science Computational Intelligence Informatik Ingenieurwissenschaften Mathematik Partielle Differentialgleichung Diskretisierung Iteration Gebietszerlegungsmethode Randwertproblem |
url | https://doi.org/10.1007/978-3-642-56767-4 |
work_keys_str_mv | AT wohlmuthbarbara discretizationmethodsanditerativesolversbasedondomaindecomposition |