Papers › Simulations of real-time system identification for superconducting cavities with a...
Simulations of real-time system identification for superconducting cavities with a recursive least-squares algorithm
Volker Ziemann
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We explore the performance of a recursive least-squares algorithm to determine the bandwidth ω₁₂ and the detuning Δω of a superconducting cavity. We base the simulations on parameters of the ESS double-spoke cavities. Expressions for the signal-to-noise ratio of derived parameters are given to explore the applicability of the algorithm to other configurations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections