A novel numerical method based on a high order polynomial approximation of the fourth order Steklov equation and its eigenvalue problems

Abstract

<p style='text-indent:20px;'>Based on high order polynomial approximation and dimension reduction technique, we propose a novel numerical method for the fourth order Steklov problems in the circular domain. We first decompose the primal problem into a set of 1D problems via polar coordinate transformation and Fourier basis functions expansion. Then, by introducing a non-uniformly weighed Sobolev space, the variational form and corresponding discrete scheme are derived. Employing the Lax-Milgram lemma and approximation properties of the projection operators, we further prove existence and uniqueness of weak solutions and approximation solutions for each one-dimensional problems, and the error estimation between them, respectively. We also carry out ample numerical experiments which illustrate that the numerical algorithm is efficient and highly accurate.</p>