相关论文: On inverse dynamical and spectral problems for the…

In this paper, we consider the inverse dynamic problem for the Dirac system on finite metric tree graphs. Our main goal is to recover the topology (connectivity) of a tree, lengths of edges, and a matrix potential function on each edge. We…

The inverse problem of recovery of a potential on a quantum tree graph from Weyl's matrix given at a number of points is considered. A method for its numerical solution is proposed. The overall approach is based on the leaf peeling method…

In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of…

We consider the in-plane motion of elastic strings on tree-like network, observed from the 'leaves'. We investigate the inverse problem of recovering not only the physical properties i.e. the 'optical lengths' of each string, but also the…

We study the inverse problem for a semilinear wave equation on metric tree graphs. From the Dirichlet-to-Neumann map defined at all but one of the boundary vertices, we recover unknown connectivity of the graph, lengths of the edges, the…

We consider inverse dynamic and spectral problems for the one dimensional Dirac system on a finite tree. Our aim will be to recover the topology of a tree (lengths and connectivity of edges) as well as matrix potentials on each edge. As…

We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula…

We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…

We consider Sturm-Liouville operators on geometrical graphs without cycles (trees) with singular potentials from the class $W_2^{-1}$. We suppose that the potentials are known on a part of the graph, and study the so-called partial inverse…

We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…

A new method for solving inverse spectral problems on quantum star graphs is proposed. The method is based on Neumann series of Bessel functions representations for solutions of Sturm-Liouville equations. The representations admit estimates…

Inverse scattering and spectral one-dimensional problems are discussed systematically in a self-contained way. Many novel results, due to the author are presented. The classical results are often presented in a new way. Several highlights…

Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…

This paper proposes a new and efficient numerical algorithm for recovering the damping coefficient from the spectrum of a damped wave operator, which is a classical Borg-Levinson inverse spectral problem. The algorithm is based on inverting…

In this paper, inverse spectral problems for Sturm-Liouville operators on a tree (a graph without cycles) are studied. We show that if the potential on an edge is known a priori, then b - 1 spectral sets uniquely determine the potential…

We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $B\subset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2\in B$. The distance of points $x_1,x_2\in X$ is defined as the…

We present an inverse scattering approach for computing n-peakon solutions of the Degasperis-Procesi equation (a modification of the Camassa-Holm (CH) shallow water equation). The associated non-self-adjoint spectral problem is shown to be…

In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…

This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models,…

This paper is concerned with a numerical method for a 3D coefficient inverse problem with phaseless scattering data. These are multi-frequency data generated by a single direction of the incident plane wave. Our numerical procedure consists…