Explicit, high-order Runge-Kutta-Nyström methods for parallel computers:
Abstract: "The paper describes the construction of explicit Runge-Kutta-Nyström (RKN) methods of arbitrarily high order. The order is borrowed from an underlying implicit RKN method. For the approximate solution of this method, an iteration scheme is defined. Prescribing a fixed number of itera...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1992
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM
1992,19 |
| Subjects: | |
| Summary: | Abstract: "The paper describes the construction of explicit Runge-Kutta-Nyström (RKN) methods of arbitrarily high order. The order is borrowed from an underlying implicit RKN method. For the approximate solution of this method, an iteration scheme is defined. Prescribing a fixed number of iterations, the resulting scheme is an explicit RKN method. The iteration scheme is defined in such a way that many of the right-hand side evaluations can be done concurrently. As a result, explicit RKN schemes of order p are obtained which require, on a parallel computer, approximately p/2 right-hand side evaluations per step. Both in fixed- and variable-step mode, the schemes are compared with existing (sequential) high-order RKN methods from the literature and are shown to demonstrate superior behaviour." |
| Physical Description: | 17 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010186123 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950517s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)29451502 | ||
| 035 | |a (DE-599)BVBBV010186123 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sommeijer, Ben P. |d ca. 20. Jh. |e Verfasser |0 (DE-588)132820269 |4 aut | |
| 245 | 1 | 0 | |a Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 17 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 1992,19 | |
| 520 | 3 | |a Abstract: "The paper describes the construction of explicit Runge-Kutta-Nyström (RKN) methods of arbitrarily high order. The order is borrowed from an underlying implicit RKN method. For the approximate solution of this method, an iteration scheme is defined. Prescribing a fixed number of iterations, the resulting scheme is an explicit RKN method. The iteration scheme is defined in such a way that many of the right-hand side evaluations can be done concurrently. As a result, explicit RKN schemes of order p are obtained which require, on a parallel computer, approximately p/2 right-hand side evaluations per step. Both in fixed- and variable-step mode, the schemes are compared with existing (sequential) high-order RKN methods from the literature and are shown to demonstrate superior behaviour." | |
| 650 | 4 | |a Runge-Kutta formulas | |
| 810 | 2 | |a Afdeling Numerieke Wiskunde: Report NM |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 1992,19 |w (DE-604)BV010177152 |9 1992,19 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006766935 | ||
Record in the Search Index
| _version_ | 1804124586670817280 |
|---|---|
| any_adam_object | |
| author | Sommeijer, Ben P. ca. 20. Jh |
| author_GND | (DE-588)132820269 |
| author_facet | Sommeijer, Ben P. ca. 20. Jh |
| author_role | aut |
| author_sort | Sommeijer, Ben P. ca. 20. Jh |
| author_variant | b p s bp bps |
| building | Verbundindex |
| bvnumber | BV010186123 |
| ctrlnum | (OCoLC)29451502 (DE-599)BVBBV010186123 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01801nam a2200289 cb4500</leader><controlfield tag="001">BV010186123</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950517s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29451502</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010186123</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">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="245" ind1="1" ind2="0"><subfield code="a">Explicit, high-order Runge-Kutta-Nyström methods for parallel computers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">1992,19</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The paper describes the construction of explicit Runge-Kutta-Nyström (RKN) methods of arbitrarily high order. The order is borrowed from an underlying implicit RKN method. For the approximate solution of this method, an iteration scheme is defined. Prescribing a fixed number of iterations, the resulting scheme is an explicit RKN method. The iteration scheme is defined in such a way that many of the right-hand side evaluations can be done concurrently. As a result, explicit RKN schemes of order p are obtained which require, on a parallel computer, approximately p/2 right-hand side evaluations per step. Both in fixed- and variable-step mode, the schemes are compared with existing (sequential) high-order RKN methods from the literature and are shown to demonstrate superior behaviour."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Runge-Kutta formulas</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">1992,19</subfield><subfield code="w">(DE-604)BV010177152</subfield><subfield code="9">1992,19</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006766935</subfield></datafield></record></collection> |
| id | DE-604.BV010186123 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:48:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006766935 |
| oclc_num | 29451502 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 17 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM |
| spelling | Sommeijer, Ben P. ca. 20. Jh. Verfasser (DE-588)132820269 aut Explicit, high-order Runge-Kutta-Nyström methods for parallel computers Amsterdam 1992 17 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM 1992,19 Abstract: "The paper describes the construction of explicit Runge-Kutta-Nyström (RKN) methods of arbitrarily high order. The order is borrowed from an underlying implicit RKN method. For the approximate solution of this method, an iteration scheme is defined. Prescribing a fixed number of iterations, the resulting scheme is an explicit RKN method. The iteration scheme is defined in such a way that many of the right-hand side evaluations can be done concurrently. As a result, explicit RKN schemes of order p are obtained which require, on a parallel computer, approximately p/2 right-hand side evaluations per step. Both in fixed- and variable-step mode, the schemes are compared with existing (sequential) high-order RKN methods from the literature and are shown to demonstrate superior behaviour." Runge-Kutta formulas Afdeling Numerieke Wiskunde: Report NM Centrum voor Wiskunde en Informatica <Amsterdam> 1992,19 (DE-604)BV010177152 1992,19 |
| spellingShingle | Sommeijer, Ben P. ca. 20. Jh Explicit, high-order Runge-Kutta-Nyström methods for parallel computers Runge-Kutta formulas |
| title | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_auth | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_exact_search | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_full | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_fullStr | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_full_unstemmed | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_short | Explicit, high-order Runge-Kutta-Nyström methods for parallel computers |
| title_sort | explicit high order runge kutta nystrom methods for parallel computers |
| topic | Runge-Kutta formulas |
| topic_facet | Runge-Kutta formulas |
| volume_link | (DE-604)BV010177152 |
| work_keys_str_mv | AT sommeijerbenp explicithighorderrungekuttanystrommethodsforparallelcomputers |