Abstract
Here we consider diagonal plus semiseparable representations of matrices. This is a direct generalization of diagonal plus separable representations studied in Chapter 1. Note that every matrix may be represented in the diagonal plus semiseparable form. The problem is to obtain such a representation with minimal orders. This may be treated as the problem of completing strictly lower triangular and strictly upper triangular parts of a matrix to matrices with minimal ranks, since it will be proved that minimal orders of the generators are equal to the ranks of those minimal completions. Thus one can apply results of Chapter 2 to determine diagonal plus semiseparable representation of a matrix. An algorithm for finding minimal generators of a semiseparable representation of a given matrix is presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Basel
About this chapter
Cite this chapter
Eidelman, Y., Gohberg, I., Haimovici, I. (2014). Quasiseparable Representations: The Basics. In: Separable Type Representations of Matrices and Fast Algorithms. Operator Theory: Advances and Applications, vol 234. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0606-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0606-0_4
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0605-3
Online ISBN: 978-3-0348-0606-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)