Parallel diagonally implicit Runge-Kutta-Nyström methods:
Abstract: "In this paper, we study diagonally implicit iteration methods for solving implicit Runge-Kutta-Nystrom methods on parallel computers. These iteration methods are such that in each step, the iterated method belongs to the class of diagonally implicit Runge-Kutta- Nystrom methods (DIRK...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1991
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM
1991,3 |
| Subjects: | |
| Summary: | Abstract: "In this paper, we study diagonally implicit iteration methods for solving implicit Runge-Kutta-Nystrom methods on parallel computers. These iteration methods are such that in each step, the iterated method belongs to the class of diagonally implicit Runge-Kutta- Nystrom methods (DIRKN methods). The number of stages of this DIRKN method depends on the number of iterations and may vary from step to step. Since a large number of these stages can be computed in parallel, and since the total number of stages can be kept small by a suitable choice of the parameters in the iteration process, the resulting variable-stage DIRKN methods are rather efficient on parallel computers By using implicit Runge-Kutta-Nystrom methods with high stage order, the phenomenon of order reduction exhibited in many problems with large Lipschitz constants does not deteriorate the accuracy of these variable-stage DIRKN methods. |
| Physical Description: | 14 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010182977 | ||
| 003 | DE-604 | ||
| 005 | 20180302 | ||
| 007 | t | ||
| 008 | 950516s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24807124 | ||
| 035 | |a (DE-599)BVBBV010182977 | ||
| 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 Parallel diagonally implicit Runge-Kutta-Nyström methods |c P. J. van der Houwen ; B. P. Sommeijer ; Nguyen huu Cong |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 14 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,3 | |
| 520 | 3 | |a Abstract: "In this paper, we study diagonally implicit iteration methods for solving implicit Runge-Kutta-Nystrom methods on parallel computers. These iteration methods are such that in each step, the iterated method belongs to the class of diagonally implicit Runge-Kutta- Nystrom methods (DIRKN methods). The number of stages of this DIRKN method depends on the number of iterations and may vary from step to step. Since a large number of these stages can be computed in parallel, and since the total number of stages can be kept small by a suitable choice of the parameters in the iteration process, the resulting variable-stage DIRKN methods are rather efficient on parallel computers | |
| 520 | 3 | |a By using implicit Runge-Kutta-Nystrom methods with high stage order, the phenomenon of order reduction exhibited in many problems with large Lipschitz constants does not deteriorate the accuracy of these variable-stage DIRKN methods. | |
| 650 | 4 | |a Parallel computers | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Prediction theory | |
| 650 | 4 | |a Runge-Kutta formulas | |
| 700 | 1 | |a Sommeijer, Ben P. |d ca. 20. Jh. |e Verfasser |0 (DE-588)132820269 |4 aut | |
| 700 | 1 | |a Nguyen, Huu Cong |e Verfasser |0 (DE-588)1150724099 |4 aut | |
| 810 | 2 | |a Afdeling Numerieke Wiskunde: Report NM |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 1991,3 |w (DE-604)BV010177152 |9 1991,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006764756 | ||
Record in the Search Index
| _version_ | 1804124583081541632 |
|---|---|
| any_adam_object | |
| author | Houwen, Pieter J. van der Sommeijer, Ben P. ca. 20. Jh Nguyen, Huu Cong |
| author_GND | (DE-588)132820269 (DE-588)1150724099 |
| author_facet | Houwen, Pieter J. van der Sommeijer, Ben P. ca. 20. Jh Nguyen, Huu Cong |
| author_role | aut aut aut |
| author_sort | Houwen, Pieter J. van der |
| author_variant | p j v d h pjvd pjvdh b p s bp bps h c n hc hcn |
| building | Verbundindex |
| bvnumber | BV010182977 |
| ctrlnum | (OCoLC)24807124 (DE-599)BVBBV010182977 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02230nam a2200361 cb4500</leader><controlfield tag="001">BV010182977</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180302 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950516s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24807124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010182977</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">Parallel diagonally implicit Runge-Kutta-Nyström methods</subfield><subfield code="c">P. J. van der Houwen ; B. P. Sommeijer ; Nguyen huu Cong</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">14 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,3</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we study diagonally implicit iteration methods for solving implicit Runge-Kutta-Nystrom methods on parallel computers. These iteration methods are such that in each step, the iterated method belongs to the class of diagonally implicit Runge-Kutta- Nystrom methods (DIRKN methods). The number of stages of this DIRKN method depends on the number of iterations and may vary from step to step. Since a large number of these stages can be computed in parallel, and since the total number of stages can be kept small by a suitable choice of the parameters in the iteration process, the resulting variable-stage DIRKN methods are rather efficient on parallel computers</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">By using implicit Runge-Kutta-Nystrom methods with high stage order, the phenomenon of order reduction exhibited in many problems with large Lipschitz constants does not deteriorate the accuracy of these variable-stage DIRKN methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prediction theory</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="700" ind1="1" ind2=" "><subfield code="a">Nguyen, Huu Cong</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1150724099</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,3</subfield><subfield code="w">(DE-604)BV010177152</subfield><subfield code="9">1991,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006764756</subfield></datafield></record></collection> |
| id | DE-604.BV010182977 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006764756 |
| oclc_num | 24807124 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 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 Parallel diagonally implicit Runge-Kutta-Nyström methods P. J. van der Houwen ; B. P. Sommeijer ; Nguyen huu Cong Amsterdam 1991 14 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM 1991,3 Abstract: "In this paper, we study diagonally implicit iteration methods for solving implicit Runge-Kutta-Nystrom methods on parallel computers. These iteration methods are such that in each step, the iterated method belongs to the class of diagonally implicit Runge-Kutta- Nystrom methods (DIRKN methods). The number of stages of this DIRKN method depends on the number of iterations and may vary from step to step. Since a large number of these stages can be computed in parallel, and since the total number of stages can be kept small by a suitable choice of the parameters in the iteration process, the resulting variable-stage DIRKN methods are rather efficient on parallel computers By using implicit Runge-Kutta-Nystrom methods with high stage order, the phenomenon of order reduction exhibited in many problems with large Lipschitz constants does not deteriorate the accuracy of these variable-stage DIRKN methods. Parallel computers Parallel processing (Electronic computers) Prediction theory Runge-Kutta formulas Sommeijer, Ben P. ca. 20. Jh. Verfasser (DE-588)132820269 aut Nguyen, Huu Cong Verfasser (DE-588)1150724099 aut Afdeling Numerieke Wiskunde: Report NM Centrum voor Wiskunde en Informatica <Amsterdam> 1991,3 (DE-604)BV010177152 1991,3 |
| spellingShingle | Houwen, Pieter J. van der Sommeijer, Ben P. ca. 20. Jh Nguyen, Huu Cong Parallel diagonally implicit Runge-Kutta-Nyström methods Parallel computers Parallel processing (Electronic computers) Prediction theory Runge-Kutta formulas |
| title | Parallel diagonally implicit Runge-Kutta-Nyström methods |
| title_auth | Parallel diagonally implicit Runge-Kutta-Nyström methods |
| title_exact_search | Parallel diagonally implicit Runge-Kutta-Nyström methods |
| title_full | Parallel diagonally implicit Runge-Kutta-Nyström methods P. J. van der Houwen ; B. P. Sommeijer ; Nguyen huu Cong |
| title_fullStr | Parallel diagonally implicit Runge-Kutta-Nyström methods P. J. van der Houwen ; B. P. Sommeijer ; Nguyen huu Cong |
| title_full_unstemmed | Parallel diagonally implicit Runge-Kutta-Nyström methods P. J. van der Houwen ; B. P. Sommeijer ; Nguyen huu Cong |
| title_short | Parallel diagonally implicit Runge-Kutta-Nyström methods |
| title_sort | parallel diagonally implicit runge kutta nystrom methods |
| topic | Parallel computers Parallel processing (Electronic computers) Prediction theory Runge-Kutta formulas |
| topic_facet | Parallel computers Parallel processing (Electronic computers) Prediction theory Runge-Kutta formulas |
| volume_link | (DE-604)BV010177152 |
| work_keys_str_mv | AT houwenpieterjvander paralleldiagonallyimplicitrungekuttanystrommethods AT sommeijerbenp paralleldiagonallyimplicitrungekuttanystrommethods AT nguyenhuucong paralleldiagonallyimplicitrungekuttanystrommethods |