On the public citation graph
Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
0 signed · 40 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/bf01436075openalex-snapshot
Numerical methods for solving linear least squares problems
inferredcites →https://doi.org/10.1016/0024-3795(80)90156-1openalex-snapshot
Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
inferredcites →https://doi.org/10.1016/0024-3795(80)90158-5openalex-snapshot
A direct method for the solution of sparse linear least squares problems
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.1016/0040-1951(79)90233-6openalex-snapshot
Four-dimensional modeling of recent vertical movements in the area of the southern california uplift
inferredcites →https://doi.org/10.1016/0045-7825(75)90038-9openalex-snapshot
The natural factor formulation of the stiffness for the matrix displacement method
inferredcites →https://doi.org/10.1016/0045-7825(78)90049-xopenalex-snapshot
On the natural factor in nonlinear analysis
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50015-5openalex-snapshot
METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMS
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50016-7openalex-snapshot
THE ORTHOGONAL FACTORIZATION OF A LARGE SPARSE MATRIX
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50025-8openalex-snapshot
THE SPARSE TABLEAU APPROACH TO FINITE ELEMENT ASSEMBLY
inferredcites →https://doi.org/10.1093/comjnl/13.3.309openalex-snapshot
The least squares problem and pseudo-inverses
inferredcites →https://doi.org/10.1093/imamat/17.3.267openalex-snapshot
A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
inferredcites →https://doi.org/10.1126/science.200.4340.421openalex-snapshot
Geodesy: Dealing with an Enormous Computer Task
inferredcites →https://doi.org/10.1137/0715044openalex-snapshot
Incomplete Nested Dissection for Solving n by n Grid Problems
inferredcites →https://doi.org/10.1137/0715069openalex-snapshot
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
inferredcites →https://doi.org/10.1145/355826.355829openalex-snapshot
The Design of a User Interface for a Sparse Matrix Package
inferredcites →https://doi.org/10.1287/mnsc.18.1.98openalex-snapshot
Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.1620200602openalex-snapshot
Minimum norm solutions to linear elastic analysis problems
inferred← citeshttps://doi.org/10.1007/bf01087548openalex-snapshot
Sparse linear problems of the least squares method
inferred← citeshttps://doi.org/10.1007/bf01389453openalex-snapshot
An algorithm to compute a sparse basis of the null space
inferred← citeshttps://doi.org/10.1007/bf01539488openalex-snapshot
Karmarkar's projective algorithm: A null space variant for multi-commodity generalized networks
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90159-7openalex-snapshot
Solution of sparse linear least squares problems using givens rotations
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90022-3openalex-snapshot
Row-ordering schemes for sparse givens transformations. I. bipartite graph model
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90168-0openalex-snapshot
A pipelined givens method for computing the QR factorization of a sparse matrix
inferred← citeshttps://doi.org/10.1016/0096-3003(86)90126-8openalex-snapshot
Linear algebra on high performance computers
inferred← citeshttps://doi.org/10.1016/0377-0427(87)90127-0openalex-snapshot
A survey of the advances in the exploitation of the sparsity in the solution of large problems
inferred← citeshttps://doi.org/10.1016/0898-1221(88)90170-8openalex-snapshot
Solving large and sparse linear least-squares problems by conjugate gradient algorithms
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00180-4openalex-snapshot
Dedication to Robert J. Plemmons
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1090/dimacs/050/09openalex-snapshot
A survey of out-of-core algorithms in numerical linear algebra
inferred← citeshttps://doi.org/10.1137/0903014openalex-snapshot
Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0905037openalex-snapshot
Numerical Methods for Large Sparse Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0906060openalex-snapshot
Auxiliary Storage Methods for Solving Finite Element Systems
inferred← citeshttps://doi.org/10.1137/0907053openalex-snapshot
A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0907081openalex-snapshot
On General Row Merging Schemes for Sparse Givens Transformations
inferred← citeshttps://doi.org/10.1137/s0895479893252337openalex-snapshot
Least-Squares Approximate Solution of Overdetermined Sylvester Equations
inferred← citeshttps://doi.org/10.1145/200979.200987openalex-snapshot
Algorithm 741: least-squares solution of a linear, bordered, block-diagonal system of equations
inferred← citeshttps://doi.org/10.1145/974781.974783openalex-snapshot
The design and implementation of a new out-of-core sparse cholesky factorization method
inferred← citeshttps://doi.org/10.1190/1.1441862openalex-snapshot
Correlation of systematic error in magnetic surveys; an application of ridge regression and sparse matrix theory
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.