Robust preconditioning of large, sparse, symmetric eigenvalue problems (Q1917916): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ILUT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(95)00141-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070675934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Davidson Method / 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: Super-matrix methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Accuracy of Computed Eigenvalues and Eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix eigensystem routines. EISPACK guide extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davidson's algorithm with and without perturbation corrections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / 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: Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Software Scene in the Extraction of Eigenvalues from Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: ILUT: A dual threshold incomplete LU factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Flexible Inner-Outer Preconditioned GMRES Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Advantages of Inverted Operators in Rayleigh–Ritz Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria for Combining Inverse and Rayleigh Quotient Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank

Latest revision as of 13:22, 24 May 2024

scientific article
Language Label Description Also known as
English
Robust preconditioning of large, sparse, symmetric eigenvalue problems
scientific article

    Statements

    Robust preconditioning of large, sparse, symmetric eigenvalue problems (English)
    0 references
    0 references
    0 references
    20 February 1997
    0 references
    The generalized Davidson method is a technique for eigenvalue preconditioning in the computation of a few selected eigenvalues of large, sparse, symmetric matrices. In the paper, the quality of preconditioning is studied and strategies are proposed to improve the robustness. The authors present extensive and quite convincing numerical evidence.
    0 references
    0 references
    0 references
    0 references
    0 references
    numerical examples
    0 references
    Davidson method
    0 references
    eigenvalue preconditioning
    0 references
    large, sparse, symmetric matrices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references