Abstract
Here we use another representation of a matrix from the class HN, which may be better for ensuring the stability of the iteration process. As data we use, instead of generators, the elementary unitary matrices whose product forms a corresponding unitary matrix from the class UN. Notice that in this case also it is necessary to compute upper triangular generators in the algorithm.
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). The Factorization Based Implicit Method. In: Separable Type Representations of Matrices and Fast Algorithms. Operator Theory: Advances and Applications, vol 235. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0612-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0612-1_15
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0611-4
Online ISBN: 978-3-0348-0612-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)