Inverse problems on a graph with loops (Q2397875)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inverse problems on a graph with loops |
scientific article; zbMATH DE number 6722962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse problems on a graph with loops |
scientific article; zbMATH DE number 6722962 |
Statements
Inverse problems on a graph with loops (English)
0 references
24 May 2017
0 references
The inverse nodal problem is studied for the Sturm-Liouville operator on a geometrical graph having only one interior vertex. The uniqueness theorem is proved and an algorithm for constructing the solution for this class of problems is provided.
0 references
Sturm-Liouville operators
0 references
geometrical graphs, inverse nodal problem
0 references
0.9029243
0 references
0 references
0.89539057
0 references
0.8939915
0 references
0.89308137
0 references
0.8930638
0 references
0 references
0 references
0.8903917
0 references
0.88613963
0 references
