On the public citation graph
Stewart's pivoted QLP decomposition for low‐rank matrices
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0024-3795(93)90493-8openalex-snapshot
A block QR algorithm and the singular value decomposition
inferredcites →https://doi.org/10.1016/s0024-3795(96)00301-1openalex-snapshot
A theory of pseudoskeleton approximations
inferredcites →https://doi.org/10.1023/a:1024082314087openalex-snapshot
On the Convergence of Stewart's QLP Algorithm for Approximating the SVD
inferredcites →https://doi.org/10.1137/0732088openalex-snapshot
Relative Perturbation Techniques for Singular Value Problems
inferredcites →https://doi.org/10.1137/0908009openalex-snapshot
The WY Representation for Products of Householder Matrices
inferredcites →https://doi.org/10.1137/0910005openalex-snapshot
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
inferredcites →https://doi.org/10.1137/s0895479891223781openalex-snapshot
On Rank-Revealing Factorisations
inferredcites →https://doi.org/10.1137/s0895479892236532openalex-snapshot
Analysis of a QR Algorithm for Computing Singular Values
inferredcites →https://doi.org/10.1137/s1064827597319519openalex-snapshot
The QLP Approximation to the Singular Value Decomposition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10915-018-0885-5openalex-snapshot
ALORA: Affine Low-Rank Approximations
inferred← citeshttps://doi.org/10.1007/s11075-005-2263-2openalex-snapshot
UTV Expansion Pack: Special-purpose rank-revealing algorithms
inferred← citeshttps://doi.org/10.1016/j.laa.2020.03.041openalex-snapshot
Randomized QLP decomposition
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00040openalex-snapshot
PAQR: Pivoting Avoiding QR factorization
inferred← citeshttps://doi.org/10.1109/lsp.2019.2920054openalex-snapshot
Randomized Truncated Pivoted QLP Factorization for Low-Rank Matrix Recovery
inferred← citeshttps://doi.org/10.1109/tsp.2020.3001399openalex-snapshot
Efficient Low-Rank Approximation of Matrices Based on Randomized Pivoted Decomposition
inferred← citeshttps://doi.org/10.1109/tsp.2021.3066258openalex-snapshot
Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices
inferred← citeshttps://doi.org/10.1137/13092157xopenalex-snapshot
Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
inferred← citeshttps://doi.org/10.1553/etna_vol51s469openalex-snapshot
Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1803.01982openalex-snapshot
Low-Rank Matrix Approximations with Flip-Flop Spectrum-Revealing QR Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.1811.09334openalex-snapshot
Randomized QLP algorithm and error analysis
inferred← citeshttps://doi.org/10.70675/1db07b9cz1be1z4407z8eb7za27dc296fdecopenalex-snapshot
Complexity reduction methods applied to the rapid solution to multi-trace boundary integral formulations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.