Core-chasing algorithms for the Eigenvalue problem:

Eigenvalue computations are ubiquitous in science and engineering. John Francis's implicitly shifted QR algorithm has been the method of choice for small to medium sized eigenvalue problems since its invention in 1959. This book presents a new view of this classical algorithm. While Francis...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Aurentz, Jared L. (VerfasserIn), Mach, Thomas (VerfasserIn), Robol, Leonardo (VerfasserIn), Vandebril, Raf 1978- (VerfasserIn), Watkins, David S. 1948- (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Philadelphia, Pennsylvania SIAM, Society for Industrial and Applied Mathematics [2018]
Schriftenreihe:Fundamentals of algorithms 13
Schlagworte:
Online-Zugang:DE-91
DE-20
DE-706
DE-29
Volltext
Inhaltsverzeichnis
Zusammenfassung:Eigenvalue computations are ubiquitous in science and engineering. John Francis's implicitly shifted QR algorithm has been the method of choice for small to medium sized eigenvalue problems since its invention in 1959. This book presents a new view of this classical algorithm. While Francis's original procedure chases bulges, the new version chases core transformations, which allows the development of fast algorithms for eigenvalue problems with a variety of special structures. This also leads to a fast and backward stable algorithm for computing the roots of a polynomial by solving the companion matrix eigenvalue problem. The authors received a SIAM Outstanding Paper prize for this work
Beschreibung:1 online resource (x, 149 Seiten)
ISBN:9781611975345
DOI:10.1137/1.9781611975345

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen