An inverse Sturm-Liouville problem for an impedance

A numerical method for reconstructing an impedance in a Sturm-Liouville operator from finitely many eigenvalues is investigated. The method constructs an impedance that has the given eigenvalues by finding a zero of a nonlinear finite dimensional map. A Newton scheme is investigated and numerical examples are considered.     

An inverse problem for Sturm-Liouville operators on arbitrary compact spatial networks

An inverse spectral problem is studied for Sturm-Liouville differential operators on arbitrary compact graphs (spatial networks). A uniqueness theorem of recovering operators from their spectra is proved, and a constructive procedure for the solution of the inverse problem is provided.     

On the inverse Sturm-Liouville problem for spatially symmetric operators,III

In this note it is proved that x(·) a boundary trajectory of a Lipschitz-continuous differential inclusion ? ? F(t, x), x(0) = 0, the tangent cone to F(t, x(t)) at ?(t) that of attainable set E(t) at x(t) coincide for almost every t provided that ?F(t, x) is smooth (similar results with more stringent assumptions were obtained by H. Hermes (J. Differential Equations3 (1967), 256–270) and S. ?ojasiewicz, Jr. (Asterisque75–76 (1980), 187–197)). It is also proved that the outward normal to these cones along the trajectory is Lipschitz-continuous (in t). Moreover, using the lower, one-side, directional derivative instead of F. H. Clarke's generalised gradient, first-order necessary conditions are obtained, which can be stronger than those of Clarke (in “International Symposium on the Calculus of Variation and Optimal Control, University of Wisconsin, Madison, Wisconsin, September 1975”). The main ideas of this paper were presented in J. Hale's seminar at Brown University (March 1976).     

On the inverse Sturm-Liouville problem for spatially symmetric operators,II

Using a third order Picard-Fuchs equation we show that a certain two parameter family of planar vectorfields for parameter values in a certain cone has a unique limit cycle, which is born from a Hopf bifurcation and dies in a saddle connection. This removes a superfluous hypothesis in Theorem 3.2, Chapter 13 of S. N. Chow and J. K. Hale (“Methods of Bifurcation Theory,” Springer-Verlag, New York, 1982).     

The inverse problem for pencils of differential operators on the half-line with turning points

The inverse spectral problem of recovering pencils of second-order differential operators on the half-line with turning points is studied. We give a formulation of the inverse problem, establish properties of the spectral characteristics, and prove the uniqueness theorem for the solution of the inverse problem. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 12, No. 5, pp. 237–246, 2006.     

A finite-difference algorithm for an inverse Sturm-Liouville problem

We study a method for approximating a potential q(x) in y(0)=y()=0 from finite spectral data. When the potential is symmetric,the data are the first M Dirichlet eigenvalues. In the generalcase, the first M terminal velocities are also specified. Acentred finite-difference scheme reduces the inverse Sturm-Liouvilleproblem to a matrix inverse eigenvalue problem. Our approachis motivated by the work of Paine, de Hoog and Anderssen, whoinvestigated the discrepancy between continuous and matrix eigenvaluesunder finite differences. Our modified Newton scheme is basedon choosing the number of interior mesh points in the discretizationto be 2M. The modified Newton scheme is shown to be convergentfor both the case of a symmetric and general potential. Somenumerical experiments are given. Supported in part by Institute for Scientific Computation,Texas A&M University.     

An interior point method with Bregman functions for the variational inequality problem with paramonotone operators

We present an algorithm for the variational inequality problem on convex sets with nonempty interior. The use of Bregman functions whose zone is the convex set allows for the generation of a sequence contained in the interior, without taking explicitly into account the constraints which define the convex set. We establish full convergence to a solution with minimal conditions upon the monotone operatorF, weaker than strong monotonicity or Lipschitz continuity, for instance, and including cases where the solution needs not be unique. We apply our algorithm to several relevant classes of convex sets, including orthants, boxes, polyhedra and balls, for which Bregman functions are presented which give rise to explicit iteration formulae, up to the determination of two scalar stepsizes, which can be found through finite search procedures. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Corresponding author.     

Inverse problem for Sturm-Liouville operators on hedgehog-type graphs

We study the inverse spectral problem for Sturm-Liouville differential operators on hedgehog-type graphs with a cycle and with standard matching conditions at interior vertices. We prove a uniqueness theorem and obtain a constructive solution for this class of inverse problems.     

On an inverse problem for the Sturm-Liouville operator with degenerate boundary conditions

We consider the spectral problem generated by the Sturm-Liouville equation on the interval (0, π) with degenerate boundary conditions. We derive sufficient conditions for an entire analytic function to be the characteristic determinant of this boundary value problem.     

On an inverse problem for non-selfadjoint difference operators

We recover the coefficients in certain difference expressions in terms of a known generalized spectral function of Marchenko type.Translated from Matematicheskie Zametki, Vol. 11, No. 6, pp. 661–668, June, 1972.     

Inverse scattering with fixed energy and an inverse eigenvalue problem on the half-line

Recently A. G. Ramm (1999) has shown that a subset of phase shifts , , determines the potential if the indices of the known shifts satisfy the Müntz condition . We prove the necessity of this condition in some classes of potentials. The problem is reduced to an inverse eigenvalue problem for the half-line Schrödinger operators.

     

An inverse problem for operators of a triangular structure

An inverse problem for operators of a triangular structure is studied. An algorithm for the solution and necessary and sufficient conditions for the solvability of this problem are obtained, moreover uniqueness is proved. Applications to difference and differential operators are considered.     

An inverse spectral problem for differential operators on a hedgehog-type graph

Doklady Mathematics -     

An interior point potential reduction algorithm for the linear complementarity problem

The linear complementarity problem (LCP) can be viewed as the problem of minimizingx ^T y subject toy=Mx+q andx, y?0. We are interested in finding a point withx ^T y <ε for a givenε > 0. The algorithm proceeds by iteratively reducing the potential function $$f(x,y) = \rho \ln x^T y - \Sigma \ln x_j y_j ,$$ where, for example,ρ=2n. The direction of movement in the original space can be viewed as follows. First, apply alinear scaling transformation to make the coordinates of the current point all equal to 1. Take a gradient step in the transformed space using the gradient of the transformed potential function, where the step size is either predetermined by the algorithm or decided by line search to minimize the value of the potential. Finally, map the point back to the original space. A bound on the worst-case performance of the algorithm depends on the parameterλ ^*=λ^*(M, ε), which is defined as the minimum of the smallest eigenvalue of a matrix of the form $$(I + Y^{ - 1} MX)(I + M^T Y^{ - 2} MX)^{ - 1} (I + XM^T Y^{ - 1} )$$ whereX andY vary over the nonnegative diagonal matrices such thate ^T XYe ?ε andX _jj Y _jj?n ². IfM is a P-matrix,λ ^* is positive and the algorithm solves the problem in polynomial time in terms of the input size, |log ε|, and 1/λ ^*. It is also shown that whenM is positive semi-definite, the choice ofρ = 2n+ \(\sqrt {2n} \) yields a polynomial-time algorithm. This covers the convex quadratic minimization problem.     

On a local uniqueness result for the inverse Sturm-Liouville problem

A new and fairly elementary proof is given of the result by B. Simon [S], that the potential in a Sturm-Liouville operator is determined by the asymptotics of the associatedm-function near −∞. The proof given is based on relations between the classical transformation operators and them-function.