Recursion relations for the extended Krylov subspace method (Q630517): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: mftoolbox / rank | |||
Normal rank |
Revision as of 21:38, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recursion relations for the extended Krylov subspace method |
scientific article |
Statements
Recursion relations for the extended Krylov subspace method (English)
0 references
17 March 2011
0 references
Many problems in applied mathematics require the computation of expressions of the form \(w:=f(A)v\), where \(A\in{\mathbb R}^{n\times n}\) is a large, sparse or structured, symmetric matrix, \(f\) is a nonlinear function defined on the spectrum of \(A\), and \(v\in{\mathbb R}^n\). The authors implement rational Lanczos methods for generating orthonormal bases of extended rational Krylov subspaces \({\mathbb K}^{m,mi+1}(A,v)=\text{span}\{A^{-m+1},\dots,A^{-1},v,Av,\dots,A^{mi}v\}\), \(m=1,2,\dots\) with \(i\) a positive integer, with short recursion relations. For all integers \(i\geq 1\), the projected matrix \(H_{m(i+1)}\) is pentadiagonal with a block-tridiagonal structure. Computed examples show that the above Krylov subspaces yield more accurate approximants for \(i>1\) than with \(i=1\) or standard Krylov subspaces \({\mathbb K}^m(A,v)=\text{span}\{v,Av,\dots,A^{m-1}v\}\) of the same dimension.
0 references
extended Krylov subspace method
0 references
orthogonal Laurent polynomial
0 references
recursion relation
0 references
matrix function evaluation
0 references
rational Gauss quadrature
0 references
numerical examples
0 references
rational Lanczos methods
0 references