Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
Numerische Mathematik
Complexity of parallel matrix computations
Theoretical Computer Science
Superfast solution of real positive definite toeplitz systems
SIAM Journal on Matrix Analysis and Applications
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Simple algorithms for approximating all roots of a polynomial with real roots
Journal of Complexity
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
On the complexity of polynomial zeros
SIAM Journal on Computing
Space and time efficient implementations of parallel nested dissection
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel solution of Toeplitzlike linear systems
Journal of Complexity
On parallel computations with banded matrices
Information and Computation
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm
IBM Journal of Research and Development
A view of three decades of linear filtering theory
IEEE Transactions on Information Theory
A complete modular resultant algorithm targeted for realization on graphics hardware
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
This paper gives improved parallel methods for several exact factorizations of some classes of symmetric positive definite (SPD) matrices. Our factorizations also provide us similarly efficient algorithms for exact computation of the solution of the corresponding linear systems (which need not be SPD), and for finding rank and determinant magnitude. We assume the input matrices have entries that are rational numbers expressed as a ratio of integers with at most a polynomial number of bits @b. We assume a parallel random access machine (PRAM) model of parallel computation, with unit cost arithmetic operations, including division, over a finite field Z"p, where p is a prime number whose binary representation is linear in the size of the input matrix and is randomly chosen by the algorithm. We require only bit precision O(n(@b+logn)), which is the asymptotically optimal bit precision for @b=logn. Our algorithms are randomized, giving the outputs with high likelihood =1-1/n^@W^(^1^). We compute LU and QR factorizations for dense matrices, and LU factorizations of sparse matrices which are s(n)-separable, reducing the known parallel time bounds for these factorizations from @W(log^3n) to O(log^2n), without an increase in processors (matching the best known work bounds of known parallel algorithms with polylog time bounds). Using the same parallel algorithm specialized to structured matrices, we compute LU factorizations for Toeplitz matrices and matrices of bounded displacement rank in time O(log^2n) with nloglogn processors, reducing by a nearly linear factor the best previous processor bounds for polylog times (however, these prior works did not generally require unit cost division over a finite field). We use this result to solve in the same bounds: polynomial resultant; and Pade approximants of rational functions; and in a factor O(logn) more time: polynomial greatest common divisors (GCD) and extended GCD; again reducing the best processor bounds by a nearly linear factor.