On the public citation graph

Changing the Norm in Conjugate Gradient Type Algorithms

https://doi.org/10.1137/0730003
0 signed · 48 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.1007/978-3-0348-7175-4openalex-snapshot
Der Quotienten-Differenzen-Algorithmus
inferredcites →https://doi.org/10.1007/978-3-0348-7224-9_2openalex-snapshot
Theory of Gradient Methods
inferredcites →https://doi.org/10.1007/bf01385726openalex-snapshot
QMR: a quasi-minimal residual method for non-Hermitian linear systems
inferredcites →https://doi.org/10.1007/bf01386412openalex-snapshot
On conjugate gradient type methods and polynomial preconditioners for a class of complex non-hermitian matrices
inferredcites →https://doi.org/10.1007/bf01436383openalex-snapshot
Conjugate direction methods for solving systems of linear equations
inferredcites →https://doi.org/10.1007/bf02564277openalex-snapshot
Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
inferredcites →https://doi.org/10.1016/0024-3795(80)90165-2openalex-snapshot
Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
inferredcites →https://doi.org/10.1016/0024-3795(83)80026-3openalex-snapshot
On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
inferredcites →https://doi.org/10.1016/0024-3795(87)90120-0openalex-snapshot
Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
inferredcites →https://doi.org/10.1016/0378-4754(88)90016-xopenalex-snapshot
Scientific computing on vector computers
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777273-9openalex-snapshot
Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1137/0712047openalex-snapshot
Solution of Sparse Indefinite Systems of Linear Equations
inferredcites →https://doi.org/10.1137/0721026openalex-snapshot
Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
inferredcites →https://doi.org/10.1137/0724014openalex-snapshot
Orthogonal Error Methods
inferredcites →https://doi.org/10.1137/0727091openalex-snapshot
A Taxonomy for Conjugate Gradient Methods
inferredcites →https://doi.org/10.1137/0907058openalex-snapshot
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1137/0912003openalex-snapshot
A Theoretical Comparison of the Arnoldi and GMRES Algorithms
inferredcites →https://doi.org/10.6028/jres.049.044openalex-snapshot
Methods of conjugate gradients for solving linear 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/nla.1843openalex-snapshot
Combination preconditioning of saddle point systems for positive definiteness
inferred← citeshttps://doi.org/10.1002/nla.499openalex-snapshot
Recent computational developments in Krylov subspace methods for linear systems
inferred← citeshttps://doi.org/10.1007/978-3-663-11108-5_10openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/bf02145754openalex-snapshot
Complex conjugate gradient methods
inferred← citeshttps://doi.org/10.1007/bf02510219openalex-snapshot
Breakdowns and stagnation in iterative methods
inferred← citeshttps://doi.org/10.1007/s00020-017-2404-8openalex-snapshot
Finite Section Method in a Space with Two Norms
inferred← citeshttps://doi.org/10.1007/s10444-016-9481-0openalex-snapshot
Minimal polynomial and reduced rank extrapolation methods are related
inferred← citeshttps://doi.org/10.1007/s11075-014-9906-0openalex-snapshot
Revisiting (k, ℓ)-step methods
inferred← citeshttps://doi.org/10.1007/s13160-026-00794-xopenalex-snapshot
Theoretical insights on the residual transformation from bi-conjugate gradient into bi-conjugate residual via a smoothing scheme
inferred← citeshttps://doi.org/10.1016/0168-9274(95)00084-4openalex-snapshot
A theoretical overview of Krylov subspace methods
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00067-bopenalex-snapshot
New insights in GMRES-like methods with variable preconditioners
inferred← citeshttps://doi.org/10.1016/j.cam.2005.03.044openalex-snapshot
Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems
inferred← citeshttps://doi.org/10.1016/j.cma.2006.03.027openalex-snapshot
Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00139-9openalex-snapshot
The Chebyshev iteration revisited
inferred← citeshttps://doi.org/10.1016/s0168-2024(99)80012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0168-9274(01)00107-6openalex-snapshot
A framework for generalized conjugate gradient methods—with special emphasis on contributions by Rüdiger Weiss
inferred← citeshttps://doi.org/10.1016/s0377-0427(96)00121-5openalex-snapshot
Projection methods for linear systems
inferred← citeshttps://doi.org/10.1016/s0377-0427(98)00113-7openalex-snapshot
On the stable implementation of the generalized minimal error method
inferred← citeshttps://doi.org/10.1017/s0962492900002737openalex-snapshot
Lanczos-type solvers for nonsymmetric linear systems of equations
inferred← citeshttps://doi.org/10.1017/s0962492901000046openalex-snapshot
Geometric aspects of the theory of Krylov subspace methods
inferred← citeshttps://doi.org/10.1023/a:1011889705659openalex-snapshot
By How Much Can Residual Minimization Accelerate the Convergence of Orthogonal Residual Methods?
inferred← citeshttps://doi.org/10.1023/a:1021917801600openalex-snapshot
Residual Smoothing Techniques: Do They Improve the Limiting Accuracy of Iterative Solvers?
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173554openalex-snapshot
A unified theory for Krylov algorithms
inferred← citeshttps://doi.org/10.1137/080727129openalex-snapshot
Preconditioning Saddle-Point Systems with Applications in Optimization
inferred← citeshttps://doi.org/10.1137/0915021openalex-snapshot
Residual Smoothing Techniques for Iterative Methods
inferred← citeshttps://doi.org/10.1137/0915034openalex-snapshot
Error-Minimizing Krylov Subspace Methods
inferred← citeshttps://doi.org/10.1137/s0895479893246765openalex-snapshot
Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
inferred← citeshttps://doi.org/10.1137/s1064827596304812openalex-snapshot
QMR Smoothing for Lanczos-Type Product Methods Based on Three-Term Rrecurrences
inferred← citeshttps://doi.org/10.1145/317275.317278openalex-snapshot
An interface optimization and application for the numerical solution of optimal control problems
inferred← citeshttps://doi.org/10.3929/ethz-a-004328241openalex-snapshot
Residual smoothing techniques: do they improve the limiting accuracy of iterative solvers?
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.