Collocation Approximation to Eigenvalues of an Ordinary Differential Equation: The Principle of the Thing
- 1 July 1980
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 35 (151) , 679-694
- https://doi.org/10.2307/2006187
Abstract
It is shown that simple eigenvalues of an mth order ordinary differential equation are approximated within $\mathcal {O}(|\Delta {|^{2k}})$ by collocation at Gauss points with piecewise polynomial functions of degree $< m + k$ on a mesh $\Delta$. The same rate is achieved by certain averages in case the eigenvalue is not simple. The argument relies on an extension and simplification of Osborn’s recent results concerning the approximation of eigenvalues of compact linear maps.
Keywords
This publication has 10 references indexed in Scilit:
- Collocation methods for parabolic partial differential equations in one space dimensionNumerische Mathematik, 1976
- Spectral Approximation for Compact OperatorsMathematics of Computation, 1975
- Convergence Rates for Approximate Eigenvalues of Compact Integral OperatorsSIAM Journal on Numerical Analysis, 1975
- A collocation method for eigenvalue problemsBIT Numerical Mathematics, 1974
- Collocation Methods for Parabolic Equations in a Single Space VariableLecture Notes in Mathematics, 1974
- High order projection methods of moment- and collocation-type for nonlinear boundary value problemsComputing, 1973
- Collocation at Gaussian PointsSIAM Journal on Numerical Analysis, 1973
- Rate of Convergence Estimates for Nonselfadjoint Eigenvalue ApproximationsMathematics of Computation, 1973
- Difference Approximations for Boundary and Eigenvalue Problems for Ordinary Differential EquationsMathematics of Computation, 1972
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966