On the public citation graph

Polynomial iteration for nonsymmetric indefinite linear systems

https://doi.org/10.1007/bfb0072674
0 signed · 39 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/bf01389971openalex-snapshot
The Tchebychev iteration for nonsymmetric linear systems
inferredcites →https://doi.org/10.1007/bf01397475openalex-snapshot
Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
inferredcites →https://doi.org/10.1007/bfb0080116openalex-snapshot
Conjugate gradient methods for indefinite systems
inferredcites →https://doi.org/10.1016/0021-9991(83)90139-0openalex-snapshot
An iterative method for the Helmholtz equation
inferredcites →https://doi.org/10.1016/c2009-0-21990-8openalex-snapshot
Applied Iterative Methods
inferredcites →https://doi.org/10.1016/s0304-0208(08)72624-0openalex-snapshot
Chapter 7 Preconditioned Iterative Methods for Nonselfadjoint or Indefinite Elliptic Boundary Value Problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7136-1openalex-snapshot
Unification of Finite Element Methods
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0438681-4openalex-snapshot
An iterative solution method for linear systems of which the coefficient matrix is a symmetric 𝑀-matrix
inferredcites →https://doi.org/10.1137/0712047openalex-snapshot
Solution of Sparse Indefinite Systems of Linear Equations
inferredcites →https://doi.org/10.1137/0720052openalex-snapshot
Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals
inferredcites →https://doi.org/10.1137/0903004openalex-snapshot
Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
inferredcites →https://doi.org/10.1137/0907010openalex-snapshot
Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
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/1019071openalex-snapshot
The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle
inferredcites →https://doi.org/10.1145/214408.214415openalex-snapshot
ALGORITHM 635
inferredcites →https://doi.org/10.1145/355984.355989openalex-snapshot
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem
inferredcites →https://doi.org/10.2307/2007849openalex-snapshot
Numerical Solution of Partial Differential Equations, Finite Difference Methods.
inferredcites →https://doi.org/10.5860/choice.45-6220openalex-snapshot
Applied iterative methods
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/num.1690090604openalex-snapshot
Optimal m‐stage Runge‐Kutta schemes for steady‐state solutions of hyperbolic equations
inferred← citeshttps://doi.org/10.1007/978-1-4899-3442-0_24openalex-snapshot
A fast algorithm for linear complex Chebyshev approximation
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/bf01409782openalex-snapshot
On semiiterative methods generated by Faber polynomials
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/s13160-016-0220-1openalex-snapshot
Locally optimal and heavy ball GMRES methods
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)90397-fopenalex-snapshot
Implementation of an adaptive algorithm for Richardson's method
inferred← citeshttps://doi.org/10.1016/0168-9274(93)90088-9openalex-snapshot
Optimal one-stage and two-stage schemes for steady state solutions of hyperbolic equations
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90351-2openalex-snapshot
Leapfrog variants of iterative methods for linear algebraic equations
inferred← citeshttps://doi.org/10.1016/b978-0-12-407475-0.50019-xopenalex-snapshot
An Adaptive Algorithm for Richardson's Method
inferred← citeshttps://doi.org/10.1016/s0045-7825(99)00037-7openalex-snapshot
On parameter choice and iterative convergence for stabilised discretisations of advection–diffusion problems
inferred← citeshttps://doi.org/10.1016/s0168-9274(96)00054-2openalex-snapshot
The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm
inferred← citeshttps://doi.org/10.1090/s0025-5718-1988-0935074-5openalex-snapshot
A Fast Algorithm for Linear Complex Chebyshev Approximations
inferred← citeshttps://doi.org/10.1137/0613049openalex-snapshot
How Fast are Nonsymmetric Matrix Iterations?
inferred← citeshttps://doi.org/10.1137/0613050openalex-snapshot
A Hybrid GMRES Algorithm for Nonsymmetric 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/s1064827596305258openalex-snapshot
Adaptively Preconditioned GMRES Algorithms
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.