A Parallel QR Algorithm for Symmetric Tridiagonal Matrices

DOI10.1109/TC.1977.5009293MaRDI QIDQ4118720zbMATH OpenFDO

Authors Ahmed H. Sameh, David Kuck

Publication date 1977

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09)

Cited in

(16)

• On the parallel arithmetic complexity of the root-finding problem
• LU factorization on parallel computers
• On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices
• Properties of a matrix, inverse to a Hessenberg matrix
• Parallel computations in linear algebra. II
• Parallel direct linear system solvers - a survey
• A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
• Parallel complexities and computations of cholesky's decomposition and QR factorization
• A shifted method for solving symmetric eigenvalue problems
• A parallel implementation of Wang's method for solving tridiagonal systems
• A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
• Parallel discrete invariant embedding algorithm for singular pertubation problems
• Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations
• On computing accurate singular values and eigenvalues of matrices with acyclic graphs
• On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
• Some algorithms for the solution of the symmetric eigenvalue problem on a multiprocessor electronic computer

This page was built for publication: A Parallel QR Algorithm for Symmetric Tridiagonal Matrices

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