
doi: 10.1137/0905030
The paper surveys some of the more commonly used methods for approximating the rank of a matrix X, with particular attention to the effects of errors. It is supposed that X itself cannot be observed and only a perturbed matrix \(X=X+E\) is given.
QR decomposition, Vector spaces, linear dependence, rank, lineability, rank, inverse, Other matrix algorithms, singular value decomposition, perturbed matrix
QR decomposition, Vector spaces, linear dependence, rank, lineability, rank, inverse, Other matrix algorithms, singular value decomposition, perturbed matrix
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 52 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
