Abstract.
We present an analysis of algorithms for finding saddle points in a random matrix, presented by Donald E. Knuth as Exercise 1.3.2-12 in The Art of Computer Programming . We estimate the average computing costs of three saddle point search algorithms. Amusingly, the asymptotic results in this analysis about matrix saddle points uses the same approach that leads to the celebrated saddle point method in complex analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 22, 1997; revised March 15, 1998.
Rights and permissions
About this article
Cite this article
Hofri, M., Jacquet, P. Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms. Algorithmica 22, 516–528 (1998). https://doi.org/10.1007/PL00009237
Issue Date:
DOI: https://doi.org/10.1007/PL00009237