计算秩分布矩阵
Computing the Rank Profile Matrix
摘要:
行(Resp。列)的秩分布描述了其行(分别为列)梯形。在ISSAC'13的论文中,我们提出了一种递归高斯消去法,该方法可以同时计算矩阵及其所有前导子矩阵的行和列秩分布,与现有技术的高斯消去算法相同。在这里,我们首先研究的条件,使高斯消除算法揭示这一信息。因此,我们提出了一个新的矩阵不变量的定义,秩配置矩阵,总结所有信息的行和列秩配置文件的所有领导的子矩阵。我们还探讨了高斯消除算法计算全部或部分不变量的条件,通过相应的PLUQ分解。因此,我们表明,经典的迭代CUP分解算法实际上可以适用于计算的秩配置矩阵。在Crout变体中,作为我们ISSAC'13实现的基础案例,它提供了效率的显著提高。第二,行(resp)。列)的梯形矩阵通常通过不同的专用三角分解计算。我们在这里表明,从一些PLUQ分解,它是可能的,以恢复一个矩阵的行和列的梯队形式和它的任何领先的子矩阵由于一个基本的后处理算法。
英文摘要:
The row (resp. column) rank profile of a matrix describes the staircase shape of its row (resp. column) echelon form. In an ISSAC'13 paper, we proposed a recursive Gaussian elimination that can compute simultaneously the row and column rank profiles of a matrix as well as those of all of its leading sub-matrices, in the same time as state of the art Gaussian elimination algorithms. Here we first study the conditions making a Gaus-sian elimination algorithm reveal this information. Therefore, we propose the definition of a new matrix invariant, the rank profile matrix, summarizing all information on the row and column rank profiles of all the leading sub-matrices. We also explore the conditions for a Gaussian elimination algorithm to compute all or part of this invariant, through the corresponding PLUQ decomposition. As a consequence, we show that the classical iterative CUP decomposition algorithm can actually be adapted to compute the rank profile matrix. Used, in a Crout variant, as a base-case to our ISSAC'13 implementation, it delivers a significant improvement in efficiency. Second, the row (resp. column) echelon form of a matrix are usually computed via different dedicated triangular decompositions. We show here that, from some PLUQ decompositions, it is possible to recover the row and column echelon forms of a matrix and of any of its leading sub-matrices thanks to an elementary post-processing algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。