;
A\ptomcat Ba==h\:#8X@"1Arial1Arial1Arial1Arial1Arial"$"#,##0_);\("$"#,##0\)!"$"#,##0_);[Red]\("$"#,##0\)""$"#,##0.00_);\("$"#,##0.00\)'""$"#,##0.00_);[Red]\("$"#,##0.00\)7*2_("$"* #,##0_);_("$"* \(#,##0\);_("$"* "-"_);_(@_).))_(* #,##0_);_(* \(#,##0\);_(* "-"_);_(@_)?,:_("$"* #,##0.00_);_("$"* \(#,##0.00\);_("$"* "-"??_);_(@_)6+1_(* #,##0.00_);_(* \(#,##0.00\);_(* "-"??_);_(@_) + ) , * `n
metadata2+TitleCreator/AuthorPublication DateOSTI IdentifierReport Number(s)DOE Contract NumberOther Number(s)
Resource Type
Specific TypeCoverageResource Relation
Research Org.Sponsoring Org.SubjectRelated SubjectDescription/Abstract PublisherCountry of PublicationLanguageFormatAvailabilityRightsSystem Entry Date Full TextBibliographic Citation:On the Reversibility of Newton-Raphson Root-Finding MethodOPerumalla, Kalyan S [ORNL]; Wright, John P [ORNL]; Kuruganti, Phani Teja [ORNL]2008-07-01T04:00:00Z934800ORNL/TM-2007/152DE-AC05-00OR22725TRN: US200815%%176Technical ReportGOak Ridge National Laboratory (ORNL); Center for Computational SciencesORNL LDRD Director's R&D97; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; MATHEMATICS; RESEARCH PROGRAMSReversibility 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.
United StatesEnglish2015-01-19T05:00:00Z1https://www.osti.gov/scitech/servlets/purl/934800*https://www.osti.gov/scitech/biblio/9348002 A
&
dMbP?_*+%"d,,??U
!
!
!
"
#
$
!
%
!
&
'
!
!
!
(
)
*^>@
Root EntryWorkbook_