A simple algorithm that finds a simultaneous block diagonalization of multiple matrices through the eigendecomposition of a single matrix.
-
Updated
Aug 26, 2021 - Python
A simple algorithm that finds a simultaneous block diagonalization of multiple matrices through the eigendecomposition of a single matrix.
Finding the finest simultaneous block diagonalization of multiple matrices by sequentially exploring invariant subspaces under matrix multiplications. Applications include the efficient analysis of arbitrary synchronization patterns in complex networks.
Add a description, image, and links to the sbd-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the sbd-algorithm topic, visit your repo's landing page and select "manage topics."