On the public citation graph
Reconstructing Householder Vectors from Tall-Skinny QR
0 signed · 58 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.1002/cpe.1206openalex-snapshot
Collective communication: theory, practice, and experience
inferredcites →https://doi.org/10.1007/978-3-642-23397-5_10openalex-snapshot
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms
inferredcites →https://doi.org/10.1007/s13160-011-0053-xopenalex-snapshot
Backward error analysis of the AllReduce algorithm for householder QR decomposition
inferredcites →https://doi.org/10.1016/j.future.2006.04.017openalex-snapshot
Communication-efficient parallel generic pairwise elimination
inferredcites →https://doi.org/10.1016/j.parco.2013.01.003openalex-snapshot
Hierarchical QR factorization algorithms for multi-core clusters
inferredcites →https://doi.org/10.1109/ipdps.2010.5470475openalex-snapshot
QR factorization of tall and skinny matrices in a grid computing environment
inferredcites →https://doi.org/10.1109/ipdps.2011.15openalex-snapshot
Communication-Avoiding QR Decomposition for GPUs
inferredcites →https://doi.org/10.1109/ipdps.2011.93openalex-snapshot
A Communication-Avoiding, Hybrid-Parallel, Rank-Revealing Orthogonalization Method
inferredcites →https://doi.org/10.1109/ipdps.2014.120openalex-snapshot
Reconstructing Householder Vectors from Tall-Skinny QR
inferredcites →https://doi.org/10.1109/sc.2010.48openalex-snapshot
Scalable Tile Communication-Avoiding QR Factorization on Multicore Cluster Systems
inferredcites →https://doi.org/10.1137/0139032openalex-snapshot
Broadcast Time in Communication Networks
inferredcites →https://doi.org/10.1137/0725014openalex-snapshot
Block Reflectors: Theory and Computation
inferredcites →https://doi.org/10.1137/080731992openalex-snapshot
Communication-optimal Parallel and Sequential QR and LU Factorizations
inferredcites →https://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/0910005openalex-snapshot
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
inferredcites →https://doi.org/10.1137/0913042openalex-snapshot
Modification of the Householder Method Based on the Compact WY Representation
inferredcites →https://doi.org/10.1137/13092157xopenalex-snapshot
Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
inferredcites →https://doi.org/10.1137/s0895479894276369openalex-snapshot
A Basis-Kernel Representation of Orthogonal Matrices
inferredcites →https://doi.org/10.1177/1094342005051521openalex-snapshot
Optimization of Collective Communication Operations in MPICH
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-16145-3_45openalex-snapshot
Exploring Dual-Triangular Structure for Efficient R-Initiated Tall-Skinny QR on GPGPU
inferred← citeshttps://doi.org/10.1007/978-3-319-17353-5_23openalex-snapshot
Performance Analysis of the Householder-Type Parallel Tall-Skinny QR Factorizations Toward Automatic Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-49631-3_4openalex-snapshot
Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.06.003openalex-snapshot
Reconstructing Householder vectors from Tall-Skinny QR
inferred← citeshttps://doi.org/10.1016/j.parco.2020.102703openalex-snapshot
A parallel strategy for density functional theory computations on accelerated nodes
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.410openalex-snapshot
Multilevel Communication Optimal Least Squares
inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot
Communication lower bounds and optimal algorithms for numerical linear algebra
inferred← citeshttps://doi.org/10.1073/pnas.2122762119openalex-snapshot
Large-scale distributed linear algebra with tensor processing units
inferred← citeshttps://doi.org/10.1098/rsta.2019.0066openalex-snapshot
Numerical algorithms for high-performance computational science
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840606openalex-snapshot
Matrix factorizations at scale: A comparison of scientific data analytics in spark and C+MPI using three case studies
inferred← citeshttps://doi.org/10.1109/fpl.2015.7293751openalex-snapshot
Towards heterogeneous solvers for large-scale linear systems
inferred← citeshttps://doi.org/10.1109/icieam.2016.7911607openalex-snapshot
Implementation of QR and LQ decompositions on shared memory parallel computing systems
inferred← citeshttps://doi.org/10.1109/ipdps.2015.56openalex-snapshot
Hierarchical DAG Scheduling for Hybrid Distributed Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00020openalex-snapshot
Communication-Avoiding Cholesky-QR2 for Rectangular Matrices
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00014openalex-snapshot
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9173985openalex-snapshot
Coded QR Decomposition
inferred← citeshttps://doi.org/10.1109/lsens.2023.3303074openalex-snapshot
Speeding up System Identification Algorithms on a Parallel RISC-V MCU for Fast Near-Sensor Vibration Diagnostic
inferred← citeshttps://doi.org/10.1109/scala.2014.11openalex-snapshot
CholeskyQR2: A Simple and Communication-Avoiding Algorithm for Computing a Tall-Skinny QR Factorization on a Large-Scale Parallel System
inferred← citeshttps://doi.org/10.1109/tpds.2024.3522776openalex-snapshot
High Performance Householder QR Factorization on Emerging GPU Architectures Using Tensor Cores
inferred← citeshttps://doi.org/10.1137/18m1197400openalex-snapshot
Block Modified Gram--Schmidt Algorithms and Their Analysis
inferred← citeshttps://doi.org/10.1137/19m1296367openalex-snapshot
Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
inferred← citeshttps://doi.org/10.1145/2686877openalex-snapshot
Avoiding Communication in Successive Band Reduction
inferred← citeshttps://doi.org/10.1145/3087556.3087561openalex-snapshot
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem
inferred← citeshttps://doi.org/10.1145/3330345.3330356openalex-snapshot
Least squares solvers for distributed-memory machines with GPU accelerators
inferred← citeshttps://doi.org/10.1145/3572848.3577516openalex-snapshot
Fast Symmetric Eigenvalue Decomposition via WY Representation on Tensor Core
inferred← citeshttps://doi.org/10.1145/3774934.3786427openalex-snapshot
Towards Singular Value Decomposition for Rank-Deficient Matrices: An Efficient and Accurate Algorithm on GPU Architectures
inferred← citeshttps://doi.org/10.1145/3806645.3818781openalex-snapshot
Achieving 86% Peak GPU Throughput for Distributed QR Factorization
inferred← citeshttps://doi.org/10.14495/jsiaml.16.89openalex-snapshot
Iterative refinement for an eigenpair subset of a real symmetric matrix
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02504openalex-snapshot
Fault Tolerant QR Factorization for General Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1607.01335openalex-snapshot
Matrix Factorization at Scale: a Comparison of Scientific Data Analytics in Spark and C+MPI Using Three Case Studies
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06524openalex-snapshot
A Generalized Randomized Rank-Revealing Factorization
inferred← citeshttps://doi.org/10.70675/2c802f33z5cebz433azb2cfzbeaee3f7ff31openalex-snapshot
Application-based fault tolerance for numerical linear algebra at large scale
showing the first 34 of 35 · page through all 35
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.