On the public citation graph
Solving positive (semi)definite linear systems by preconditioned iterative methods
0 signed · 51 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/bf01389447openalex-snapshot
On the eigenvalue distribution of a class of preconditioning methods
inferredcites →https://doi.org/10.1007/bf01389448openalex-snapshot
On the rate of convergence of the preconditioned conjugate gradient method
inferredcites →https://doi.org/10.1007/bf01389450openalex-snapshot
The rate of convergence of Conjugate Gradients
inferredcites →https://doi.org/10.1007/bf01932739openalex-snapshot
Approximate factorizations with S/P consistently ordered M-factors
inferredcites →https://doi.org/10.1007/bf01932740openalex-snapshot
Incomplete factorizations of singular linear systems
inferredcites →https://doi.org/10.1007/bfb0116614openalex-snapshot
Solution of linear systems of equations: Iterative methods
inferredcites →https://doi.org/10.1016/0024-3795(84)90088-0openalex-snapshot
Upper eigenvalue bounds for pencils of matrices
inferredcites →https://doi.org/10.1016/0024-3795(85)90214-9openalex-snapshot
On Axelsson's perturbations
inferredcites →https://doi.org/10.1016/0024-3795(87)90211-4openalex-snapshot
Lower eigenvalue bounds for pencils of matrices
inferredcites →https://doi.org/10.1016/0041-5553(76)90007-0openalex-snapshot
Utilization of ordered chebyshev parameters in iterative methods
inferredcites →https://doi.org/10.1016/0168-9274(92)90058-lopenalex-snapshot
Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
inferredcites →https://doi.org/10.1016/0377-0427(88)90350-0openalex-snapshot
Polynomial acceleration of iterative schemes associated with subproper splittings
inferredcites →https://doi.org/10.1016/0377-0427(88)90358-5openalex-snapshot
Preconditioned conjugate gradients for solving singular systems
inferredcites →https://doi.org/10.1016/0377-0427(89)90298-7openalex-snapshot
Conditioning analysis of positive definite matrices by approximate factorizations
inferredcites →https://doi.org/10.1016/0377-0427(92)90208-fopenalex-snapshot
Lower eigenvalue bounds for singular pencils of matrices
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1137/0713052openalex-snapshot
Existence Criteria for Partial Matrix Factorizations in Iterative Methods
inferredcites →https://doi.org/10.2307/1403291openalex-snapshot
Generalized Inverses: Theory and Applications
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(199709/10)4:5<369::aid-nla105>3.0.co;2-aopenalex-snapshot
A nearly optimal preconditioning based on recursive red-black orderings
inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199907/08)6:5<379::aid-nla170>3.0.co;2-popenalex-snapshot
Efficient planewise-like preconditioners for solving 3D problems
inferred← citeshttps://doi.org/10.1002/nla.1680010103openalex-snapshot
Approximate factorizations with modified S/P consistently ordered M‐factors
inferred← citeshttps://doi.org/10.1002/nla.1680010602openalex-snapshot
DRIC: A dynamic version of the RIC method
inferred← citeshttps://doi.org/10.1002/nla.307openalex-snapshot
Algebraic formulations for the solution of the nullspace‐free eigenvalue problem using the inexact Shift‐and‐Invert Lanczos method
inferred← citeshttps://doi.org/10.1007/978-3-322-85732-3_1openalex-snapshot
Relaxed ILU Preconditioning for the CG Solution of a Singular Boundary Value Problem for Pressure
inferred← citeshttps://doi.org/10.1007/978-3-322-85732-3_11openalex-snapshot
A new approximate factorization method
inferred← citeshttps://doi.org/10.1007/978-3-322-85732-3_3openalex-snapshot
Incomplete Factorizations with S/P and Modified S/P Consistently Ordered M-Factors
inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_6openalex-snapshot
Approximate and Incomplete Factorizations
inferred← citeshttps://doi.org/10.1007/bfb0090898openalex-snapshot
Modified incomplete factorization strategies
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90400-qopenalex-snapshot
Conditioning analysis of modified block incomplete factorizations
inferred← citeshttps://doi.org/10.1016/0168-9274(92)90058-lopenalex-snapshot
Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
inferred← citeshttps://doi.org/10.1016/j.apnum.2004.06.003openalex-snapshot
Iterative solution methods
inferred← citeshttps://doi.org/10.1016/j.jcp.2017.11.028openalex-snapshot
An efficient MILU preconditioning for solving the 2D Poisson equation with Neumann boundary condition
inferred← citeshttps://doi.org/10.1016/j.jcp.2021.110189openalex-snapshot
Optimal preconditioners on solving the Poisson equation with Neumann boundary conditions
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00133-0openalex-snapshot
A multilevel block incomplete factorization preconditioning
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00535-0openalex-snapshot
Efficient algebraic solution of reaction–diffusion systems for the cardiac excitation process
inferred← citeshttps://doi.org/10.1016/s0377-0427(98)00251-9openalex-snapshot
Finite volume modelling of free surface draining vortices
inferred← citeshttps://doi.org/10.1137/0613052openalex-snapshot
Bounds of Eigenvalues of Preconditioned Matrices
inferred← citeshttps://doi.org/10.1137/0916024openalex-snapshot
Ordering Strategies for Modified Block Incomplete Factorizations
inferred← citeshttps://doi.org/10.1137/100787921openalex-snapshot
MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
inferred← citeshttps://doi.org/10.1137/24m1673577openalex-snapshot
AC(\({k}\)): Robust Solution of Laplacian Equations by Randomized Approximate Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s0036144594266284openalex-snapshot
Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations
inferred← citeshttps://doi.org/10.1137/s0895479801384019openalex-snapshot
Support-Graph Preconditioners
inferred← citeshttps://doi.org/10.1137/s0895479897319301openalex-snapshot
Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices
inferred← citeshttps://doi.org/10.1137/s1064827596311591openalex-snapshot
Dynamically Relaxed Block Incomplete Factorizations for Solving Two- and Three-Dimensional Problems
inferred← citeshttps://doi.org/10.1137/s1064827597320770openalex-snapshot
Optimal Order Preconditioning of Finite Difference Matrices
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.