{
 "id": "epmx9tmcgh",
 "slug": "krylov-subspace-methods",
 "title": "Krylov subspace methods",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "physical",
   "label": "Physical world and mathematics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical"
  },
  {
   "id": "physical.math",
   "label": "Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
  },
  {
   "id": "physical.math.number",
   "label": "Numbers and algebra",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number"
  },
  {
   "id": "physical.math.number.linear-and-multilinear-algebra",
   "label": "Linear and multilinear algebra",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.linear-and-multilinear-algebra"
  },
  {
   "id": "physical.math.number.numerical-linear-algebra",
   "label": "Numerical linear algebra",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.numerical-linear-algebra"
  },
  {
   "id": "physical.math.number.numerical-linear-algebra.iterative-methods",
   "label": "Iterative methods for linear systems",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.numerical-linear-algebra.iterative-methods"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1946.physical.math",
   "label": "Non-geographic · 1946 to 2000: Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical"
    },
    {
     "id": "geo.nongeo.t1946.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math"
    }
   ]
  }
 ],
 "excerpt": "Krylov subspace methods are iterative projection methods for large linear systems, eigenvalue problems, and matrix functions, building approximations from repeated matrix-vector products; examples include CG, GMRES, and BiCGSTAB.",
 "snippet": "Krylov subspace methods are iterative projection methods for large linear systems, eigenvalue problems, and matrix functions, building approximations from repeated matrix-vector products; examples include CG, GMRES, and BiCGSTAB.",
 "node": "physical.math.number.numerical-linear-algebra.iterative-methods",
 "markdown": "# Krylov subspace methods\n\nKrylov subspace methods are iterative projection methods that solve large linear systems \\( Ax=b \\), eigenvalue problems, and matrix-function problems \\( f(A)b \\) by building approximate solutions inside subspaces generated by repeated matrix-vector products with \\( A \\). Because they never need the entries of \\( A \\) individually, only the result of multiplying \\( A \\) by a vector, they can be run matrix-free, without storing \\( A \\) explicitly.<sup>[1](https://comp-lin-alg.github.io/L6_krylov.html)</sup><sup> • </sup><sup>[2](https://web.math.ucsb.edu/~siam/2014-Fall/enniss_krylov.pdf)</sup>\n\n| Key fact | Detail |\n|---|---|\n| Subspace used | \\( \\mathcal{K}_k(A,v) = \\mathrm{span}\\{v, Av, \\dots, A^{k-1}v\\} \\)<sup>[3](https://www.math.ucla.edu/~njhu/notes/nla/lin-iter/krylov/)</sup> |\n| Problem classes | Linear systems \\( Ax=b \\), eigenvalue problems, matrix functions \\( f(A)b \\)<sup>[4](https://www.ams.org//journals/notices/202305/noti2683/noti2683.html)</sup> |\n| Method-to-matrix mapping | CG for symmetric positive definite, GMRES for nonsymmetric, MINRES/SymmLQ for symmetric indefinite, BiCGSTAB family for nonsymmetric with short recurrences<sup>[5](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)</sup> |\n| GMRES cost per iteration | One matrix-vector product, \\( k+1 \\) axpy and \\( k+1 \\) inner products, about \\( 2n(\\ell+2k+2) \\) flops, \\( k+5 \\) stored vectors; typically restarted after about 30 iterations<sup>[6](https://ar5iv.labs.arxiv.org/html/1607.00351)</sup> |\n| Practice | Nearly always preconditioned, so the preconditioned matrix has clustered eigenvalues<sup>[5](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)</sup><sup> • </sup><sup>[1](https://comp-lin-alg.github.io/L6_krylov.html)</sup> |\n| Convergence bound | \\( \\|r_k\\|/\\|b\\| \\le \\kappa(Z) \\min_{p\\in\\Pi_k} \\max_i \\lvert p(\\lambda_i)\\rvert \\) for diagonalizable \\( A \\)<sup>[7](https://www.karlin.mff.cuni.cz/~strakos/download/2013_DuiMeuSadStr.pdf)</sup> |\n| Recent direction | Randomized sketching and communication-avoiding variants; reported speedups of 70× over gmres and 10× over eigs on model problems<sup>[8](https://www.tropp.caltech.edu/papers/NT24-Fast-Accurate-SIMAX.pdf)</sup> |\n\n## How it works\n\nA [Krylov subspace](https://www.edgepedia.org/krylov-subspace) is \\( \\mathcal{K}_k(A,v) := \\mathrm{span}\\{A^j v\\}_{j=0}^{k-1} \\); a Krylov method for \\( Ax=b \\) is a projection method whose search subspaces are these spaces.<sup>[3](https://www.math.ucla.edu/~njhu/notes/nla/lin-iter/krylov/)</sup> The iterate has polynomial form: the solver produces \\( x_n \\) with \\( x_n - x_0 = q_{n-1}(A)\\, r_0 \\in \\mathcal{K}_n(A, r_0) \\), so each correction is a polynomial in \\( A \\) applied to the initial residual.<sup>[5](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)</sup> For eigenvalue problems the Arnoldi method acts as a generalization of the power method, obtaining Ritz eigenvector approximations as linear combinations of its Krylov basis vectors through eigenvectors of the projected Hessenberg matrix.<sup>[9](https://www.mat.tuhh.de/lehre/material/Summer_school_Finland2006/chap10.pdf)</sup><sup> • </sup><sup>[33](https://www.mat.tuhh.de/lehre/material/ewa/chap2.pdf)</sup>\n\nThe approximation is fixed by a projection condition. In a Galerkin-type method one imposes \\( V^{T} A V y = V^{T} b \\) on the approximation \\( \\tilde{x} = V \\cdot y \\) built on the basis \\( V \\) of the subspace; requiring the residual to be orthogonal to the previous search directions is called a Galerkin, or more precisely a Petrov-Galerkin, condition.<sup>[10](https://www-users.cse.umn.edu/~saad/PDF/ys-2022-03.pdf)</sup><sup> • </sup><sup>[11](https://www.netlib.org/lapack/lawnspdf/lawn51.pdf)</sup> A unified analysis shows that the main methods for \\( Ax=f \\) encompass Petrov-Galerkin and minimal-seminorm methods as special cases.<sup>[12](https://link.springer.com/article/10.1007/s11075-023-01648-0)</sup>\n\nBasis construction distinguishes the methods. The Arnoldi iteration builds orthonormal bases of successive Krylov subspaces by modified Gram-Schmidt orthogonalization, computing coefficients \\( h_{ij} = \\langle v_j, q_i \\rangle \\) at each step.<sup>[3](https://www.math.ucla.edu/~njhu/notes/nla/lin-iter/krylov/)</sup> When \\( A \\) is symmetric the Hessenberg matrix reduces to tridiagonal and Arnoldi collapses to the Lanczos iteration with a three-term recurrence.<sup>[6](https://ar5iv.labs.arxiv.org/html/1607.00351)</sup><sup> • </sup><sup>[13](https://ucla-biostat-257-2020spring.github.io/readings/krylov.pdf)</sup> The optimality properties then differ: CG, applicable to symmetric positive definite systems, minimizes the \\( A \\)-norm (energy norm) of the error; GMRES minimizes the 2-norm of the residual over the Krylov subspace; MINRES and SymmLQ use the symmetric Lanczos process, and QMR the nonsymmetric Lanczos process with a pseudo-norm residual minimization.<sup>[5](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)</sup><sup> • </sup><sup>[14](https://arxiv.org/html/2408.00693)</sup><sup> • </sup><sup>[6](https://ar5iv.labs.arxiv.org/html/1607.00351)</sup>\n\nBecause GMRES minimizes \\( \\|r_0 - A z_k\\|_2 \\) over an expanding subspace \\( \\mathcal{K}_k(A, r_0) \\), the residual decreases monotonically.<sup>[14](https://arxiv.org/html/2408.00693)</sup> For diagonalizable \\( A \\) the standard bound is \\( \\|r_k\\|/\\|b\\| \\le \\kappa(Z) \\min_{p\\in\\Pi_k} \\max_{i=1,\\dots,n} \\lvert p_k(\\lambda_i)\\rvert \\), where \\( A = Z\\Lambda Z^{-1} \\), \\( \\kappa(Z) \\) is the condition number of the eigenvector matrix, and \\( \\Pi_k \\) is the set of polynomials of degree \\( k \\) with value one at the origin.<sup>[7](https://www.karlin.mff.cuni.cz/~strakos/download/2013_DuiMeuSadStr.pdf)</sup> For normal matrices this min-max bound is sharp, i.e. attainable by the GMRES residual norm; for Hermitian matrices the worst-case residual norm equals the lower bound, which numerical experiments suggest is generally within a factor of \\( 4/\\pi \\) of the actual worst case.<sup>[15](https://page.math.tu-berlin.de/~liesen/Publicat/LieTic04.pdf)</sup> Practically, GMRES converges quickly when eigenvalues cluster in a few groups away from 0, allowing a low-degree polynomial \\( p \\) with \\( p(0)=1 \\) that is small on the spectrum; scattered eigenvalues or eigenvalues near zero require many iterations.<sup>[1](https://comp-lin-alg.github.io/L6_krylov.html)</sup> Eigenvalues alone do not explain GMRES convergence: it also depends on the projection of \\( b \\) onto each eigenvector and on the normality of \\( A \\), and a large \\( \\kappa(V) \\) of the eigenvector matrix can hinder convergence.<sup>[14](https://arxiv.org/html/2408.00693)</sup>\n\n## How it is done\n\nA practitioner runs a loop of matrix-vector products, orthogonalization against previous basis vectors, and a small projected solve. For GMRES this means one Arnoldi vector per iteration, with \\( k+1 \\) axpy operations and \\( k+1 \\) inner products at step \\( k \\).<sup>[6](https://ar5iv.labs.arxiv.org/html/1607.00351)</sup> Stopping is judged through residual-error bounds: the relative error satisfies \\( \\|e^k\\|/\\|x^*\\| \\le \\|A^{-1}\\|\\|A\\| \\, \\|r^k\\|/\\|b\\| \\), so relative error is bounded by the condition number times the relative residual.<sup>[1](https://comp-lin-alg.github.io/L6_krylov.html)</sup>\n\nMethod choice follows the matrix: CG only for symmetric positive definite systems; GMRES for general nonsymmetric systems; MINRES and SymmLQ through symmetric Lanczos for symmetric indefinite problems.<sup>[5](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)</sup> For nonsymmetric matrices where full orthogonalization is too costly, the bi-Lanczos iteration (Lanczos biorthogonalization) builds a non-orthogonal basis with a three-term recurrence using two matrix-vector products per iteration, and BiCG, CGS, TFQMR, BiCGSTAB, and QMRCGSTAB are built on transpose-free bi-Lanczos variants.<sup>[6](https://ar5iv.labs.arxiv.org/html/1607.00351)</sup>\n\nIn practice Krylov solvers are nearly always preconditioned, because they often converge very slowly on large real-world problems.<sup>[5](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)</sup> Preconditioning applies the solver to the left-preconditioned system \\( \\hat{A}^{-1}Ax = \\hat{A}^{-1}b \\), choosing \\( \\hat{A} \\) so that \\( \\hat{A}^{-1}A \\) has clustered eigenvalues.<sup>[1](https://comp-lin-alg.github.io/L6_krylov.html)</sup>\n\nThe Arnoldi process costs \\( O(m \\cdot \\mathrm{mv}(A) + n \\cdot m^2) \\) for \\( m \\) iterations, so orthogonalization becomes the dominant cost for moderately large \\( m \\) or on parallel computers.<sup>[16](https://arxiv.org/html/2512.15455v1)</sup> GMRES stores \\( k+5 \\) vectors beyond the matrix and is typically restarted after about 30 iterations.<sup>[6](https://ar5iv.labs.arxiv.org/html/1607.00351)</sup>\n\n## Origin\n\nThe subspace form described a procedure for computing the characteristic polynomial of an arbitrary square matrix, in the context of solving a secular equation for small oscillations of mechanical systems.<sup>[10](https://www-users.cse.umn.edu/~saad/PDF/ys-2022-03.pdf)</sup><sup> • </sup><sup>[17](https://www2.karlin.mff.cuni.cz/~strakos/download/2024_CarLieStr.pdf)</sup> Lanczos reported his \"method of minimized iterations\" for eigenvalue problems of differential and integral operators in 1950 in the Journal of Research of the National Bureau of Standards,<sup>[18](https://doi.org/10.6028/jres.045.026)</sup> and in 1952 a companion paper there on linear systems, noting that matrix inversion and the solution of simultaneous linear equations are contained in the general eigenvalue procedure as a special case.<sup>[19](https://doi.org/10.6028/jres.049.006)</sup> Lanczos showed that for symmetric \\( A \\) an orthogonal basis of the Krylov subspace can be generated with a simple three-term recurrence.<sup>[13](https://ucla-biostat-257-2020spring.github.io/readings/krylov.pdf)</sup>\n\nThe conjugate gradient method was published by M. R. Hestenes and E. Stiefel in 1952 in the Journal of Research of the National Bureau of Standards,<sup>[20](https://doi.org/10.6028/jres.049.044)</sup> prepared jointly during Stiefel's stay at the National Bureau of Standards.<sup>[21](https://nvlpubs.nist.gov/nistpubs/jres/049/6/V49.N06.A08.pdf)</sup> A 1987 Stanford review records that the first papers were given by E. Stiefel (1952) and M. R. Hestenes (1951), and that Hestenes, Lanczos, and Stiefel considered the algorithm a full n-step direct method.<sup>[22](http://i.stanford.edu/pub/cstr/reports/na/m/87/05/NA-M-87-05.pdf)</sup> Hestenes and Todd state that CG is \"an easy consequence of results given by Lanczos\".<sup>[10](https://www-users.cse.umn.edu/~saad/PDF/ys-2022-03.pdf)</sup> The method received little recognition in its first 20 years.<sup>[13](https://ucla-biostat-257-2020spring.github.io/readings/krylov.pdf)</sup> GMRES was proposed in 1986 by Youcef Saad and Martin H. Schultz in the SIAM Journal on Scientific and Statistical Computing,<sup>[23](https://doi.org/10.1137/0907058)</sup> and is the de facto standard for unsymmetric systems.<sup>[13](https://ucla-biostat-257-2020spring.github.io/readings/krylov.pdf)</sup>\n\n## Variants\n\nThe short-recurrence family trades optimality for cost. CGS replaces the transpose multiplication with a second multiplication by \\( A \\), squaring the residual polynomial so the Krylov space grows by two dimensions per step; it is typically nearly twice as fast as BiCG in matrix-vector products but converges more erratically.<sup>[24](https://people.math.ethz.ch/~mhg/pub/mhg-published/66-Gut97-ActaNum6.pdf)</sup> BiCGSTAB uses residuals of the form \\( r_n = p_n(A)\\, t_n(A)\\, y \\) with the polynomials \\( t_n \\) built in factored form so the residual undergoes a one-dimensional minimization each step, giving smoother convergence and founding a family of methods.<sup>[24](https://people.math.ethz.ch/~mhg/pub/mhg-published/66-Gut97-ActaNum6.pdf)</sup> Across this family the kth residual has product form \\( r_k = \\Psi_k(A)\\, \\Phi_k(A)\\, r_0 \\), and the choice of \\( \\Psi_k \\) trades local convergence against smoothing, fixed memory, and per-iteration cost.<sup>[12](https://link.springer.com/article/10.1007/s11075-023-01648-0)</sup>\n\nRestarted, truncated, augmented, deflated, flexible, and inexact variants reduce cost or handle variable preconditioning.<sup>[25](https://www.dm.unibo.it/~simoncin/survey.pdf)</sup> Flexible methods allow the preconditioner to vary across outer iterations, for example when preconditioning requires an inner iterative solve; under variable preconditioning the perturbation to the outer residual stays of the same order as the perturbation to the preconditioner application, so a moderate inner tolerance preserves BiCGStab-like convergence.<sup>[26](https://jiechenjiechen.github.io/pub/fbcgs.pdf)</sup> Inexact Krylov methods tolerate inexactness in the matrix-vector product itself, with computable criteria bounding the inexactness so convergence is maintained.<sup>[27](https://psycnet.apa.org/doi/10.1137/S1064827502406415)</sup>\n\n## Applications\n\nKrylov methods dominate extreme-scale simulation. Flexible BiCGStab with a variable multigrid preconditioner significantly accelerated PFLOTRAN reacting-flow simulations on computers using \\( O(10^4) \\) to \\( O(10^5) \\) processor cores.<sup>[26](https://jiechenjiechen.github.io/pub/fbcgs.pdf)</sup> A 2023 survey reviews GMRES algorithms over 35 years, focusing on acceleration strategies, parallel algorithms, multiple right-hand sides, and shifted systems.<sup>[28](https://dl.acm.org/doi/10.1016/j.amc.2023.127869)</sup>\n\n## Limitations and alternatives\n\nGMRES exhibits stagnation breakdowns very similar to Arnoldi's method breakdowns, and a relationship between the two methods' residual norms shows that if one performs poorly on a problem, so will the other.<sup>[29](https://epubs.siam.org/doi/10.1137/0912003)</sup> Complete stagnation of GMRES can occur for certain complex right-hand sides but not real ones, and if a normal matrix completely stagnates, an entire family of nonnormal matrices with the same eigenvalues also stagnates.<sup>[30](https://www.sciencedirect.com/science/article/pii/S0024379502006122)</sup> BiCG-type methods can suffer true breakdown (non-existence of new basis vectors), ghost or pivot breakdown from the recurrences, and pivot breakdown when the LU factorization of the tridiagonal matrix \\( T_m \\) does not exist; look-ahead Lanczos and composite-step strategies address these.<sup>[25](https://www.dm.unibo.it/~simoncin/survey.pdf)</sup> The two-sided Lanczos method is not very stable, its residual norms can oscillate erratically, and it needs access to both \\( A \\) and \\( A^T \\), which is why Lanczos and BiCG are not much used today; smoothing procedures such as QMR and TFQMR exist because Lanczos-based residual norms are not necessarily non-increasing, though smoothing does not improve the numerical properties of the short recurrence.<sup>[25](https://www.dm.unibo.it/~simoncin/survey.pdf)</sup> A classical negative result by [Vance Faber](https://www.edgepedia.org/vance-faber) and Thomas Manteuffel shows that constructing optimal solutions in the Krylov subspace for unsymmetric \\( A \\) by short recurrences, as CG does for the symmetric case, is generally not possible.<sup>[13](https://ucla-biostat-257-2020spring.github.io/readings/krylov.pdf)</sup> Parts of the convergence analysis remain open, including the effect of small perturbations such as rounding errors for symmetric or Hermitian matrices.<sup>[4](https://www.ams.org//journals/notices/202305/noti2683/noti2683.html)</sup>\n\nRecent work targets orthogonalization cost and stability. GMRES-SDR combines randomized sketching with deflated restarting, avoiding orthogonalization of a full Krylov basis for a system or a sequence of slowly changing systems.<sup>[31](https://ar5iv.labs.arxiv.org/html/2311.14206)</sup> Randomized (sketched) Krylov methods replace exact Gram-Schmidt orthogonalization with operations on a low-dimensional sketched space, producing a basis whose sketch \\( \\Omega \\cdot V_m \\) has orthonormal columns, which permits mixed-precision arithmetic and optimized kernels with high-probability numerical guarantees.<sup>[16](https://arxiv.org/html/2512.15455v1)</sup> Randomized algorithms for linear systems and eigenvalue problems reach accuracy similar to classic methods while running faster and sometimes using less storage, with experiments showing a 70× speedup over gmres and a 10× speedup over eigs against optimized MATLAB routines.<sup>[8](https://www.tropp.caltech.edu/papers/NT24-Fast-Accurate-SIMAX.pdf)</sup> Communication-avoiding s-step GMRES generates \\( s \\) Krylov vectors at a time via the Matrix Powers Kernel and orthogonalizes \\( s+1 \\) basis vectors at once, reducing communication cost by a factor of \\( s \\); on up to 64 NVIDIA A100 GPUs of the Perlmutter supercomputer, random sketching added virtually no overhead to stabilize the one-stage BCGS2 orthogonalization.<sup>[32](https://www.sciencedirect.com/science/article/abs/pii/S0167819126000153)</sup>\n\n## References\n\n1. [Iterative Krylov methods for Ax=b, Computational linear algebra course](https://comp-lin-alg.github.io/L6_krylov.html)\n2. [Krylov Subspace Methods (UCSB SIAM slides)](https://web.math.ucsb.edu/~siam/2014-Fall/enniss_krylov.pdf)\n3. [Krylov subspace methods | Nicholas Hu](https://www.math.ucla.edu/~njhu/notes/nla/lin-iter/krylov/)\n4. [Open Problems in the Analysis of Krylov Subspace Methods](https://www.ams.org//journals/notices/202305/noti2683/noti2683.html)\n5. [A Brief Introduction to Krylov Space Methods for Solving Linear Systems](https://people.math.ethz.ch/~mhg/pub/biksm.pdf)\n6. [A Comparison of Preconditioned Krylov Subspace Methods for Large-Scale Nonsymmetric Linear Systems](https://ar5iv.labs.arxiv.org/html/1607.00351)\n7. [On investigating GMRES convergence using unitary matrices](https://www.karlin.mff.cuni.cz/~strakos/download/2013_DuiMeuSadStr.pdf)\n8. [Fast and Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems (SIAM J. Matrix Anal. Appl., Vol. 45, No. 2)](https://www.tropp.caltech.edu/papers/NT24-Fast-Accurate-SIMAX.pdf)\n9. [Iterative Projection Methods for Sparse Linear Systems and Eigenproblems, Chapter 10: Krylov Subspace Methods](https://www.mat.tuhh.de/lehre/material/Summer_school_Finland2006/chap10.pdf)\n10. [Krylov subspace methods from the historical, analytic, application, and high performance computing perspective (Y. Saad, historical review)](https://www-users.cse.umn.edu/~saad/PDF/ys-2022-03.pdf)\n11. [Qualitative Properties of the Conjugate Gradient and Lanczos Methods in a Matrix Framework (LAPACK Working Note 51)](https://www.netlib.org/lapack/lawnspdf/lawn51.pdf)\n12. [A unified approach to Krylov subspace methods for solving linear systems (Numerical Algorithms)](https://link.springer.com/article/10.1007/s11075-023-01648-0)\n13. [Krylov Subspace Iteration (van der Vorst, SIAM News-style survey)](https://ucla-biostat-257-2020spring.github.io/readings/krylov.pdf)\n14. [Superlinear Convergence of GMRES for clustered eigenvalues and its application to least squares problems](https://arxiv.org/html/2408.00693)\n15. [The Worst-Case GMRES for Normal Matrices](https://page.math.tu-berlin.de/~liesen/Publicat/LieTic04.pdf)\n16. [Randomized orthogonalization and Krylov subspace methods: principles and algorithms](https://arxiv.org/html/2512.15455v1)\n17. [Towards understanding CG and GMRES through examples](https://www2.karlin.mff.cuni.cz/~strakos/download/2024_CarLieStr.pdf)\n18. [C. Lanczos (1950). An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of research of the National Bureau of Standards.](https://doi.org/10.6028/jres.045.026)\n19. [C. Lanczos (1952). Solution of systems of linear equations by minimized iterations. Journal of research of the National Bureau of Standards.](https://doi.org/10.6028/jres.049.006)\n20. [M.R. Hestenes, E. Stiefel (1952). Methods of conjugate gradients for solving linear systems. Journal of research of the National Bureau of Standards.](https://doi.org/10.6028/jres.049.044)\n21. [Methods of Conjugate Gradients for Solving Linear Systems (Hestenes & Stiefel, 1952, NBS Journal of Research)](https://nvlpubs.nist.gov/nistpubs/jres/049/6/V49.N06.A08.pdf)\n22. [Some history of the conjugate gradient and Lanczos methods (Golub & O'Leary, Stanford NA report, 1987)](http://i.stanford.edu/pub/cstr/reports/na/m/87/05/NA-M-87-05.pdf)\n23. [Youcef Saad, Martin H. Schultz (1986). GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems. SIAM Journal on Scientific and Statistical Computing.](https://doi.org/10.1137/0907058)\n24. [Lanczos type solvers for nonsymmetric linear systems of equations (Gutknecht, Acta Numerica)](https://people.math.ethz.ch/~mhg/pub/mhg-published/66-Gut97-ActaNum6.pdf)\n25. [Krylov subspace methods survey (Simoncini)](https://www.dm.unibo.it/~simoncin/survey.pdf)\n26. [Analysis and Practical Use of Flexible BiCGStab](https://jiechenjiechen.github.io/pub/fbcgs.pdf)\n27. [Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing (SIAM J. Sci. Comput.)](https://psycnet.apa.org/doi/10.1137/S1064827502406415)\n28. [GMRES algorithms over 35 years](https://dl.acm.org/doi/10.1016/j.amc.2023.127869)\n29. [A Theoretical Comparison of the Arnoldi and GMRES Algorithms (Peter N. Brown)](https://epubs.siam.org/doi/10.1137/0912003)\n30. [Complete stagnation of GMRES (Linear Algebra and its Applications)](https://www.sciencedirect.com/science/article/pii/S0024379502006122)\n31. [GMRES with randomized sketching and deflated restarting (GMRES-SDR)](https://ar5iv.labs.arxiv.org/html/2311.14206)\n32. [Random sketching to enhance the numerical stability of block orthogonalization algorithms for s-step GMRES (Parallel Computing)](https://www.sciencedirect.com/science/article/abs/pii/S0167819126000153)\n33. [mat.tuhh.de](https://www.mat.tuhh.de/lehre/material/ewa/chap2.pdf)\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Numbers and algebra › Linear and multilinear algebra › Numerical linear algebra › Iterative methods for linear systems*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [
  "https://web.math.ucsb.edu/~siam/2014-Fall/enniss_krylov.pdf",
  "https://www.math.ucla.edu/~njhu/notes/nla/lin-iter/krylov/",
  "https://www-users.cse.umn.edu/~saad/PDF/ys-2022-03.pdf"
 ],
 "url": "https://www.edgepedia.org/krylov-subspace-methods",
 "markdown_url": "https://www.edgepedia.org/krylov-subspace-methods.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"Krylov subspace methods\", Edgepedia (EdgeChat), https://www.edgepedia.org/krylov-subspace-methods. Edgepedia Community License 1.0.",
 "credit_md": "\"[Krylov subspace methods](https://www.edgepedia.org/krylov-subspace-methods)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/krylov-subspace-methods](https://www.edgepedia.org/krylov-subspace-methods). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/krylov-subspace-methods\">Krylov subspace methods</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/krylov-subspace-methods\">https://www.edgepedia.org/krylov-subspace-methods</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "Krylov subspace methods are iterative projection methods for large linear systems, eigenvalue problems, and matrix functions, building approximations from repeated matrix-vector products; examples include CG, GMRES, and BiCGSTAB."
}