Skip to main content

Completion to Matrices with Band Inverses and with Minimal Ranks

  • Chapter
  • First Online:
Book cover Separable Type Representations of Matrices and Fast Algorithms

Part of the book series: Operator Theory: Advances and Applications ((OT,volume 234))

  • 1059 Accesses

Abstract

Here we study properties of the unique Green completion obtained in Theorem 8.2 of the previous Chapter 8. In the first section it is shown that this completion is invertible if and only if all the matrices \(D_{k}=\tilde{A}(k-n:k,k-n:k),\qquad k=n+1,....,N\) are invertible. In this case all the principal leading submatrices \(A^{(j,k)}=A(j:k,j:k),\quad 1\leq j <j+n\leq k\leq N\) of the completion are also invertible.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Basel

About this chapter

Cite this chapter

Eidelman, Y., Gohberg, I., Haimovici, I. (2014). Completion to Matrices with Band Inverses and with Minimal Ranks. 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_9

Download citation

Publish with us

Policies and ethics