On the public citation graph
Incomplete Methods for Solving $A^T Ax = b$
0 signed · 61 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.1002/nme.1620120114openalex-snapshot
The solution of sparse linear equations by the conjugate gradient method
inferredcites →https://doi.org/10.1002/nme.1620200511openalex-snapshot
A robust incomplete Choleski‐conjugate gradient algorithm
inferredcites →https://doi.org/10.1007/978-1-4899-5850-1openalex-snapshot
Energy Theorems and Structural Analysis
inferredcites →https://doi.org/10.1016/0021-9991(78)90098-0openalex-snapshot
The incomplete Cholesky—conjugate gradient method for the iterative solution of systems of linear equations
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/0148-9062(77)91140-8openalex-snapshot
Matrix analysis of structures
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.1090/s0025-5718-1955-0074929-1openalex-snapshot
On the numerical solution of elliptic difference equations
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0438681-4openalex-snapshot
An iterative solution method for linear systems of which the coefficient matrix is a symmetric 𝑀-matrix
inferredcites →https://doi.org/10.1093/imamat/20.1.61openalex-snapshot
Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
inferredcites →https://doi.org/10.1093/imamat/4.3.295openalex-snapshot
The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
inferredcites →https://doi.org/10.1137/0905037openalex-snapshot
Numerical Methods for Large Sparse Linear Least Squares Problems
inferredcites →https://doi.org/10.2307/2002018openalex-snapshot
Algebraic Approximations for Laplace's Equation in the Neighborhood of Interfaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/gamm.202000015openalex-snapshot
Preconditioners for Krylov subspace methods: An overview
inferred← citeshttps://doi.org/10.1002/nla.320openalex-snapshot
A robust incomplete factorization preconditioner for positive definite matrices
inferred← citeshttps://doi.org/10.1007/3-540-62598-4_140openalex-snapshot
New IMGS-based preconditioners for least squares problems
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_50openalex-snapshot
The highly parallel incomplete Gram-Schmidt preconditioner
inferred← citeshttps://doi.org/10.1007/978-3-030-69984-0_21openalex-snapshot
A Note on the Sensitivity of Generic Approximate Sparse Pseudoinverse Matrix for Solving Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-32149-3_13openalex-snapshot
LU Preconditioning for Overdetermined Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1007/bf02935723openalex-snapshot
A multilevel block incomplete cholesky preconditioner for solving normal equations in linear least squares problems
inferred← citeshttps://doi.org/10.1007/bf03167519openalex-snapshot
Preconditioned GMRES methods for least squares problems
inferred← citeshttps://doi.org/10.1007/s10543-005-2642-zopenalex-snapshot
A Class of Incomplete Orthogonal Factorization Methods. II: Implementation and Results
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/s10915-022-01824-9openalex-snapshot
Hierarchical Orthogonal Factorization: Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1016/0045-7949(90)90097-lopenalex-snapshot
Application of parallel data structures to the finite element solution of circular flat plates
inferred← citeshttps://doi.org/10.1016/0045-7949(91)90099-8openalex-snapshot
Implementation of gram-schmidt triangularization method using sequential column pointer data structure
inferred← citeshttps://doi.org/10.1016/0045-7949(93)90425-dopenalex-snapshot
Garbage collection data structure and its application to incomplete jacobi transformations
inferred← citeshttps://doi.org/10.1016/0045-7949(94)00451-8openalex-snapshot
Fast dynamic multilayer data structure to implement Gram-Schmidt orthogonalization algorithm (FDM)
inferred← citeshttps://doi.org/10.1016/0045-7949(94)90170-8openalex-snapshot
Efficient algorithm for linear problems using packed data structure with a set of parallel pointers
inferred← citeshttps://doi.org/10.1016/0965-9978(93)90067-4openalex-snapshot
Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS)
inferred← citeshttps://doi.org/10.1016/0965-9978(94)90018-3openalex-snapshot
PC-based implementation of Lanczos algorithm using packed and column pointer data structures for solving linear problems (PCBLAN)
inferred← citeshttps://doi.org/10.1016/j.apnum.2020.11.008openalex-snapshot
A modified SSOR-like preconditioner for non-Hermitian positive definite matrices
inferred← citeshttps://doi.org/10.1016/j.cam.2013.02.016openalex-snapshot
Incomplete hyperbolic Gram–Schmidt-based preconditioners for the solution of large indefinite least squares problems
inferred← citeshttps://doi.org/10.1016/j.cam.2018.07.032openalex-snapshot
Accurate solutions of product linear systems associated with rank-structured matrices
inferred← citeshttps://doi.org/10.1016/j.jocs.2020.101092openalex-snapshot
A note on parallel approximate pseudoinverse matrix techniques for solving linear least squares problems
inferred← citeshttps://doi.org/10.1016/s0168-9274(01)00119-2openalex-snapshot
Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from Semidefinite Programming
inferred← citeshttps://doi.org/10.1023/a:1016637813615openalex-snapshot
On the preconditioning of matrices with skew-symmetric splittings
inferred← citeshttps://doi.org/10.1023/a:1021913700691openalex-snapshot
A Class of Incomplete Orthogonal Factorization Methods. I: Methods and Theories
inferred← citeshttps://doi.org/10.1080/01495739908947371openalex-snapshot
SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1108/ec-10-2016-0353openalex-snapshot
Hybrid multilevel solution of sparse least-squares linear systems
inferred← citeshttps://doi.org/10.1109/apdc.1997.574029openalex-snapshot
Solving sparse least squares problems on massively distributed memory computers
inferred← citeshttps://doi.org/10.1109/csci51800.2020.00250openalex-snapshot
A class of Generic Approximate Sparse Pseudoinverse Matrix Techniques based on incomplete QR factorization
inferred← citeshttps://doi.org/10.1137/050633032openalex-snapshot
MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
inferred← citeshttps://doi.org/10.1137/070696313openalex-snapshot
GMRES Methods for Least Squares Problems
inferred← citeshttps://doi.org/10.1137/1031089openalex-snapshot
The Early Use of Matrix Diagonal Increments in Statistical Problems
inferred← citeshttps://doi.org/10.1137/110828472openalex-snapshot
Inner-Iteration Krylov Subspace Methods for Least Squares Problems
inferred← citeshttps://doi.org/10.1137/130917582openalex-snapshot
On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/130931588openalex-snapshot
Preconditioned Iterative Methods for Solving Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/140975358openalex-snapshot
Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix
inferred← citeshttps://doi.org/10.1137/16m105890xopenalex-snapshot
Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations
inferred← citeshttps://doi.org/10.1137/20m1364126openalex-snapshot
Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
inferred← citeshttps://doi.org/10.1137/20m1373475openalex-snapshot
Hierarchical Orthogonal Factorization: Sparse Square Matrices
inferred← citeshttps://doi.org/10.1137/s106482750240649xopenalex-snapshot
A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1137/s1064827594268270openalex-snapshot
CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
inferred← citeshttps://doi.org/10.1145/3014057openalex-snapshot
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
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/3536165openalex-snapshot
HIFIR: Hybrid Incomplete Factorization with Iterative Refinement for Preconditioning Ill-Conditioned and Singular Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1307.1368openalex-snapshot
Specifying Gaussian Markov Random Fields with Incomplete Orthogonal Factorization using Givens Rotations
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.