Methods for computing lower bounds to eigenvalues of self-adjoint operators

DOI10.1007/S002110050164MaRDI QIDQ1907131zbMATH OpenOpenAlexFDO

Authors Friedrich Goerisch, Christopher Beattie

Publication date 16 March 1997

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002110050164

computational examples differential operators finite element lower bounds on eigenvalues Rayleigh-Ritz method selfadjoint operators upper bounds

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Eigenvalue problems for linear operators (47A75) Linear symmetric and selfadjoint operators (unbounded) (47B25) Numerical solutions to equations with linear operators (65J10)

Review text

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.

Recommendations

Cited in

(25)

This page was built for publication: Methods for computing lower bounds to eigenvalues of self-adjoint operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907131)