Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach |
scientific article |
Statements
Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (English)
0 references
17 October 2018
0 references
Laplacian matrix
0 references
rank minimization
0 references
minimal polynomial
0 references
consensus algorithm
0 references
0 references
