On using the minimum spanning tree algorithm for optimal secant approximation of derivatives

ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik

Volumn 76, Issue SUPPL. 3, 1996, Pages 389-390

  Burdakov, O P ^a  

^a CERFACS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27644488474     PISSN: 00442267     EISSN: 15214001     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. BURDAKOV, O.P., FELGENHAUER, U.: Stable multipoint secant methods with released requirements to points position, in: Henry, J. et al. (Eds.), System Modelling and Optimization; Springer-Verlag, London 1994, 225-236.
2. BURDAKOV, O.P.: Stable versions of the secant method for solving systems of equations; U.S.S.R. Comput. Math and Math. Phys. 23, No. 5 (1983), 1-10.
3. BURDAKOV, O.P.: On superlinear convergence of some stable variants of the secant method; ZAMM 66 (1986), 615-622.
4. BURDAKOV, O.P.: Stable symmetric secant methods with restart; Cybernetics 27 (1991), 390-396.
5. EVEN, S.: Graph Algorithms; Computer Science Press, Potomac, Maryland 1979.
6. PAPADIMITRIOU, CH. H., STEIGLITZ, K.: Combinatorial Optimization: Algorithms and Complexity; Prentice-Hall, Englewood Cliffs, New Jersey 1982.
7. BURDAKOV, O.P.: An MST-type algorithm for the optimal basis problem; CERFACS Report TR/PA/95/22, Toulouse 1995.