On the public citation graph
Avoiding breakdown and near-breakdown in Lanczos type algorithms
0 signed · 89 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-6558-6openalex-snapshot
Padé-Type Approximation and General Orthogonal Polynomials
inferredcites →https://doi.org/10.1007/bf01385846openalex-snapshot
A breakdown-free Lanczos type algorithm for solving linear systems
inferredcites →https://doi.org/10.1007/bf02142321openalex-snapshot
Avoiding breakdown in the CGS algorithm
inferredcites →https://doi.org/10.1007/bf02145581openalex-snapshot
Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
inferredcites →https://doi.org/10.1007/bfb0066470openalex-snapshot
Polynômes orthogonaux formels : applications
inferredcites →https://doi.org/10.1007/bfb0080116openalex-snapshot
Conjugate gradient methods for indefinite systems
inferredcites →https://doi.org/10.1137/0910004openalex-snapshot
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
inferredcites →https://doi.org/10.1137/s0895479890188803openalex-snapshot
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199611/12)3:6<473::aid-nla85>3.0.co;2-jopenalex-snapshot
A Comparison of Three Basic Conjugate Direction Methods
inferred← citeshttps://doi.org/10.1002/nla.1680010106openalex-snapshot
Properties of generalized conjugate gradient methods
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-1-4612-1984-2_12openalex-snapshot
Krylov Subspace Iterations for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0261-2_8openalex-snapshot
Systems of Linear Algebraic Equations
inferred← citeshttps://doi.org/10.1007/978-3-0348-8685-7_2openalex-snapshot
Transpose-Free Look-Ahead Algorithms for Lanczos’ Method
inferred← citeshttps://doi.org/10.1007/978-94-011-0970-3_5openalex-snapshot
Breakdowns In The Computation Of Orthogonal Polynomials
inferred← citeshttps://doi.org/10.1007/978-94-015-8196-7_8openalex-snapshot
The Look-Ahead Lanczos Process for Large Nonsymmetric Matrices and Related Algorithms
inferred← citeshttps://doi.org/10.1007/bf01385846openalex-snapshot
A breakdown-free Lanczos type algorithm for solving linear systems
inferred← citeshttps://doi.org/10.1007/bf01737161openalex-snapshot
Look-ahead in Bi-CGSTAB and other product methods for linear systems
inferred← citeshttps://doi.org/10.1007/bf02141258openalex-snapshot
A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1007/bf02141259openalex-snapshot
A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1007/bf02141260openalex-snapshot
Treatment of near-breakdown in the CGS algorithm
inferred← citeshttps://doi.org/10.1007/bf02141743openalex-snapshot
An adaptive block Lanczos algorithm
inferred← citeshttps://doi.org/10.1007/bf02141750openalex-snapshot
A linear system solver based on a modified Krylov subspace method for breakdown recovery
inferred← citeshttps://doi.org/10.1007/bf02142321openalex-snapshot
Avoiding breakdown in the CGS algorithm
inferred← citeshttps://doi.org/10.1007/bf02142487openalex-snapshot
A look-ahead strategy for the implementation of some old and new extrapolation methods
inferred← citeshttps://doi.org/10.1007/bf02142491openalex-snapshot
Breakdown and near-breakdown control in the CGS algorithm using stochastic arithmetic
inferred← citeshttps://doi.org/10.1007/bf02142493openalex-snapshot
Formal orthogonal polynomials revisited. Applications
inferred← citeshttps://doi.org/10.1007/bf02145381openalex-snapshot
Addendum to “Avoiding breakdown and near-breakdown in Lanczos type algorithms”
inferred← citeshttps://doi.org/10.1007/bf02576010openalex-snapshot
Fast and stable computation of the barycentric representation of rational interpolants
inferred← citeshttps://doi.org/10.1007/s00211-019-01069-zopenalex-snapshot
Generalized block anti-Gauss quadrature rules
inferred← citeshttps://doi.org/10.1007/s002110050439openalex-snapshot
New look-ahead Lanczos-type algorithms for linear systems
inferred← citeshttps://doi.org/10.1007/s11075-020-01052-yopenalex-snapshot
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization
inferred← citeshttps://doi.org/10.1007/s11075-022-01351-6openalex-snapshot
A Lanczos-type procedure for tensors
inferred← citeshttps://doi.org/10.1007/s11075-025-02294-4openalex-snapshot
A matrix based analysis of the non-Hermitian Lanczos algorithm with applications to special matrix classes
inferred← citeshttps://doi.org/10.1007/s40574-022-00328-6openalex-snapshot
A Lanczos-like method for non-autonomous linear ordinary differential equations
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00081-6openalex-snapshot
The methods of Vorobyev and Lanczos
inferred← citeshttps://doi.org/10.1016/0168-9274(93)90087-8openalex-snapshot
Lanczos-type algorithms for solving systems of linear equations
inferred← citeshttps://doi.org/10.1016/0168-9274(95)00083-6openalex-snapshot
An engineering approach to generalized conjugate gradient methods and beyond
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/0168-9274(95)00110-7openalex-snapshot
Extrapolation algorithms and Padé approximations: a historical survey
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00211-1openalex-snapshot
A new taxonomy of conjugate gradient methods
inferred← citeshttps://doi.org/10.1016/b978-0-444-50617-7.50009-4openalex-snapshot
Iterative solution of linear systems in the 20th century
inferred← citeshttps://doi.org/10.1016/b978-012203590-6/50019-7openalex-snapshot
LARGE-SCALE MATRIX COMPUTATIONS IN CONTROL: KRYLOV SUBSPACE METHODS
inferred← citeshttps://doi.org/10.1016/j.aml.2025.109672openalex-snapshot
A modified CMRH method for solving large nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1016/j.cam.2007.01.004openalex-snapshot
A new implementation of the CMRH method for solving dense linear systems
inferred← citeshttps://doi.org/10.1016/j.parco.2017.05.006openalex-snapshot
Preconditioned Krylov solvers on GPUs
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00525-3openalex-snapshot
Avoiding breakdown in variants of the bi-cgstab algorithm
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00004-xopenalex-snapshot
On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00397-6openalex-snapshot
The matrix and polynomial approaches to Lanczos-type algorithms
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00412-xopenalex-snapshot
Iterative solution of linear systems in the 20th century
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00412-5openalex-snapshot
A review of formal orthogonality in Lanczos-based methods
inferred← citeshttps://doi.org/10.1016/s0764-4442(97)80163-2openalex-snapshot
A transpose-free “Lanczos/Orthodir” algorithm for linear systems
inferred← citeshttps://doi.org/10.1016/s0898-1221(96)00217-9openalex-snapshot
Breakdowns in the implementation of the Lánczos method for solving linear systems
inferred← citeshttps://doi.org/10.1017/s0962492900002737openalex-snapshot
Lanczos-type solvers for nonsymmetric linear systems of equations
inferred← citeshttps://doi.org/10.1023/a:1009998225359openalex-snapshot
Reliability of Lanczos-Type Product Methods from Perturbation Theory
inferred← citeshttps://doi.org/10.1023/a:1011637511962openalex-snapshot
Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1023/a:1012085428800openalex-snapshot
Transpose-free Lanczos-type algorithms for nonsymmetric linear systems
inferred← citeshttps://doi.org/10.1023/a:1014836728675openalex-snapshot
Vector-Orthogonality and Lanczos-Type Methods
inferred← citeshttps://doi.org/10.1023/a:1019145010317openalex-snapshot
Avoiding breakdown in Van der Vorst's method
inferred← citeshttps://doi.org/10.1023/a:1019162308133openalex-snapshot
A “Look-around Lanczos” algorithm for solving a system of linear equations
inferred← citeshttps://doi.org/10.1023/a:1019164119887openalex-snapshot
CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
inferred← citeshttps://doi.org/10.1023/a:1019210503339openalex-snapshot
Chebyshev rational interpolation
inferred← citeshttps://doi.org/10.1063/1.5121046openalex-snapshot
RMEIEMLA : The recent advance in improving the robustness of Lanczos-type algorithms
inferred← citeshttps://doi.org/10.1080/10556789608805643openalex-snapshot
A breakdown of the block CG method
inferred← citeshttps://doi.org/10.1080/10652469.2016.1197922openalex-snapshot
On quasi-orthogonal polynomials of orderr
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1201072-2openalex-snapshot
A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
inferred← citeshttps://doi.org/10.1093/imanum/drw032openalex-snapshot
Gauss quadrature for quasi-definite linear functionals
inferred← citeshttps://doi.org/10.1109/cem.2011.6047335openalex-snapshot
Investigating the composite step biconjugate A-orthogonal residual method for non-hermitian linear systems in electromagnetics
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.45openalex-snapshot
Efficiency of General Krylov Methods on GPUs -- An Experimental Study
inferred← citeshttps://doi.org/10.1115/1.3097289openalex-snapshot
New Trends in Asymptotic Approaches: Summation and Interpolation Methods
inferred← citeshttps://doi.org/10.1137/0914009openalex-snapshot
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
inferred← citeshttps://doi.org/10.1137/0915034openalex-snapshot
Error-Minimizing Krylov Subspace Methods
inferred← citeshttps://doi.org/10.1137/1.9780898718003openalex-snapshot
Iterative Methods for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/s1064827594269202openalex-snapshot
Composite Step Product Methods for Solving Nonsymmetric Linear Systems
inferred← citeshttps://doi.org/10.1137/s106482759631370xopenalex-snapshot
Multiparameter Iterative Schemes for the Solution of Systems of Linear and Nonlinear Equations
inferred← citeshttps://doi.org/10.1155/2013/408167openalex-snapshot
Exploiting the Composite Step Strategy to the Biconjugate A -Orthogonal Residual Method for Non-Hermitian Linear Systems
inferred← citeshttps://doi.org/10.1515/9783112318805-006openalex-snapshot
Some applications of the Euclidean algorithm
inferred← citeshttps://doi.org/10.22099/ijsts.2013.1634openalex-snapshot
A preemptive restarting approach to beating the inherent instability of Lanczos-type algorithms
inferred← citeshttps://doi.org/10.4064/-29-1-19-33openalex-snapshot
Orthogonal polynomials and the Lanczos method
inferred← citeshttps://doi.org/10.4064/am-26-1-33-62openalex-snapshot
Avoiding look-ahead in the Lanczos method and Padé approximation
inferred← citeshttps://doi.org/10.4064/am-26-4-477-488openalex-snapshot
A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms
inferred← citeshttps://doi.org/10.4203/ctr.3.3openalex-snapshot
Some Properties of Krylov Projection Methods for Large Linear Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0323openalex-snapshot
New Recurrence Relationships between Orthogonal Polynomials which Lead to New Lanczos-type Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0326openalex-snapshot
An alternative derivation of a new Lanczos-type algorithm for systems of linear equations
inferred← citeshttps://doi.org/10.5614/j.math.fund.sci.2015.47.2.5openalex-snapshot
Restarting from Specific Points to Cure Breakdown in Lanczos-type 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.