Processor Efficient Parallel Solution of Linear Systems of Equations

We present a deterministic parallel algorithm that solves a n-dimensional system Ax=b of linear equations over an ordered field or over a subfield of the complex numbers. This algorithm uses O(log2n) parallel time and O(max{M(n),n2(loglogn)/logn}) arithmetic processors if M(n) is the processor complexity of fast parallel matrix multiplication.

[1]  Franco P. Preparata,et al.  An Improved Parallel Processor Bound in Fast Matrix Inversion , 1978, Inf. Process. Lett..

[2]  Victor Y. Pan,et al.  Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields , 1996, Theor. Comput. Sci..

[3]  Victor Y. Pan,et al.  Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[4]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[5]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[6]  Victor Y. Pan,et al.  Processor efficient parallel solution of linear systems over an abstract field , 1991, SPAA '91.

[7]  Victor Y. Pan,et al.  Parallel Evaluation of the Determinant and of the Inverse of a Matrix , 1989, Inf. Process. Lett..

[8]  Erich Kaltofen,et al.  On randomized Lanczos algorithms , 1997, ISSAC.

[9]  Alexander L. Chistov,et al.  Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic , 1985, FCT.

[10]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[11]  Victor Y. Pan,et al.  Fast rectangular matrix multiplications and improving parallel matrix computations , 1997, PASCO '97.

[12]  V. Pan.  PARAMETRIZATION OF NEWTON'S ITERATION FOR COMPUTATIONS WITH STRUCTURED MATRICES AND APPLICATIONS , 1992 .

[13]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[14]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[15]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[16]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[17]  Wayne Eberly.  Processor-efficient parallel matrix inversion over abstract fields: two extensions , 1997, PASCO '97.

[18]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[19]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[20]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.