Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization¶
Gu, M., & Eisenstat, S. C. (1996). Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization. SIAM Journal on Scientific Computing, 17(4), 848-869.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Rank-Revealing QR Factorization
- It reveals the rank in nearly every practical case, but contrived matrices exist on which no single pivot exposes the deficiency, which is why "strong" variants were developed.
This sourceShows that ordinary column-pivoted QR works well in practice but fails on constructed examples, motivating and evaluating strong rank-revealing variants.
- It reveals the rank in nearly every practical case, but contrived matrices exist on which no single pivot exposes the deficiency, which is why "strong" variants were developed.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:88d0b322692f · see in the full table