On the public citation graph
A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
0 signed · 22 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.1016/0024-3795(80)90159-7openalex-snapshot
Solution of sparse linear least squares problems using givens rotations
inferredcites →https://doi.org/10.1137/0903014openalex-snapshot
Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
inferredcites →https://doi.org/10.1137/0905029openalex-snapshot
A General Updating Algorithm for Constrained Linear Least Squares Problems
inferredcites →https://doi.org/10.1137/0905037openalex-snapshot
Numerical Methods for Large Sparse Linear Least Squares Problems
inferredcites →https://doi.org/10.1137/0907031openalex-snapshot
Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
inferredcites →https://doi.org/10.1137/0908072openalex-snapshot
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
inferredcites →https://doi.org/10.1137/0909008openalex-snapshot
A Data Structure for Sparse $QR$ and $LU$ Factorizations
inferredcites →https://doi.org/10.1145/1057562.1057566openalex-snapshot
A brief description of SPARSPAK Waterloo sparse linear equations package
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11075-018-0478-2openalex-snapshot
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
inferred← citeshttps://doi.org/10.1016/j.cma.2009.05.012openalex-snapshot
Computing the null space of finite element problems
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1022370419231openalex-snapshot
Newton's Method in Shape Optimisation: A Three-Dimensional Case
inferred← citeshttps://doi.org/10.1090/s0025-5718-1992-1106970-4openalex-snapshot
Rank-revealing 𝑄𝑅 factorizations and the singular value decomposition
inferred← citeshttps://doi.org/10.1137/070698725openalex-snapshot
Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/0912073openalex-snapshot
Structure-Preserving and Rank-Revealing QR-Factorizations
inferred← citeshttps://doi.org/10.1137/0913043openalex-snapshot
Some Applications of the Rank Revealing QR Factorization
inferred← citeshttps://doi.org/10.1137/16m1108339openalex-snapshot
Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
inferred← citeshttps://doi.org/10.2307/2153029openalex-snapshot
Rank-Revealing QR Factorizations and the Singular Value Decomposition
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.