Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems (Q1326401): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Davidson Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices / 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: Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems / 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

Latest revision as of 14:56, 22 May 2024

scientific article
Language Label Description Also known as
English
Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
scientific article

    Statements

    Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems (English)
    0 references
    7 July 1994
    0 references
    We present two methods for computing the leading eigenpairs of large sparse unsymmetric matrices. Namely the block-Arnoldi method and an adaptation of the Davidson method to unsymmetric matrices. We give some theoretical results concerning the convergence of these two methods when restarting is used, and discuss implementation aspects of the two methods on an Alliant FX/80. Finally some results of numerical tests on a variety of matrices including matrices from the Harwell-Boeing test collection, in which we compare these two methods are reported.
    0 references
    Chebyshev iterations
    0 references
    leading eigenpairs
    0 references
    large sparse unsymmetric matrices
    0 references
    block-Arnoldi method
    0 references
    Davidson method
    0 references
    convergence
    0 references
    restarting
    0 references
    numerical tests
    0 references
    0 references

    Identifiers