✦ LIBER ✦

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

✍ Scribed by Christopher Beattie; Friedrich Goerisch

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 269 KB
Volume: 72
Category: Article
ISSN: 0029-599X
DOI: 10.1007/s002110050164

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Error estimates for the computation of e

Error estimates for the computation of eigenvalues of self-adjoint operators

✍ Peter Linz 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 264 KB

An interlacing theorem for eigenvalues o

An interlacing theorem for eigenvalues of self-adjoint operators

✍ Jerome Dancis; Chandler Davis 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Variational Principles for Eigenvalues o

Variational Principles for Eigenvalues of Self-adjoint Operator Functions

✍ David Eschwé; Matthias Langer 📂 Article 📅 2004 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 365 KB

Variational principles for real eigenval

Variational principles for real eigenvalues of self-adjoint operator pencils

✍ Paul Binding; David Eschwé; Heinz Langer 📂 Article 📅 2000 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 787 KB

Variational procedure yielding upper and

Variational procedure yielding upper and lower bounds to eigenvalues of hermitian operators

✍ A.M.K. Müller 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 212 KB

The computation of eigenvalues and eigen

The computation of eigenvalues and eigenvector of a completely continuous self-adjoint operator

✍ E.K. Blum 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 307 KB

If A is a completely continuous self-adjoint operator on a Hilbert space, its eigen= values are the values of the inner product (Ax, x) at stationary points on the unit sphere. Gradient procedures can be used to determine eigenvectors and eigenvalues provided that certain regularity conditions hold