Lecture 11

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 95-101 from Springer

Abstract: Abstract Suppose that the generalized QR algorithm exploits polynomials f k (multi- shifts) of the same degree r on every step.

Keywords: Unitary Matrice; Quadratic Convergence; Hessenberg Matrix; Tridiagonal Matrice; Real Entry (search for similar items in EconPapers)
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_11

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

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

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 ().