Parallel complexities and computations of cholesky's decomposition and QR factorization

DOI10.1080/00207168508803479zbMath0655.68038OpenAlexW2039527536MaRDI QIDQ3802604

Karabi Datta

Publication date: 1985

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168508803479

zbMATH Keywords

QR factorizationmatrix algorithmsCholesky's decompositionparallel arithmetic computational complexities

Mathematics Subject Classification ID

Related Items (3)

Convergence analysis for a parallel Jacobi algorithm ⋮ Parallel algorithm for householder transformation with applications to Ill-conditioned problems ⋮ On the parallel arithmetic complexity of the root-finding problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved parallel processor bound in fast matrix inversion
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• Fast Parallel Matrix Inversion Algorithms
• The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

This page was built for publication: Parallel complexities and computations of cholesky's decomposition and QR factorization