1. Polynomial zerofinding by elementary operations on Frobenius companion matrix.  
   Karbassi, S. M.; Shariatnejad, M.
   Far East J. Appl. Math.  7  (2002),  no. 1, 25--33, MathSciNet.  
2. Optimisation of modified Mueller and Muller algorithm
   Danesfahani, G.R.; Jeans, T.G.
   Electronics Letters, v 31, n 13, Jun 22, 1995, p 1032-1033, Compendex
3. On the use of Davidenko's method in complex root search
   Hejase, Hassan A.N.
   IEEE Transactions on Microwave Theory and Techniques, v 41, n 1, Jan, 1993, p 141-143, Compendex
4. A method of Muller's method for computing the zeros of a function. (Italian)    
   Frontini, M.; Tognoni, A.    
   Istit. Lombardo Accad. Sci. Lett. Rend. A 125 (1991), no. 1, 69--75 (1992), MathSciNet.  
5. A study on new Muller's method.    
   Park, Bong-kyu; Hitotumatu, Sin    
   Publ. Res. Inst. Math. Sci. 23 (1987), no. 4, 667--672, MathSciNet.  
6. A modified Muller routine for finding the zeroes of a nonanalytic complex function.    
   Dyer, Charles C.    
   J. Comput. Phys. 53 (1984), no. 3, 530--534, MathSciNet.  
7. Convergence of Muller's method for finding roots. (Chinese)
   Xie, Shen Quan
   Knowledge Practice Math. No. 2 (1980), 18--25, MathSciNet.  
8. A stable method of inverse interpolation.  
   Blatt, J. M.
   Austral. Comput. J.  7  (1975), no. 2, 51--57, MathSciNet.  
9. Tangent methods for nonlinear equations.  
   King, Richard F.
   Numer. Math.  18  (1971/72), 298--304, MathSciNet.  
10. A procedure for solving polynomial equations by Muller's method. (Russian)    
    Lozovskiui, V. S.    
    Vyvcisl. Sistemy No. 44 (1971), 155--161, MathSciNet.  

(c) John H. Mathews 2004