求解马鞍点的两种算法及性能分析

求解矩阵中的马鞍点是计算机程序设计中的常见问题。结合矩阵中马鞍点的特点,给出了求解矩阵中的马鞍点的依次搜索法和多马鞍点相等法,详细叙述了它们的算法思想,特别对多马鞍点相等法的理论基础做了证明,分别给出了对应的算法。最后针对这两种算法进行了时间性能和空间性能的分析和比较,总结了两种算法各自的优缺点。

Two Algorithms about Solving the Saddle Point and Analyzing Performance

To solve the saddle point is the common problem in computer programming. Combine with the characteristic of saddle point in matrix,the paper propose two algorithms to solve the saddle point ,such as the method of search in turn and the equal of multi saddle point. And describe the thinking and corresponding code of the algorithm in detail,especially,the method of equal of multi saddle point is proved. Last the time and space performance of the arithmetic are analyzed and compared,and summarize the respectiv...