Abstract
It is clear from the preceding chapter that any matrix has quasiseparable representations. By padding given quasiseparable generators with zero matrices of large sizes one can arrange that they have arbitrarily large orders. However, one is looking for generators of minimal orders, because they will give better computational complexity in applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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 Generators. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0606-0_5
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)