矩形最大体积和投影体积搜索算法
Rectangular maximum volume and projective volume search algorithms
AI总结:
本文提出并研究了寻找局部最大体积和大投影体积子矩阵的新方法,并对现有方法进行了详细分析。新方法的有效性在构造交叉近似时得到验证,并在搜索强非退化子矩阵时证明了估计的正确性,同时特别关注起始子矩阵的选择。
摘要:
新方法用于寻找具有(局部)最大体积和大投影体积的子矩阵,并对现有方法进行了详细分析。在构造交叉近似时展示了新方法的有效性,并在应用以搜索强非退化子矩阵的情况下证明了估计。同时,也特别关注起始子矩阵的选择。
英文摘要:
New methods for finding submatrices of (locally) maximal volume and large projective volume are proposed and studied. Detailed analysis is also carried out for existing methods. The effectiveness of the new methods is shown in the construction of cross approximations, and estimates are also proved in the case of their application for the search for a strongly nondegenerate submatrix. Much attention is also paid to the choice of the starting submatrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。