Bounding the spectrum of large Hermitian matrices (Q541913): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A sharp version of Kahan's theorem on clustered eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates for Some Computational Techniques in Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue of a Positive Definite Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating the Largest Eigenvalue with the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-consistent-field calculations using Chebyshev-filtered subspace iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems / rank
 
Normal rank

Latest revision as of 04:04, 4 July 2024

scientific article
Language Label Description Also known as
English
Bounding the spectrum of large Hermitian matrices
scientific article

    Statements

    Bounding the spectrum of large Hermitian matrices (English)
    0 references
    0 references
    0 references
    8 June 2011
    0 references
    For the spectrum of large Hermitian matrices, an analysis and certain rigorous proof conditions under which the estimator provides an upper bound are formulated, and, based on this analysis, four tighter upper bounds are also developed. A practical algorithm that exploits 5-8-step Lanczos iteration with a safeguard step is presented, where the safeguard step can be realized with marginal cost by using the obtained theoretical bounds.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hermitian matrix
    0 references
    largest eigenvalue
    0 references
    upper bound
    0 references
    Lanczos iteration
    0 references
    algorithm
    0 references
    0 references