![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
An inverse spectral problem is studied for differential pencils on graphs with a rooted cycle and with standard matching conditions in internal vertices. A uniqueness theorem is proved, and a constructive procedure for the solution is provided.
1. Introduction
This paper is devoted to inverse spectral problems for ordinary differential equations on spatial networks (geometrical graphs). Differential operators on graphs often appear in mathematics, mechanics, physics, geophysics, physical chemistry, electronics, nano-technology and other branches of natural sciences and engineering (see [Citation1–Citation8] and the bibliography therein). Most of the works are devoted to the so-called direct problems of studying properties of the spectrum and root functions. In this direction we mark the monograph,[Citation8] where extensive references can be found related to direct problems of spectral analysis on graphs. inverse problems consist in recovering coefficients of operators from their spectral characteristics. Such problems have many applications and therefore attract attention of scientists. On the other hand, inverse spectral problems are very difficult for investigation because of their nonlinearity. The main results and methods on inverse spectral problems for differential operators on an interval (finite or infinite) were obtained in the second half of the XX century; these results are presented fairly completely in the monographs,[Citation9–Citation12] where an extensive bibliography can be found.
Active research on the inverse spectral problems for differential operators on graphs started in the XXI century. The first important and rather wide class of problems, for which the theory of solutions of inverse problems has been constructed, were the Sturm–Liouville operators on the so-called trees, i.e. graphs without cycles.[Citation13–Citation15] Two different methods were applied in the investigation of inverse problems on trees in [Citation13–Citation15]: the transformation operator method and the method of spectral mappings. The first method [Citation13] connects with the process of wave propagation, and the second one [Citation14] uses ideas of contour integration and the apparatus of the theory of analytic functions. In particular, the method of spectral mappings allowed one not only to prove a uniqueness theorem with most limited data, but also to obtain an algorithm for the solution of this class of inverse problems. Moreover, this method turned out to be effective also for essentially more difficult problems on graphs with cycles. Inverse spectral problems for Sturm–Liouville operators on arbitrary compact graphs with cycles have been solved in [Citation16–Citation20] and other works. Some other aspects of the inverse problem theory for Sturm–Liouville operators on graphs were discussed in [Citation21–Citation29] and other works.
Differential pencils (when differential equations depend nonlinearly on the spectral parameter) produce serious qualitative changes in the spectral theory. In particular, there are only a few works on inverse spectral problems for differential pencils on graphs (see [Citation30,Citation31] and the references therein). In this paper we investigate the inverse spectral problem for non-self-adjoint second-order differential pencils on compact graphs with a rooted cycle under standard matching conditions in interior vertices and boundary conditions in boundary vertices. We pay attention to the most important nonlinear inverse problem of recovering coefficients of differential equations (potentials) provided that the structure of the graph is known a priori. For this inverse problem we prove the uniqueness theorem and provide a procedure for constructing its solution. For studying the inverse problem we develop the ideas of the method of spectral mappings.[Citation11] The obtained results are natural generalizations of the results on inverse problems for Sturm–Liouville operators on an interval and on graphs.
Consider a compact graph G in with the set of vertices
and the set of edges
, where
is a cycle,
. The graph has the form
where T is the tree (i.e. graph without cycles) with the root
, the set of vertices
and the set of edges
,
, and
is a boundary vertex for T, but
is an internal vertex for the graph G.
For two points we will write
if a lies on a unique simple path connecting the root
with b. We will write
if
and
The relation
defines a partial ordering on T. If
we denote
In particular, if
is an edge, we call v its initial point, w its end point and say that e emanates from v and terminates at w. For each internal vertex v we denote by
the set of edges emanated from v. For each
we denote by |v| the number of edges between
and v. For any
the number |v| is a non-negative integer, which is called the order of v. For
its order is defined as the order of its end point. The number
is called the height of the tree T. Let
,
be the set of vertices of order
and let
,
be the set of edges of order
For definiteness we enumerate the vertices as follows:
are boundary vertices of G,
, and
are enumerated in order of increasing
. We enumerate the edges similarly, namely:
,
In particular,
is the set of boundary edges,
The edge
, emanated from the root
, is called the rooted edge of T. Clearly,
iff
. As an example see Figure where
Let be the length of the edge
,
Each edge
is viewed as a segment
and is parameterized by the parameter
It is convenient for us to choose the following orientation: for
the end vertex
corresponds to
, and the initial vertex
corresponds to
; for the cycle
both endpoints
and
correspond to
.
A function Y on G may be represented as , where the function
is defined on the edge
. Let
and
be complex-valued functions on G; they are called the potentials. Assume that
Consider the following differential equation on G:
(1.1)
(1.1)
where ,
is the spectral parameter, the functions
are absolutely continuous on
and satisfy the following matching conditions in the internal vertices
and
,
: For
,
(1.2)
(1.2)
and for ,
(1.3)
(1.3)
Matching conditions (Equation1.2(1.2)
(1.2) ) and (Equation1.3
(1.3)
(1.3) ) are called the standard conditions. In electrical circuits, they express Kirchhoff’s law; in elastic string network, they express the balance of tension, and so on. Let us consider the boundary value problem
for Equation (Equation1.1
(1.1)
(1.1) ) with the matching conditions (Equation1.2
(1.2)
(1.2) ) and (Equation1.3
(1.3)
(1.3) ) and with the Dirichlet boundary conditions at the boundary vertices
:
Moreover, we also consider the boundary value problems ,
for Equation (Equation1.1
(1.1)
(1.1) ) with the matching conditions (Equation1.2
(1.2)
(1.2) ) and (Equation1.3
(1.3)
(1.3) ) and with the boundary conditions
We denote by the eigenvalues (counting with multiplicities) of
. In contrast to the case of trees (see [Citation14,Citation30]), here the specification of the spectra
,
does not uniquely determines the potentials, and we need an additional information. Let
be the solutions of equation (1.1) on the edge
with the initial conditions
For each fixed
the functions
are entire in
of exponential type. Moreover,
where
is the Wronskian of y and z. Denote
Let be zeros (counting with multiplicities) of the entire function
Then
are the eigenvalues of the boundary value problem
for Equation (Equation1.1
(1.1)
(1.1) ) with
under the boundary conditions
Let
be the
-sequence for
(see [Citation32]). For example, if all zeros of
are simple, then
We note that for the classical self-adjoint periodic Sturm–Liouville inverse problem, the -sequence was introduced and studied in [Citation33,Citation34] and other works. The inverse problem is formulated as follows.
Inverse Problem 1.1:
Given and
construct q and p on G.
Let us formulate the uniqueness theorem for the solution of inverse problem 1.1. For this purpose together with (p, q) we consider potentials Everywhere below if a symbol
denotes an object related to (p, q) then
will denote the analogous object related to
Theorem 1.2:
If and
then
and
on G. Thus, the specification of
and
uniquely determines the potentials q and p on G.
This theorem will be proved in Section 3. Moreover, we will give there a constructive procedure for the solution of inverse problem 1.1. In Section 2 we introduce the main notions and prove some auxiliary propositions.
2. Characteristic functions
Fix Denote
. Then
where is the tree with the root
and with the rooted edge
. Clearly,
, where
.
Noatations:
If D is a graph, then we will denote by the boundary value problem for Equation (Equation1.1
(1.1)
(1.1) ) on D with the standard matching conditions in internal vertices and with the Dirichlet boundary conditions in boundary vertices. Let
If
is a boundary vertex of D, then
will denote the boundary value problem for Equation (Equation1.1
(1.1)
(1.1) ) on D with the standard matching conditions in internal vertices, with the Neumann boundary condition
at
and with the Dirichlet boundary conditions in all other boundary vertices. For example,
is the boundary value problem on
with the boundary conditions
, and
is the boundary value problem on
with the boundary conditions
. We also consider the BVP
for Equation (Equation1.1
(1.1)
(1.1) ) on T with the boundary conditions
Fix Let
, be solutions of Equation (Equation1.1
(1.1)
(1.1) ) satisfying the matching conditions (Equation1.2
(1.2)
(1.2) ) and (Equation1.3
(1.3)
(1.3) ) and the boundary conditions
(2.1)
(2.1)
where is the Kronecker symbol. Denote
The function
is called the Weyl function with respect to the boundary vertex
.
Denote ,
. Then
(2.2)
(2.2)
In particular, ,
,
for
. Hence
and consequently, Substituting (Equation2.2
(2.2)
(2.2) ) into (Equation1.2
(1.2)
(1.2) ), (Equation1.3
(1.3)
(1.3) ) and (Equation2.1
(2.1)
(2.1) ) we obtain a linear algebraic system
with respect to
The determinant
of this system does not depend on k and has the form
(2.3)
(2.3)
where(2.4)
(2.4)
and
are the characteristic functions of the boundary value problems
and
respectively, which were defined and studied in [Citation35]. For convenience of the readers in the Appendix 1 at the end of the paper we provide formulae for constructing the functions
and
from [Citation35]. The function
is entire in
of exponential type, and its zeros (counting with multiplicities) coincide with the eigenvalues of the boundary value problem
This fact and other similar facts can be shown by the well-known arguments (see, e.g. [Citation11,Citation14,Citation35,Citation37]). Solving the algebraic system
we get by Cramer’s rule:
,
where the determinant
is obtained from
by the replacement of the column which corresponds to
with the column of free terms. In particular,
(2.5)
(2.5)
where is obtained from
by the replacement of
with
Similarly to the function
one can see that the zeros of
(counting with multiplicities) coincide with the eigenvalues of the boundary value problem
The function
is called the characteristic function for the boundary value problem
Fix Let
and
be the characteristic functions for
and
, respectively. Using (Equation2.3
(2.3)
(2.3) ) and (Equation2.4
(2.4)
(2.4) ) and formulae for
from [Citation35] (see also the Appendix 1) one can get
(2.6)
(2.6)
where and
are the characteristic functions for
and
, respectively, which were defined and studied in [Citation35] (see also the Appendix 1). Similarly, for
,
(2.7)
(2.7)
where and
are constructed from
and
by the replacement of
with
Example 2.1:
Let Then
Example 2.2:
Let Then
hence
In particular, for
and (Equation2.6(2.6)
(2.6) ) takes the form
where
Denote
Without loss of generality we assume that It is known (see [Citation36]) that for each fixed
on the edge
there exist fundamental systems of solutions of Equation (Equation1.1
(1.1)
(1.1) )
,
with the properties:
(1) | the functions | ||||
(2) | uniformly for |
Fix One has
(2.9)
(2.9)
Substituting (Equation2.9(2.9)
(2.9) ) into (Equation1.2
(1.2)
(1.2) ), (Equation1.3
(1.3)
(1.3) ) and (Equation2.1
(2.1)
(2.1) ) we obtain a linear algebraic system
with respect to
The determinant
of
does not depend on k, and has the form
(2.10)
(2.10)
Solving the algebraic system and using (Equation2.8
(2.8)
(2.8) )–(Equation2.10
(2.10)
(2.10) ) we get for each fixed
:
(2.11)
(2.11)
In particular,(2.12)
(2.12)
Moreover, for uniformly in
(2.13)
(2.13)
Similarly, one gets for :
(2.14)
(2.14)
(2.15)
(2.15)
3. Solution of inverse problem 1.1
In this section, we provide a constructive procedure for the solution of inverse problem 1.1 and prove its uniqueness. First we consider the following auxiliary inverse problem for G on the edge ,
which is called IP(k).
IP(k). Given construct
In IP(k) we construct the potentials only on the edge , but the Weyl function
brings a global information from the whole graph, i.e. IP(k) is not a local inverse problem related only to the edge
.
Lemma 3.1:
Fix The specification of two spectra
and
uniquely determines the Weyl function
Proof:
The characteristic functions are entire in
of exponential type. By Hadamard’s factorization theorem,
(3.1)
(3.1)
where(3.2)
(3.2)
and
is the multiplicity of the zero eigenvalue. In view of (Equation2.5
(2.5)
(2.5) ) and (Equation3.1
(3.1)
(3.1) ), we deduce
(3.3)
(3.3)
where ,
. Using (Equation2.12
(2.12)
(2.12) ) we calculate for
:
and consequently,(3.4)
(3.4)
(3.5)
(3.5)
Thus, we have uniquely constructed by (Equation3.2
(3.2)
(3.2) )–(Equation3.5
(3.5)
(3.5) ).
Let us prove the uniqueness theorem for the solution of IP(k).
Theorem 3.2:
If then
and
a.e. on
Thus, the specification of the Weyl function
uniquely determines the potentials
and
on the edge
.
Proof:
Let us introduce the functions(3.6)
(3.6)
Since it follows that
(3.7)
(3.7)
Denote where
Taking (Equation2.11
(2.11)
(2.11) ), (Equation2.13
(2.13)
(2.13) ) and (Equation3.6
(3.6)
(3.6) ) into account we obtain
(3.8)
(3.8)
Using (Equation3.6(3.6)
(3.6) ) and the relation
we calculate
Since it follows that for each fixed
, the functions
are entire in
of exponential type. Together with (Equation3.8
(3.8)
(3.8) ) this yields
Substituting these relations into (Equation3.6
(3.6)
(3.6) ) and (Equation3.7
(3.7)
(3.7) ) we get
(3.9)
(3.9)
for all and
Using (2.11) and (2.13) we obtain for
,
From this and from (3.9) we infer Since
it follows that
i.e.
and consequently,
on
Using the method of spectral mappings [Citation11] for the Sturm–Liouville operator on the edge one can get a constructive procedure for the solution of the inverse problem IP(k).
Now we consider the following auxiliary inverse problem IP(0) on the cycle .
IP(0). Given and
, construct
This inverse problem is the classical periodic inverse problem on the interval it was solved in [Citation33,Citation34], where the uniqueness theorem was proved and an algorithm for constructing the solution of IP(0) was provided.
Fix Let the spectrum
of the boundary value problem
be given. Then we can construct the characteristic function
as follows.
Using (Equation3.1(3.1)
(3.1) ) and (Equation3.2
(3.2)
(3.2) ) and the asymptotical formulae (Equation2.14
(2.14)
(2.14) ) and (Equation2.15
(2.15)
(2.15) ), we obtain for
:
and consequently,(3.10)
(3.10)
Furthermore,
This yields(3.11)
(3.11)
where
Now we are ready to provide a constructive procedure for the solution of Inverse Problem 1.1 and prove its uniqueness. Let and
be given. The procedure for the solution of inverse problem 1.1 consists in the realization of the so-called
- procedures successively for
where
is the height of T. Let us describe
- procedures.
-procedure
(1) | For each fixed | ||||
(2) | For each fixed | ||||
(3) | For each fixed | ||||
(4) | For each fixed | ||||
(5) | For each fixed | ||||
(6) | For each fixed |
(1) | For each edge | ||||
(2) | For each | ||||
(3) | For each fixed | ||||
(4) | For each fixed |
(1) | We solve the inverse problem IP(p+1) on | ||||
(2) | We calculate | ||||
(3) | Solving the linear algebraic system |
Using and
we construct
on the cycle
by solving the inverse problem IP(0).
Thus, executing successively -procedures we obtain the solution of inverse problem 1.1 and prove its uniqueness.
Additional information
Funding
Notes
No potential conflict of interest was reported by the author.
References
- Montrol E. Quantum theory on a network. J. Math. Phys. 1970;11:635–648.
- Nicaise S. Some results on spectral theory over networks, applied to nerve impulse transmission. Vol. 1771, Lecture notes in mathematics. Berlin: Springer; 1985. p. 532–541.
- Langese JE, Leugering G, Schmidt JPG. Modelling, analysis and control of dynamic elastic multi-link structures. Boston: Birkhäuser; 1994.
- Kottos T, Smilansky U. Quantum chaos on graphs. Phys. Rev. Lett. 1997;79:4794–4797.
- Tautz J, Lindauer M, Sandeman DC. Transmission of vibration across honeycombs and its detection by bee leg receptors. J. Exp. Biol. 1999;199:2585–2594.
- Dekoninck B, Nicaise S. The eigenvalue problem for networks of beams. Linear Algebra Appl. 2000;314:165–189.
- Sobolev A, Solomyak M. Schrödinger operator on homogeneous metric trees: spectrum in gaps. Rev. Math. Phys. 2002;14:421–467.
- Pokorny YuV, Penkin OM, Pryadiev VL, et al. Differential equations on geometrical graphs. Fizmatlit: Moscow; 2004.
- Marchenko VA. Sturm--Liouville operators and their applications. Kiev: Naukova Dumka; 1977. English transl., Birkhäuser, 1986.
- Levitan BM. Inverse Sturm--Liouville problems. Moscow: Nauka; 1984. English transl., VNU Science Press, Utrecht, 1987.
- Yurko VA. Method of spectral mappings in the inverse problem theory. Inverse and ill-posed problems series. Utrecht: VSP; 2002.
- Yurko VA. Introduction to the theory of inverse spectral problems. Moscow: Fizmatlit; 2007. 384pp. Russian.
- Belishev MI. Boundary spectral inverse problem on a class of graphs (trees) by the BC method. Inverse Prob. 2004;20:647–672.
- Yurko VA. Inverse spectral problems for Sturm--Liouville operators on graphs. Inverse Prob. 2005;21:1075–1086.
- Brown BM, Weikard R. A Borg--Levinson theorem for trees. Proc. R. Soc. London Ser. A Math. Phys. Eng. Sci. 2005;461:3231–3243.
- Yurko VA. Inverse problems for Sturm--Liouville operators on bush-type graphs. Inverse Prob. 2009;25:105008. 14pp.
- Yurko VA. An inverse problem for Sturm--Liouville operators on A-graphs. Appl. Math. Lett. 2010;23:875–879.
- Yurko VA. Reconstruction of Sturm--Liouville differential operators on A-graphs. Differ. Uravneniya. 2011;47:50–59. Russian. English transl. in Differ. Equ. 2011;47:50--59.
- Yurko VA. An inverse problem for Sturm--Liouville operators on arbitrary compact spatial networks. Doklady Akad. Nauk. 2010;432:318–321. Russian. English transl. in Dokl. Math. 2010;81:410--413.
- Yurko VA. Inverse spectral problems for differential operators on arbitrary compact graphs. J. Inverse Ill-Posed Prob. 2010;18:245–261.
- Freiling G, Yurko VA. Inverse problems for differential operators on graphs with general matching conditions. Appl. Anal. 2007;86:653–667.
- Freiling G, Ignatyev M. Spectral analysis for the Sturm–Liouville operator on sun-type graphs. Inverse Prob. 2011;27:095003. 17pp.
- Carlson R. Inverse eigenvalue problems on directed graphs. Trans. Am. Math. Soc. 1999;351:4069–4088.
- Freiling G, Ignatiev M, Yurko VA. An inverse spectral problem for Sturm–Liouville operators with singular potentials on star-type graphs. Analysis on graphs and its applications. Vol. 77, Proceedings of Symposia in Pure Mathematics. Providence (RI): American Mathematical Society; 2008. p. 397–408.
- Buterin S, Freiling G. Inverse spectral-scattering problem for the Sturm-Liouville operator on a noncompact star-type graph. Tamkang J. Math. 2013;44:327–349.
- Bondarenko N. Inverse problems for the differential operator on the graph with a cycle with different orders on different edges. Tamkang J. Math. 2015;46:229–243.
- Yang C-Fu; Yang X-P. Uniqueness theorems from partial information of the potential on a graph. J. Inverse Ill-Posed Prob. 2011;19:631–639.
- Yurko VA. Inverse nodal problems for differential operators on graphs. J. Inverse Ill-Posed Prob. 2008;16:715–722.
- Freiling G, Yurko VA. Inverse nodal problems for differential operators on graphs with a cycle. Tamkang J. Math. 2010;41:15–24.
- Yurko VA. Recovering differential pencils on compact graphs. J. Differ. Equ. 2008;244:431–443.
- Yurko VA. An inverse problem for differential pencils on graphs with a cycle. J. Inverse Ill-Posed Prob. 2014;22:625–641.
- Yurko VA. Inverse problems for non-selfadjoint quasi-periodic differential pencils. Anal. Math. Phys. 2012;2:215–230.
- Stankevich IV. An inverse problem of spectral analysis for Hill’s equations. Dokl. Akad. Nauk SSSR. 1970;192:34–37. Russian.
- Marchenko VA, Ostrovskii IV. A characterization of the spectrum of the Hill operator. Mat. Sbornik. 1975;97:540–606. Russian. English transl. in Math. USSR Sbornik 1975;26:493--554.
- Yurko VA. Inverse spectral problems for differential operators on a graph with a rooted cycle. Tamkang J. Math. 2009;40:271–286.
- Mennicken R, Möller M. Non-self-adjoint boundary value problems. Vol. 192, North-Holland mathematic studies. Amsterdam: North-Holland; 2003.
- Naimark MA. Linear differential operators. 2nd ed. Moscow: Nauka; 1969. English transl. of, 1st ed., Parts I, II, Ungar, New York (NY), 1967, 1968.
Appendix 1
Consider the tree T and fix Denote
. Then
, where
is the tree with the root
and the rooted edge
. Let us define functions
and
recurrently with respect to
where
is the height of T. For
the tree T is the segment
and we put
For each we put
(A1)
(A1)
(A2)
(A2)
Denote
Then relations (EquationA1(A1)
(A1) ) and (EquationA2
(A2)
(A2) ) take the form
(A3)
(A3)
The functions and
are entire in
of exponential type. We note that
is obtained from
by the replacement of
and
with
and
respectively.
Example 1.1:
Let Then
hence
In particular, for
Example 1.2:
Consider the tree on Figure . Then
Let and
be constructed from
and
respectively by the replacement
with
Fix
Then regrouping terms in (EquationA3
(A3)
(A3) ) one can get
Similarly, for ,
,
Example 1.3:
Let Then,
and the spectrum of the boundary value problem
consists of two parts
, where