CUR Decompositions, Approximations, and Perturbations
Department of Mathematics, University of Arizona, Tucson, AZ 85719 USA(亚利桑那大学数学系,图森,亚利桑那州,85719 USA);Department of Mathematics, Vanderbilt University, Nashville, TN 37240 USA(范德比尔特大学数学系,纳什维尔,田纳西州,37240 USA)
This article discusses a useful tool in dimensionality reduction and low-rank matrix approximation called the CUR decomposition. Various viewpoints of this method in the literature are synergized and are compared and contrasted; included in this is a new characterization of exact CUR decompositions. A novel perturbation analysis is performed on CUR approximations of noisy versions of low-rank matrices, which compares them with the putative CUR decomposition of the underlying low-rank part. Additionally, we give new column and row sampling results which allow one to conclude that a CUR decomposition of a low-rank matrix is attained with high probability. We then illustrate the stability of these sampling methods under the perturbations studied before, and provide numerical illustrations of the methods and bounds discussed.
A Bloch decomposition based split-step pseudo spectral method for quantum dynamics with periodic potentials
Tsinghua University(清华大学);University of Wisconsin, Madison(威斯康星大学麦迪逊分校);Wolfgang Pauli Institute Vienna(维也纳沃尔夫冈·泡利研究所);Faculty of Mathematics, University of Vienna(维也纳大学数学学院)