On some algorithms for the solution of the complete eigenvalue problem
From MaRDI portal
Publication:5335641
DOI10.1016/0041-5553(63)90168-XzbMATH Open0128.11702OpenAlexW2087788281WikidataQ55953351 ScholiaQ55953351MaRDI QIDQ5335641FDOQ5335641
Authors: V. N. Kublanovskaya
Publication date: 1961
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(63)90168-x
Cited In (27)
- On a functional approach to constructing projections onto invariant subspaces of matrices
- Two connections between the \(SR\) and \(HR\) eigenvalue algorithms
- A direct algorithm for pole assignment of time-invariant multi-input linear systems using state feedback
- \(QR\)-like algorithms for eigenvalue problems
- Exact methods for variable selection in principal component analysis: guide functions and pre-selection
- Eigenvalue computation in the 20th century
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- The QR and QL algorithms for symmetric matrices
- Schur parameter pencils for the solution of the unitary eigenproblem
- Presentation geométrique des méthodes de calcul des valeurs propres
- The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
- Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
- Exact QR factorizations of rectangular matrices
- The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
- Towards optimal spatio-temporal decomposition of control-related sum-of-squares programs
- To the memory of V. N. Kublanovskaya
- Global convergence of tridiagonal QR algorithm with origin shifts
- An application of the discrete-time Toda lattice to the progressive algorithm by Lanczos and related problems
- A numerical approach to surface Green's functions via generalized eigenvalue problems
- Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
- Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
- A novel nonsymmetric \(K\)-Lanczos algorithm for the generalized nonsymmetric \(K\)-eigenvalue problems
- \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
- Unstructured quotient fixed modes and decentralised stabilisability
- On the convergence of the \(QR\) algorithm with multishifts
- The QR algorithm for real Hessenberg matrices
- Computing surface Green's functions for semi-infinite systems on multilayered periodic structures
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)