On the public citation graph

randUTV

https://doi.org/10.1145/3242670
0 signed · 69 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-4532-0_2openalex-snapshot
Modification and Maintenance of ULV Decompositions
inferredcites →https://doi.org/10.1007/bf01740542openalex-snapshot
An algorithm and a stability theory for downdating the ULV decomposition
inferredcites →https://doi.org/10.1007/s00211-007-0114-xopenalex-snapshot
Fast linear algebra is stable
inferredcites →https://doi.org/10.1007/s00453-014-9891-7openalex-snapshot
Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds
inferredcites →https://doi.org/10.1007/s10444-016-9494-8openalex-snapshot
Efficient algorithms for cur and interpolative matrix decompositions
inferredcites →https://doi.org/10.1016/0024-3795(87)90103-0openalex-snapshot
Rank revealing QR factorizations
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/j.acha.2010.02.003openalex-snapshot
A randomized algorithm for the decomposition of matrices
inferredcites →https://doi.org/10.1023/a:1019112103049openalex-snapshot
UTV Tools: Matlab templates for rank-revealing UTV decompositions
inferredcites →https://doi.org/10.1023/a:1019254318361openalex-snapshot
Low-rank revealing UTV decompositions
inferredcites →https://doi.org/10.1073/pnas.0709640104openalex-snapshot
Randomized algorithms for the low-rank approximation of matrices
inferredcites →https://doi.org/10.1109/78.139256openalex-snapshot
An updating algorithm for subspace tracking
inferredcites →https://doi.org/10.1109/mcse.2009.207openalex-snapshot
The libflame Library for Dense Matrix Computations
inferredcites →https://doi.org/10.1137/0614034openalex-snapshot
Updating a Rank-Revealing ULV Decomposition
inferredcites →https://doi.org/10.1137/080736417openalex-snapshot
A Randomized Algorithm for Principal Component Analysis
inferredcites →https://doi.org/10.1137/090771806openalex-snapshot
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
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/0917055openalex-snapshot
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
inferredcites →https://doi.org/10.1137/1.9780898719604openalex-snapshot
LAPACK Users' Guide
inferredcites →https://doi.org/10.1137/1.9781611971446openalex-snapshot
Applied Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/100804139openalex-snapshot
An Algorithm for the Principal Component Analysis of Large Data Sets
inferredcites →https://doi.org/10.1137/130938700openalex-snapshot
Subspace Iteration Randomization and Singular Value Problems
inferredcites →https://doi.org/10.1137/15m1026080openalex-snapshot
A Randomized Blocked Algorithm for Efficiently Computing Rank-revealing Factorizations of Matrices
inferredcites →https://doi.org/10.1137/15m1044680openalex-snapshot
Randomized QR with Column Pivoting
inferredcites →https://doi.org/10.1137/16m1081270openalex-snapshot
Householder QR Factorization With Randomization for Column Pivoting (HQRRP)
inferredcites →https://doi.org/10.1137/s0895479892241913openalex-snapshot
Downdating the Rank-Revealing URV Decomposition
inferredcites →https://doi.org/10.1137/s1064827595296732openalex-snapshot
A BLAS-3 Version of the QR Factorization with Column Pivoting
inferredcites →https://doi.org/10.1137/s1064827597319519openalex-snapshot
The QLP Approximation to the Singular Value Decomposition
inferredcites →https://doi.org/10.1137/s1064827597325141openalex-snapshot
Hybrid Gauss-Trapezoidal Quadrature Rules
inferredcites →https://doi.org/10.1137/s1064827598345679openalex-snapshot
A Note On Parallel Matrix Inversion
inferredcites →https://doi.org/10.1145/1141885.1141886openalex-snapshot
Accumulating Householder transformations, revisited
inferredcites →https://doi.org/10.1145/504210.504213openalex-snapshot
FLAME
inferredcites →https://doi.org/10.21236/ada458904openalex-snapshot
On Interpolation and Integration in Finite-Dimensional Spaces of Bounded Functions
inferredcites →https://doi.org/10.21236/ada458932openalex-snapshot
A Randomized Algorithm for the Approximation of Matrices
inferredcites →https://doi.org/10.2140/camcos.2006.1.133openalex-snapshot
On interpolation and integration in finite-dimensional spaces of bounded functions
inferredcites →https://doi.org/10.2307/2153226openalex-snapshot
Solving Linear Systems on Vector and Shared Memory Computers.
inferredcites →https://doi.org/10.2307/2669960openalex-snapshot
Matrix Algorithms, Volume 1: Basic Decompositions
inferredcites →https://doi.org/10.4135/9781452229669.n3824openalex-snapshot
U.S. Department of Commerce
inferredcites →https://doi.org/10.4153/cmb-1966-083-2openalex-snapshot
Numerical Linear Algebra
inferredcites →https://doi.org/10.48550/arxiv.1505.08115openalex-snapshot
Blocked rank-revealing QR factorizations: How randomized sampling can be used to avoid single-vector pivoting
inferredcites →https://doi.org/10.5555/1899353.1899359openalex-snapshot
A Randomized Algorithm for Principal Component Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.7726openalex-snapshot
Computing rank‐revealing factorizations of matrices stored out‐of‐core
inferred← citeshttps://doi.org/10.1002/int.22893openalex-snapshot
A watermarking scheme for dual‐color images based on URV decomposition and image correction
inferred← citeshttps://doi.org/10.1002/nla.2515openalex-snapshot
Efficient algorithms for computing rank‐revealing factorizations on a GPU
inferred← citeshttps://doi.org/10.1002/nla.70002openalex-snapshot
Adaptive Parallelizable Algorithms for Interpolative Decompositions via Partially Pivoted LU
inferred← citeshttps://doi.org/10.1007/978-3-030-70277-9_3openalex-snapshot
Single Solution Metaheuristics
inferred← citeshttps://doi.org/10.1007/s00371-022-02610-2openalex-snapshot
A robust and secure blind color image watermarking scheme based on contourlet transform and Schur decomposition
inferred← citeshttps://doi.org/10.1007/s10915-022-01956-yopenalex-snapshot
An Efficient Algorithm for Computing the Approximate t-URV and its Applications
inferred← citeshttps://doi.org/10.1016/j.camwa.2024.02.022openalex-snapshot
Piecewise DMD for oscillatory and Turing spatio-temporal dynamics
inferred← citeshttps://doi.org/10.1016/j.ins.2023.119464openalex-snapshot
An efficient randomized QLP algorithm for approximating the singular value decomposition
inferred← citeshttps://doi.org/10.1016/j.laa.2024.01.001openalex-snapshot
Fast randomized numerical rank estimation for numerically low-rank matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2025.11.013openalex-snapshot
Estimating a matrix's singular values with interpolative decompositions
inferred← citeshttps://doi.org/10.1016/j.sigpro.2022.108575openalex-snapshot
From multilinear SVD to multilinear UTV decomposition
inferred← citeshttps://doi.org/10.1017/s0962492920000021openalex-snapshot
Randomized numerical linear algebra: Foundations and algorithms
inferred← citeshttps://doi.org/10.1051/m2an/2019088openalex-snapshot
Outgoing solutions and radiation boundary conditions for the ideal atmospheric scalar wave equation in helioseismology
inferred← citeshttps://doi.org/10.1109/icmsp53480.2021.9513402openalex-snapshot
A Randomized Algorithm for Approximating Truncated SVD
inferred← citeshttps://doi.org/10.1109/icspcc46631.2019.8960878openalex-snapshot
Randomized ULV Decomposition for Approximating Low-Rank Matrices
inferred← citeshttps://doi.org/10.1109/tsp.2018.2853137openalex-snapshot
Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
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/20m1335571openalex-snapshot
Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
inferred← citeshttps://doi.org/10.1137/25m1736839openalex-snapshot
A Novel Adaptive Low-Rank Matrix Approximation Method for Image Compression and Reconstruction
inferred← citeshttps://doi.org/10.1145/3507466openalex-snapshot
Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures
inferred← citeshttps://doi.org/10.1177/1094342020918305openalex-snapshot
A parallel hierarchical blocked adaptive cross approximation algorithm
inferred← citeshttps://doi.org/10.23919/eusipco.2018.8553296openalex-snapshot
Subspace-Orbit Randomized - Based Decomposition for Low-Rank Matrix Approximations
inferred← citeshttps://doi.org/10.3389/fenrg.2021.692627openalex-snapshot
An Eulerian Single-Phase Transport Model for Solid Fission Products in the Molten Salt Fast Reactor: Development of an Analytical Solution for Verification Purposes
inferred← citeshttps://doi.org/10.48550/arxiv.2104.05782openalex-snapshot
Efficient algorithms for computing a rank-revealing UTV factorization on parallel computing architectures
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14385openalex-snapshot
A theory of meta-factorization
inferred← citeshttps://doi.org/10.70675/e437c495z786ez458dzb88dz67742cb983afopenalex-snapshot
Improving the memory and time overhead of low-rank parallel linear sparse direct solvers
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.