Sparse factorization of the square all-ones matrix of arbitrary order

DOI10.1137/24M1633790MaRDI QIDQ7016668zbMATH OpenFDO

Authors Xin Jiang, Edward Duc Hien Nguyen, César A. Uribe, Bicheng Ying

Publication date 6 March 2025

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1633790

zbMATH Keywords

decentralized optimizationaverage consensusfinite-time consensussparse matrix factorizationall-ones matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Stochastic matrices (15B51) Distributed algorithms (68W15)

Cites work

• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Binary factorizations of the matrix of all ones
• Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
• Introduction to hierarchical matrices with applications.
• On the convergence of decentralized gradient descent
• On the g-circulant solutions to the matrix equation A^ m= J. II
• On the g-circulant solutions to the matrix equation \(A^m=\lambda J\)
• Optimal strategies in the average consensus problem
• The g-circulant solutions of \(A^ m=\lambda J\)
• \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)

This page was built for publication: Sparse factorization of the square all-ones matrix of arbitrary order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016668)