Numerical linear algorithms and group theory
From MaRDI portal
Publication:1218719
DOI10.1016/0024-3795(75)90074-9zbMath0308.65025MaRDI QIDQ1218719
Publication date: 1975
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(75)90074-9
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
15A18: Eigenvalues, singular values, and eigenvectors
15A30: Algebraic systems of matrices
Related Items
Convergence of algorithms of decomposition type for the eigenvalue problem, Lie algebra representations, nilpotent matrices, and the \(C\)-numerical range, Optimal symplectic Householder transformations for \(SR\) decomposition, On some algebraic problems in connection with general eigenvalue algorithms, \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem, The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method, Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations, Two connections between the \(SR\) and \(HR\) eigenvalue algorithms, \(QR\)-like algorithms for eigenvalue problems, On matrix differential equations and abstract FG algorithm, Matrix factorizations for symplectic QR-like methods, Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches, On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms, The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices, Matrix differential equations: a continuous realization process for linear algebra problems
Cites Work