On the public citation graph

A fast convergent iterative solver for approximate inverse of matrices

0 signed · 37 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.1002/1099-1506(200010/12)7:7/8<527::aid-nla211>3.0.co;2-oopenalex-snapshot
Preconditioning by incomplete block elimination
inferredcites →https://doi.org/10.1002/nla.1823openalex-snapshot
On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products
inferredcites →https://doi.org/10.1002/nla.779openalex-snapshot
A probing method for computing the diagonal of a matrix inverse
inferredcites →https://doi.org/10.1002/nla.798openalex-snapshot
On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks
inferredcites →https://doi.org/10.1002/zamm.19330130111openalex-snapshot
Iterative Berechung der reziproken Matrix
inferredcites →https://doi.org/10.1007/978-0-387-75477-2openalex-snapshot
Mathematica® in Action: Problem Solving Through Visualization and Computation
inferredcites →https://doi.org/10.1007/bf01890035openalex-snapshot
Approximate Newton methods and homotopy for stationary operator equations
inferredcites →https://doi.org/10.1016/j.amc.2008.04.037openalex-snapshot
Successive matrix squaring algorithm for computing outer inverses
inferredcites →https://doi.org/10.1016/j.amc.2009.10.038openalex-snapshot
A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
inferredcites →https://doi.org/10.1016/j.amc.2011.05.036openalex-snapshot
Chebyshev-type methods and preconditioning techniques
inferredcites →https://doi.org/10.1016/j.laa.2012.08.004openalex-snapshot
A family of iterative methods for computing Moore–Penrose inverse of a matrix
inferredcites →https://doi.org/10.1016/s0024-3795(98)00008-1openalex-snapshot
A characterization and representation of the generalized inverse A(2)T,S and its applications
inferredcites →https://doi.org/10.1137/0912058openalex-snapshot
An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
inferredcites →https://doi.org/10.1137/0914010openalex-snapshot
Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
inferredcites →https://doi.org/10.1137/1.9780898718003openalex-snapshot
Iterative Methods for Sparse Linear Systems
inferredcites →https://doi.org/10.1137/s1064827594276552openalex-snapshot
Parallel Preconditioning with Sparse Approximate Inverses
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.2307/2316079openalex-snapshot
Iterative Methods for the Solution of Equations.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nla.2111openalex-snapshot
On the two classes of high‐order convergent methods of approximate inverse preconditioners for solving linear systems
inferred← citeshttps://doi.org/10.1007/s11263-020-01307-0openalex-snapshot
Tensorized Multi-view Subspace Representation Learning
inferred← citeshttps://doi.org/10.1007/s12190-013-0743-4openalex-snapshot
A higher order iterative method for $A^{(2)}_{T,S}$
inferred← citeshttps://doi.org/10.1007/s12190-014-0759-4openalex-snapshot
Finding the Moore–Penrose inverse by a new matrix iteration
inferred← citeshttps://doi.org/10.1007/s40819-015-0083-1openalex-snapshot
A Class of Kung–Traub-Type Iterative Algorithms for Matrix Inversion
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126381openalex-snapshot
A general class of arbitrary order iterative methods for computing generalized inverses
inferred← citeshttps://doi.org/10.1016/j.cam.2015.09.013openalex-snapshot
Computing outer inverses by scaled matrix iterations
inferred← citeshttps://doi.org/10.1016/j.laa.2015.07.010openalex-snapshot
On hyperpower family of iterations for computing outer inverses possessing high efficiencies
inferred← citeshttps://doi.org/10.1109/access.2020.3009456openalex-snapshot
Reusing Preconditioners in Projection Based Model Order Reduction Algorithms
inferred← citeshttps://doi.org/10.1109/iccv.2015.185openalex-snapshot
Low-Rank Tensor Constrained Multiview Subspace Clustering
inferred← citeshttps://doi.org/10.1109/taslp.2022.3209942openalex-snapshot
End-to-End Dereverberation, Beamforming, and Speech Recognition in a Cocktail Party
inferred← citeshttps://doi.org/10.1134/s0965542515020189openalex-snapshot
Constructing two-step iterative methods with and without memory
inferred← citeshttps://doi.org/10.1155/2014/137486openalex-snapshot
A Matrix Iteration for Finding Drazin Inverse with Ninth-Order Convergence
inferred← citeshttps://doi.org/10.1155/2014/563787openalex-snapshot
A New Iterative Method for Finding Approximate Inverses of Complex Matrices
inferred← citeshttps://doi.org/10.1155/2014/731562openalex-snapshot
Approximating the Inverse of a Square Matrix with Application in Computation of the Moore-Penrose Inverse
inferred← citeshttps://doi.org/10.1155/2014/741368openalex-snapshot
A High-Order Iterate Method for Computing AT,S(2)
inferred← citeshttps://doi.org/10.1177/0142331214528350openalex-snapshot
An improved Schulz-type iterative method for matrix inversion with application
inferred← citeshttps://doi.org/10.12677/aam.2026.156283openalex-snapshot
Accelerated Least Squares Progressive-Iterative Approximation of Higher Order of Convergence
inferred← citeshttps://doi.org/10.48550/arxiv.2010.07033openalex-snapshot
Training Invertible Linear Layers through Rank-One Perturbations
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.