Adaptive Morley element algorithms for the biharmonic eigenvalue problem

This paper is devoted to the adaptive Morley element algorithms for a biharmonic eigenvalue problem in Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathbb{R}^{n}$\end{document} (n≥2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$n\geq2$\end{document}). We combine the Morley element method with the shifted-inverse iteration including Rayleigh quotient iteration and the inverse iteration with fixed shift to propose multigrid discretization schemes in an adaptive fashion. We establish an inequality on Rayleigh quotient and use it to prove the efficiency of the adaptive algorithms. Numerical experiments show that these algorithms are efficient and can get the optimal convergence rate.