A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method (Q2654201): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CIRR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JDQR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JDQZ / 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/j.cam.2009.09.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152538969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for the Solution of Algebraic Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue computation in the 20th century / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Variants of the Lanczos Method for the Eigenproblem / 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: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for generalized eigenvalue problems using numerical integration. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4482901 / 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: CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach / 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 09:46, 2 July 2024

scientific article
Language Label Description Also known as
English
A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
scientific article

    Statements

    A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method (English)
    0 references
    0 references
    0 references
    0 references
    15 January 2010
    0 references
    The authors deal with the generalized eigenvalue problem by the Sakurai-Sugiura (SS) projection method [cf. the second author and \textit{H. Sugiura}, J. Comput. Appl. Math. 159, No.\,1, 119--128 (2003; Zbl 1037.65040)], which aims at finding certain eigenvalues in a given domain. Here the SS method is formulated within the frame of the resolvent theory. A block version is also proposed, which allows an improvment in numerical accuracy. The method is also interpreted in the context of filter diagonalization. This method may exhibit a larger computational cost than the usual methods. However the advantage of the block SS method is the fact that it can be easily parallelized. Some significant numerical examples are discussed in details.
    0 references
    0 references
    generalized eigenvalue problem
    0 references
    spectral projection
    0 references
    filter diagonalization
    0 references
    0 references
    0 references
    0 references
    0 references