Checkpointing scheme: Difference between revisions

Content deleted Content added

Revision as of 23:00, 3 March 2009 edit Qiqi.wang (talk \| contribs) 32 edits ←Created page with 'Checkpointing schemes are scientific computing algorithms used in solving time dependent adjoint equations, as well as reverse mode [[automatic differentiation]…'		Latest revision as of 20:16, 6 January 2022 edit undo Crteianlian (talk \| contribs) 39 edits No edit summary
(9 intermediate revisions by 7 users not shown)
Line 1: {{Use American English\|date = March 2019}} Checkpointing schemes are scientific computing algorithms used in solving time dependent [[adjoint equations]], as well as reverse mode [[automatic differentiation]].▼ {{Short description\|Type of algorithm}} {{Use mdy dates\|date = March 2019}} ▲'''Checkpointing schemes''' are scientific computing algorithms used in solving time dependent [[adjoint ~~equations~~equation]]s, as well as reverse mode [[automatic differentiation]].<ref>D. K. Pradhan and N. H. Vaidya, "Roll-forward checkpointing scheme: a novel fault-tolerant architecture," in IEEE Transactions on Computers, vol. 43, no. 10, pp. 1163-1174, Oct. 1994, doi: 10.1109/12.324542.</ref> ==References== {{Reflist}} ==Bibliography== ~~<div class="references-small"><references /></div>~~ * {{~~cite~~Cite book▼ ~~== Literature ==~~ ▲* {{cite book \| last = Griewank \| first = Andreas