Lecture 10

Eugene E. Tyrtyshnikov
Additional contact information
Eugene E. Tyrtyshnikov: Russian Academy of Sciences, Institute of Numerical Mathematics

A chapter in A Brief Introduction to Numerical Analysis, 1997, pp 85-93 from Springer

Abstract: Abstract Given a dense unstructured matrix A of several hundred (thousand) order with all the eigenvalues (eigenvectors) wanted, a vehicle of choice is definitely the QR algorithm. Since the early 60s, it is used due to V. N. Kublanovskaya (Russia) and J. G. F. Francis (England). We begin with the QR iterations in the orthodox form: $$ A_0 = A \in \mathbb{C}^{n \times n} (a given matrix); $$

Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-8136-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9780817681364

DOI: 10.1007/978-0-8176-8136-4_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().