Accession Number:

ADA280052

Title:

O(log2 n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Reif, John H.

Report Date:

1994-04-11

Pagination or Media Count:

31.0

Abstract:

Known polylog parallel algorithms for the solution of linear systems and related problems require computation of the characteristic polynomial or related forms, which are known to be highly unstable in practice. However, matrix factorizations of various types, bypassing computation of the characteristic polynomial, are used extensively in sequential numerical computations and are essential in many applications.

Descriptors:

• *MATRICES(MATHEMATICS)
• *PARALLEL PROCESSING
• ALGORITHMS
• LINEAR SYSTEMS
• SEQUENTIAL ANALYSIS
• DETERMINANTS(MATHEMATICS)
• POLYNOMIALS
• NUMERICAL ANALYSIS
• COMPUTATIONS
• TIME DEPENDENCE

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE