On the public citation graph
A Parallel QR Factorization Algorithm with Controlled Local Pivoting
0 signed · 53 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.1007/3-540-12914-6openalex-snapshot
Large Sparse Numerical Optimization
inferredcites →https://doi.org/10.1007/3-540-51604-2_4openalex-snapshot
Solution of nonlinear least squares problems on a multiprocessor
inferredcites →https://doi.org/10.1007/978-1-4684-6357-6_12openalex-snapshot
Block Algorithms for Parallel Machines
inferredcites →https://doi.org/10.1007/bf01436084openalex-snapshot
Linear least squares solutions by householder transformations
inferredcites →https://doi.org/10.1016/0024-3795(86)90115-1openalex-snapshot
Rank and null space calculations using matrix decomposition without column interchanges
inferredcites →https://doi.org/10.1016/0024-3795(86)90169-2openalex-snapshot
Complexity of dense-linear-system solution on a multiprocessor ring
inferredcites →https://doi.org/10.1016/0024-3795(87)90103-0openalex-snapshot
Rank revealing QR factorizations
inferredcites →https://doi.org/10.1016/0167-8191(86)90004-9openalex-snapshot
Implementation of some concurrent algorithms for matrix factorization
inferredcites →https://doi.org/10.1137/0717034openalex-snapshot
The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
inferredcites →https://doi.org/10.1137/0908009openalex-snapshot
The WY Representation for Products of Householder Matrices
inferredcites →https://doi.org/10.1137/0909032openalex-snapshot
A Parallel Triangular Solver for a Distributed-Memory Multiprocessor
inferredcites →https://doi.org/10.1137/0909037openalex-snapshot
Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
inferredcites →https://doi.org/10.1137/0909038openalex-snapshot
Modified Cyclic Algorithms for Solving Triangular Systems on Distributed-Memory Multiprocessors
inferredcites →https://doi.org/10.1137/0910005openalex-snapshot
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
inferredcites →https://doi.org/10.1137/0910025openalex-snapshot
A New Method for Solving Triangular Systems on Distributed-Memory Message-Passing Multiprocessors
inferredcites →https://doi.org/10.1137/0911063openalex-snapshot
Solving Systems of Nonlinear Equations on a Message-Passing Multiprocessor
inferredcites →https://doi.org/10.1177/109434208800200103openalex-snapshot
Impact of Hierarchical Memory Systems On Linear Algebra Algorithm Design
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3540761691_9openalex-snapshot
Parallel Algorithms for Computing Rank-Revealing QR Factorizations
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.1007/978-3-642-38718-0_8openalex-snapshot
Parallelization of the QR Decomposition with Column Pivoting Using Column Cyclic Distribution on Multicore and GPU Processors
inferred← citeshttps://doi.org/10.1007/978-3-642-75833-1_13openalex-snapshot
Fundamental Linear Algebra Computations on High-Performance Computers
inferred← citeshttps://doi.org/10.1007/bf02139475openalex-snapshot
A block algorithm for computing rank-revealing QR factorizations
inferred← citeshttps://doi.org/10.1007/s10915-018-0885-5openalex-snapshot
ALORA: Affine Low-Rank Approximations
inferred← citeshttps://doi.org/10.1007/s11390-010-9372-7openalex-snapshot
A Unified Co-Processor Architecture for Matrix Decomposition
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00124-7openalex-snapshot
Gaussian quadrature for matrix valued functions on the real line
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90066-vopenalex-snapshot
Parallel structured networks for solving a wide variety of matrix algebra problems
inferred← citeshttps://doi.org/10.1016/s0377-0427(96)00109-4openalex-snapshot
Improved parallel QR method for large least squares problems involving Kronecker products
inferred← citeshttps://doi.org/10.1023/a:1011192320367openalex-snapshot
Efficient Algorithms for the Block Hessenberg Form
inferred← citeshttps://doi.org/10.1023/a:1021933127041openalex-snapshot
A Low-Complexity Divide-and-Conquer Method for Computing Eigenvalues and Eigenvectors of Symmetric Band Matrices
inferred← citeshttps://doi.org/10.1109/71.219760openalex-snapshot
The parallel complexity of embedding algorithms for the solution of systems of nonlinear equations
inferred← citeshttps://doi.org/10.1109/fpl.2009.5272252openalex-snapshot
FPGA accelerating three QR decomposition algorithms in the unified pipelined framework
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00040openalex-snapshot
PAQR: Pivoting Avoiding QR factorization
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00015openalex-snapshot
A Cholesky QR type algorithm for computing tall-skinny QR factorization with column pivoting
inferred← citeshttps://doi.org/10.1109/mcse.2018.042781323openalex-snapshot
A Note on QR-Based Model Reduction: Algorithm, Software, and Gravitational Wave Applications
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296624openalex-snapshot
Parallel performance of a symmetric eigensolver based on the invariant subspace decomposition approach
inferred← citeshttps://doi.org/10.1109/splc.1993.365575openalex-snapshot
The PRISM project: infrastructure and algorithms for parallel eigensolvers
inferred← citeshttps://doi.org/10.1137/0912073openalex-snapshot
Structure-Preserving and Rank-Revealing QR-Factorizations
inferred← citeshttps://doi.org/10.1137/13092157xopenalex-snapshot
Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
inferred← citeshttps://doi.org/10.1137/130922872openalex-snapshot
On Incremental Condition Estimators in the 2-Norm
inferred← citeshttps://doi.org/10.1137/15m1044680openalex-snapshot
Randomized QR with Column Pivoting
inferred← citeshttps://doi.org/10.1137/16m1074527openalex-snapshot
Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
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/s0895479891222106openalex-snapshot
Large Least Squares Problems Involving Kronecker Products
inferred← citeshttps://doi.org/10.1137/s1064827592228833openalex-snapshot
A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues
inferred← citeshttps://doi.org/10.1137/s1064827595296732openalex-snapshot
A BLAS-3 Version of the QR Factorization with Column Pivoting
inferred← citeshttps://doi.org/10.1145/109025.109067openalex-snapshot
Exploiting parallelism in automatic differentiation
inferred← citeshttps://doi.org/10.1145/290200.287637openalex-snapshot
Computing rank-revealing QR factorizations of dense matrices
inferred← citeshttps://doi.org/10.2172/10133022openalex-snapshot
Robust incremental condition estimation
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.