Abstract
In this study, a highly efficient spectral-Galerkin method is posed for the fourth-order Steklov equation with boundary eigenvalue. By making use of the spectral theory of compact operators and the error formulas of projective operators, we first obtain the error estimates of approximative eigenvalues and eigenfunctions. Then we build a suitable set of basis functions included in \(H^{1}_{0}(\Omega)\cap H^{2}(\Omega)\) and establish the matrix model for the discrete spectral-Galerkin scheme by adopting the tensor product. Finally, we use some numerical experiments to verify the correctness of the theoretical results.
Similar content being viewed by others
1 Introduction
Increasing attention has recently been paid to numerical approximations for Steklov equations with boundary eigenvalue, arising in fluid mechanics, electromagnetism, etc. (see, e.g., [1–11]). However, most existing work usually treated the second-order Steklov equations with boundary eigenvalue and there are relatively few articles treating fourth-order ones. The fourth-order Steklov equations with boundary eigenvalue also have been used in both mathematics and physics, for example, the main eigenvalues play a very key role in the positivity-preserving properties for the biharmonic-operator \(\triangle ^{2}\) under the border conditions \(w=\triangle w-\chi w_{\nu}=0\) on ∂Θ (see [12]).
In this article, we take into account the following fourth-order Steklov equation with boundary eigenvalue:
where \(\Theta\subset\mathbb{R}^{d}\) (\(d=2, 3\)) is a rectangular domain or a cuboid domain, \(w_{\nu}\) represents the outer normal derivative of w on ∂Θ.
A conforming finite element method was first studied and a bound for the exact eigenvalues was provided in [13] for (1.1)-(1.3). Compared with finite element methods, spectral methods have the characteristics of high accuracy (see [14]). Especially, as far as we know, there is no work at all on spectral methods for the fourth-order Steklov equations with boundary eigenvalue, which is different from the equation and technique in [15]. So, this article aims to build a successful spectral-Galerkin formulation for the fourth-order Steklov equation with boundary eigenvalue. The article includes at least the following three features.
(1) We adopt the generalized Jacobian polynomial to deduce in detail the error formula of the high dimensional projective operator associated with the fourth-order Steklov equation with boundary eigenvalue. Then by employing the spectral method of compact operators, we obtain the satisfactory error formulas of approximative eigenvalues and eigenfunctions.
(2) We formulate a suitable set of basis functions and build the matrix formulation for the discrete variational scheme by means of the tensor product. Especially, we combine a set of basis function in spectral space included in \(H_{0}^{2}(\Theta)\) with two basis functions in spectral space included in \(H_{0}^{1}(\Theta)\) to formulate the basis functions. In this way, the matrix formulation obtained is sparse so that it can easily and efficiently be solved.
(3) We not only present the numerical example in the two-dimensional domain for the equation, but we also provide the three-dimensional one which has not been reported as far as we know. The numerical results explain the effectiveness of our approach.
The remainder of this article is arranged as follows. Section 2 provides some preparations. Section 3 provides the error formulas of the projective-operator and the spectral-Galerkin approximate solutions. In Section 4, we establish the matrix model based on the tensor product for the discrete variational model such that it can easily be solved. In Section 5, we enumerate some numerical examples to confirm the accuracy and efficiency of the theoretical results. Finally, in Section 6, we give main conclusions.
2 Some preparations
Let \(H^{s}(\Theta)\) and \(H^{s}(\partial\Theta)\) be the standard Sobolev space on Θ and ∂Θ with integer order s, respectively. \(H^{0}(\Theta)=L^{2}(\Theta), H^{0}(\partial\Theta )=L^{2}(\partial\Theta), H_{0}^{1}(\Theta)=\{v\in H^{1}(\Theta ):v=0 \mbox{ on } \partial\Theta\}\). The norm in \(H^{s}(\Theta)\) and \(H^{s}(\partial\Theta)\) are represented by \(\Vert \cdot \Vert _{s}\) and \(\Vert \cdot \Vert _{s,\partial\Theta}\), respectively. Throughout this article, C is a generic positive constant independent of the degree N of polynomials that may be unequal at the various places.
Put \(V=H^{2}(\Theta)\cap H^{1}_{0}(\Theta)\). The variational formulation for (1.1)-(1.3) is stated as follows.
Seek \(\chi\in\mathbb{R}\) and nonzero \(w \in V\) that satisfy
where \(a(w,\upsilon)=\int_{\Theta}\triangle w\triangle v \,dx, b(w,\upsilon)=\int_{\partial\Theta}w_{\nu} \upsilon_{\nu}\,ds\).
The source equation corresponding to (2.1) is denoted in the following form.
Seek \(w \in V\) that satisfies
It is obvious that \(a(\cdot,\cdot)\) is a continuous, symmetric, and V-elliptic bilinear function on \(V\times V\) and \(b(f,\cdot)\) is a linear and continuous function on V (see [13]). Thus, we can define the norm in V by \(\Vert \cdot \Vert _{a}=\sqrt{a(\cdot,\cdot)}\) equivalent with the norm \(\Vert \cdot \Vert _{2}\) in \(H^{2}(\Theta)\). Further, by the Lax-Milgram theorem, for equation (2.2) there exists a unique solution. Therefore, for \(g\in V\), the source equation (2.2) may determine an operator \(\Gamma: V\rightarrow V\) that satisfies
From [16] and (2.1), we obtain the following equivalent operator formula:
It follows from Lemma 2.2 in [13] that the operator \(\Gamma: V\rightarrow V\) is self-adjoint and compact. Then, from the spectral method of compact operators (see, e.g., [16, 17]), we deduce that all eigenvalues of Γ are real and finite multiple numbers, which are increasingly arranged as follows:
The eigenfunctions with respect to two disparate eigenvalues of Γ must be orthometric. Therefore, there must be a standard orthometric basis in the eigenspace for the same eigenvalue. Thus, we can formulate a complete orthometric system of V by means of the eigenfunctions of Γ with respect to \(\{\chi_{j}\}\) as follows:
Next, we specify some notations which will appear in the sequel. For simplicity, we consider \(\Theta=I^{d} \) (\(d=2,3\)) where \(I=(-1,1)\). Let \(L_{n}(x)\) represent the Legendre polynomial of degree n and let
Then the spectral-Galerkin discrete formulation of (2.1) is denoted in the following form.
Seek \(\chi_{N} \in\mathbb{R}\) and nonzero \(w_{N}\in X_{N}\) that satisfy
The discrete formulation with respect to (2.2) can be denoted in the following form.
Seek \(w_{N}\in X_{N}\) that satisfies
Similarly, it follows from the Lax-Milgram theorem that for (2.6) there exists one and only one solution. Further, for \(g\in V\) there is the operator \(\Gamma_{N}: V\rightarrow X_{N}\) that satisfies
From [16] and (2.5), we obtain the following equivalent operator formula in operator form:
It is obvious that the rank of the operator \(\Gamma_{N}: V\rightarrow X_{N}\) is finite.
Define a projection-operator \(\Pi_{N}^{1,0}: V\rightarrow X_{N}\) by
Lemma 2.1
If Γ and \(\Gamma_{N} \) be bounded linear operators determined by (2.3) and (2.7), respectively, then we have the following equality:
Proof
For \(\forall w\in V, \upsilon\in X_{N}\), we have
By taking \(\upsilon=\Pi_{N}^{1,0}\Gamma w-\Gamma_{N}w\) in (2.10), we obtain
Because \(a(\cdot,\cdot)\) is V-elliptic, we immediately obtain \(\Gamma_{N}=\Pi_{N}^{1,0}\Gamma\). □
It is obvious that the rank of the operator \(\Gamma _{N}|_{X_{N}}:X_{N}\rightarrow X_{N}\) is finite. Therefore, the eigenvalues of (2.5) may be increasingly arranged as follows:
3 Error analysis
We will devote this section to estimating the errors between \(\chi _{N}\) and χ, and \(w_{N}\) and w.
Lemma 3.1
If \((\chi,w)\) and \((\chi_{N},w_{N})\) are the kth eigenpairs of (2.1) and (2.5), respectively, then we have
Proof
From (2.1), we have
Dividing \(b(w_{N},w_{N})\) in both sides of the above equation and using (2.5), we obtain
□
Put
It is obvious that
Theorem 3.1
We have
Proof
With the norm of the operator, we obtain
□
Let \(M(\chi)\) represent the eigenfunction subspace with respect to the eigenvalue χ of (2.1).
Theorem 3.2
If \((\chi,w)\) and \((\chi_{N},w_{N})\) are the kth eigenpairs of (2.1) and (2.5), respectively, then we have
Proof
From Theorem 3.1, we deduce that \(\Vert \Gamma-\Gamma_{N}\Vert _{a}\rightarrow 0 \) (\(N\rightarrow\infty\)). Thus, from Theorem 7.4 in [16], we obtain
Therefore, for any \(w\in M(\chi)\) that satisfies \(\Vert w\Vert _{a}=1\), we deduce that
Combining (3.7) with the above two inequalities yields the desired conclusion (3.5). By using Lemma 3.1, we obtain
Combining the above inequality with (3.5) yields (3.6). □
Denote by \(J_{n}^{\sigma,\kappa}(x)\) the Jacobi polynomials that are orthometric about the Jacobi weight function \(\omega^{\sigma,\kappa}(x):=(1-x)^{\sigma}(1+x)^{\kappa}\) over \(I:=(-1,1)\), i.e.,
where \(\gamma_{n}^{\sigma,\kappa}=\Vert J_{n}^{\sigma,\kappa} \Vert _{\omega ^{\sigma,\kappa}}^{2}\).
Since for \(\sigma\leq-1\) and/or \(\kappa\leq-1\), the function \(\omega^{\sigma,\kappa}(x)\) is not in \(L^{1}(I)\), it cannot be used as a general weight function. However, the usual Jacobi polynomials only include the case where \(\sigma>-1\) and \(\kappa>-1\). Thus, it is necessary to extend the definition of the usual Jacobi polynomials to the following cases where one or both negative integer(s)
where \(n_{0}\le n\) and
Let \(\hat{J}_{n}^{k,l}(x)\) be the normalized Jacobi polynomials that satisfy
Now, the d-dimensional (\(d=2, 3\)) generalized Jacobi polynomial tensors and weight functions are defined by
where \(\boldsymbol {n}=(n_{1},n_{2},\ldots,n_{d})\in\mathbb{N}^{d}\), \(\boldsymbol {k}=(k_{1},k_{2},\ldots,k_{d})\), \(\boldsymbol {l}=(l_{1},l_{2},\ldots,l_{d})\) with \(n_{j}\geq2,k_{j}=l_{j}=-1\) (\(j=1,2,\ldots, d\)). Then the d-dimensional generalized Jacobi polynomial tensors \(\boldsymbol {J}_{\boldsymbol {n}}^{\boldsymbol {k},\boldsymbol {l}}(\boldsymbol {x})\) constitute a complete orthometric basis in \(L^{2}_{\boldsymbol {w}^{\boldsymbol {k},\boldsymbol {l}}} (I^{d})\). Thus, the d-dimensional polynomial subspace of degree N can be defined by
where \(|\boldsymbol {n}|_{\infty}=\max_{1\leq j\leq d }n_{j}\). Further, the orthometric projection \(\tilde{\Pi}_{N}^{\boldsymbol {k},\boldsymbol {l}}: L^{2}_{\boldsymbol {w}^{\boldsymbol {k},\boldsymbol {l}}} (I^{d})\rightarrow Q_{N}^{\boldsymbol {k},\boldsymbol {l}}\) is defined by
Finally, the d-dimensional Jacobi-weighted Sobolev space, which is an extension of the one-dimensional case, is defined by
whose semi-norm and norm are, respectively, as follows:
where \(\boldsymbol {m}=(m_{1},m_{2},\ldots,m_{d})\in\mathbb{N}^{d}, |\boldsymbol {m}|_{1}=\sum_{j=1}^{d} m_{j},\partial_{\boldsymbol {x}}^{\boldsymbol {m}} \boldsymbol {w}=\partial _{x_{1}}^{m_{1}}\cdots\partial_{x_{d}}^{m_{d}} \boldsymbol {w}\), and \(\boldsymbol {e}_{j}\) is the jth unit vector of \(\mathbb{R}^{d}\).
The following lemma is directly obtained from Theorem 8.1 and Remark 8.14 in [14].
Lemma 3.2
For any \(\boldsymbol {w}\in B_{\boldsymbol {k},\boldsymbol {l}}^{m}(I^{d})\) and \(2\leq m\leq N+1\), we have the following error formula:
where \(c\simeq\sqrt{2}\) for \(N\gg1\).
Before we proceed with the error formulas, it is important to make the following observation: \((\nabla(\tilde{\Pi}_{N}^{\boldsymbol {k},\boldsymbol {l}}w-w),\nabla\upsilon_{N})=-(\tilde {\Pi}_{N}^{\boldsymbol {k},\boldsymbol {l}}w-w,\Delta\upsilon_{N}) =-(\tilde{\Pi}_{N}^{\boldsymbol {k},\boldsymbol {l}}w-w, \boldsymbol {w}^{\boldsymbol {k},\boldsymbol {l}}\Delta\upsilon _{N})_{{\boldsymbol {w}^{\boldsymbol {k},\boldsymbol {l}}}}=0\) (\(\forall\upsilon_{N}\in X_{N}\)). Thus, \(\tilde{\Pi}_{N}^{\boldsymbol {k},\boldsymbol {l}}\) is also an orthometric projection from V into \(X_{N}\).
Theorem 3.3
If \((\chi,w)\) and \((\chi_{N},w_{N})\) are the kth eigenpairs of (2.1) and (2.5), respectively, then, for any \(w\in B_{\boldsymbol {k},\boldsymbol {l}}^{m}(I^{d})\), we have
Proof
From (2.9) and the properties of \(a(w,\upsilon)\), we can derive
Thus, from Lemma 3.2, we obtain
By combining Theorem 3.2 and (3.226) in [14], we immediately obtain the desired conclusion. □
4 Efficient implementation of the spectral-Galerkin solutions
We will devote this section to providing the approach to solve equation (2.5) efficiently. To this end, we first formulate a basis of normal orthometric functions for \(X_{N}\).
Let \(\phi_{k}(x)=\frac{1}{\sqrt{2(2k+3)^{2}(2k+5)}}(L_{k}(x)-\frac {2(2k+5)}{2k+7}L_{k+2}(x)+\frac{2k+3}{2k+7}L_{k+4})\) (\(k=0,1,\ldots ,N-4\)), \(\phi_{N-3}(x)=L_{0}(x)-L_{2}(x)\), and \(\phi _{N-2}(x)=L_{1}(x)-L_{3}(x)\). It is obvious that \(\{\phi_{k}\}_{k=0}^{N-2}\) constitutes a basis for \(X_{N}\).
From Lemma 3.1 in [18] and the orthogonality of Legendre polynomial, we immediately obtain the following lemma.
Lemma 4.1
If \(a_{kj}=(\phi_{j}'',\phi_{k}'')\), \(b_{kj}=(\phi _{j},\phi_{k})\), and \(c_{kj}=(\phi_{j}',\phi_{k}')\), then we have the following results.
(1) When \(k,j=0,1,\ldots,N-4\), \(a_{kj}=\delta_{kj}\) and the only nonzero elements of \(b_{kj}\) and \(c_{kj}\) are
where \(e_{k}=\frac{2}{2k+1}\), \(g_{k}=\frac{2k+3}{2k+7}\), and \(h_{k}=-(1+g_{k})\).
(2) When \(k=N-3,N-2,j=0,1,\ldots,N-4\), \(a_{kj}=0\), and the only nonzero elements of \(b_{kj}\) and \(c_{kj}\) are
(3) When \(k=N-3,N-2,j=N-3,N-2\), the only nonzero elements of \(a_{kj}\), \(b_{kj}\), and \(c_{kj}\) are
From the fact that \(\varphi_{i}'(\pm1)=0\) \((i=0,1,\ldots,N-4)\), \(\varphi_{N-3}'(\pm1)=\mp3\), and \(\varphi_{N-2}'(\pm1)=-5\), we immediately obtain the following lemma.
Lemma 4.2
Let \(p_{ij}=\varphi_{j}'(-1)\varphi_{i}'(-1)\), \(q_{ij}=\varphi_{j}'(1)\varphi_{i}'(1)\), then
Next we will build the matrix formulation for the discrete equation (2.5) by means of the tensor product.
• Case \(d=2\).
It is easy to see that \(X_{N}=\)span\(\{\phi_{i}(x)\phi_{j}(y): i,j=0,1,\ldots,N-2\}\). Thus, we shall seek
Put
By denoting the column vectors of W by \(\bar{\boldsymbol {w}}\), plugging the (4.1) into (2.5), taking \(\upsilon_{N}\) through all the basis functions in \(X_{N}\), and using tensor product, we can simplify the Legendre-Galerkin approximation to the system (2.5) in two-dimensional case as follows:
where \(\mathbb{A}=B\otimes A+A\otimes B+2C\otimes C\), \(\mathbb {B}=(P+Q)\otimes B+B\otimes(P+Q)\), \(A=\{a_{ij}\}_{i,j=0}^{N-2},B=\{b_{ij}\}_{i,j=0}^{N-2}\), \(C=\{c_{ij}\} _{i,j=0}^{N-2},P=\{p_{ij}\}_{i,j=0}^{N-2},Q=\{q_{ij}\}_{i,j=0}^{N-2}\), and ⊗ denotes the notation of tensor product of matrix.
• Case \(d=3\).
It is easy to see that \(X_{N}=\operatorname{span}\{\phi_{i}(x)\phi_{j}(y)\phi_{k}(z): i,j,k=0,1,\ldots,N-2\}\). Hence, we shall look for
Put
By denoting the column vectors of \(\boldsymbol {W}^{k}\) by \(\bar{\boldsymbol {w}}^{k}\) (\(j=1,2, \ldots, N-2\)), plugging the (4.3) into (2.5), taking \(\upsilon_{N}\) through all the basis functions in \(X_{N}\), and using tensor product, we can simplify the Legendre-Galerkin approximation to the discrete equation (2.5) in the three-dimensional case as follows:
where \(\mathbb{A}=B\otimes B\otimes A+B\otimes A\otimes B+A\otimes B\otimes B+2B\otimes C\otimes C+2C\otimes B\otimes C+2C\otimes C\otimes B\), \(\mathbb{B}=(P+Q)\otimes B\otimes B+B\otimes(P+Q)\otimes B+B\otimes B\otimes(P+Q)\).
Based on (4.2) and (4.4) we can efficiently compute the approximative eigenvalues of (1.1)-(1.3) on the rectangle domain and cubic one, respectively.
5 Numerical examples
We now carry out some numerical experiments to compute the eigenvalues of (2.1) on \(\bar{\Theta}=[0,\pi/2]^{2}\) and \(\bar{\Theta}=[0,\pi/2]^{3}\), respectively. By using finite element methods, [13] computed the first four eigenvalues of (2.1) on \(\bar{\Theta}=[0, \pi/2]^{2}\) and gave the bounds of the exact eigenvalues as follows:
However, as far as we know, there has appeared no report of numerical results on three-dimensional regions. In this article, we employ the Legendre polynomials to formulate the basis functions such that the matrices in the discrete variational formulation are sparse, which makes it efficient and easy for us to compute eigenvalues of (2.1) on three-dimensional regions. We operate our programs in MATLAB. The numerical results are listed in Table 1 and Table 2, where DOF denotes the degree of freedom (number of unknowns).
We can see that the eigenvalues in Table 1 have at least ten-digit accuracy with \(N= 25\), i.e., \(\mathrm{DOF}=576\). As a comparison, we observe that the eigenvalues obtained by using finite element in [13] only have four-digit accuracy for \(h={\sqrt{2}\pi }/({80})\), i.e., \(\mathrm{DOF}=6{,}244\).
It also can be seen from Table 2 that the eigenvalues have at least eight-digit accuracy with \(N=20\). By computing, for the problem (2.1) on \(\bar {\Theta}=[0,\pi/2]^{3}\), we also see that \(\chi_{1}\) is a simple eigenvalue, \(\chi_{2}\) and \(\chi_{5}\) are all eigenvalues with multiplicity 3.
6 Conclusions
In this study, we have establish an efficient spectral-Galerkin formulation for the fourth-order Steklov equation with boundary eigenvalue. By analyzing the error formulas of projective operators and adopting the compact-operator spectral method, we have derived the error formulas of approximative eigenvalues and eigenfunctions. Then we have formulated a suitable set of basis functions included in \(H^{1}_{0}(\Theta)\cap H^{2}(\Theta)\) and built the matrix formulation for the discrete variational scheme by means of the tensor product. In this way, we can efficiently solve the discrete system and obtain highly accurate approximative eigenvalues. We have provided the numerical examples in rectangle domain and cubic one and the satisfactory results obtained show that our method is very effective. In this study, we confined our focus to the cases in the rectangle domain and the cubic one. In fact, the technique used in this article could be expanded to more general domains by adopting a spectral-element technique.
References
Bramble, JH, Osborn, JE: Approximation of a Steklov eigenvalue problem of non-self adjoint second order elliptic operators. In: Aziz, AK (ed.) Mathematical Foundations of the Finite Element Method with Application to PDE. Academic Press, San Diego (1972)
Andreev, AB, Todorov, TD: Isoparametric finite-element approximation of a Steklov eigenvalue problem. IMA J. Numer. Anal. 24, 309-322 (2007)
Armentano, MG, Padra, C: A posteriori error estimates for the Steklov eigenvalue problem. Appl. Numer. Math. 58, 593-601 (2008)
Yang, YD, Li, Q, Li, SR: Nonconforming finite element approximation of the Steklov eigenvalue problem. Appl. Numer. Math. 59, 2388-2401 (2009)
Lin, Q, Xie, HH: Nonconforming finite element approximations of the Steklov eigenvalue problem and its lower bound approximations. Appl. Math. 58, 129-151 (2013)
Li, Q, Yang, YD: A two-grid discretization scheme for the Steklov eigenvalue problem. J. Appl. Math. Comput. 36, 129-139 (2011)
Bi, H, Yang, YD: A two-grid method of the non-conforming Crouzeix-Raviart element for the Steklov eigenvalue problem. Appl. Math. Comput. 217, 9669-9678 (2011)
Li, MX, Lin, Q, Zhang, SH: Extrapolation and superconvergence of the Steklov eigenvalue problems. Adv. Comput. Math. 33, 25-44 (2010)
Tang, WJ, Guan, Z, Han, HD: Boundary element approximation of Steklov eigenvalue problem for Helmholtz equation. J. Comput. Math. 16, 165-178 (1998)
Cao, LQ, Zhang, L, Allegretto, W, Lin, YP: Multiscale asymptotic method for Steklov eigenvalue equations in composite media. SIAM J. Numer. Anal. 51(1), 273-296 (2013)
Zhang, XQ, Yang, YD, Bi, H: Spectral method with the tensor-product nodal basis for the Steklov eigenvalue problems. Math. Probl. Eng. 2013, 650530 (2013)
Gazzola, F, Sweers, G: On positivity for the biharmonic operator under Steklov boundary conditions. Arch. Ration. Mech. Anal. 188, 399-427 (2008)
Bi, H, Ren, SX, Yang, YD: Conforming finite element approximations for a fourth-order Steklov eigenvalue problem. Math. Probl. Eng. 2011, 873152 (2011). doi:10.1155/2011/873152
Shen, J, Tang, T, Wang, L: Spectral Methods Algorithms, Analysis and Applications. Springer, Heidelberg (2011)
Luo, ZD: A high accuracy numerical method based on spectral theory of compact operator for biharmonic eigenvalue equations. J. Inequal. Appl. 2016, 77 (2016)
Babuska, I, Osborn, J: Eigenvalue problems. In: Ciarlet, PG, Lions, JL (eds.) Handbook of Numerical Analysis, Finite Element Methods (Part 1), vol. 2, pp. 640-787. Elsevier, Amsterdam (1991)
Osborn, JE: Spectral approximation for compact operators. Math. Comput. 29(131), 712-725 (1975)
Shen, J: Efficient spectral-Galerkin method I. Direct solvers for second- and fourth-order equations using Legendre polynomials. SIAM J. Sci. Comput. 15(6), 1489-1508 (1994)
Acknowledgements
This research was supported by National Science Foundation of China grant 11271127, 11671106, and 11661022.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare to have no competing interests.
Authors’ contributions
The authors wrote, read, and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
An, J., Bi, H. & Luo, Z. A highly efficient spectral-Galerkin method based on tensor product for fourth-order Steklov equation with boundary eigenvalue. J Inequal Appl 2016, 211 (2016). https://doi.org/10.1186/s13660-016-1158-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-016-1158-1