A greedy algorithm for the optimal basis problem

BIT Numerical Mathematics

Volumn 37, Issue 3, 1997, Pages 591-599

  Burdakov, Oleg ^a  

^a CERFACS   (France)

Author keywords

Greedy algorithm; Interpolation methods; Minimum spanning tree problem; Optimal basis problem; Secant approximation of derivatives; The Hadamard condition number

Indexed keywords

EID: 0012087557     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02510241     Document Type: Article

References (20)

1. C. Berge, Graphes et Hypergraphes, Dunod, Paris, 1970.
2. C. Berge and A. Ghouilla-Houri, Programming, Games, and Transportation Networks, John Wiley & Sons, New York, 1965.
3. G. Birkhoff, Two Hadamard numbers for matrices, Comm. ACM, 23 (1975), pp. 25-29.
4. O. P. Burdakov, Stable versions of the secant method for solving systems of equations, U.S.S.R. Comput. Math and Math. Phys., 23:5 (1983), pp. 1-10.
5. O. P. Burdakov, On superlinear convergence of some stable variants of the secant method, ZAMM, 66 (1986), pp. 615-622.
6. O. P. Burdakov, Stable symmetric secant methods with restart, Cybernetics, 27 (1991), pp. 390-396.
7. O. P. Burdakov, On using the minimum spanning tree algorithm for optimal secant approximation of derivatives, ZAMM, 76 (1996), No. S3, pp. 389-390.
8. O. P. Burdakov and U. Felgenhauer, Stable multipoint secant methods with released requirements to points position. In System Modelling and Optimization, J. Henry et al., eds., Springer-Verlag, London, 1994, pp. 225-236.
9. A. R. Conn and Ph. L. Toint, An algorithm using quadratic interpolation for unconstrained derivative free optimization. In Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi, eds., Plenum Press, New York, 1996, pp. 27-47.
10. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, ACM, New York City, 1987, pp. 1-6.
11. E. W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik, 1 (1959), pp. 269-271.
12. S. Even, Graph Algorithms, Computer Science Press, Potomac, Maryland, 1979.
13. F. R. Gantmacher, The Theory of Matrices, Chelsea, New York, 1959.
14. H. W. Guggenheimer, A. S. Edelman, and C. R. Johnson, A simple estimate of the condition number of a linear system, College Mathematics Journal, 26 (1995), pp. 2-5.
15. N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
16. M. Iri, Network Flows, Transportation and Scheduling, Academic Press, New York, 1969.
17. J. M. Ortega and W. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
18. Ch. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
19. M. J. D. Powell, A direct search optimization method that models the objective and constraint functions by linear interpolation. In Advances in Optimization and Numerical Analysis, Proceedings of the Sixth Workshop on Optimization and Numerical Analysis, Oaxaca, Mexico, Vol. 275, Kluwer Academic Publishers, 1994, pp. 51-67.
20. M. J. D. Powell, A direct search optimization method that models the objective by quadratic interpolation. Presentation at the 5th Stockholm Optimization Days, 1994.