On the public citation graph

A block algorithm for computing rank-revealing QR factorizations

https://doi.org/10.1007/bf02139475
0 signed · 43 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-3-7091-4433-6_42openalex-snapshot
Using a Fast Signal Processor to Solve the Inverse Kinematic Problem
inferredcites →https://doi.org/10.1007/bf01436075openalex-snapshot
Numerical methods for solving linear least squares problems
inferredcites →https://doi.org/10.1007/bfb0067700openalex-snapshot
The Levenberg-Marquardt algorithm: Implementation and theory
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(87)90103-0openalex-snapshot
Rank revealing QR factorizations
inferredcites →https://doi.org/10.1016/0167-8396(87)90005-7openalex-snapshot
An iterative method for computing multivariate C1 piecewise polynomial interpolants
inferredcites →https://doi.org/10.1090/s0025-5718-1992-1106970-4openalex-snapshot
Rank-revealing 𝑄𝑅 factorizations and the singular value decomposition
inferredcites →https://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferredcites →https://doi.org/10.1109/78.139256openalex-snapshot
An updating algorithm for subspace tracking
inferredcites →https://doi.org/10.1109/78.157185openalex-snapshot
On updating signal subspaces
inferredcites →https://doi.org/10.1137/0611021openalex-snapshot
Incremental Condition Estimation
inferredcites →https://doi.org/10.1137/0613077openalex-snapshot
Adaptive Condition Estimation for Rank-One Updates of QR Factorizations
inferredcites →https://doi.org/10.1137/0907053openalex-snapshot
A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
inferredcites →https://doi.org/10.1137/0907060openalex-snapshot
An Application of Systolic Arrays to Linear Discrete Ill-Posed 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/0911028openalex-snapshot
Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
inferredcites →https://doi.org/10.1137/0911029openalex-snapshot
Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
inferredcites →https://doi.org/10.1137/0912002openalex-snapshot
A Parallel QR Factorization Algorithm with Controlled Local Pivoting
inferredcites →https://doi.org/10.1137/0912073openalex-snapshot
Structure-Preserving and Rank-Revealing QR-Factorizations
inferredcites →https://doi.org/10.1137/0913043openalex-snapshot
Some Applications of the Rank Revealing QR Factorization
inferredcites →https://doi.org/10.1137/0913066openalex-snapshot
The Modified Truncated SVD Method for Regularization in General Form
inferredcites →https://doi.org/10.1145/76263.76290openalex-snapshot
A block QR factorization algorithm using restricted pivoting
inferredcites →https://doi.org/10.2172/10133022openalex-snapshot
Robust incremental condition estimation
inferredcites →https://doi.org/10.2307/2008670openalex-snapshot
Direct Methods for Sparse Matrices.
inferredcites →https://doi.org/10.3386/w0165openalex-snapshot
Rosetak Document 4: Rank Degeneracies and Least Square Problems
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.1680010105openalex-snapshot
Low‐rank revealing QR factorizations
inferred← citeshttps://doi.org/10.1002/nla.2490openalex-snapshot
The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery
inferred← citeshttps://doi.org/10.1007/3540761691_9openalex-snapshot
Parallel Algorithms for Computing Rank-Revealing QR Factorizations
inferred← citeshttps://doi.org/10.1007/s11075-022-01291-1openalex-snapshot
Deviation maximization for rank-revealing QR factorizations
inferred← citeshttps://doi.org/10.1016/j.laa.2015.09.037openalex-snapshot
Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
inferred← citeshttps://doi.org/10.1016/s0045-7825(97)00200-4openalex-snapshot
Structural instability analyses based on generalised path-following
inferred← citeshttps://doi.org/10.1016/s0165-1684(97)00085-6openalex-snapshot
Subspace-based parameter estimation of exponentially damped sinusoids using prior knowledge of frequency and phase
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.1134/s0965542525700654openalex-snapshot
Block Generalized Minimal Residual Method
inferred← citeshttps://doi.org/10.1137/0917055openalex-snapshot
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
inferred← citeshttps://doi.org/10.1137/s0895479891223781openalex-snapshot
On Rank-Revealing Factorisations
inferred← citeshttps://doi.org/10.1137/s0895479893244353openalex-snapshot
Sparse Multifrontal Rank Revealing QR Factorization
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/290200.287637openalex-snapshot
Computing rank-revealing QR factorizations of dense matrices
inferred← citeshttps://doi.org/10.1155/s0161171293000262openalex-snapshot
A center of a polytope: An expository review and a parallel implementation
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.