In this paper, an original solution to a distributed identification problem on an undirected chain graph is presented. A symmetrical neighbourhood-based decentralized parallel set of estimation algorithms (aiming at reducing the computational burden of a centralized estimation scheme) is designed and adopted. The positive definite nature of a quadratic form associated with a tridiagonal block structure is crucial to proving consensus achievement. Explicit characterization of persistency of excitation for the exponential convergence is innovatively provided, without resorting to existence assertions.
Verrelli, C.m., Tomei, P., Di Fiore, C. (2026). Distributed estimation algorithms on undirected chained graphs with explicit characterization of consensus. APPLIED MATHEMATICS AND COMPUTATION, 531, 1-15 [10.1016/j.amc.2026.130208].
Distributed estimation algorithms on undirected chained graphs with explicit characterization of consensus
Verrelli C. M.
;Tomei P.;Di Fiore C.
2026-01-01
Abstract
In this paper, an original solution to a distributed identification problem on an undirected chain graph is presented. A symmetrical neighbourhood-based decentralized parallel set of estimation algorithms (aiming at reducing the computational burden of a centralized estimation scheme) is designed and adopted. The positive definite nature of a quadratic form associated with a tridiagonal block structure is crucial to proving consensus achievement. Explicit characterization of persistency of excitation for the exponential convergence is innovatively provided, without resorting to existence assertions.| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0096300326002602-main.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
5.26 MB
Formato
Adobe PDF
|
5.26 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


