In linear algebra, the order-r Krylov subspace generated by an n-by-n matrix A and a vector b of dimension n is the linear subspace spanned by the images of b under the first r powers of A (starting from A 0 = I {\displaystyle A^{0}=I} ), that is,
K r ( A , b ) = span { b , A b , A 2 b , … , A r − 1 b } . {\displaystyle {\mathcal {K}}_{r}(A,b)=\operatorname {span} \,\{b,Ab,A^{2}b,\ldots ,A^{r-1}b\}.}
Background The concept is named after Russian applied mathematician and naval engineer Alexei Krylov, who published a paper about the concept in 1931.
Properties
K r ( A , b ) , A K r ( A , b ) ⊂ K r + 1 ( A , b ) {\displaystyle {\mathcal {K}}_{r}(A,b),A\,{\mathcal {K}}_{r}(A,b)\subset {\mathcal {K}}_{r+1}(A,b)} . Let r 0 = dim span { b , A b , A 2 b , … } {\displaystyle r_{0}=\operatorname {dim} \operatorname {span} \,\{b,Ab,A^{2}b,\ldots \}} . Then { b , A b , A 2 b , … , A r − 1 b } {\displaystyle \{b,Ab,A^{2}b,\ldots ,A^{r-1}b\}} are linearly independent unless r > r 0 {\displaystyle r>r_{0}} , K r ( A , b ) ⊂ K r 0 ( A , b ) {\displaystyle {\mathcal {K}}_{r}(A,b)\subset {\mathcal {K}}_{r_{0}}(A,b)} for all r {\displaystyle r} , and dim K r 0 ( A , b ) = r 0 {\displaystyle \operatorname {dim} {\mathcal {K}}_{r_{0}}(A,b)=r_{0}} . So r 0 {\displaystyle r_{0}} is the maximal dimension of the Krylov subspaces K r ( A , b ) {\displaystyle {\mathcal {K}}_{r}(A,b)} . The maximal dimension satisfies r 0 ≤ 1 + rank A {\displaystyle r_{0}\leq 1+\operatorname {rank} A} and r 0 ≤ n {\displaystyle r_{0}\leq n} . Consider dim span { I , A , A 2 , … } = deg p ( A ) {\displaystyle \dim \operatorname {span} \,\{I,A,A^{2},\ldots \}=\deg \,p(A)} , where p ( A ) {\displaystyle p(A)} is the minimal polynomial of A {\displaystyle A} . We have r 0 ≤ deg p ( A ) {\displaystyle r_{0}\leq \deg \,p(A)} . Moreover, for any A {\displaystyle A} , there exists a b {\displaystyle b} for which this bound is tight, i.e. r 0 = deg p ( A ) {\displaystyle r_{0}=\deg \,p(A)} .
… excerpt ends here. Continue reading the full article.
