On the public citation graph
Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
0 signed · 80 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.1007/bf01932945openalex-snapshot
A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
inferredcites →https://doi.org/10.1007/bf01932992openalex-snapshot
On computing bounds for the least singular value of a triangular matrix
inferredcites →https://doi.org/10.1016/0024-3795(79)90138-1openalex-snapshot
Restoring rank and consistency by orthogonal projection
inferredcites →https://doi.org/10.1016/0024-3795(79)90158-7openalex-snapshot
The rank of a difference of matrices and associated generalized inverses
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/0024-3795(80)90232-3openalex-snapshot
On rank-deficient pseudoinverses
inferredcites →https://doi.org/10.1016/b978-0-12-514250-2.50012-3openalex-snapshot
Differentiation of Pseudoinverses, Separable Nonlinear Least Square Problems and Other Tales
inferredcites →https://doi.org/10.1093/comjnl/13.3.309openalex-snapshot
The least squares problem and pseudo-inverses
inferredcites →https://doi.org/10.1137/0112014openalex-snapshot
Minimum and Basic Solutions to Singular Linear Systems
inferredcites →https://doi.org/10.1137/0708066openalex-snapshot
The Direct Solution of the Discrete Poisson Equation on Irregular Regions
inferredcites →https://doi.org/10.1137/0716029openalex-snapshot
An Estimate for the Condition Number of a Matrix
inferredcites →https://doi.org/10.1137/0902034openalex-snapshot
Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
inferredcites →https://doi.org/10.1137/1018004openalex-snapshot
$l_2 $-Solutions to Underdetermined Linear Systems
inferredcites →https://doi.org/10.1137/1023004openalex-snapshot
On Deriving the Inverse of a Sum of Matrices
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.1002/(sici)1099-1506(200003)7:2<51::aid-nla187>3.0.co;2-oopenalex-snapshot
Matrix stretching for sparse least squares problems
inferred← citeshttps://doi.org/10.1002/nme.1620200602openalex-snapshot
Minimum norm solutions to linear elastic analysis problems
inferred← citeshttps://doi.org/10.1007/3-540-12914-6_4openalex-snapshot
Chapter 4 Nonlinear equations and nonlinear least squares
inferred← citeshttps://doi.org/10.1007/978-1-4612-2856-1_7openalex-snapshot
Solution of Sparse Weighted and Equality Constrained Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_3openalex-snapshot
Generalized and Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-0841-3_2openalex-snapshot
Linear algebra support modules for approximation and other software
inferred← citeshttps://doi.org/10.1007/bf01087548openalex-snapshot
Sparse linear problems of the least squares method
inferred← citeshttps://doi.org/10.1007/bf01399695openalex-snapshot
Approximation by cubicC 1-splines on arbitrary triangulations
inferred← citeshttps://doi.org/10.1007/bf01403888openalex-snapshot
A direct method for sparse least squares problems with lower and upper bounds
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.1007/bf01582287openalex-snapshot
Conical projection algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/bf01840455openalex-snapshot
An extension of Karmarkar's algorithm for linear programming using dual variables
inferred← citeshttps://doi.org/10.1007/bf02142744openalex-snapshot
Fast orthogonal decomposition of rank deficient Toeplitzmatrices
inferred← citeshttps://doi.org/10.1007/s10543-022-00930-2openalex-snapshot
Solving large linear least squares problems with linear equality constraints
inferred← citeshttps://doi.org/10.1007/s11075-025-02192-9openalex-snapshot
Krylov iterative methods for linear least squares problems with linear equality constraints
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90115-1openalex-snapshot
Rank and null space calculations using matrix decomposition without column interchanges
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00064-1openalex-snapshot
Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80133-6openalex-snapshot
9 Numerical aspects of solving linear least squares problems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)55409-9openalex-snapshot
Constrained Power System State Estimation
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1015210828153openalex-snapshot
Sparse Linear Algebra and Geophysical Migration: A Review of Direct and Iterative Methods
inferred← citeshttps://doi.org/10.1049/ip-c.1989.0032openalex-snapshot
Line and shunt switching to alleviate overloads and voltage violations in power networks
inferred← citeshttps://doi.org/10.1057/jors.1988.43openalex-snapshot
On the Performance of Karmarkar's Algorithm
inferred← citeshttps://doi.org/10.1093/imanum/dri027openalex-snapshot
Updating and downdating an upper trapezoidal sparse orthogonal factorization†
inferred← citeshttps://doi.org/10.1109/59.76734openalex-snapshot
Enhancement to Givens rotations for power system state estimation
inferred← citeshttps://doi.org/10.1109/dmcc.1990.555401openalex-snapshot
Incremental Condition Estimator for Parallel Sparse Matrix Factorization
inferred← citeshttps://doi.org/10.1109/jas.2019.1911705openalex-snapshot
Cycle flow formulation of optimal network flow problems and respective distributed solutions
inferred← citeshttps://doi.org/10.1137/0608037openalex-snapshot
Computing a Sparse Basis for the Null Space
inferred← citeshttps://doi.org/10.1137/0611041openalex-snapshot
An Improved Method for One-Way Dissection with Singular Diagonal Blocks
inferred← citeshttps://doi.org/10.1137/0613078openalex-snapshot
Rank Detection Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1137/070698725openalex-snapshot
Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/0720022openalex-snapshot
On Row and Column Orderings for Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0905029openalex-snapshot
A General Updating Algorithm for Constrained 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/0905038openalex-snapshot
Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
inferred← citeshttps://doi.org/10.1137/0905041openalex-snapshot
Sparse Matrix Methods in Optimization
inferred← citeshttps://doi.org/10.1137/0905068openalex-snapshot
Solution of Sparse Underdetermined Systems of Linear Equations
inferred← citeshttps://doi.org/10.1137/0906028openalex-snapshot
An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
inferred← citeshttps://doi.org/10.1137/0907031openalex-snapshot
Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
inferred← citeshttps://doi.org/10.1137/0908033openalex-snapshot
Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1137/0908054openalex-snapshot
Evaluation of Orderings for Unsymmetric Sparse Matrices
inferred← citeshttps://doi.org/10.1137/0910006openalex-snapshot
ANOVA Model Fitting via Sparse Matrix Computations: A Fast Direct Method
inferred← citeshttps://doi.org/10.1137/0911029openalex-snapshot
Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
inferred← citeshttps://doi.org/10.1137/0911030openalex-snapshot
The Probability of Large Diagonal Elements in the $QR$ Factorization
inferred← citeshttps://doi.org/10.1137/0912062openalex-snapshot
A Scheme for Handling Rank-Deficiency in the Solution of Sparse 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.1137/18m1181353openalex-snapshot
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/s0895479893244353openalex-snapshot
Sparse Multifrontal Rank Revealing QR Factorization
inferred← citeshttps://doi.org/10.1145/232826.232937openalex-snapshot
A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
inferred← citeshttps://doi.org/10.1145/3412559openalex-snapshot
Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
inferred← citeshttps://doi.org/10.1145/3494527openalex-snapshot
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1145/5925.5932openalex-snapshot
Predicting fill for sparse orthogonal factorization
inferred← citeshttps://doi.org/10.21236/ada284060openalex-snapshot
A Direct Decomposition Method for the Solution of Sparse Linear Least Squares Problems
inferred← citeshttps://doi.org/10.2172/5621358openalex-snapshot
Least squares adjustment of large-scale geodetic networks by orthogonal decomposition
inferred← citeshttps://doi.org/10.2478/s11533-007-0003-7openalex-snapshot
On stable least squares solution to the system of linear inequalities
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.