1989
DOI: 10.1007/bf01405199
|View full text |Cite
|
Sign up to set email alerts
|

Tchebychev acceleration technique for large scale nonsymmetric matrices

Abstract: Summary.The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvatues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
25
0

Year Published

1989
1989
1995
1995

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(25 citation statements)
references
References 19 publications
0
25
0
Order By: Relevance
“…Two methods are discussed both from the theoretical and the practical point of view: a block-Arnoldi method and an adaptation of the Davidson method to the unsymmetric case. The former method and some of its variants have been recently studied [7,[11][12][13]. The latter one is very popular in quantum chemistry [4].…”
Section: Introductionmentioning
confidence: 99%
“…Two methods are discussed both from the theoretical and the practical point of view: a block-Arnoldi method and an adaptation of the Davidson method to the unsymmetric case. The former method and some of its variants have been recently studied [7,[11][12][13]. The latter one is very popular in quantum chemistry [4].…”
Section: Introductionmentioning
confidence: 99%
“…We have used the algorithm studied by Ho [4] to solve the problem ~'. We will not describe this algorithm in this paper.…”
Section: (D -~) + ((~ -~)~ -C~) I/~mentioning
confidence: 99%
“…One way to overcome this difficulty is to use the real part of the eigenvalues as a reference point [14"1. Ho [4] has developed a new procedure to find the optimal ellipse containing the unwanted eigenvalues without having to verify all possible ellipses. This procedure computes the exact rate of convergence of the Chebyshev ellipse with respect to the eigenvalues in the complex plane.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, an iterative Arnoldi algorithm with reorthogonalization (Saad 1980) has been developed and seems to work fairly well. Furthermore, acceleration techniques (Saad 1984;Ho 1990) have been developed to speed up the convergence of the Arnoldi algorithm. The standard Arnoldi algorithm does not give approximations to the left eigenvectors of a matrix.…”
Section: 1mentioning
confidence: 99%