Convergence rates and explicit error bounds of Hill's method for spectra of self-adjoint differential operators

Stability and convergence of numerical methods for ordinary differential equations (65L20) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical approximation of eigenvalues and of other parts of the spectrum of ordinary differential operators (34L16) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)

Abstract: We present the convergence rates and the explicit error bounds of Hill's method, which is a numerical method for computing the spectra of ordinary differential operators with periodic coefficients. This method approximates the operator by a finite dimensional matrix. On the assumption that the operator is selfadjoint, it is shown that, under some conditions, we can obtain the convergence rates of eigenvalues with respect to the dimension and the explicit error bounds. Numerical examples demonstrate that we can verify these conditions using Gershgorin's theorem for some real problems. Main theorems are proved using the Dunford integrals which project an eigenvector to the corresponding eigenspace.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Convergence rates and explicit error bounds of Hill's method for spectra of self-adjoint differential operators

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