On the public citation graph
On the efficiency of a class of a-stable methods
0 signed · 28 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/bf01934126openalex-snapshot
A note on unconditionally stable linear multistep methods
inferredcites →https://doi.org/10.1016/0021-9991(70)90053-7openalex-snapshot
Rational approximations to matrix exponential for systems of stiff differential equations
inferredcites →https://doi.org/10.1016/0022-460x(72)90614-1openalex-snapshot
Optimal gradient minimization scheme for finite element eigenproblems
inferredcites →https://doi.org/10.1016/0041-5553(73)90124-9openalex-snapshot
Computational methods in ordinary differential equations
inferredcites →https://doi.org/10.1137/0710033openalex-snapshot
Complexity Bounds for Regular Finite Difference and Finite Element Grids
inferredcites →https://doi.org/10.1137/1.9781611970647openalex-snapshot
Functional Analysis and Approximation Theory in Numerical Analysis
inferredcites →https://doi.org/10.2307/2005674openalex-snapshot
Numerical Initial Value Problems in Ordinary Differential Equations
inferredcites →https://doi.org/10.5170/cern-1974-010openalex-snapshot
On preconditioning and convergence acceleration in sparse matrix problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1099-1506(200005)7:4<197::aid-nla194>3.0.co;2-sopenalex-snapshot
Real valued iterative methods for solving complex symmetric linear systems
inferred← citeshttps://doi.org/10.1002/nla.2015openalex-snapshot
Preconditioning methods for high‐order strongly stable time integration methods with an application for a DAE problem
inferred← citeshttps://doi.org/10.1002/nla.2532openalex-snapshot
Stage‐parallel preconditioners for implicit Runge–Kutta methods of arbitrarily high order, linear problems
inferred← citeshttps://doi.org/10.1002/nla.814openalex-snapshot
A new approximation of the Schur complement in preconditioners for PDE‐constrained optimization
inferred← citeshttps://doi.org/10.1007/bf01932292openalex-snapshot
Numerical solution of linear algebraic equations where the coefficient matrix is a polynomial of a square matrix
inferred← citeshttps://doi.org/10.1007/s00791-013-0209-0openalex-snapshot
Stable discretization of poroelasticity problems and efficient preconditioners for arising saddle point type matrices
inferred← citeshttps://doi.org/10.1007/s10543-018-0741-xopenalex-snapshot
A new version of a preconditioning method for certain two-by-two block matrices with square blocks
inferred← citeshttps://doi.org/10.1007/s10665-013-9670-5openalex-snapshot
On preconditioned iteration methods for complex linear systems
inferred← citeshttps://doi.org/10.1007/s11075-013-9764-1openalex-snapshot
A comparison of iterative methods to solve complex valued linear algebraic systems
inferred← citeshttps://doi.org/10.1007/s11075-019-00728-4openalex-snapshot
Efficient preconditioners for Radau-IIA time discretization of space fractional diffusion equations
inferred← citeshttps://doi.org/10.1063/1.4992509openalex-snapshot
High order time discretization for DAEs with efficient block preconditioners
inferred← citeshttps://doi.org/10.1080/00207169508804440openalex-snapshot
Analysis of preconditioners for conjugate gradients through distribution of eigenvalues
inferred← citeshttps://doi.org/10.1137/0914037openalex-snapshot
Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
inferred← citeshttps://doi.org/10.1137/1031003openalex-snapshot
Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
inferred← citeshttps://doi.org/10.1155/2010/972794openalex-snapshot
Milestones in the Development of Iterative Solution Methods
inferred← citeshttps://doi.org/10.1186/1687-2770-2013-108openalex-snapshot
On the solution of high order stable time integration methods
inferred← citeshttps://doi.org/10.21136/am.2017.0222-17openalex-snapshot
Preconditioning of two-by-two block matrix systems with square matrix blocks, with applications
inferred← citeshttps://doi.org/10.4208/nmtma.oa-2020-0016openalex-snapshot
A New Iteration and Preconditioning Method for Elliptic PDE-Constrained Optimization Problems
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.