Factoring Permutation Matrices Into a Product of Tridiagonal Matrices

MaRDI QIDQ6219819zbMATH OpenFDO

Authors Michael Daniel Samson, Martianus Frederic Ezerman

Publication date 20 July 2010

Abstract: Gilbert Strang posited that a permutation matrix of bandwidth $w$ can be written as a product of $N<2w$ permutation matrices of bandwidth 1. A proof employing a greedy ``parallel bubblesort algorithm on the rows of the permutation matrix is detailed and further points of interest are elaborated.

This page was built for publication: Factoring Permutation Matrices Into a Product of Tridiagonal Matrices

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