Numerical Methods for General and Structured Eigenvalue Problems

The purpose of this book is to describe recent developments in solving eig- value problems, in particular with respect to the QR and QZ algorithms as well as structured matrices. Outline Mathematically speaking, the eigenvalues of a square matrix A are the roots of its characteristic polynomial det(...

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal: Kressner, Daniel, 19..-
Format: Livre numérique
Langue:Anglais
Publié: Berlin, Heidelberg : Springer Berlin Heidelberg : Springer e-books [20..].
Cham : Springer Nature
Collection:Lecture Notes in Computational Science and Engineering 46
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Numerical methods for general and structured eigenvalue problems, with 32 figures and 10 tables, Daniel Kressner, Berlin, Springer, 2005, 1 vol. (XIV-258 p.), Lecture notes in computational science and engineering, 3-540-24546-4
Description
Résumé:The purpose of this book is to describe recent developments in solving eig- value problems, in particular with respect to the QR and QZ algorithms as well as structured matrices. Outline Mathematically speaking, the eigenvalues of a square matrix A are the roots of its characteristic polynomial det(A??I). An invariant subspace is a linear subspace that stays invariant under the action of A. In realistic applications, it usually takes a long process of simpli?cations, linearizations and discreti- tions before one comes up with the problem of computing the eigenvalues of a matrix. In some cases, the eigenvalues have an intrinsic meaning, e.g., for the expected long-time behavior of a dynamical system; in others they are just meaningless intermediate values of a computational method. The same applies to invariant subspaces, which for example can describe sets of initial states for which a dynamical system produces exponentially decaying states. Computing eigenvalues has a long history, dating back to at least 1846 when Jacobi [172] wrote his famous paper on solving symmetric eigenvalue problems. Detailed historical accounts of this subject can be found in two papers by Golub and van der Vorst [140, 327]
Description:Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
ISBN:9783540285021
ISSN:1439-7358
Accès:Accès en ligne pour les établissements français bénéficiaires des licences nationales
Accès soumis à abonnement pour tout autre établissement
Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017