Linear Algebra 1971
DOI: 10.1007/978-3-662-39778-7_15
|View full text |Cite
|
Sign up to set email alerts
|

The Implicit QL Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

1982
1982
1983
1983

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…The increased computing cost will be substantially reduced if the solution is based on a diagonalization process analogous to that described in section 4.5.2. If special boundary conditions prevent the use of a fast diagonalization algorithm, it will still be economical to compute once the eigensystem of the pertinent difference operator in x by conventional methods (Schwarz 1971, Martin, Reinsch, and Wilkinson 1971, Dubrulle, Martin, and Wilkinson 1971 for repeated usage. The same comment applies to the method based on the mixed approximation.…”
Section: Resultsmentioning
confidence: 99%
“…The increased computing cost will be substantially reduced if the solution is based on a diagonalization process analogous to that described in section 4.5.2. If special boundary conditions prevent the use of a fast diagonalization algorithm, it will still be economical to compute once the eigensystem of the pertinent difference operator in x by conventional methods (Schwarz 1971, Martin, Reinsch, and Wilkinson 1971, Dubrulle, Martin, and Wilkinson 1971 for repeated usage. The same comment applies to the method based on the mixed approximation.…”
Section: Resultsmentioning
confidence: 99%
“…The algorithm becomes very simple and has been shown to be very efficient when it is applied to a real symmetric tridiagonal matrix (Bowdler et al, 1971). However, when the elements of the tridiagonal matrix differ widely in order of magnitude, severe loss of accuracy may be experienced in the computation of the eigenvalues of smaller magnitude (Dubrulle et al, 1971).…”
Section: Computational Strategiesmentioning
confidence: 99%
“…This loss of accuracy can be avoided to some extent by employing the implicit QL algorithm of Dubrulle et al (1971).…”
Section: Computational Strategiesmentioning
confidence: 99%
See 1 more Smart Citation