Methods for computing lower bounds to eigenvalues of self-adjoint operators (Q1907131): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Christopher A. Beattie / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: A. J. Meir / rank
 
Normal rank

Revision as of 20:50, 13 February 2024

scientific article
Language Label Description Also known as
English
Methods for computing lower bounds to eigenvalues of self-adjoint operators
scientific article

    Statements

    Methods for computing lower bounds to eigenvalues of self-adjoint operators (English)
    0 references
    16 March 1997
    0 references
    The authors describe a new approach for computing lower bounds on eigenvalues of selfadjoint operators (in particular differential operators). The derivation of the method depends on intermediate problem formulation but needs no information on eigenvectors of the base problem. The proposed method permits effective use of finite element trial functions; this yields a computational method which involves sparse well-structured matrices. This method may be coupled with a Rayleigh-Ritz method (for computing upper bounds) to obtain bounds on eigenvalues as is illustrated by two computational examples.
    0 references
    lower bounds on eigenvalues
    0 references
    selfadjoint operators
    0 references
    differential operators
    0 references
    finite element
    0 references
    Rayleigh-Ritz method
    0 references
    upper bounds
    0 references
    computational examples
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references