Estimation of top singular values is one of the widely used techniques and one of the intensively researched problems in Numerical Linear Algebra and Data Science. We consider here two general questions related to this problem:
How top singular values are affected by zeroing out a sparse rectangular block of a matrix?
How much top singular values differ from top column norms of a tall sparse non-negative matrix ?
Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matrices
Stanford University(斯坦福大学);Purdue University(普渡大学);Purdue University Institute for Computational and Bindley Biosciences Center(普渡大学计算与Bindley生物科学中心);Computer Science Mathematical Engineering(计算机科学数学工程)
QR Factorization of Tall and Skinny Matrices in a Grid Computing Environment
University of Tennessee(田纳西大学);INRIA Saclay-Île de France(法国国家信息与自动化研究所萨克雷-法兰西岛分部);Univ Paris Sud, University of Tennesse, LRI, INRIA(巴黎第十一大学、田纳西大学、LRI、法国国家信息与自动化研究所);University of Colorado Denver(科罗拉多大学丹佛分校)
Shifted CholeskyQR for computing the QR factorization of ill-conditioned matrices
Hokkaido University(北海道大学);Arup(奥雅纳);National Institute of Informatics(国立情报学研究所);The University of Electro-Communications(电气通信大学);JST CREST(日本科学技术振兴机构战略创造事业);Waseda university(早稻田大学)
Fast approximation of orthogonal matrices and application to PCA
Faculty of Automatic Control and Computers, University Politehnica Bucharest(布加勒斯特理工大学自动控制与计算机学院);LCSL, Universitá di Genova(热那亚大学LCSL);Massachusetts Institute of Technology(麻省理工学院);Istituto Italiano di Tecnologia(意大利技术研究院)