On some algorithms for the solution of the complete eigenvalue problem

Cited in

(33)

A direct algorithm for pole assignment of time-invariant multi-input linear systems using state feedback
Schur parameter pencils for the solution of the unitary eigenproblem
On a functional approach to constructing projections onto invariant subspaces of matrices
SR and SZ algorithms for the symplectic (butterfly) eigenproblem
The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
On the convergence of the QR algorithm with multishifts
Two connections between the \(SR\) and \(HR\) eigenvalue algorithms
Eigenvalue computation in the 20th century
\(QR\)-like algorithms for eigenvalue problems
Unstructured quotient fixed modes and decentralised stabilisability
Exact methods for variable selection in principal component analysis: guide functions and pre-selection
Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
A numerical approach to surface Green's functions via generalized eigenvalue problems
The QR and QL algorithms for symmetric matrices
The QR algorithm for real Hessenberg matrices
Global convergence of tridiagonal QR algorithm with origin shifts
Presentation geométrique des méthodes de calcul des valeurs propres
The parameterized SR algorithm for symplectic (butterfly) matrices
To the memory of V. N. Kublanovskaya
An application of the discrete-time Toda lattice to the progressive algorithm by Lanczos and related problems
Computing surface Green's functions for semi-infinite systems on multilayered periodic structures
Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
Exact QR factorizations of rectangular matrices
Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
Towards optimal spatio-temporal decomposition of control-related sum-of-squares programs
A novel nonsymmetric K-Lanczos algorithm for the generalized nonsymmetric K-eigenvalue problems
Finding eigenvectors with a quantum variational algorithm
On computing the zeros of a class of Sobolev orthogonal polynomials
Global convergence of Hessenberg shifted QR. I: Exact arithmetic
Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
The numerical least squares solution of large linear systems -- a compromise between speed and accuracy
A note on the exact simulation of a random eigenvalue of a \textsc{gue} matrix

This page was built for publication: On some algorithms for the solution of the complete eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5335641)