✦ LIBER ✦

Similarity of block diagonal and block triangular matrices

✍ Scribed by Vadim Olshevsky

Publisher: SP Birkhäuser Verlag Basel
Year: 1992
Tongue: English
Weight: 381 KB
Volume: 15
Category: Article
ISSN: 0378-620X
DOI: 10.1007/bf01200704

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simultaneous block triangularization and

Simultaneous block triangularization and block diagonalization of sets of matrices

✍ H. Shapiro 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 573 KB

Block Triangularization of Algebras of M

Block Triangularization of Algebras of Matrices

✍ J.F. Watters 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Block triangularization of skew-symmetri

Block triangularization of skew-symmetric matrices

✍ Satoru Iwata 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 414 KB

This paper addresses the finest block triangularization of nonsingular skewsymmetric matrices by simultaneous permutations of rows and columns. Hierarchical relations among components are represented in terms of signed posets. The finest block-triangular form can be computed efficiently with the aid

Primal partition programming for block d

Primal partition programming for block diagonal matrices

✍ J. B. Rosen 📂 Article 📅 1964 🏛 Springer-Verlag 🌐 English ⚖ 585 KB

The height characteristic of block trian

The height characteristic of block triangular matrices

✍ Daniel Hershkowitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Block diagonalization and LU-equivalence

Block diagonalization and LU-equivalence of Hankel matrices

✍ Nadia Ben Atti; Gema M. Diaz–Toca 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 196 KB

This article presents a new algorithm for obtaining a block diagonalization of Hankel matrices by means of truncated polynomial divisions, such that every block is a lower Hankel matrix. In fact, the algorithm generates a block LU-factorization of the matrix. Two applications of this algorithm are a