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

DOI10.1080/00207168508803479MaRDI QIDQ3802604zbMATH OpenOpenAlexFDO

Authors 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

Cholesky's decompositionmatrix algorithmsparallel arithmetic computational complexitiesQR factorization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process
• The parallel QR factorization algorithm for tridiagonal linear systems
• scientific article; zbMATH DE number 440657
• scientific article; zbMATH DE number 641618
• Parallel QR decomposition of a rectangular matrix

Cites work

• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
• An improved parallel processor bound in fast matrix inversion
• Fast Parallel Matrix Inversion Algorithms
• scientific article; zbMATH DE number 3942900 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle

Cited in

(12)

• Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer
• Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process
• A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer
• Convergence analysis for a parallel Jacobi algorithm
• scientific article; zbMATH DE number 440657 (Why is no real title available?)
• Fast Parallel Algorithms for QR and Triangular Factorization
• On the parallel arithmetic complexity of the root-finding problem
• Parallel algorithm for householder transformation with applications to Ill-conditioned problems
• Parallel complexity of Householder QR factorization
• Parallel \textit{QR} factorization of block-tridiagonal matrices
• Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
• Parallel quadrant interlocking factorization on hypercube computers

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

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