On the public citation graph
Orderings for Conjugate Gradient Preconditionings
0 signed · 46 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/978-1-4899-2112-3openalex-snapshot
Introduction to Parallel and Vector Solution of Linear Systems
inferredcites →https://doi.org/10.1007/bf01932738openalex-snapshot
The effect of ordering on preconditioned conjugate gradients
inferredcites →https://doi.org/10.1016/0010-4655(89)90162-8openalex-snapshot
ICCG and related methods for 3D problems on vector computers
inferredcites →https://doi.org/10.1016/0010-4655(89)90163-xopenalex-snapshot
Parallel elliptic preconditioners: Fourier analysis and performance on the connection machine
inferredcites →https://doi.org/10.1016/0010-4655(89)90164-1openalex-snapshot
Ordering techniques for the preconditioned conjugate gradient method on parallel computers
inferredcites →https://doi.org/10.1016/0020-0190(76)90077-6openalex-snapshot
Matrix multiplication by diagonals on a vector/parallel processor
inferredcites →https://doi.org/10.1016/0167-8191(87)90005-6openalex-snapshot
Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
inferredcites →https://doi.org/10.1016/0377-0427(89)90372-5openalex-snapshot
Vectorizable preconditioners for elliptic difference equations in three space dimensions
inferredcites →https://doi.org/10.1016/0377-0427(89)90373-7openalex-snapshot
Solving 3D block bidiagonal linear systems on vector computers
inferredcites →https://doi.org/10.1016/b978-0-12-407475-0.50017-6openalex-snapshot
Solution of Three-Dimensional Generalized Poisson Equations on Vector Computers
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1137/0724090openalex-snapshot
Multicolor ICCG Methods for Vector Computers
inferredcites →https://doi.org/10.1137/0902001openalex-snapshot
Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
inferredcites →https://doi.org/10.1137/0903021openalex-snapshot
A Vectorizable Variant of some ICCG Methods
inferredcites →https://doi.org/10.1137/0909009openalex-snapshot
On Vectorizing Incomplete Factorization and SSOR Preconditioners
inferredcites →https://doi.org/10.1137/0911008openalex-snapshot
Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470125809.ch1openalex-snapshot
Optimization Methods in Computational Chemistry
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0117openalex-snapshot
Parallel Heuristics for Improved, Balanced Graph Colorings
inferred← citeshttps://doi.org/10.1007/bf02074880openalex-snapshot
Towards a cost-effective ILU preconditioner with high level fill
inferred← citeshttps://doi.org/10.1007/bfb0023062openalex-snapshot
Efficient parallel graph coloring with prioritization
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90004-3openalex-snapshot
Scalable iterative solution of sparse linear systems
inferred← citeshttps://doi.org/10.1016/0167-8191(96)80005-6openalex-snapshot
An efficient parallel discrete PDE solver
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2008.11.010openalex-snapshot
A comparison of projective and direct solvers for finite elements in elastostatics
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00064-2openalex-snapshot
Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations
inferred← citeshttps://doi.org/10.1016/s0955-7997(03)00016-xopenalex-snapshot
Performance of iterative solvers for acoustic problems. Part II. Acceleration by ILU-type preconditioner
inferred← citeshttps://doi.org/10.1137/040604777openalex-snapshot
A New Block Parallel SOR Method and Its Analysis
inferred← citeshttps://doi.org/10.1137/0914003openalex-snapshot
Fast Solution of Nonlinear Poisson-Type Equations
inferred← citeshttps://doi.org/10.1137/0916024openalex-snapshot
Ordering Strategies for Modified Block Incomplete Factorizations
inferred← citeshttps://doi.org/10.1137/1.9780898718003openalex-snapshot
Iterative Methods for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/s0895479899354251openalex-snapshot
A Multilevel Dual Reordering Strategy for Robust Incomplete LU Factorization of Indefinite Matrices
inferred← citeshttps://doi.org/10.1137/s1064827593256244openalex-snapshot
Orderings for Parallel Conjugate Gradient Preconditioners
inferred← citeshttps://doi.org/10.1137/s1064827597303370openalex-snapshot
New Parallel SOR Method by Domain Partitioning
inferred← citeshttps://doi.org/10.1137/s1064827597326845openalex-snapshot
Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1322openalex-snapshot
A Reordering Heuristic for Accelerating the Convergence of the Solution of Some Large Sparse PDE Matrices on Structured Grids by the Krylov Subspace Methods with the ILUT Preconditioner
inferred← citeshttps://doi.org/10.2139/ssrn.5669485openalex-snapshot
Parallelizing Sequential Sweeping on Structured Grids -- Parallel SOR/ILU preconditioners for Structured n-Diagonal Matrices
inferred← citeshttps://doi.org/10.2172/10148824openalex-snapshot
Parallel iterative solution of sparse linear systems using orderings from graph coloring heuristics
inferred← citeshttps://doi.org/10.2514/6.1995-1646openalex-snapshot
An unstructured grid approach to sensitivity analysis and shape optimization using the Euler equations
inferred← citeshttps://doi.org/10.48550/arxiv.1008.3699openalex-snapshot
Parallelizing Sequential Sweeping on Structured Grids -- Fully Parallel SOR/ILU preconditioners for Structured n-Diagonal 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.