Reconstruction of the Potential Function and its Derivatives for the Diffusion Operator
Hikmet Koyunbakan and Emrah Yilmaz
Firat University, Department of Mathematics, 23119, Elazıg, Turkey Reprint requests to H. K. and E. Y.; E-mail: hkoyunbakan@gmail.com and emrah231983@gmail.com
Z. Naturforsch.63a,127 – 130 (2008); received October 24, 2007
We solve the inverse nodal problem for the diffusion operator. In particular, we obtain a reconstruc- tion of the potential function and its derivatives using only nodal data. Results are a generalization of Law’s and Yang’s works.
Key words:Diffusion Operator; Inverse Nodal Problem; Reconstruction Formula.
MSC 2000:34L40, 34A55, 34B99
1. Introduction
The inverse nodal problem was initiated by McLaughlin [1], who proved that the Sturm-Liouville problem is uniquely determined by any dense subset of the nodal points. Some numerical schemes were given by Hald and McLaughlin [2] for the reconstruc- tion of the potential. Recently Law, Yang and other authors have reconstructed the potential function and its derivatives of the Sturm-Liouville problem from the nodal points [3 – 7].
In this paper, we are concerned with the inverse nodal problem for the diffusion operator on a finite in- terval. We reconstruct the potential function and all its derivatives by using Law’s and Yang’s method [7].
The diffusion operator is written as
Ly=−y+ [q(x) +2λp(x)]y, (1.1) where the function q(x)∈ L2[0,π], p(x)∈L2[0,π]. Some spectral problems were extensively solved for the diffusion operator in [8 – 11].
Consider the problem
L[y] =λ2y, (1.2)
y(0) =1, y(0) =−h, (1.3) y(π,λ) +Hy(π,λ) =0, (1.4) wherehandHare finite numbers.
Let λn be the n-th eigenvalue and 0<xn1 < ...
<xni <π,i=1,2,...,n−1, the nodal points of then-th
0932–0784 / 08 / 0300–0127 $ 06.00 c2008 Verlag der Zeitschrift f¨ur Naturforschung, T ¨ubingen·http://znaturforsch.com
eigenfunction. Also letIin= [xni,xni+1]be thei-th nodal domain of the n-th eigenfunction and let lin=|lin|= xni+1−xni be the associated nodal length. Let jn(x)be the largest indexjsuch that 0≤x(n)j <x.
∆ denotes the difference operator∆ai=ai+1−ai. Inductively, fork>1,∆kai=∆k−1ai+1−∆k−1ai, and we introduce the difference quotient operatorδ: δai=ai+1−ai
xi+1−xi=∆ai
li andδkai=δk−1ai+1−δk−1ai
li .
2. Main Results
Lemma 1.[12] Assume thatq∈L2[0,π]. Then, as n→∞for the problem (1.2) – (1.4),
xni = i−12
π λn − h
2λn2
+ 1 2λn2
xni 0
(1+cos2λnt)[q(t) +2λnp(t)]dt+O
1 λn4
, (2.1)
lin= π λn
+ 1 2λn2
xni+1 xni
(1+cos 2λnt)[q(t)
+2λnp(t)]dt+O 1
λn4
.
(2.2)
128 H. Koyunbakan and E. Yilmaz·Potential Function and its Derivatives Lemma 2.Suppose that f ∈L2[0,π]. Then for al-
most everyx∈[0,π], with j=jn(x),
nlim→∞
λn
π
xnj+1 xnj
f(t)dt=f(x).
Theorem 1.[12] Suppose thatq∈L2[0,π], then
q(x) =lim
n→∞λn
2λn2lnj
π −2λn−2p(x)
.
Proposition 1. Ifqis a continuous function, then (a) lim
n→∞
√λnli(n)=πandli(n)=1 n+O
1 n2 ; (b)l(n)i+k/li+m(n) =1+O1
n
for any fixedk,m∈N;
(c)qm≤λn− π2
(l(n)i )2 ≤qM, whereqm=min
[0,π]q(x)and qM=max
[0,π]q(x).
Lemma 3. [7] If q ∈CN[0,π], then for k = 1,...,N,∆klj=O(n−(k+3))asn→∞and the order es- timate is independent ofj.
Lemma 4.[7] Let Φj= ∑m
i=1φj,i with eachφj,i=
ki
p=1∏ ϕj,i,p, where each ϕj,i,p ∈U(n)j . Suppose Φj = O(n−v) and q is sufficiently smooth. Then δkΦj = O(n−v)for allk∈N.
Lemma 5. [7] Suppose f ∈CN[0,π] and Φj =
xj+1
xj
f(x)dx. Then δkΦj = O(n−1) for any k = 0,1,...,N.
Theorem 2. [7] Let Φm(xj) =ψ1(xj)ψ2(xj)...
ψm(xj), where ψi(xj) =xj+ki andki∈N∪ {0}. Ifq isCkon[0,π], then
δkΦm(xj) =
O(1), 0≤k≤m−1, m!+O(n−1), k=m,
O(n−2), k≥m+1.
Theorem 3. If q ∈ CN+1[0,π], then q(k)(x) = δkq(xj)−2λnp(x)+O(n−1)fork=0,1,...,N, where j= jn(x). The order estimate is uniformly valid for compact subsets of[0,π].
Remark: Fork=1,...,N,
Vk(xj) =
1 xj ··· xkj 1 xj+1 ··· xkj+1
... ... ... 1 xj+k ··· xkj+k
be a(k+1)×(k+1)Vandermonde matrix. It is well known that
detVk(xj) =
∏
km=1
m−1
∏
i=0m−1
∑
p=ilj+p
.
To prove Theorem 3, we need the following lemma.
Lemma 6.
∏k m=1lmj+k−m
detVk(xj) = 1
∏k m=1m!
+O(1
n). (2.3)
Next, we consider the following(k+1)×(k+1) matrix:
A=
1 xj ··· xk−1j q(xj) 1 xj+1 ··· xk−1j+1 q(xj+1) ... ... ... ... 1 xj+k ··· xk−1j+k q(xj+k)
.
After some operations, we obtain detA=ljlj+1...lj+k−1
·det
1 xj ··· xk−1j q(xj) δ(1) δxj ··· · δq(xj)
... ... ... ...
δ(1) δ(xj+k−1) ··· · δq(xj+k−1)
= (lj)k(lj+1)k−1...lj+k−1
·det
1 xj ··· xk−1j q(xj) δ(1) δxj ··· · δq(xj)
... ... ... ...
δk(1) δk(xj) ··· · δkq(xj)
.
Let B be the matrix at the right-hand side. By Lemma 4 and Theorem 2,
detB= (δxj)(δ2x2j)...(δk−1xk−1j )(δkq(xj)) +O
1 n2
=k−1
∏
m=0(m!)δkq(xj) +O 1
n
.
H. Koyunbakan and E. Yilmaz·Potential Function and its Derivatives 129 Proof of Theorem 3: Fork=1,2,...,N, let
g(x) =det
1 x ··· xk q(x) 1 xj ··· xkj q(xj)
... ... ... ... 1 xj+k ··· xkj+k q(xj+k)
.
By Rolle’s theorem,g(xj) =g(xj+1) =...=g(xj+k) = 0 implies that there is someξ1,j+i∈(xj+i,xj+i+1)such thatg(ξ1,j+i) =0. When we repeat the process, we can find thatξk,j∈(xj,xj+k)such thatg(k)(ξk,j) =0.
In view of the definition ofg,q(k)(ξk,j)detVk(xj) = k! detA. Hence
q(k)(ξk,j) = (k!)(lj)k(lj+1)k−1...lj+k−1 detB detVk(xj). By Lemma 6 q(k)(ξk,j) = δkq(xj) +O(1n), since q ∈ Ck+1,q(k)(x) = q(k)(ξk,j)−2λnp(x) +O(1n) = δkq(xj)−2λnp(x) +O(1n).
Theorem 4. Suppose that q in (1.1) isCN+1 on [0,π](N ≥1), and let j = jn(x) for eachx∈[0,π]. Then, asn→∞,
q(x) =λn
2λn2lnj
π −2λn−2p(x)
+O 1
n
,
and, for allk=1,2,...,N,
q(k)(x)=2λn3/2δklj
π −2λnδkp(xj)−2λnp(k)(x)+O(1).
Proof: The uniform approximation for q is evi- dent. Suppose thatqis continuously differentiable on [0,π]. Apply the intermediate value theorem on Propo- sition 1c, then there is someξ(n)j ∈(x(n)j ,x(n)j+1)such that
λn2l(n)j
π =
1−q(ξj(n)) λn
−1/2
=1+q(ξj(n)) 2λn +O
1 λn2
.
Hence 2λn
λn2lnj π −1
−q(ξ(n)j ) =O 1
n2
,
2λn
λn2lnj π −p(x)
+2λnp(x)−q(ξj(n)) =O 1
n2
.
Applying the mean value theorem, when n is suffi- ciently large, then
q(x) =q(ξ(n)j )−2λnp(x) +O 1
n
.
Then we employ a modified Pr¨ufer substitution due to Ashbaugh-Benguria [13] to solve the boundary condi- tionshandH,x=0 andx=π, respectively:
y=r(x)sin√ λθ(x), y=√
λr(x)cos√ λθ(x),
so that
θ=cos2√
λθ(x)−q(x)sin2√ λθ(x) λ
−2p(x)sin2√ λθ(x).
(2.4)
Integrating (2.4) fromxjtoxj+1,
√π λn
=
xj+1
xj
cos2√
λθ(x)dx
−1 λ
xj+1
xj
q(x)sin2√
λθ(x)dx
−2
xj+1
xj
p(x)sin2√
λθ(x)dx,
(2.5)
it results by Lemma 5 from (2.5) that
√π λn
=−q(xj) 2λn
lj+cj+O 1
nN+4
−p(xj)lj+dj+O 1
nN+4
+O 1
n
, (2.6)
where cj= 1
2λn
∑
N k=1q(k)(xj)
(k+1)!lk+1j =O 1
n4
,
dj=
∑
Nk=1
p(k)(xj)
(k+1)!lk+1j =O 1
n2
.
Summarizing from (2.6), q(xj) =−2π√λn
lj −2λnp(xj)+2λn(cj+dj)+O(1).
130 H. Koyunbakan and E. Yilmaz·Potential Function and its Derivatives Therefore
δq(xj) =−2πλn ∆lj
l2jlj+1−2λnδp(xj) +O(1), and so, fork=1,2,...,N,
δkq(xj) =−2πλnδk−1 ∆lj
l2jlj+1
−2λnδkp(xj) +O(1).
(2.7)
If we use the results of Theorem 3 and Theorem 5, we get
q(k)(x) =δkq(xj)−2λnp(x) +O(n−1),
q(k)(x) =2λn3/2δklj
π −2λnδkp(xj)−2λnp(x)+O(1).
Theorem 5. Assume thatqisCN+1on[0,π]. Then, fork=1,2,...,N,
δkq(xj) =2λn3/2δklj
π −2λnδkp(xj) +O(1).
The estimate is independent ofj.
Proof:In view of derivations and the fact thatδlj=
∆lj
lj =O(nO(n−4−1)) =O(n−3), it suffices to show that δk−1
π2∆lj l2jlj+1
=−δk−1 λn∆lj
lj
+O 1
n3
. (2.8)
But δ
λn∆lj
lj −π2∆lj l2jlj+1
=δ
λn− π2 ljlj+1
∆lj lj
=π2(∆lj+∆lj+1) l2jlj+1lj+2 +
λn− π2 ljlj+1
δlj
=O 1
n3
.
Thus, (2.8) follows by Lemma 4. If we write (2.8) in (2.7), then
δkq(xj) =−2πλn
−δk−1λn∆lj π2lj +O
1 n3
−2λnδkp(xj) +O(1), (2.9)
δkq(xj) =2λn3/2δklj
π −2λnδkp(xj) +O(1).
[1] J. R. McLaughlin, J. Differential Equations 73, 354 (1988).
[2] O. Hald and J. R. McLaughlin, Inverse Problems5, 307 (1989).
[3] C. K. Law, C. Liang Shen, and C. F. Yang, Inverse Problems15, 253 (1999).
[4] Y. H. Cheng and C. K. Law, Inverse Problems22, 891 (2006).
[5] Y. Ting Chen, Y. H. Cheng, C. K. Law, and J. Tsa, Proc.
Am. Math. Soc.130, 2319 (2002).
[6] H. Koyunbakan, Appl. Math. Lett.19, 995, (2006).
[7] C. K. Law and C.-F. Yang, Inverse Problems14, 299 (1998).
[8] E. Bairamov, ¨O. C¸ akar, and O. C¸ elebi, J. Math. Anal.
Appl.216, 303 (1997).
[9] M. G. Gasymov and G. S. Guseinov, SSSR Dokl.37, 19 (1981).
[10] H. Koyunbakan and E. S. Panakhov, J. Math. Anal.
Appl.326, 1024 (2007).
[11] M. Jaulent and C. Jean, Commun. Math. Phys.28, 177 (1972).
[12] H. Koyunbakan, Numerical Functional Analysis and Optimization (2008), in press.
[13] M. S. Ashbaugh and R. D. Benguira, J. Differential Equations103, 205 (1993).