2013
DOI: 10.1137/100804012
|View full text |Cite
|
Sign up to set email alerts
|

Eigenvalue Computations Based on IDR

Abstract: The induced dimension reduction (IDR) method, which has been introduced as a transpose-free Krylov space method for solving nonsymmetric linear systems, can also be used to determine approximate eigenvalues of a matrix or operator. The IDR residual polynomials are the products of a residual polynomial constructed by successively appending linear smoothing factors and the residual polynomials of a two-sided (block) Lanczos process with one right-hand side and several left-hand sides. The Hessenberg matrix of th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
33
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 17 publications
(34 citation statements)
references
References 28 publications
1
33
0
Order By: Relevance
“…The representation (4.11) justifies the approximation of some of the eigenvalues of A by the spectrum of the pencil (H M , C m ), where H M denotes the "upper part" of H M ; see [9].…”
Section: Reformulation For Linear Systems Of Equationsmentioning
confidence: 99%
“…The representation (4.11) justifies the approximation of some of the eigenvalues of A by the spectrum of the pencil (H M , C m ), where H M denotes the "upper part" of H M ; see [9].…”
Section: Reformulation For Linear Systems Of Equationsmentioning
confidence: 99%
“…Update [6] for details). The IDR factorization is a standard Hessenberg relation which can be used to approximate eigenvalues and eigenvectors of a sparse matrix.…”
Section: Idr Process and Idr Factorizationmentioning
confidence: 99%
“…This method has obtained attention and different variants have been proposed to improved its convergence and numerical stability, for example [3,4,5]. Recently, in [6], the IDR(s) method has been adapted to approximate eigenpairs (λ , x) of the matrix A, i.e. Ax = λ x, with λ ∈ C, and x = 0 ∈ C n .…”
Section: Introductionmentioning
confidence: 99%
“…The obvious choice is to drop the variant for n = j(s + 1) − 1 and to keep the variant based on the first residual in the new space. See also [13]. The ambiguity does not occur in the variant of IDR(s) described in [30], since in this variant the critical residuals satisfy…”
Section: First Observations On the Convergence Behavior Of Idr(s)mentioning
confidence: 99%
“…Relations with Bi-CGSTAB are described in [19] and the combination of IDR(s) with BiCGSTAB( ) in [20]. Recent extensions to IDR(s) can be found in [3,29], and IDR(s)-eigenvalue algorithms have been developed [13]. …”
mentioning
confidence: 99%