The inverse problem for differential pencils on a star-shaped graph with mixed spectral data

The partial inverse problem for differential pencils on a star-shaped graph is studied from mixed spectral data.More precisely,we show that if the potentials on all edges on the star-shaped graph but one are known a priori then the unknown potential on the remaining edge can be uniquely determined by partial information on the potential and a part of eigenvalues.     

Solvability and stability of the inverse Sturm–Liouville problem with analytical functions in the boundary condition

The paper deals with the Sturm–Liouville eigenvalue problem with the Dirichlet boundary condition at one end of the interval and with the boundary condition containing entire functions of the spectral parameter at the other end. We study the inverse problem, which consists in recovering the potential from a part of the spectrum. This inverse problem generalizes partial inverse problems on finite intervals and on graphs and also the inverse transmission eigenvalue problem. We obtain sufficient conditions for global solvability of the studied inverse problem, which prove its local solvability and stability. In addition, application of our main results to the partial inverse Sturm–Liouville problem on the star-shaped graph is provided.     

Inverse problems for Sturm–Liouville operators on a star-shaped graph with mixed spectral data

The partial inverse spectral problem for Sturm–Liouville operators on a star-shaped graph was studied. The authors showed that if the potentials but one were known a priori, then the unknown potential on the whole interval can be uniquely determined by part of information of the potential and part of eigenvalues. The methods employed rest on the Weyl's m-function and theory concerning densities of zeros of entire functions.     

Incomplete Inverse Spectral and Nodal Problems for Differential Pencils

We prove uniqueness theorems for so-called half inverse spectral problem (and also for some its modification) for second order differential pencils on a finite interval with Robin boundary conditions. Using the obtained result we show that for unique determination of the pencil it is sufficient to specify the nodal points only on a part of the interval slightly exceeding its half.     

Scattering in a Forked-Shaped Waveguide

We consider wave scattering in a forked-shaped waveguide which consists of two finite and one half-infinite intervals having one common vertex. We describe the spectrum of the direct scattering problem and introduce an analogue of the Jost function. In case of the potential which is identically equal to zero on the half-infinite interval, the problem is reduced to a problem of the Regge type. For this case, using Hermite-Biehler classes, we give sharp results on the asymptotic behavior of resonances, that is, the corresponding eigenvalues of the Regge-type problem. For the inverse problem, we obtain sufficient conditions for a function to be the S-function of the scattering problem on the forked-shaped graph with zero potential on the half-infinite edge, and present an algorithm that allows to recover potentials on the finite edges from the corresponding Jost function. It is shown that the solution of the inverse problem is not unique. Some related general results in the spectral theory of operator pencils are also given. This work was supported by the grant UM1-2567-OD-03 from the Civil Research and Development Foundation (CRDF). YL was partially supported by the NSF grants 0338743, 0354339 and 0754705, by the Research Board and Research Council of the University of Missouri, and by the EU Marie Curie “Transfer of Knowledge” program.     

Determination of differential pencils from dense nodal subset in an interior subinterval

The uniqueness problem of the inverse nodal problem for the differential pencils defined on interval [0, 1] with the Dirichlet boundary conditions is considered. We prove that a bilaterally dense subset of the nodal set in interior subinterval (a ₁, a ₂)(? [0, 1]) can determine the pencil uniquely. However, in the case of 1/2 ? [a ₁, a ₂] we need additional spectral information to treat this problem, which is associated with the derivatives of eigenfunctions at some known nodal points.     

Inverse problems for Sturm–Liouville operators on a compact equilateral graph by partial nodal data

Partial inverse nodal problems for Sturm–Liouville operators on a compact equilateral star graph are investigated in this paper. Uniqueness theorems from partial twin‐dense nodal subsets in interior subintervals or arbitrary interior subintervals having the central vertex are proved. In particular, we posed and solved a new type partial inverse nodal problems for the Sturm–Liouville operator on the compact equilateral star graph.     

Recovery of differential equations with nonlinear dependence on the spectral parameter

The inverse spectral problem of recovering pencils of second-order differential operators on the half-line is studied. We give a formulation of the inverse problem, prove the uniqueness theorem and provided a procedure for constructing the solution of the inverse problem. We also establishe connections with inverse problems for partial differential equations.     

An inverse problem for an integro‐differential operator on a star‐shaped graph

A partial inverse problem for an integro‐differential Sturm‐Liouville operator on a star‐shaped graph is studied. We suppose that the convolution kernels are known on all the edges of the graph except one and recover the kernel on the remaining edge from a part of the spectrum. We prove the uniqueness theorem for this problem and develop a constructive algorithm for its solution, based on the reduction of the inverse problem on the graph to the inverse problem on the interval by using the Riesz basis property of the special system of functions.     

Some inverse scattering problems on star-shaped graphs

Having in mind applications to the fault-detection/diagnosis of lossless electrical networks, here we consider some inverse scattering problems for Schrödinger operators over star-shaped graphs. We restrict ourselves to the case of minimal experimental setup consisting in measuring, at most, two reflection coefficients when an infinite homogeneous (potential-less) branch is added to the central node. First, by studying the asymptotic behavior of only one reflection coefficient in the high-frequency limit, we prove the identifiability of the geometry of this star-shaped graph: the number of edges and their lengths. Next, we study the potential identification problem by inverse scattering, noting that the potentials represent the inhomogeneities due to the soft faults in the network wirings (potentials with bounded H¹-norms). The main result states that, under some assumptions on the geometry of the graph, the measurement of two reflection coefficients, associated to two different sets of boundary conditions at the external vertices of the tree, determines uniquely the potentials; it can be seen as a generalization of the theorem of the two boundary spectra on an interval.     

Recovering nonselfadjoint differential pencils with nonseparated boundary conditions

Nonselfadjoint second-order differential pencils on a finite interval with nonseparated boundary conditions are studied. We establish some important properties of spectral characteristics and investigate inverse problems of recovering the operator from its spectral data. For these inverse problems, we prove the corresponding uniqueness theorems and provide procedures for constructing their solutions.     

Reconstruction of the Dirac-Type Integro-Differential Operator From Nodal Data

Abstract

The inverse nodal problem for Dirac type integro-differential operator with the spectral parameter in the boundary conditions is studied. We prove that dense subset of the nodal points determines the coefficients of differential part of operator and gives partial information for integral part of it.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

Integrability of the Equations for Nonsingular Pairs of Compatible Flat Metrics

We solve the problem of describing all nonsingular pairs of compatible flat metrics (or, in other words, nonsingular flat pencils of metrics) in the general N-component case. This problem is equivalent to the problem of describing all compatible Dubrovin–Novikov brackets (compatible nondegenerate local Poisson brackets of hydrodynamic type) playing an important role in the theory of integrable systems of hydrodynamic type and also in modern differential geometry and field theory. We prove that all nonsingular pairs of compatible flat metrics are described by a system of nonlinear differential equations that is a special nonlinear differential reduction of the classical Lamé equations, and we present a scheme for integrating this system by the method of the inverse scattering problem. The integration procedure is based on using the Zakharov method for integrating the Lamé equations (a version of the inverse scattering method).     

Inverse nodal problems for the Sturm-Liouville differential operators on a star-type graph

We study inverse nodal problems for the second order differential operators on a star-type graph satisfying the standard matching conditions at the interior vertex. We prove uniqueness theorems and obtain a constructive solution to the inverse problems of this class. Original Russian Text Copyright ? 2009 Yurko V. A. The author was supported by the Russian Foundation for Basic Research (Grant 07-01-00003) and the National Science Council of Taiwan (Grant 07-01-92000-NSC-a). __________ Saratov. Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 50, No. 2, pp. 469–475, March–April, 2009.     

On the Structure of Contractible Edges in <Emphasis Type="Italic">k</Emphasis>-connected Partial <Emphasis Type="Italic">k</Emphasis>-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k − 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.     

Spectral analysis of the Sturm-Liouville operator on the star-shaped graph

The Sturm-Liouville operator on the star-shaped graph is considered. We study its spectral properties, important for inverse problem theory. In particular, asymptotic formulas for the weight matrices are derived, by using contour integration. We also prove the Riesz-basis property for a special sequence of vector functions, constructed by the spectral data.     

Inverse Problem for Quasi-Periodic Differential Pencils with Jump Conditions Inside the Interval

Non-self-adjoint second-order differential pencils on a finite interval with non-separated quasi-periodic boundary conditions and jump conditions are studied. We establish properties of spectral characteristics and investigate the inverse spectral problem of recovering the operator from its spectral data. For this inverse problem we prove the corresponding uniqueness theorem and provide an algorithm for constructing its solution.     

Vekua theory for the Helmholtz operator

Vekua operators map harmonic functions defined on domain in \mathbb R²{\mathbb R^{2}} to solutions of elliptic partial differential equations on the same domain and vice versa. In this paper, following the original work of I. Vekua (Ilja Vekua (1907–1977), Soviet-Georgian mathematician), we define Vekua operators in the case of the Helmholtz equation in a completely explicit fashion, in any space dimension N ≥ 2. We prove (i) that they actually transform harmonic functions and Helmholtz solutions into each other; (ii) that they are inverse to each other; and (iii) that they are continuous in any Sobolev norm in star-shaped Lipschitz domains. Finally, we define and compute the generalized harmonic polynomials as the Vekua transforms of harmonic polynomials. These results are instrumental in proving approximation estimates for solutions of the Helmholtz equation in spaces of circular, spherical, and plane waves.     

An inverse problem for a differential pencil using nodal points as data

An inverse nodal problem is studied for a differential pencil with non-separated boundary conditions. We prove that a dense subset of nodal points uniquely determines the boundary data and potential functions. We also provide a constructive procedure for the solution of the inverse nodal problem.