Computing eigenvalue bounds for iterative subspace matrix methods (Q709710): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4348515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Algorithms / 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: The subspace projected approximate matrix (SPAM) modification of the Davidson method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rotation of Eigenvectors by a Perturbation. III / rank
 
Normal rank

Latest revision as of 08:04, 3 July 2024

scientific article
Language Label Description Also known as
English
Computing eigenvalue bounds for iterative subspace matrix methods
scientific article

    Statements

    Computing eigenvalue bounds for iterative subspace matrix methods (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2010
    0 references
    bounds
    0 references
    eigenvalue
    0 references
    subspace
    0 references
    Ritz
    0 references
    Hermitian
    0 references
    generalized
    0 references
    gap
    0 references
    spread
    0 references

    Identifiers