Improved bound for rank revealing LU factorizations

Tsung Min Hwang, Wen Wei Lin, Daniel Pierce

研究成果: 雜誌貢獻文章

12 引文 斯高帕斯(Scopus)

摘要

In many applications it is necessary to determine the rank (or numerical rank) of a matrix. Many of these situations involve matrices that are very large order or that are sparse or that may undergo some form of modification (rank-k update, row or column appended or removed). In these cases the singular value decomposition's cost may be prohibitively high or the decomposition may not be computationally feasible (especially for large sparse problems). We thus examine the theoretical merits of rank revealing LU (RRLU) factorizations. We find that in those cases where the nullity is small and the gap is well defined, an RRLU factorization could be a very useful tool.

原文英語
頁(從 - 到)173-186
頁數14
期刊Linear Algebra and Its Applications
261
發行號1-3
DOIs
出版狀態已發佈 - 1997 八月

    指紋

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

引用此