On the public citation graph
Stationary and almost stationary iterative (k, l)-step methods for linear and nonlinear systems of equations
0 signed · 45 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/zamm.19600401041openalex-snapshot
M. Engeli — Th. Ginsburg — H. Rutishauser — E. Stiefel, Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self‐Adjoint Bondary Value Problems. (Mitteilungen aus dem Institut für angewandte Mathematik der ETH Zürich, Nr. 8.) 107 S. Basel/Stuttgart 1959. Birkhäuser…
inferredcites →https://doi.org/10.1007/978-3-0348-7224-9openalex-snapshot
Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems
inferredcites →https://doi.org/10.1007/bf01110911openalex-snapshot
Iterationsverfahren und allgemeine Euler-Verfahren
inferredcites →https://doi.org/10.1007/bf01220936openalex-snapshot
Iterative solution of linear operator equations in Hilbert space and optimal Euler methods
inferredcites →https://doi.org/10.1007/bf01386065openalex-snapshot
�ber ein mehrstufiges Iterationsverfahren zur L�sung von linearen Gleichungen
inferredcites →https://doi.org/10.1007/bf01389454openalex-snapshot
A study of semiiterative methods for nonsymmetric systems of linear equations
inferredcites →https://doi.org/10.1007/bf01390212openalex-snapshot
The analysis ofk-step iterative methods for linear systems from summability theory
inferredcites →https://doi.org/10.1007/bf01398258openalex-snapshot
Rational Chebyshev approximation on the unit disk
inferredcites →https://doi.org/10.1007/bf01399689openalex-snapshot
k-Step iterative methods for solving nonlinear systems of equations
inferredcites →https://doi.org/10.1007/bf01404882openalex-snapshot
�ber mehrstufige Iterationsverfahren und die L�sung der Hammersteinschen Gleichung
inferredcites →https://doi.org/10.1007/bf01818449openalex-snapshot
On the construction of iteration methods for linear equations in Banach spaces by summation methods
inferredcites →https://doi.org/10.1007/bfb0062080openalex-snapshot
Averaging to improve convergence of iterative processes
inferredcites →https://doi.org/10.1016/0016-0032(64)90102-4openalex-snapshot
Functions of a complex variable
inferredcites →https://doi.org/10.1016/0022-247x(87)90167-3openalex-snapshot
Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces
inferredcites →https://doi.org/10.1016/0377-0427(86)90130-5openalex-snapshot
Numerical conformal mapping methods based on function conjugation
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0054846-3openalex-snapshot
Mean Value Methods in Iteration
inferredcites →https://doi.org/10.1137/0720085openalex-snapshot
On the Construction of Semi-Iterative Methods
inferredcites →https://doi.org/10.1137/0724015openalex-snapshot
General k -Part Stationary Iterative Solutions to Linear Systems
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2003785openalex-snapshot
Computational Methods of Linear Algebra
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.4064/sm-27-3-247-249openalex-snapshot
Concerning the convergence of iterates to fixed points
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<169::aid-nla192>3.0.co;2-vopenalex-snapshot
Comparison between the convergence rates of the Chebyshev method and the related (2,2)-step methods
inferred← citeshttps://doi.org/10.1007/978-1-4899-3442-0_30openalex-snapshot
Approximation theory and numerical linear algebra
inferred← citeshttps://doi.org/10.1007/bf02431998openalex-snapshot
A mixed finite element for the stokes problem using quadrilateral elements
inferred← citeshttps://doi.org/10.1007/bf03028363openalex-snapshot
Evaluation of a boundary integral representation for the conformal mapping of the unit disk onto a simply-connected domain
inferred← citeshttps://doi.org/10.1007/pl00005401openalex-snapshot
The conformal ‘bratwurst’ mapsand associated Faber polynomials
inferred← citeshttps://doi.org/10.1007/s11075-014-9906-0openalex-snapshot
Revisiting (k, ℓ)-step methods
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90397-fopenalex-snapshot
Implementation of an adaptive algorithm for Richardson's method
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(92)90006-jopenalex-snapshot
An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK
inferred← citeshttps://doi.org/10.1016/j.laa.2005.01.035openalex-snapshot
A condition for the superiority of the (2,2)-step methods over the related Chebyshev method
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00362-7openalex-snapshot
Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00139-9openalex-snapshot
The Chebyshev iteration revisited
inferred← citeshttps://doi.org/10.1017/s0962492900002737openalex-snapshot
Lanczos-type solvers for nonsymmetric linear systems of equations
inferred← citeshttps://doi.org/10.1093/imanum/13.2.181openalex-snapshot
A numerical method for the computation of Faber polynomials for starlike domains
inferred← citeshttps://doi.org/10.1137/100804012openalex-snapshot
Eigenvalue Computations Based on IDR
inferred← citeshttps://doi.org/10.15480/882.789openalex-snapshot
Eigenvalue computations based on IDR
inferred← citeshttps://doi.org/10.1553/etna_vol51s451openalex-snapshot
Biorthogonal rational Krylov subspace methods
inferred← citeshttps://doi.org/10.48550/arxiv.1809.07660openalex-snapshot
Biorthogonal Extended Krylov Subspace Methods
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.