A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
From MaRDI portal
Publication:4118720
DOI10.1109/TC.1977.5009293zbMath0348.65028MaRDI QIDQ4118720
Publication date: 1977
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
On computing accurate singular values and eigenvalues of matrices with acyclic graphs, A shifted method for solving symmetric eigenvalue problems, A fast and stable parallel QR algorithm for symmetric tridiagonal matrices, Some algorithms for the solution of the symmetric eigenvalue problem on a multiprocessor electronic computer, Properties of a matrix, inverse to a Hessenberg matrix, A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix, On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices, Parallel complexities and computations of cholesky's decomposition and QR factorization, On the parallel arithmetic complexity of the root-finding problem, On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization, Parallel discrete invariant embedding algorithm for singular pertubation problems, A parallel implementation of Wang's method for solving tridiagonal systems, Parallel computations in linear algebra. II, Parallel direct linear system solvers - a survey, LU factorization on parallel computers, Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations
