Inverse source problem in a forced network
From MaRDI portal
Publication:5383307
DOI10.1088/1361-6420/aafcc6zbMath1431.35239arXiv1803.04895OpenAlexW3101864280WikidataQ128632156 ScholiaQ128632156MaRDI QIDQ5383307
No author found.
Publication date: 21 June 2019
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04895
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Inverse problems for PDEs (35R30)
Related Items (1)
Cites Work
- Transportation in graphs and the admittance spectrum
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Square regularization matrices for large linear discrete ill-posed problems
- Distributed asynchronous optimal routing in data networks
- Sensors and actuators in distributed systems
- Oscillations of networks: the role of soft nodes
- Depth-First Search and Linear Graph Algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication: Inverse source problem in a forced network