๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Variational Methods for Eigenvalue Approximation

โœ Scribed by Hans F. Weinberger


Publisher
Society for Industrial Mathematics
Year
1987
Tongue
English
Leaves
169
Series
CBMS-NSF Regional Conference Series in Applied Mathematics
Edition
2
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Provides a common setting for various methods of bounding the eigenvalues of a self-adjoint linear operator and emphasizes their relationships. A mapping principle is presented to connect many of the methods. The eigenvalue problems studied are linear, and linearization is shown to give important information about nonlinear problems. Linear vector spaces and their properties are used to uniformly describe the eigenvalue problems presented that involve matrices, ordinary or partial differential operators, and integro-differential operators.


๐Ÿ“œ SIMILAR VOLUMES


Variational Methods for Eigenvalue Appro
โœ Hans F. Weinberger ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

Provides a common setting for various methods of bounding the eigenvalues of a self-adjoint linear operator and emphasizes their relationships. A mapping principle is presented to connect many of the methods. The eigenvalue problems studied are linear, and linearization is shown to give important in

Variational Methods for Eigenvalue Appro
โœ Hans F. Weinberger ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

Provides a common setting for various methods of bounding the eigenvalues of a self-adjoint linear operator and emphasizes their relationships. A mapping principle is presented to connect many of the methods. The eigenvalue problems studied are linear, and linearization is shown to give important in

Numerical Methods for Eigenvalue Problem
โœ Steffen Borm; Christian Mehl ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› De Gruyter ๐ŸŒ English

This textbook presents a number of the most important numerical methods for finding eigenvalues and eigenvectors of matrices. The authors discuss the central ideas underlying the different algorithms and introduce the theoretical concepts required to analyze their behaviour. Several programming ex