Core-chasing algorithms for the Eigenvalue problem / Jared L. Aurentz, Thomas Mach, Leonardo Robol, Raf Vandebril, David S. Watkins

Von:

Aurentz, Jared L [VerfasserIn]

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Fundamentals of algorithms ; 13Verlag: Philadelphia, Pennsylvania : SIAM, Society for Industrial and Applied Mathematics, [2018]Beschreibung: 1 Online-Ressource (ix, 149 Seiten)ISBN:

9781611975345

Schlagwörter:

Andere physische Formen: 9781611975338 | Erscheint auch als: Core-chasing algorithms for the Eigenvalue problem. Druck-Ausgabe Philadelphia : SIAM, Society for Industrial and Applied Mathematics, 2018. ix, 149 SeitenDDC-Klassifikation:

512.9/436 23

MSC: MSC: 65-02 | 65F15 | 65F30DOI: DOI: 10.1137/1.9781611975345Online-Ressourcen:

Zugang im Netz des KIT

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.PPN: PPN: 1029948704Package identifier: Produktsigel: ZDB-72-SIA

Exemplare ( 0 )
Titelinformationen ( 1 )

Dieser Titel hat keine Exemplare

Restricted to subscribers or individual electronic text purchasers.