Galerkin Eigenvector Approximations
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
1998
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917022892294144 |
|---|---|
| author | Beattie, Christopher |
| author_facet | Beattie, Christopher |
| contents | How close are Galerkin eigenvectors to the best approximation available out of the trial subspace ? Under a variety of conditions the Galerkin method gives an approximate eigenvector that approaches asymptotically the projection of the exact eigenvector onto the trial subspace -- and this occurs more rapidly than the underlying rate of convergence of the approximate eigenvectors. Both orthogonal-Galerkin and Petrov-Galerkin methods are considered here with a special emphasis on nonselfadjoint problems. Consequences for the numerical treatment of elliptic PDEs discretized either with finite element methods or with spectral methods are discussed and an application to Krylov subspace methods for large scale matrix eigenvalue problems is presented. New lower bounds to the $sep$ of a pair of operators are developed as well. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_9805028 |
| institution | arXiv |
| publishDate | 1998 |
| record_format | arxiv |
| spellingShingle | Galerkin Eigenvector Approximations Beattie, Christopher Spectral Theory Numerical Analysis 65N25;65N30;65F15 How close are Galerkin eigenvectors to the best approximation available out of the trial subspace ? Under a variety of conditions the Galerkin method gives an approximate eigenvector that approaches asymptotically the projection of the exact eigenvector onto the trial subspace -- and this occurs more rapidly than the underlying rate of convergence of the approximate eigenvectors. Both orthogonal-Galerkin and Petrov-Galerkin methods are considered here with a special emphasis on nonselfadjoint problems. Consequences for the numerical treatment of elliptic PDEs discretized either with finite element methods or with spectral methods are discussed and an application to Krylov subspace methods for large scale matrix eigenvalue problems is presented. New lower bounds to the $sep$ of a pair of operators are developed as well. |
| title | Galerkin Eigenvector Approximations |
| topic | Spectral Theory Numerical Analysis 65N25;65N30;65F15 |
| url | https://arxiv.org/abs/math/9805028 |