On the public citation graph
Computing projections with LSQR
0 signed · 27 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/sapm195534164openalex-snapshot
The N ‐Step Iteration Procedures
inferredcites →https://doi.org/10.1007/bf01739829openalex-snapshot
Solution of sparse rectangular systems using LSQR and CRAIG
inferredcites →https://doi.org/10.1137/0702016openalex-snapshot
Calculating the Singular Values and Pseudo-Inverse of a Matrix
inferredcites →https://doi.org/10.1137/0711019openalex-snapshot
Bidiagonalization of Matrices and Solution of Linear Equations
inferredcites →https://doi.org/10.1137/s0895479895284944openalex-snapshot
Estimating the Attainable Accuracy of Recursively Computed Residual Methods
inferredcites →https://doi.org/10.1137/s089547989631202xopenalex-snapshot
Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
inferredcites →https://doi.org/10.1145/355984.355989openalex-snapshot
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
inferredcites →https://doi.org/10.1145/355993.356000openalex-snapshot
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems
inferredcites →https://doi.org/10.2307/2003785openalex-snapshot
Computational Methods of Linear Algebra
inferredcites →https://doi.org/10.6028/jres.049.044openalex-snapshot
Methods of conjugate gradients for solving linear systems
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.5914openalex-snapshot
Parallel solution of saddle point systems with nested iterative solvers based on the Golub‐Kahan Bidiagonalization
inferred← citeshttps://doi.org/10.1002/nla.1874openalex-snapshot
Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization
inferred← citeshttps://doi.org/10.1007/978-3-030-43229-4_10openalex-snapshot
Parallel Performance of an Iterative Solver Based on the Golub-Kahan Bidiagonalization
inferred← citeshttps://doi.org/10.1007/s10543-009-0239-7openalex-snapshot
The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
inferred← citeshttps://doi.org/10.1016/j.laa.2014.07.045openalex-snapshot
Two projection methods for Regularized Total Least Squares approximation
inferred← citeshttps://doi.org/10.1016/j.laa.2017.07.031openalex-snapshot
Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
inferred← citeshttps://doi.org/10.1023/a:1010098523281openalex-snapshot
Analysis of Approximate Inverses in Tomography I. Resolution Analysis of Common Inverses
inferred← citeshttps://doi.org/10.1023/a:1011588308111openalex-snapshot
Analysis of Approximate Inverses in Tomography II. Iterative Inverses
inferred← citeshttps://doi.org/10.1137/050645592openalex-snapshot
A Projection‐Based Approach to General‐Form Tikhonov Regularization
inferred← citeshttps://doi.org/10.1137/100787921openalex-snapshot
MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
inferred← citeshttps://doi.org/10.1137/120866543openalex-snapshot
Generalized Golub--Kahan Bidiagonalization and Stopping Criteria
inferred← citeshttps://doi.org/10.1137/16m1102410openalex-snapshot
SPMR: A Family of Saddle-Point Minimum Residual Solvers
inferred← citeshttps://doi.org/10.1137/s106482759834634xopenalex-snapshot
Iterative Methods for Nearly Singular Linear Systems
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.898769openalex-snapshot
Métodos para problemas mal-postos discretos de grande porte
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6782openalex-snapshot
Minimal Residual Methods for Complex Symmetric, Skew Symmetric, and Skew Hermitian Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1808.07677openalex-snapshot
An iterative generalized Golub-Kahan algorithm for problems in structural mechanics
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.