BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-67-60
       ENTRY:: January 03, 1996
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Two algorithms based on successive linear interpolation
        TYPE:: Technical Report
      AUTHOR:: Wilkinson, James H.
        DATE:: April 1967
       PAGES:: 16
    ABSTRACT:: The method of successive linear interpolation has a very
               satisfactory asymptotic rate of convergence but the behavior
               in the early steps may lead to divergence. The regular falsi
               has the advantage of being safe but its asymptotic behavior
               is unsatisfactory. Two modified algorithms are described here
               which overcome these weaknesses. Although neither is new,
               discussions of their main features do not appear to be
               readily available in the literature.
       NOTES:: [Adminitrivia V1/Prg/19960103]
         END:: STAN//CS-TR-67-60