Related papers: Inverse Dynamic Problem for the Dirac System on Fi…
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…
Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum…
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 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…
A forward problem for the Dirac system is to find $u=\begin{pmatrix}u_1(x,t)\\u_2(x,t)\end{pmatrix}$ obeying $iu_t+\begin{pmatrix}0&1\\-1&0\end{pmatrix}u_x+\begin{pmatrix}p&q\\q&-p\end{pmatrix}u=0$ for…
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 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…
In this article we present a method to reconstruct the interconnectedness of dynamically related stochastic processes, where the interactions are bi-directional and the underlying topology is a tree. Our approach is based on multivariate…
We consider the inverse dynamic problem for a dynamical system with discrete time associated with a semi-infinite complex Jacobi matrix. We propose two approaches of recovering coefficients from dynamic response operator and answer a…
This paper studies the formulation, well-posedness, and numerical solution of Bayesian inverse problems on metric graphs, in which the edges represent one-dimensional wires connecting vertices. We focus on the inverse problem of recovering…
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…
Many iterative and non-iterative methods have been developed for inverse problems associated with Ising models. Aiming to derive an accurate non-iterative method for the inverse problems, we employ the tree-reweighted approximation. Using…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also…
The Relativistic Dynamical Inversion technique, a novel tool for finding analytical solutions to the Dirac equation, is written in explicitly covariant form. It is then shown how the technique can be used to make a change from Cartesian to…
This paper describes a unified method solving for inverse, forward, and hybrid dynamics problems for robotic manipulators with either open kinematic chains or closed kinematic loops based on factor graphs. Manipulator dynamics is considered…
Topological signals are variables or features associated with both nodes and edges of a network. Recently, in the context of Topological Machine Learning, great attention has been devoted to signal processing of such topological signals.…
A metric tree is a tree whose edges are viewed as line segments of positive length. The Dirac operator on such tree is the operator which operates on each edge, complemented by the matching conditions at the vertices which were given by…
In this paper, we propose a novel adaptive finite element method for an elliptic equation with line Dirac delta functions as a source term. We first study the well-posedness and global regularity of the solution in the whole domain. Instead…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers certain queries that are specific to the problem under consideration. There has been a lot of research on dynamic algorithms…
Planning long duration robotic manipulation sequences is challenging because of the complexity of exploring feasible trajectories through nonlinear contact dynamics and many contact modes. Moreover, this complexity grows with the problem's…