Abstract
Here we study the problem of completion of a partially specified matrix with a given lower triangular part to a matrix with minimal rank. This chapter contains a formula for the rank of a minimal completion and an algorithm to build such a completion, first in the case of a 2 × 2 block matrix, which is then of help for the proof of the general case.
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). The Minimal Rank Completion Problem. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0606-0_2
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)