Abstract
Generators with orders one are complex numbers. One can then apply the linear complexity inversion algorithm from Theorem 18.2 suggested under the conditions of invertibility of the principal leading submatrices of the matrix. In this chapter an algorithm to determine quasiseparable generators of the inverse without any restrictions on the principal leading submatrices is obtained.
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). Scalar Matrices with Quasiseparable Order One. 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0606-0_19
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)