Galerkin eigenvector approximations

DOI10.1090/S0025-5718-00-01181-9MaRDI QIDQ4501033zbMATH OpenFDO

Authors Christopher Beattie

Publication date 3 September 2000

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

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

zbMATH Keywords

convergenceHilbert spaceeigenvalueeigenvectorfinite element methodsspectral methodsGalerkin approximationlinear operatorPetrov-Galerkin methodseigenvector asymptoticssep

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Eigenvalue problems for linear operators (47A75) Numerical solutions to equations with linear operators (65J10)

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.

Recommendations

• Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
• scientific article; zbMATH DE number 4088850
• Finite element approximation of eigenvalue problems
• The spectral-Galerkin approximation of nonlinear eigenvalue problems
• A numerical comparison of alternative Galerkin methods for eigenvalue estimation
• Generalized eigenvalue methods for Gaussian quadrature rules
• On the Galerkin method with vector basis functions
• Discontinuous Galerkin approximation of the Laplace eigenproblem
• Approximation of differential eigenvalue problems
• scientific article; zbMATH DE number 1104534

Cites work

• scientific article; zbMATH DE number 4011016 (Why is no real title available?)
• scientific article; zbMATH DE number 3533576 (Why is no real title available?)
• Approximation of the Spectrum of Closed Operators: The Determination of Normal Modes of a Rotating Basin
• Beiträge zur Störungstheorie der Spektralzerlegung
• Estimation of iterated matrices, with application to the von Neumann condition
• Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
• New estimates for Ritz vectors
• On spectral approximation. Part 1. The problem of convergence
• On the regularity of the solution of the Poisson problem on a domain with boundary locally similar to the boundary of a convex open set
• Semigroups of linear operators and applications to partial differential equations

Cited in

(18)

• On estimators for eigenvalue/eigenvector approximations
• The many proofs of an identity on the norm of oblique projections
• Eigenvalue approximation
• Cluster robust error estimates for the Rayleigh-Ritz approximation. I: Estimates for invariant subspaces
• Immersed Finite Element Method for Eigenvalue Problems in Elasticity
• On the Galerkin method with vector basis functions
• scientific article; zbMATH DE number 3868513 (Why is no real title available?)
• Interpolating self consistent field for eigenvector nonlinearities
• On the eigenvalues of the ADER-WENO Galerkin predictor
• Finite element computation of KPP front speeds in cellular and cat's eye flows
• On the field of values of oblique projections
• Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
• A numerical comparison of alternative Galerkin methods for eigenvalue estimation
• Robust error estimates for approximations of non-self-adjoint eigenvalue problems
• Estimates for the Errors in Eigenvalue and Eigenvector Approximation by Galerkin Methods, with Particular Attention to the Case of Multiple Eigenvalues
• Greedy algorithms for high-dimensional eigenvalue problems
• A subspace iteration algorithm for Fredholm valued functions
• Accuracy of singular vectors obtained by projection-based SVD methods

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)