Matrix-Based Multigrid: Theory and Applications
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA
Springer US
2003
|
| Series: | Numerical Methods and Algorithms
2 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | Many important problems in applied science and engineering, such as the NavierStokes equations in fluid dynamics, the primitive equations in global climate modeling, the strain-stress equations in mechanics, the neutron diffusion equations in nuclear engineering, and MRIICT medical simulations, involve complicated systems of nonlinear partial differential equations. When discretized, such problems produce extremely large, nonlinear systems of equations, whose numerical solution is prohibitively costly in terms of time and storage. High-performance (parallel) computers and efficient (parallelizable) algorithms are clearly necessary. Three classical approaches to the solution of such systems are: Newton's method, Preconditioned Conjugate Gradients (and related Krylov-space acceleration techniques), and multigrid methods. The first two approaches require the solution of large sparse linear systems at every iteration, which are themselves often solved by multigrid methods. Developing robust and efficient multigrid algorithms is thus of great importance. The original multigrid algorithm was developed for the Poisson equation in a square, discretized by finite differences on a uniform grid. For this model problem, multigrid exhibits extremely rapid convergence, and actually solves the problem in the minimal possible time. The original algorithm uses rediscretization of the partial differential equation (POE) on each grid in the hierarchy of coarse grids that are used. However, this approach would not work for more complicated problems, such as problems on complicated domains and nonuniform grids, problems with variable coefficients, and non symmetric and indefinite equations. In these cases, matrix-based multi grid methods are in order |
| Physical Description: | 1 Online-Ressource (XVI, 221 p) |
| ISBN: | 9781475737264 9781475737288 |
| ISSN: | 1571-5698 |
| DOI: | 10.1007/978-1-4757-3726-4 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042421516 | ||
| 003 | DE-604 | ||
| 005 | 20180123 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475737264 |c Online |9 978-1-4757-3726-4 | ||
| 020 | |a 9781475737288 |c Print |9 978-1-4757-3728-8 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3726-4 |2 doi | |
| 035 | |a (OCoLC)1184499053 | ||
| 035 | |a (DE-599)BVBBV042421516 | ||
| 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 518 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Shapira, Yair |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Matrix-Based Multigrid |b Theory and Applications |c by Yair Shapira |
| 264 | 1 | |a Boston, MA |b Springer US |c 2003 | |
| 300 | |a 1 Online-Ressource (XVI, 221 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Numerical Methods and Algorithms |v 2 |x 1571-5698 | |
| 500 | |a Many important problems in applied science and engineering, such as the NavierStokes equations in fluid dynamics, the primitive equations in global climate modeling, the strain-stress equations in mechanics, the neutron diffusion equations in nuclear engineering, and MRIICT medical simulations, involve complicated systems of nonlinear partial differential equations. When discretized, such problems produce extremely large, nonlinear systems of equations, whose numerical solution is prohibitively costly in terms of time and storage. High-performance (parallel) computers and efficient (parallelizable) algorithms are clearly necessary. Three classical approaches to the solution of such systems are: Newton's method, Preconditioned Conjugate Gradients (and related Krylov-space acceleration techniques), and multigrid methods. The first two approaches require the solution of large sparse linear systems at every iteration, which are themselves often solved by multigrid methods. Developing robust and efficient multigrid algorithms is thus of great importance. The original multigrid algorithm was developed for the Poisson equation in a square, discretized by finite differences on a uniform grid. For this model problem, multigrid exhibits extremely rapid convergence, and actually solves the problem in the minimal possible time. The original algorithm uses rediscretization of the partial differential equation (POE) on each grid in the hierarchy of coarse grids that are used. However, this approach would not work for more complicated problems, such as problems on complicated domains and nonuniform grids, problems with variable coefficients, and non symmetric and indefinite equations. In these cases, matrix-based multi grid methods are in order | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Electronic data processing | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Computational Mathematics and Numerical Analysis | |
| 650 | 4 | |a Numeric Computing | |
| 650 | 4 | |a Mathematics of Computing | |
| 650 | 4 | |a Applications of Mathematics | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Matrizenrechnung |0 (DE-588)4126963-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mehrgitterverfahren |0 (DE-588)4038376-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Differentialgleichung |0 (DE-588)4012249-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mehrgitterverfahren |0 (DE-588)4038376-3 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Differentialgleichung |0 (DE-588)4012249-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Matrizenrechnung |0 (DE-588)4126963-9 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 830 | 0 | |a Numerical Methods and Algorithms |v 2 |w (DE-604)BV016934978 |9 2 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3726-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-027856933 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804153094673530880 |
|---|---|
| any_adam_object | |
| author | Shapira, Yair |
| author_facet | Shapira, Yair |
| author_role | aut |
| author_sort | Shapira, Yair |
| author_variant | y s ys |
| building | Verbundindex |
| bvnumber | BV042421516 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184499053 (DE-599)BVBBV042421516 |
| dewey-full | 518 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518 |
| dewey-search | 518 |
| dewey-sort | 3518 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4757-3726-4 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04141nmm a2200649zcb4500</leader><controlfield tag="001">BV042421516</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180123 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475737264</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-3726-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475737288</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4757-3728-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3726-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184499053</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421516</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">518</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">Shapira, Yair</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matrix-Based Multigrid</subfield><subfield code="b">Theory and Applications</subfield><subfield code="c">by Yair Shapira</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 221 p)</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="1" ind2=" "><subfield code="a">Numerical Methods and Algorithms</subfield><subfield code="v">2</subfield><subfield code="x">1571-5698</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Many important problems in applied science and engineering, such as the NavierStokes equations in fluid dynamics, the primitive equations in global climate modeling, the strain-stress equations in mechanics, the neutron diffusion equations in nuclear engineering, and MRIICT medical simulations, involve complicated systems of nonlinear partial differential equations. When discretized, such problems produce extremely large, nonlinear systems of equations, whose numerical solution is prohibitively costly in terms of time and storage. High-performance (parallel) computers and efficient (parallelizable) algorithms are clearly necessary. Three classical approaches to the solution of such systems are: Newton's method, Preconditioned Conjugate Gradients (and related Krylov-space acceleration techniques), and multigrid methods. The first two approaches require the solution of large sparse linear systems at every iteration, which are themselves often solved by multigrid methods. Developing robust and efficient multigrid algorithms is thus of great importance. The original multigrid algorithm was developed for the Poisson equation in a square, discretized by finite differences on a uniform grid. For this model problem, multigrid exhibits extremely rapid convergence, and actually solves the problem in the minimal possible time. The original algorithm uses rediscretization of the partial differential equation (POE) on each grid in the hierarchy of coarse grids that are used. However, this approach would not work for more complicated problems, such as problems on complicated domains and nonuniform grids, problems with variable coefficients, and non symmetric and indefinite equations. In these cases, matrix-based multi grid methods are in order</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">Electronic data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematics and Numerical Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numeric Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Applications of Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matrizenrechnung</subfield><subfield code="0">(DE-588)4126963-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrgitterverfahren</subfield><subfield code="0">(DE-588)4038376-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Differentialgleichung</subfield><subfield code="0">(DE-588)4012249-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehrgitterverfahren</subfield><subfield code="0">(DE-588)4038376-3</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="689" ind1="1" ind2="0"><subfield code="a">Differentialgleichung</subfield><subfield code="0">(DE-588)4012249-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Matrizenrechnung</subfield><subfield code="0">(DE-588)4126963-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Numerical Methods and Algorithms</subfield><subfield code="v">2</subfield><subfield code="w">(DE-604)BV016934978</subfield><subfield code="9">2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3726-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-027856933</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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.BV042421516 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:09Z |
| institution | BVB |
| isbn | 9781475737264 9781475737288 |
| issn | 1571-5698 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856933 |
| oclc_num | 1184499053 |
| 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 (XVI, 221 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer US |
| record_format | marc |
| series | Numerical Methods and Algorithms |
| series2 | Numerical Methods and Algorithms |
| spelling | Shapira, Yair Verfasser aut Matrix-Based Multigrid Theory and Applications by Yair Shapira Boston, MA Springer US 2003 1 Online-Ressource (XVI, 221 p) txt rdacontent c rdamedia cr rdacarrier Numerical Methods and Algorithms 2 1571-5698 Many important problems in applied science and engineering, such as the NavierStokes equations in fluid dynamics, the primitive equations in global climate modeling, the strain-stress equations in mechanics, the neutron diffusion equations in nuclear engineering, and MRIICT medical simulations, involve complicated systems of nonlinear partial differential equations. When discretized, such problems produce extremely large, nonlinear systems of equations, whose numerical solution is prohibitively costly in terms of time and storage. High-performance (parallel) computers and efficient (parallelizable) algorithms are clearly necessary. Three classical approaches to the solution of such systems are: Newton's method, Preconditioned Conjugate Gradients (and related Krylov-space acceleration techniques), and multigrid methods. The first two approaches require the solution of large sparse linear systems at every iteration, which are themselves often solved by multigrid methods. Developing robust and efficient multigrid algorithms is thus of great importance. The original multigrid algorithm was developed for the Poisson equation in a square, discretized by finite differences on a uniform grid. For this model problem, multigrid exhibits extremely rapid convergence, and actually solves the problem in the minimal possible time. The original algorithm uses rediscretization of the partial differential equation (POE) on each grid in the hierarchy of coarse grids that are used. However, this approach would not work for more complicated problems, such as problems on complicated domains and nonuniform grids, problems with variable coefficients, and non symmetric and indefinite equations. In these cases, matrix-based multi grid methods are in order Mathematics Computer science Electronic data processing Computer science / Mathematics Computational Mathematics and Numerical Analysis Numeric Computing Mathematics of Computing Applications of Mathematics Datenverarbeitung Informatik Mathematik Matrizenrechnung (DE-588)4126963-9 gnd rswk-swf Mehrgitterverfahren (DE-588)4038376-3 gnd rswk-swf Differentialgleichung (DE-588)4012249-9 gnd rswk-swf Mehrgitterverfahren (DE-588)4038376-3 s 1\p DE-604 Differentialgleichung (DE-588)4012249-9 s 2\p DE-604 Matrizenrechnung (DE-588)4126963-9 s 3\p DE-604 Numerical Methods and Algorithms 2 (DE-604)BV016934978 2 https://doi.org/10.1007/978-1-4757-3726-4 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Shapira, Yair Matrix-Based Multigrid Theory and Applications Numerical Methods and Algorithms Mathematics Computer science Electronic data processing Computer science / Mathematics Computational Mathematics and Numerical Analysis Numeric Computing Mathematics of Computing Applications of Mathematics Datenverarbeitung Informatik Mathematik Matrizenrechnung (DE-588)4126963-9 gnd Mehrgitterverfahren (DE-588)4038376-3 gnd Differentialgleichung (DE-588)4012249-9 gnd |
| subject_GND | (DE-588)4126963-9 (DE-588)4038376-3 (DE-588)4012249-9 |
| title | Matrix-Based Multigrid Theory and Applications |
| title_auth | Matrix-Based Multigrid Theory and Applications |
| title_exact_search | Matrix-Based Multigrid Theory and Applications |
| title_full | Matrix-Based Multigrid Theory and Applications by Yair Shapira |
| title_fullStr | Matrix-Based Multigrid Theory and Applications by Yair Shapira |
| title_full_unstemmed | Matrix-Based Multigrid Theory and Applications by Yair Shapira |
| title_short | Matrix-Based Multigrid |
| title_sort | matrix based multigrid theory and applications |
| title_sub | Theory and Applications |
| topic | Mathematics Computer science Electronic data processing Computer science / Mathematics Computational Mathematics and Numerical Analysis Numeric Computing Mathematics of Computing Applications of Mathematics Datenverarbeitung Informatik Mathematik Matrizenrechnung (DE-588)4126963-9 gnd Mehrgitterverfahren (DE-588)4038376-3 gnd Differentialgleichung (DE-588)4012249-9 gnd |
| topic_facet | Mathematics Computer science Electronic data processing Computer science / Mathematics Computational Mathematics and Numerical Analysis Numeric Computing Mathematics of Computing Applications of Mathematics Datenverarbeitung Informatik Mathematik Matrizenrechnung Mehrgitterverfahren Differentialgleichung |
| url | https://doi.org/10.1007/978-1-4757-3726-4 |
| volume_link | (DE-604)BV016934978 |
| work_keys_str_mv | AT shapirayair matrixbasedmultigridtheoryandapplications |