Sampling the eigenvalues of a graph
We are concerned with the computational aspects of eigenvalues of a simple graph made of Sturm–Liouville operators on its edges. We show how the sampling method not only helps to compute effectively its eigenvalues and but also to locate double eigenvalues. This helps to design better graph type str...
Gespeichert in:
Veröffentlicht in: | Sampling theory, signal processing, and data analysis signal processing, and data analysis, 2023-06, Vol.21 (1), Article 13 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We are concerned with the computational aspects of eigenvalues of a simple graph made of Sturm–Liouville operators on its edges. We show how the sampling method not only helps to compute effectively its eigenvalues and but also to locate double eigenvalues. This helps to design better graph type structures by predicting and avoiding resonance, and unwanted vibrations. |
---|---|
ISSN: | 2730-5716 2730-5724 |
DOI: | 10.1007/s43670-023-00052-y |