Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Solution of Vandermonde systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph diameter, eigenvalues, and minimum-time consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low-rank approximation and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with constant \(\mu\) and \(\overline{\mu}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Time Consensus Problems for Networks of Dynamic Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear iterations for distributed averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralised minimum-time consensus / rank
 
Normal rank

Revision as of 22:48, 16 July 2024

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
    0 references
    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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references