{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T22:43:57Z","timestamp":1785969837430,"version":"3.56.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC Discovery"},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-12-1-0455"],"award-info":[{"award-number":["FA9550-12-1-0455"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Institute for Cyber-Enabled Research at Michigan State University"},{"DOI":"10.13039\/100009953","name":"Michigan Technological University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009953","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2017,3,31]]},"abstract":"<jats:p>Revisionist integral deferred correction methods are a family of parallel-in-time methods to solve systems of initial values problems. The approach is able to bootstrap lower-order time integrators to provide high-order approximations in approximately the same wall-clock time, hence providing a multiplicative increase in the number of compute cores utilized. Here we provide a library that automatically produces a parallel-in-time solution of a system of initial value problems given user-supplied code for the right-hand side of the system and a sequential code for a first-order timestep. The user-supplied timestep routine may be explicit or implicit and may make use of any auxiliary libraries that take care of the solution of any nonlinear algebraic systems that may arise or the numerical linear algebra required.<\/jats:p>","DOI":"10.1145\/2964377","type":"journal-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T14:17:46Z","timestamp":1471270666000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Algorithm 965"],"prefix":"10.1145","volume":"43","author":[{"given":"Benjamin W.","family":"Ong","sequence":"first","affiliation":[{"name":"Michigan Technological University, Houghton, MI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald D.","family":"Haynes","sequence":"additional","affiliation":[{"name":"Memorial University of Newfoundland, NL, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyle","family":"Ladd","sequence":"additional","affiliation":[{"name":"Barracuda Networks, Seattle WA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Retrieved","author":"Balay S.","year":"2014","unstructured":"S. Balay, S. Abhyankar, M. Adams, J. Brown, P. Brune, K. Buschelman, V. Eijkhout, et al. 2014. PETSc Users Manual Revision 3.7. Retrieved July 17, 2016, from http:\/\/www.mcs.anl.gov\/petsc\/petsc-current\/docs\/manual.pdf."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0910062"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-9274(93)90037-R"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/110843484"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.2140\/camcos.2015.10.1"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-010-9452-4"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.2140\/camcos.2009.4.27"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","unstructured":"Andrew Christlieb Benjamin Ong and Jing-Mei Qiu. 2010a. Integral deferred correction methods constructed with high order Runge-Kutta integrators. Mathematics of Computation 79 270 761--783. DOI:http:\/\/dx.doi.org\/10.1090\/S0025-5718-09-02276-5","DOI":"10.1090\/S0025-5718-09-02276-5"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/09075740X"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022338906936"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2132876.2132883"},{"key":"e_1_2_2_12_1","volume-title":"Retrieved","author":"Emmett Matthew","year":"2013","unstructured":"Matthew Emmett. 2013. PyPFASST: Parallel Full Approximation Scheme in Space and Time. Retrieved July 17, 2016, from http:\/\/pypfasst.readthedocs.org\/en\/latest."},{"key":"e_1_2_2_13_1","volume-title":"Retrieved","author":"Emmett Matthew","year":"2015","unstructured":"Matthew Emmett, Torbjorn Klatt, Robert Speck, and Daniel Ruprecht. 2015. Parallel Full Approximation Scheme in Space and Time. Retrieved July 17, 2016, from https:\/\/github.com\/Parallel-in-Time\/PFASST."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.2140\/camcos.2012.7.105"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05789-7_33"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018986500842"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/130944230"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23321-5_3"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34469-8_34"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1538674"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05789-7_14"},{"key":"e_1_2_2_22_1","volume-title":"Scientific Computing","author":"Hindmarsh Alan C.","unstructured":"Alan C. Hindmarsh. 1983. ODEPACK, a systematized collection of ODE solvers. In Scientific Computing. IMACS, New Brunswick, NJ, 55--64."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089020"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(95)00219-7"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.2140\/camcos.2014.9.175"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1631-073X(02)02467-6"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1967-0223106-8"},{"key":"e_1_2_2_28_1","unstructured":"Benjamin Ong Andrew Christlieb and Andrew Melfi. 2012. Parallel Semi-Implicit Time Integrators. Technical Report. Michigan State University East Lansing MI. http:\/\/arxiv.org\/pdf\/1209.4297.pdf."},{"key":"e_1_2_2_29_1","volume-title":"Scientific Computing","author":"Petzold Linda","unstructured":"Linda Petzold. 1983. A description of DASSL: A differential\/algebraic system solver. In Scientific Computing. IMACS, New Brunswick, NJ, 65--68."},{"key":"e_1_2_2_30_1","volume-title":"Retrieved","author":"Schmitt Bernhard","year":"2013","unstructured":"Bernhard Schmitt. 2013. Peer Methods for Ordinary Differential Equations. Retrieved July 17, 2016, from http:\/\/www.mathematik.uni-marburg.de\/&sim;schmitt\/peer\/."},{"key":"e_1_2_2_31_1","volume-title":"Retrieved","author":"Schroder Jacob","year":"2015","unstructured":"Jacob Schroder, Robert Falgout, Tzanio Kolev, Ulrike Yang, Anders Petersson, Veselin Dobrev, Scott MacLachlan, Stephanie Friedhoff, and Ben O'Neil. 2015. XBraid: Parallel Time Integration with Multigrid. Retrieved July 17, 2016, from http:\/\/llnl.gov\/casc\/xbraid. (2015)."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614459933425X"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057594.1057595"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/645818.669246"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2007.04.026"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2964377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2964377","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2964377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:47:35Z","timestamp":1763459255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2964377"}},"subtitle":["RIDC Methods: A Family of Parallel Time Integrators"],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3,31]]}},"alternative-id":["10.1145\/2964377"],"URL":"https:\/\/doi.org\/10.1145\/2964377","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2014-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}