2014•Unpublished venueRequires access

A Parallel Algorithm for Power Matrix Computation

JrJung Lyu, Ming‐Chang Lee

Abstract

Abstract⎯We present a parallel algorithm for power matrix A n in O(log 2 n) time using O(n 2.807 /log n) number of processors. It is shown that the growth rate of the proposed algorithm is the same as the parallel arithmetic complexity of matrix computations, including matrix inversion and solving systems of linear equations. Keywords⎯matrix computations, parallel algorithms, computational complexity 1.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Computation, Matrix (chemical analysis), Algorithm, Mathematics, Parallel algorithm, Matrix multiplication, Gaussian elimination, Band matrix