On the public citation graph

Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class

https://doi.org/10.1007/bf02239748
0 signed · 17 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/bf00933852openalex-snapshot
A direct method for the general solution of a system of linear equations
inferredcites →https://doi.org/10.1007/bf01391414openalex-snapshot
A class of direct methods for linear systems
inferredcites →https://doi.org/10.1080/02331938708843232openalex-snapshot
Numerical experiments with the symmetric algorithm in the ABS class for linear systems
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0431641-8openalex-snapshot
Reorthogonalization and stable algorithms for updating the Gram-Schmidt 𝑄𝑅 factorization
inferredcites →https://doi.org/10.1145/321239.321243openalex-snapshot
Generalized Inverse Computations Using the Gradient Projection Method
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.1007/0-306-48332-7_2openalex-snapshot
ABS Algorithms for Linear Equations and Linear Least Squares
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_1openalex-snapshot
ABS Algorithms for Linear Equations and Linear Least Squares
inferred← citeshttps://doi.org/10.1007/978-3-642-76717-3_4openalex-snapshot
Abs Algorithms for General Linear Systems
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_11openalex-snapshot
ABS Methods for Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/bf01581261openalex-snapshot
Solution of linear least squares via the ABS algorithm
inferred← citeshttps://doi.org/10.1080/10556780108805830openalex-snapshot
Computational experiments with ABS algorithms for KKT linear systems
inferred← citeshttps://doi.org/10.1080/10556789208805516openalex-snapshot
A review of ABS algorithms for general linear systems
inferred← citeshttps://doi.org/10.1080/10556789208805524openalex-snapshot
A class of descent algorithms for nonlinear function minimization with linear equality constraints
inferred← citeshttps://doi.org/10.1080/10556789708805674openalex-snapshot
A bibliography of the ABS methods
inferred← citeshttps://doi.org/10.48550/arxiv.math/0105075openalex-snapshot
Computational Experiments with Abs Algorithms for Overdetermined Linear Systems
inferred← citeshttps://doi.org/10.48550/arxiv.math/0105076openalex-snapshot
Computational Experiments with Abs Algorithms for KKT Linear Systems
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.