Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
From MaRDI portal
Cited in
(21)- Computational methods of linear algebra
- Solution of an integer programming problem related to convergence of rows of Padé approximants
- A Krylov projection method for systems of ODEs
- Convergence of the shifted \(QR\) algorithm on \(3\times{} 3\) normal matrices
- A quaternion QR-algorithm
- Dynamics of the QR-flow for upper Hessenberg real matrices
- A posteriori error estimates of Krylov subspace approximations to matrix functions
- The QR algorithm for real Hessenberg matrices
- The shifted QR algorithm for Hermitian matrices
- Normal Hessenberg and moment matrices
- Presentation geométrique des méthodes de calcul des valeurs propres
- Szegö polynomials associated with Wiener-Levinson filters
- A propos de l’algorithme QZ
- A note on the convergence theorem of the tridiagonal QR algorithm with Wilkinson's shift
- Численное решение краевой задачи для междупредельного дифференциального уравнения методом модифицированной прогонки
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- Canonical Decomposition of Hessenberg Matrices
- An interpolatory approximation of the matrix exponential based on Faber polynomials
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Convergence of LR algorithm for a one-point spectrum tridiagonal matrix
- Quantitative and constructive aspects of the generalized Koenig's and de Montessus's theorems for Padé approximants
This page was built for publication: Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576481)
