On some algorithms for the solution of the complete eigenvalue problem
From MaRDI portal
Publication:5335641
DOI10.1016/0041-5553(63)90168-XzbMath0128.11702OpenAlexW2087788281WikidataQ55953351 ScholiaQ55953351MaRDI QIDQ5335641
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
Related Items
Exact methods for variable selection in principal component analysis: guide functions and pre-selection, A direct algorithm for pole assignment of time-invariant multi-input linear systems using state feedback, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, An application of the discrete-time Toda lattice to the progressive algorithm by Lanczos and related problems, To the memory of V. N. Kublanovskaya, Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy, On the convergence of the \(QR\) algorithm with multishifts, Two connections between the \(SR\) and \(HR\) eigenvalue algorithms, Exact QR factorizations of rectangular matrices, A numerical approach to surface Green's functions via generalized eigenvalue problems, Schur parameter pencils for the solution of the unitary eigenproblem, The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices, A novel nonsymmetric \(K\)-Lanczos algorithm for the generalized nonsymmetric \(K\)-eigenvalue problems, Computing surface Green's functions for semi-infinite systems on multilayered periodic structures, Unstructured quotient fixed modes and decentralised stabilisability, Matrix Bruhat decompositions with a remark on the QR(GR) algorithm, 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, On a functional approach to constructing projections onto invariant subspaces of matrices, \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem, Eigenvalue computation in the 20th century, \(QR\)-like algorithms for eigenvalue problems, The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
