Root isolation methods based upon lagrangian interpolation

References

• Brent , R.P. 1973 . Algorithms for Minimization without Derivatives , Englewood Cliffs, New Jersey : Prentice-Hall .
   Google Scholar
• Burden , R. , Faires , J.D. and Reynolds , A.C. 1981 . Numerical Analysis , Boston : Prindle,Weber and Schmidt . 2nd. ed
   Google Scholar
• Bus , J.C.P. and Dekker , T.J. 1975 . Two efficient algorithms with guaranteed convergence for finding a zero of a function . ACM Transactions on Mathematical Software , 1 ( 4 ) : 330 – 345 .
   Google Scholar
• Dekker , T.J. 1969 . “ Finding a zero by means of successive linear interpolation ” . In Constructive Aspects of the Fundamental Theorem of Algebra , Edited by: Dejon , B. and Henrici , P. New York : Wiley-Interscience .
   Google Scholar
• Forsythe , G. , Malcolm , M. and Moler , C. 1977 . Computer Methods for Mathematical Computations , Englewood Cliffs, New Jersey : Prentice-Hall .
   Google Scholar
• Jones , B. , Banerjee , M. and Jones , L. 1984 . Root isolation for transcendental equations . The Computer Journal , 27 ( 2 ) : 184 – 187 .
   Web of Science ®Google Scholar
• Jones , B. , Waller , W.G. and Feldman , A. 1978 . Root isolation using function values . BIT , 18 ( 2 ) : 311 – 319 .
   Google Scholar
• Rice , J.R. 1983 . Numerical Methods, Software and Analysis , New York : McGraw-Hill .
   Google Scholar
• Wilkinson J. H. Two algorithms based on successive linear interpolation Technical Report STAN-CS-67-60 Computer Science Department, Stanford University Stanford, California 1967
   Google Scholar