On the public citation graph
A study of semiiterative methods for nonsymmetric systems of linear equations
0 signed · 109 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-3-0348-5812-0openalex-snapshot
Vorlesungen über Approximation im Komplexen
inferredcites →https://doi.org/10.1007/978-3-642-52767-8openalex-snapshot
Theorie der Limitierungsverfahren
inferredcites →https://doi.org/10.1007/bf01084448openalex-snapshot
Series in faber polynomials and several generalizations
inferredcites →https://doi.org/10.1007/bf01389971openalex-snapshot
The Tchebychev iteration for nonsymmetric linear systems
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/bf01449884openalex-snapshot
�ber polynomische Entwicklungen II
inferredcites →https://doi.org/10.1007/bf01708049openalex-snapshot
Interpolation and approximation by rational functions in the complex domain
inferredcites →https://doi.org/10.1016/0024-3795(84)90219-2openalex-snapshot
Richardson's iteration for nonsymmetric matrices
inferredcites →https://doi.org/10.1070/rm1964v019n04abeh001155openalex-snapshot
FUNDAMENTAL PROPERTIES OF FABER POLYNOMIALS
inferredcites →https://doi.org/10.1090/coll/020openalex-snapshot
Interpolation and Approximation by Rational Functions in the Complex Domain
inferredcites →https://doi.org/10.1112/jlms/s1-40.1.378bopenalex-snapshot
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
inferredcites →https://doi.org/10.1137/0105004openalex-snapshot
A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
inferredcites →https://doi.org/10.1137/0720085openalex-snapshot
On the Construction of Semi-Iterative Methods
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1515/crll.1920.150.79openalex-snapshot
Über Tschebyscheffsche Polynome.
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2007352openalex-snapshot
Sequence Transformations and their Applications.
inferredcites →https://doi.org/10.2307/2314680openalex-snapshot
The Theory of Matrices in Numerical Analysis.
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.1002/fld.1650171104openalex-snapshot
Non‐symmetric CG‐like schemes and the finite element solution of the advection–dispersion equation
inferred← citeshttps://doi.org/10.1002/nla.287openalex-snapshot
Solving linear initial value problems by Faber polynomials
inferred← citeshttps://doi.org/10.1002/nla.429openalex-snapshot
The semi-iterative method applied to the hyper-power iteration
inferred← citeshttps://doi.org/10.1007/978-1-4684-7415-2_6openalex-snapshot
An Adaptive Semi-Iterative Method for Symmetric Semidefinite Linear Systems
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/978-3-0348-6303-2_31openalex-snapshot
Iterative Solution of Non-Symmetric Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/bf01279022openalex-snapshot
Chebyshev polynomials for disjoint compact sets
inferred← citeshttps://doi.org/10.1007/bf01386399openalex-snapshot
Preconditionings and splittings for rectangular systems
inferred← citeshttps://doi.org/10.1007/bf01386430openalex-snapshot
Optimal successive overrelaxation iterative methods for P-cyclic matrices
inferred← citeshttps://doi.org/10.1007/bf01388688openalex-snapshot
A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
inferred← citeshttps://doi.org/10.1007/bf01396976openalex-snapshot
A stable Richardson iteration method for complex linear systems
inferred← citeshttps://doi.org/10.1007/bf01397553openalex-snapshot
The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
inferred← citeshttps://doi.org/10.1007/bf01400358openalex-snapshot
Accelerating the convergence of power series of certain entire functions
inferred← citeshttps://doi.org/10.1007/bf01404464openalex-snapshot
On the solution of singular linear systems of algebraic equations by semiiterative methods
inferred← citeshttps://doi.org/10.1007/bf01409782openalex-snapshot
On semiiterative methods generated by Faber polynomials
inferred← citeshttps://doi.org/10.1007/bf01409784openalex-snapshot
Stationary and almost stationary iterative (k, l)-step methods for linear and nonlinear systems of equations
inferred← citeshttps://doi.org/10.1007/bf01934703openalex-snapshot
An optimum iterative method for solving any linear system with a square matrix
inferred← citeshttps://doi.org/10.1007/bf02141745openalex-snapshot
An adaptive Richardson iteration method for indefinite linear systems
inferred← citeshttps://doi.org/10.1007/bf02836112openalex-snapshot
On polynomial approximations to f a (Z)(z-a)−1 with complex a and some applications to certain non-hermitian matrices
inferred← citeshttps://doi.org/10.1007/bf03322480openalex-snapshot
Relaxation Methods for Non-Hermitian Linear Systems
inferred← citeshttps://doi.org/10.1007/pl00005401openalex-snapshot
The conformal ‘bratwurst’ mapsand associated Faber polynomials
inferred← citeshttps://doi.org/10.1007/s00211-006-0002-9openalex-snapshot
Optimal Semi-Iterative Methods for Complex SOR with Results from Potential Theory
inferred← citeshttps://doi.org/10.1007/s002110050045openalex-snapshot
Application of a block modified Chebyshev algorithm to the iterative solution of symmetric linear systems with multiple right hand side vectors
inferred← citeshttps://doi.org/10.1007/s11075-014-9906-0openalex-snapshot
Revisiting (k, ℓ)-step methods
inferred← citeshttps://doi.org/10.1007/s11075-020-01023-3openalex-snapshot
Asynchronous Richardson iterations: theory and practice
inferred← citeshttps://doi.org/10.1007/s40315-016-0176-9openalex-snapshot
Properties and Examples of Faber–Walsh Polynomials
inferred← citeshttps://doi.org/10.1016/0009-2614(94)00590-7openalex-snapshot
A general, energy-separable polynomial representation of the time-independent full Green operator with application to time-independent wavepacket forms of Schrödinger and Lippmann—Schwinger equations
inferred← citeshttps://doi.org/10.1016/0021-9045(90)90054-topenalex-snapshot
On the constrained Chebyshev approximation problem on ellipses
inferred← citeshttps://doi.org/10.1016/0022-247x(87)90167-3openalex-snapshot
Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90058-9openalex-snapshot
Over- and underrelaxation for linear systems with weakly cyclic jacobi matrices of index p
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90370-copenalex-snapshot
Some recent results on the modified SOR theory
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90380-fopenalex-snapshot
On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90386-bopenalex-snapshot
The application of Leja points to Richardson iteration and polynomial preconditioning
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90389-eopenalex-snapshot
On the spectrum of the SOR operator for symmetric positive definite matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90394-copenalex-snapshot
A parallelizable SOR-like method: Systems with plus-shaped and linear spectra
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00361-3openalex-snapshot
The convergence rate of the Chebyshev sim under a perturbation of a complex line-segment spectrum
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90503-gopenalex-snapshot
Is the optimal ω best for the SOR iteration method?
inferred← citeshttps://doi.org/10.1016/0041-5553(88)90038-9openalex-snapshot
The use of Faber polynomials to solve systems of linear equations
inferred← citeshttps://doi.org/10.1016/0168-9274(91)90066-9openalex-snapshot
On some convergence results of the k-step iterative 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/0377-0427(96)87162-7openalex-snapshot
Adaptive Richardson iteration based on Leja points
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00043-0openalex-snapshot
A note on the tau-method approximations for the Bessel functions Y0(z) and Y1(z)
inferred← citeshttps://doi.org/10.1016/j.amc.2003.12.112openalex-snapshot
The superiority of a new type (2,2)-step iterative method over the related Chebyshev method
inferred← citeshttps://doi.org/10.1016/j.apnum.2010.12.009openalex-snapshot
On the generation of Krylov subspace bases
inferred← citeshttps://doi.org/10.1016/j.cam.2015.04.028openalex-snapshot
On parameter acceleration methods for saddle point problems
inferred← citeshttps://doi.org/10.1016/j.laa.2008.04.047openalex-snapshot
Matrices, moments, and rational quadrature
inferred← citeshttps://doi.org/10.1016/j.laa.2025.04.004openalex-snapshot
A note on indefinite matrix splitting and preconditioning
inferred← citeshttps://doi.org/10.1016/j.sigpro.2016.01.010openalex-snapshot
Relaxation strategy for the Landweber 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/s0096-3003(00)00127-2openalex-snapshot
On the use of incomplete semiiterative methods for singular systems and applications in Markov chain modeling
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00817-2openalex-snapshot
Iterative methods for the Drazin inverse of a matrix with a complex spectrum
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00139-9openalex-snapshot
The Chebyshev iteration revisited
inferred← citeshttps://doi.org/10.1016/s0168-9274(02)00139-3openalex-snapshot
A polynomial method based on Fejèr points for the computation of functions of unsymmetric matrices
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)71718-3openalex-snapshot
Iterative Methods for Singular Systems
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00261-2openalex-snapshot
An interpolatory approximation of the matrix exponential based on Faber polynomials
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00403-9openalex-snapshot
Numerical analysis 2000 - Vol. III: Linear algebra
inferred← citeshttps://doi.org/10.1017/s0962492900002245openalex-snapshot
Iterative solution of linear systems
inferred← citeshttps://doi.org/10.1017/s0962492904000212openalex-snapshot
Numerical solution of saddle point problems
inferred← citeshttps://doi.org/10.1023/a:1012936012660openalex-snapshot
The Successive Over Relaxation Method (SOR) and Markov Chains
inferred← citeshttps://doi.org/10.1023/a:1025681013942openalex-snapshot
An Optimized Iterative Method for Numerical Solution of Large Systems of Equations Based on the Extremal Property of Zeroes of Chebyshev Polynomials
inferred← citeshttps://doi.org/10.1051/proc/201863001openalex-snapshot
Krylov Subspace Solvers and Preconditioners
inferred← citeshttps://doi.org/10.1063/1.468481openalex-snapshot
General, energy-separable Faber polynomial representation of operator functions: Theory and application in quantum scattering
inferred← citeshttps://doi.org/10.1081/nfa-100105314openalex-snapshot
THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1192973-1openalex-snapshot
Iterative and Semi-Iterative Methods for Computing Stationary Probability Vectors of Markov Operators
inferred← citeshttps://doi.org/10.1090/s0025-5718-1995-1260127-8openalex-snapshot
The Faber Polynomials for Annular Sectors
inferred← citeshttps://doi.org/10.1109/tip.2008.2008076openalex-snapshot
Necessary and Sufficient Convergence Conditions for Algebraic Image Reconstruction Algorithms
inferred← citeshttps://doi.org/10.1137/0608026openalex-snapshot
Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
inferred← citeshttps://doi.org/10.1137/0609017openalex-snapshot
On the Evaluation of Matrix Functions Given by Power Series
inferred← citeshttps://doi.org/10.1137/0613020openalex-snapshot
A Parallel Iteration Method and the Convection-Diffusion Equation
inferred← citeshttps://doi.org/10.1137/0613050openalex-snapshot
A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
inferred← citeshttps://doi.org/10.1137/0613059openalex-snapshot
Acceleration of Relaxation Methods for Non-Hermitian Linear Systems
inferred← citeshttps://doi.org/10.1137/0725077openalex-snapshot
Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems
inferred← citeshttps://doi.org/10.1137/s0036144596305582openalex-snapshot
From Potential Theory to Matrix Iterations in Six Steps
inferred← citeshttps://doi.org/10.1137/s0895479890182545openalex-snapshot
Iterative Consistency: A Concept for the Solution of Singular Systems of Linear Equations
inferred← citeshttps://doi.org/10.1137/s0895479897325761openalex-snapshot
Residual-Minimizing Krylov Subspace Methods for Stabilized Discretizations of Convection-Diffusion Equations
inferred← citeshttps://doi.org/10.1155/s0161171202013169openalex-snapshot
A note on computing the generalized inverse A T,S (2) of a matrix A
inferred← citeshttps://doi.org/10.1201/9781003072584-9openalex-snapshot
How (Un)stable Are Vandermonde Systems?
inferred← citeshttps://doi.org/10.13001/1081-3810.1073openalex-snapshot
The convergence rate of the Chebyshev semiiterative method under a perturbation of the foci of an elliptic domain
inferred← citeshttps://doi.org/10.1553/etna_vol54s534openalex-snapshot
Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials
inferred← citeshttps://doi.org/10.21136/am.1993.104566openalex-snapshot
Experiments with Krylov subspace methods on a massively parallel computer
inferred← citeshttps://doi.org/10.22028/d291-26524openalex-snapshot
Fast explicit methods for PDE-based image analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00602openalex-snapshot
Accelerating Smooth Games by Manipulating Spectral Shapes
inferred← citeshttps://doi.org/10.48550/arxiv.2008.07459openalex-snapshot
On the Suboptimality of Negative Momentum for Minimax Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02015openalex-snapshot
Asynchronous Richardson iterations
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.