Multilevel algorithms considered as iterative methods on indefinite systems:
Abstract: "For the representation of piecewise d-linear functions we introduce a generating system instead of the usual finite element basis. It contains the nodal basis functions of the finest level of discretization and, additionally, the nodal basis functions of all coarser levels of discret...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1991
|
| Schriftenreihe: | Technische Universität <München>: TUM
9143 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "For the representation of piecewise d-linear functions we introduce a generating system instead of the usual finite element basis. It contains the nodal basis functions of the finest level of discretization and, additionally, the nodal basis functions of all coarser levels of discretization. This approach enables us to work directly with multilevel decompositions of a function. For a partial differential equation, the Galerkin approach results now in an indefinite system of linear equations which has in the 1D case only about twice, in the 2D case about 4/3 times and in the 3D case about 8/7 times as many unknowns as the usual system. Furthermore, the indefinite system does not possess just one but many solutions However, the unique solution of the usual definite finite element problem can be computed from every solution of the indefinite problem. We show that modern mutlilevel algorithms can be considered as standard iterative methods over the indefinite system. The conjugate gradient method for the indefinite system is equivalent to the BPX- or MDS- preconditioned conjugate gradient method for the linear system which arises from the usual finite element basis. The Gauss-Seidel iteration applied to the indefinite system is equivalent to the multigrid method applied to the standard basis system. Consequently, the Gauss-Seidel- preconditioned conjugate gradient method for the indefinite system is equivalent to MG-CG for the standard basis system At last, the results of numerical experiments regarding the condition number and the convergence rates of different iterative methods for the indefinite system are reported. |
| Beschreibung: | 31 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008844 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27742848 | ||
| 035 | |a (DE-599)BVBBV009008844 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Griebel, Michael |d 1960- |e Verfasser |0 (DE-588)111660068 |4 aut | |
| 245 | 1 | 0 | |a Multilevel algorithms considered as iterative methods on indefinite systems |c Michael Griebel |
| 264 | 1 | |a München |c 1991 | |
| 300 | |a 31 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM |v 9143 | |
| 520 | 3 | |a Abstract: "For the representation of piecewise d-linear functions we introduce a generating system instead of the usual finite element basis. It contains the nodal basis functions of the finest level of discretization and, additionally, the nodal basis functions of all coarser levels of discretization. This approach enables us to work directly with multilevel decompositions of a function. For a partial differential equation, the Galerkin approach results now in an indefinite system of linear equations which has in the 1D case only about twice, in the 2D case about 4/3 times and in the 3D case about 8/7 times as many unknowns as the usual system. Furthermore, the indefinite system does not possess just one but many solutions | |
| 520 | 3 | |a However, the unique solution of the usual definite finite element problem can be computed from every solution of the indefinite problem. We show that modern mutlilevel algorithms can be considered as standard iterative methods over the indefinite system. The conjugate gradient method for the indefinite system is equivalent to the BPX- or MDS- preconditioned conjugate gradient method for the linear system which arises from the usual finite element basis. The Gauss-Seidel iteration applied to the indefinite system is equivalent to the multigrid method applied to the standard basis system. Consequently, the Gauss-Seidel- preconditioned conjugate gradient method for the indefinite system is equivalent to MG-CG for the standard basis system | |
| 520 | 3 | |a At last, the results of numerical experiments regarding the condition number and the convergence rates of different iterative methods for the indefinite system are reported. | |
| 650 | 4 | |a Differential equations, Partial | |
| 650 | 4 | |a Galerkin methods | |
| 830 | 0 | |a Technische Universität <München>: TUM |v 9143 |w (DE-604)BV006185376 |9 9143 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955316 | ||
Datensatz im Suchindex
| _version_ | 1804123355982331904 |
|---|---|
| any_adam_object | |
| author | Griebel, Michael 1960- |
| author_GND | (DE-588)111660068 |
| author_facet | Griebel, Michael 1960- |
| author_role | aut |
| author_sort | Griebel, Michael 1960- |
| author_variant | m g mg |
| building | Verbundindex |
| bvnumber | BV009008844 |
| ctrlnum | (OCoLC)27742848 (DE-599)BVBBV009008844 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02630nam a2200325 cb4500</leader><controlfield tag="001">BV009008844</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27742848</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008844</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Griebel, Michael</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)111660068</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multilevel algorithms considered as iterative methods on indefinite systems</subfield><subfield code="c">Michael Griebel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM</subfield><subfield code="v">9143</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "For the representation of piecewise d-linear functions we introduce a generating system instead of the usual finite element basis. It contains the nodal basis functions of the finest level of discretization and, additionally, the nodal basis functions of all coarser levels of discretization. This approach enables us to work directly with multilevel decompositions of a function. For a partial differential equation, the Galerkin approach results now in an indefinite system of linear equations which has in the 1D case only about twice, in the 2D case about 4/3 times and in the 3D case about 8/7 times as many unknowns as the usual system. Furthermore, the indefinite system does not possess just one but many solutions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">However, the unique solution of the usual definite finite element problem can be computed from every solution of the indefinite problem. We show that modern mutlilevel algorithms can be considered as standard iterative methods over the indefinite system. The conjugate gradient method for the indefinite system is equivalent to the BPX- or MDS- preconditioned conjugate gradient method for the linear system which arises from the usual finite element basis. The Gauss-Seidel iteration applied to the indefinite system is equivalent to the multigrid method applied to the standard basis system. Consequently, the Gauss-Seidel- preconditioned conjugate gradient method for the indefinite system is equivalent to MG-CG for the standard basis system</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">At last, the results of numerical experiments regarding the condition number and the convergence rates of different iterative methods for the indefinite system are reported.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Differential equations, Partial</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Galerkin methods</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM</subfield><subfield code="v">9143</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9143</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955316</subfield></datafield></record></collection> |
| id | DE-604.BV009008844 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955316 |
| oclc_num | 27742848 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 31 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Technische Universität <München>: TUM |
| series2 | Technische Universität <München>: TUM |
| spelling | Griebel, Michael 1960- Verfasser (DE-588)111660068 aut Multilevel algorithms considered as iterative methods on indefinite systems Michael Griebel München 1991 31 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM 9143 Abstract: "For the representation of piecewise d-linear functions we introduce a generating system instead of the usual finite element basis. It contains the nodal basis functions of the finest level of discretization and, additionally, the nodal basis functions of all coarser levels of discretization. This approach enables us to work directly with multilevel decompositions of a function. For a partial differential equation, the Galerkin approach results now in an indefinite system of linear equations which has in the 1D case only about twice, in the 2D case about 4/3 times and in the 3D case about 8/7 times as many unknowns as the usual system. Furthermore, the indefinite system does not possess just one but many solutions However, the unique solution of the usual definite finite element problem can be computed from every solution of the indefinite problem. We show that modern mutlilevel algorithms can be considered as standard iterative methods over the indefinite system. The conjugate gradient method for the indefinite system is equivalent to the BPX- or MDS- preconditioned conjugate gradient method for the linear system which arises from the usual finite element basis. The Gauss-Seidel iteration applied to the indefinite system is equivalent to the multigrid method applied to the standard basis system. Consequently, the Gauss-Seidel- preconditioned conjugate gradient method for the indefinite system is equivalent to MG-CG for the standard basis system At last, the results of numerical experiments regarding the condition number and the convergence rates of different iterative methods for the indefinite system are reported. Differential equations, Partial Galerkin methods Technische Universität <München>: TUM 9143 (DE-604)BV006185376 9143 |
| spellingShingle | Griebel, Michael 1960- Multilevel algorithms considered as iterative methods on indefinite systems Technische Universität <München>: TUM Differential equations, Partial Galerkin methods |
| title | Multilevel algorithms considered as iterative methods on indefinite systems |
| title_auth | Multilevel algorithms considered as iterative methods on indefinite systems |
| title_exact_search | Multilevel algorithms considered as iterative methods on indefinite systems |
| title_full | Multilevel algorithms considered as iterative methods on indefinite systems Michael Griebel |
| title_fullStr | Multilevel algorithms considered as iterative methods on indefinite systems Michael Griebel |
| title_full_unstemmed | Multilevel algorithms considered as iterative methods on indefinite systems Michael Griebel |
| title_short | Multilevel algorithms considered as iterative methods on indefinite systems |
| title_sort | multilevel algorithms considered as iterative methods on indefinite systems |
| topic | Differential equations, Partial Galerkin methods |
| topic_facet | Differential equations, Partial Galerkin methods |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT griebelmichael multilevelalgorithmsconsideredasiterativemethodsonindefinitesystems |