Skip to main content

Complete Algorithm for Hermitian Matrices

  • 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 235))

  • 884 Accesses

Abstract

In this chapter we study in detail the divide and conquer method for Hermitian matrices with quasiseparable representations. For Hermitian quasiseparable of order one matrices we obtain a complete algorithm to compute the eigenvalue decomposition of a matrix.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.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). Complete Algorithm for Hermitian Matrices. 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_7

Download citation

Publish with us

Policies and ethics