Paper: Efficient logarithmic time parallel algorithms for the cholesky decomposition and gram-schmidt process

Authors:
Ilan Bar-On
Affiliations:
-
Venue:
Parallel Computing
Year:
1991

Citing 10
Cited 1

Interconnection networks for large-scale parallel processing: theory and case studies

Interconnection networks for large-scale parallel processing: theory and case studies
Parallel QR Decomposition of a rectangular matrix

Numerische Mathematik
Implementation of some concurrent algorithms for matrix factorization

Parallel Computing
A practical parallel algorithm for solving band symmetric positive definite systems of linear equations

ACM Transactions on Mathematical Software (TOMS)
The symmetric eigenvalue problem

The symmetric eigenvalue problem
Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Algorithms and Matrix Computation

Parallel Algorithms and Matrix Computation
Introduction to Numerical Methods for Parallel Computers

Introduction to Numerical Methods for Parallel Computers
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Introduction to VLSI Systems

Introduction to VLSI Systems

A class of novel parallel algorithms for the solution of tridiagonal systems

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a parallel algorithm for finding the Cholesky decomposition of a symmetric positive definite matrix of order n, in O(log^2n) time using p = n^3/log^2n processors. This algorithm can be used in order to find the QR factorization of a full rank matrix in M(m x n), m = n. Alternatively, we give a more direct parallel algorithm of O(log n log m) time using p = m x n^2/(log n log m) processors.