A dynamical system approach to matrix eigenvalue algorithms
A survey of iterative matrix eigenvalue algorithms from a dynamical systems point of view is given. The paper consists of three parts. First, a calculus approach to the local convergence analysis of Jacobi-type algorithms is presented. Next, the nonsymmetric eigenvalue problem introducing new algorithms is studied. Thirdly, a new shifted QR-type algorithm, which is in some sense a generalization of the Rayleigh Quotient Iteration to a full symmetric matrix, is presented. These methods are used to reproduce well-known results and develop new efficient algorithms. For the entire collection see [Zbl 1024.00040].
- The geometry of matrix eigenvalue methods
- Matrix method for linear sequential dynamical systems on digraphs
- An order-reduction method for extraction of eigenvalues of dynamic systems
- Dynamical systems and non-Hermitian iterative eigensolvers
- Matrix Visualization in the Design of Numerical Algorithms
- scientific article; zbMATH DE number 503390 (Why is no real title available?)
- scientific article; zbMATH DE number 653118 (Why is no real title available?)
- scientific article; zbMATH DE number 741192 (Why is no real title available?)
- Une application de la théorie de la variété centrale aux algorithmes récurrents
- scientific article; zbMATH DE number 2163368 (Why is no real title available?)
- Numerical algorithms for eigenvalue assignment by constant and dynamic output feedback
- Dynamical analysis of numerical systems
- Dynamics of the symmetric eigenvalue problem with shift strategies
- scientific article; zbMATH DE number 2245554 (Why is no real title available?)
- Lie algebra representations, nilpotent matrices, and the \(C\)-numerical range
- A sort-Jacobi algorithm for semisimple Lie algebras
This page was built for publication: A dynamical system approach to matrix eigenvalue algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462132)
