Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods:
Abstract: "In this paper, we analyse parallel, diagonally- implicit iteration of Runge-Kutta methods (PDIRK methods) for solving large systems of stiff equations on parallel computers. Like Newton-iterated backward differentiation formulas (BDFs), these PDIRK methods are such that in each step...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM
1991,14 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper, we analyse parallel, diagonally- implicit iteration of Runge-Kutta methods (PDIRK methods) for solving large systems of stiff equations on parallel computers. Like Newton-iterated backward differentiation formulas (BDFs), these PDIRK methods are such that in each step the (sequential) costs consists of solving a number of linear systems with the same matrix of coefficients and with the same dimension as the system of differential equations. Although for PDIRK methods the number of linear systems is usually higher than for Newton iteration of BDFs, the more computational intensive work of computing the matrix of coefficients and its LU decomposition is identical The advantage of PDIRK methods over Newton-iterated BDFs is their unconditional stability (A-stability for Gauss-based methods and L- stability for Radau-based methods) for any order of accuracy. |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010183312 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950516s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)25511821 | ||
| 035 | |a (DE-599)BVBBV010183312 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Houwen, Pieter J. van der |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM |v 1991,14 | |
| 520 | 3 | |a Abstract: "In this paper, we analyse parallel, diagonally- implicit iteration of Runge-Kutta methods (PDIRK methods) for solving large systems of stiff equations on parallel computers. Like Newton-iterated backward differentiation formulas (BDFs), these PDIRK methods are such that in each step the (sequential) costs consists of solving a number of linear systems with the same matrix of coefficients and with the same dimension as the system of differential equations. Although for PDIRK methods the number of linear systems is usually higher than for Newton iteration of BDFs, the more computational intensive work of computing the matrix of coefficients and its LU decomposition is identical | |
| 520 | 3 | |a The advantage of PDIRK methods over Newton-iterated BDFs is their unconditional stability (A-stability for Gauss-based methods and L- stability for Radau-based methods) for any order of accuracy. | |
| 650 | 4 | |a Runge-Kutta formulas | |
| 700 | 1 | |a Sommeijer, Ben P. |d ca. 20. Jh. |e Verfasser |0 (DE-588)132820269 |4 aut | |
| 810 | 2 | |a Afdeling Numerieke Wiskunde: Report NM |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 1991,14 |w (DE-604)BV010177152 |9 1991,14 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006765042 | ||
Datensatz im Suchindex
| _version_ | 1804124583475806208 |
|---|---|
| any_adam_object | |
| author | Houwen, Pieter J. van der Sommeijer, Ben P. ca. 20. Jh |
| author_GND | (DE-588)132820269 |
| author_facet | Houwen, Pieter J. van der Sommeijer, Ben P. ca. 20. Jh |
| author_role | aut aut |
| author_sort | Houwen, Pieter J. van der |
| author_variant | p j v d h pjvd pjvdh b p s bp bps |
| building | Verbundindex |
| bvnumber | BV010183312 |
| ctrlnum | (OCoLC)25511821 (DE-599)BVBBV010183312 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01961nam a2200313 cb4500</leader><controlfield tag="001">BV010183312</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950516s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25511821</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010183312</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Houwen, Pieter J. van der</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM</subfield><subfield code="v">1991,14</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we analyse parallel, diagonally- implicit iteration of Runge-Kutta methods (PDIRK methods) for solving large systems of stiff equations on parallel computers. Like Newton-iterated backward differentiation formulas (BDFs), these PDIRK methods are such that in each step the (sequential) costs consists of solving a number of linear systems with the same matrix of coefficients and with the same dimension as the system of differential equations. Although for PDIRK methods the number of linear systems is usually higher than for Newton iteration of BDFs, the more computational intensive work of computing the matrix of coefficients and its LU decomposition is identical</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The advantage of PDIRK methods over Newton-iterated BDFs is their unconditional stability (A-stability for Gauss-based methods and L- stability for Radau-based methods) for any order of accuracy.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Runge-Kutta formulas</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sommeijer, Ben P.</subfield><subfield code="d">ca. 20. Jh.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132820269</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Afdeling Numerieke Wiskunde: Report NM</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">1991,14</subfield><subfield code="w">(DE-604)BV010177152</subfield><subfield code="9">1991,14</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006765042</subfield></datafield></record></collection> |
| id | DE-604.BV010183312 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006765042 |
| oclc_num | 25511821 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM |
| spelling | Houwen, Pieter J. van der Verfasser aut Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods Amsterdam 1991 13 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM 1991,14 Abstract: "In this paper, we analyse parallel, diagonally- implicit iteration of Runge-Kutta methods (PDIRK methods) for solving large systems of stiff equations on parallel computers. Like Newton-iterated backward differentiation formulas (BDFs), these PDIRK methods are such that in each step the (sequential) costs consists of solving a number of linear systems with the same matrix of coefficients and with the same dimension as the system of differential equations. Although for PDIRK methods the number of linear systems is usually higher than for Newton iteration of BDFs, the more computational intensive work of computing the matrix of coefficients and its LU decomposition is identical The advantage of PDIRK methods over Newton-iterated BDFs is their unconditional stability (A-stability for Gauss-based methods and L- stability for Radau-based methods) for any order of accuracy. Runge-Kutta formulas Sommeijer, Ben P. ca. 20. Jh. Verfasser (DE-588)132820269 aut Afdeling Numerieke Wiskunde: Report NM Centrum voor Wiskunde en Informatica <Amsterdam> 1991,14 (DE-604)BV010177152 1991,14 |
| spellingShingle | Houwen, Pieter J. van der Sommeijer, Ben P. ca. 20. Jh Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods Runge-Kutta formulas |
| title | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_auth | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_exact_search | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_full | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_fullStr | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_full_unstemmed | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_short | Analysis of parallel diagonal-implicit iteration of Runge-Kutta methods |
| title_sort | analysis of parallel diagonal implicit iteration of runge kutta methods |
| topic | Runge-Kutta formulas |
| topic_facet | Runge-Kutta formulas |
| volume_link | (DE-604)BV010177152 |
| work_keys_str_mv | AT houwenpieterjvander analysisofparalleldiagonalimplicititerationofrungekuttamethods AT sommeijerbenp analysisofparalleldiagonalimplicititerationofrungekuttamethods |