Related papers: Inverse Dynamic Problem for the Dirac System on Fi…
We establish simple connections between response functions of the dynamical Dirac systems and $A$-amplitudes and Weyl functions of the spectral Dirac systems. Using these connections we propose a new and rigorous procedure to recover a…
A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…
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…
Dynamic programming on tree decompositions is a frequently used approach to solve otherwise intractable problems on instances of small treewidth. In recent work by Bodlaender et al., it was shown that for many connectivity problems, there…
We investigate inverse scattering problems for Dirac equations that arise as continuum models of waveguide arrays. We first establish the well-posedness of the forward models. For the associated inverse problems, we develop the inverse Born…
In the GEODETIC SET problem, an input is a (di)graph $G$ and integer $k$, and the objective is to decide whether there exists a vertex subset $S$ of size $k$ such that any vertex in $V(G)\setminus S$ lies on a shortest (directed) path…
This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph.…
We consider the inverse problem of finding matrix valued edge or nodal quantities in a graph from measurements made at a few boundary nodes. This is a generalization of the problem of finding resistors in a resistor network from voltage and…
We consider dynamic inverse problems for a dynamical system associated with a finite Jacobi matrix and for a system describing propagation of waves in a finite Krein-Stieltjes string. We offer three methods of recovering unknown parameters:…
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood,…
In this paper, we introduce dynamics factor graphs as a graphical framework to solve dynamics problems and kinodynamic motion planning problems with full consideration of whole-body dynamics and contacts. A factor graph representation of…
We study the theory of systems with constraints from the point of view of the formal theory of partial differential equations. For finite-dimensional systems we show that the Dirac algorithm completes the equations of motion to an…
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in $\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear…
Dynamic programming is a powerful technique that is, unfortunately, often inherently sequential. That is, there exists no unified method to parallelize algorithms that use dynamic programming. In this paper, we attempt to address this issue…
This paper deals with an inverse nodal problem for the Dirac differential operator with the discontinuity conditions inside the interval. We obtain a new approach for asymptotic expressions of the solutions and prove that the coefficients…
Graphene quantum dots provide a platform for manipulating electron behaviors in two-dimensional (2D) Dirac materials. Most previous works were of the "forward" type in that the objective was to solve various confinement, transport and…
Conservation principles like conservation of charge or energy provide a natural way to couple and constrain different physical variables. In this letter, we propose a dynamical system model that exploits these constraints for solving…
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 paper, one dimentional conformable fractional Dirac-type integro differential system is considered. The asymptotic formulae for the solutions, eigenvalues and nodal points are obtained. We investigate the inverse nodal problem and…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…