Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems (Q1916981): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q587874
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Axel Ruhe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev polynomials are not always optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tchebychev acceleration technique for large scale nonsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale complex eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tchebychev iteration for nonsymmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Generalized Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices / rank
 
Normal rank

Latest revision as of 12:18, 24 May 2024

scientific article
Language Label Description Also known as
English
Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
scientific article

    Statements

    Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems (English)
    0 references
    0 references
    0 references
    14 July 1996
    0 references
    It is proposed that eigenvalues of a large non-Hermitian matrix are computed by first applying an \(r^*r\) block Arnoldi algorithm, and then using the computed Ritz values to determine an ellipse that has those eigenvalues sought on its outside. Then this ellipse is used to determine a Chebyshev acceleration that is applied to the \(r\) leading Ritz vectors obtained from Arnoldi. The technique is tested on 2 applied problems, an Orr-Sommerfeld operator and one of the test matrices from the Harwell-Boeing collection.
    0 references
    eigenvalues
    0 references
    large non-Hermitian matrix
    0 references
    block Arnoldi algorithm
    0 references
    Ritz values
    0 references
    Chebyshev acceleration
    0 references
    Ritz vectors
    0 references
    Orr-Sommerfeld operator
    0 references
    Harwell-Boeing collection
    0 references
    0 references

    Identifiers