๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Primal partition programming for block diagonal matrices

โœ Scribed by J. B. Rosen

Publisher
Springer-Verlag
Year
1964
Tongue
English
Weight
585 KB
Volume
6
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The polytope of block diagonal matrices
The polytope of block diagonal matrices and complete bipartite partitionings
โœ Crama, Yves; Oosten, Maarten ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 259 KB ๐Ÿ‘ 1 views

Motivated by a fundamental clustering problem arising in several areas (production management, marketing, numerical analysis, etc.), we investigate the facial structure of the polytope whose extreme points are all 0-1 block diagonal matrices. For this polytope, general properties of facet-defining i

A look-ahead block schur algorithm for d
A look-ahead block schur algorithm for diagonal plus semiseparable matrices
โœ Y. Eidelman; I. Gohberg ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 533 KB

A look-ahead recumive algorithm for the block triangular factorization of matrices represented as a sum of diagonal and semiseparable ones is derived. This factorization is used for fast solving of the corresponding linear system. For the case of sizes of diagonal blocks not depending on dimension o