On the public citation graph
A generalized inverse ∈-algorithm for constructing intersection projection matrices, with applications
0 signed · 30 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.1017/s0305004100030401openalex-snapshot
A generalized inverse for matrices
inferredcites →https://doi.org/10.1090/s0025-5718-1962-0145647-xopenalex-snapshot
Acceleration Techniques for Iterated Vector and Matrix Problems
inferredcites →https://doi.org/10.1137/0106005openalex-snapshot
Inversion of Matrices by Biorthogonalization and Related Results
inferredcites →https://doi.org/10.1137/0111051openalex-snapshot
Contributions to the Theory of Generalized Inverses
inferredcites →https://doi.org/10.1142/9789813270886_0005openalex-snapshot
Finite Dimensional Vector Spaces
inferredcites →https://doi.org/10.1515/9781400881895openalex-snapshot
Functional Operators (AM-21), Volume 1
inferredcites →https://doi.org/10.2307/2003785openalex-snapshot
Computational Methods of Linear Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-58418-4_6openalex-snapshot
Commentaries and Further Developments
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf01189875openalex-snapshot
Parallel, self-organizing, hierarchical neural networks with forward-backward training
inferred← citeshttps://doi.org/10.1007/bf01436918openalex-snapshot
Characterization of linear stationary iterative processes for solving a singular system of linear equations
inferred← citeshttps://doi.org/10.1007/bf02512367openalex-snapshot
A stationary iterative pseudoinverse algorithm
inferred← citeshttps://doi.org/10.1007/bf02941906openalex-snapshot
Characterization of the solutions set of inconsistent least-squares problems by an extended Kaczmarz algorithm
inferred← citeshttps://doi.org/10.1007/s11075-018-0567-2openalex-snapshot
The genesis and early developments of Aitken’s process, Shanks’ transformation, the ε–algorithm, and related fixed point methods
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90357-3openalex-snapshot
Iterative solution of simultaneous equations
inferred← citeshttps://doi.org/10.1016/b978-0-12-514250-2.50018-4openalex-snapshot
Annotated Bibliography on Generalized Inverses and Applications
inferred← citeshttps://doi.org/10.1080/00207160.2011.634002openalex-snapshot
A general extending and constraining procedure for linear iterative methods
inferred← citeshttps://doi.org/10.1080/05695557508975005openalex-snapshot
Linear Programming: A Survey of General Purpose Algorithms
inferred← citeshttps://doi.org/10.1080/05695557508975428openalex-snapshot
Linear Programming: A Survey of General Purpose Algorithms
inferred← citeshttps://doi.org/10.1090/s0025-5718-1972-0314226-xopenalex-snapshot
On the Solution of Systems of Equations by the Epsilon Algorithm of Wynn
inferred← citeshttps://doi.org/10.1109/tc.1979.1675226openalex-snapshot
On the Construction of Projectors Using Products of Elementary Matrices
inferred← citeshttps://doi.org/10.1137/0115101openalex-snapshot
On the Geometry of Subspaces in Euclidean n -Spaces
inferred← citeshttps://doi.org/10.1137/0122032openalex-snapshot
The Generalized Inverse in Linear Programming. Basic Structure
inferred← citeshttps://doi.org/10.1137/0124036openalex-snapshot
The Generalized Inverse in Linear Programming—An Intersection Projection Method and the Solution of a Class of Structured Linear Programming Problems
inferred← citeshttps://doi.org/10.1216/rmj-1974-4-2-297openalex-snapshot
Some recent developments in the theories of continued fractions and the Padé table
inferred← citeshttps://doi.org/10.1287/moor.14.1.97openalex-snapshot
Boundary Behavior of Interior Point Algorithms in Linear Programming
inferred← citeshttps://doi.org/10.13001/1081-3810.3925openalex-snapshot
Matrix Shanks Transformations
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.