Galerkin eigenvector approximations

From MaRDI portal
Publication:4501033

DOI10.1090/S0025-5718-00-01181-9zbMATH Open0956.65043arXivmath/9805028MaRDI QIDQ4501033FDOQ4501033


Authors: Christopher Beattie Edit this on Wikidata


Publication date: 3 September 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/9805028




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Galerkin eigenvector approximations

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