%APerumalla, Kalyan S[ORNL]
%AWright, John P[ORNL]
%AKuruganti, Phani Teja[ORNL]
%B
%D2008%K97; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; MATHEMATICS; RESEARCH PROGRAMS
%MOSTI ID: 934800
%PMedium: ED
%TOn the Reversibility of Newton-Raphson Root-Finding Method
%Uhttp://www.osti.gov/scitech//servlets/purl/934800/
%XReversibility of a computational method is the ability to execute the method forward as well as backward. Reversible computational methods are generally useful in undoing incorrect computation in a speculative execution setting designed for efficient parallel processing. Here, reversibility is explored of a common component in scientific codes, namely, the Newton-Raphson root-finding method. A reverse method is proposed that is aimed at retracing the sequence of points that are visited by the forward method during forward iterations. When given the root, along with the number of iterations, of the forward method, this reverse method is aimed at backtracking along the reverse sequence of points to finally recover the original starting point of the forward method. The operation of this reverse method is illustrated on a few example functions, serving to highlight the method's strengths and shortcomings.
%0Technical Report
%@ORNL/TM-2007/152; TRN: US200815%%176
United States10.2172/934800TRN: US200815%%176Thu Jun 06 09:11:25 EDT 2013ORNLEnglish