Complexity of parallel matrix computations
From MaRDI portal
DOI10.1016/0304-3975(87)90019-3zbMATH Open0641.68058OpenAlexW1995272909MaRDI QIDQ1100892FDOQ1100892
Authors: Victor Y. Pan 
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90019-3
Recommendations
Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Theory of operating systems (68N25) Numerical linear algebra (65Fxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of partial derivatives
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- How to multiply matrices faster
- On the computational power of pushdown automata
- Matching is as easy as matrix inversion
- Improved processor bounds for combinatorial problems in RNC
- Fast parallel matrix and GCD computations
- Parallel Algorithms for Algebraic Problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Fast Parallel Matrix Inversion Algorithms
- Title not available (Why is that?)
- Fast algorithms for the characteristic polynomial
- Title not available (Why is that?)
- An improved parallel processor bound in fast matrix inversion
- Title not available (Why is that?)
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
- Title not available (Why is that?)
- Algebraic complexity of computing polynomial zeros
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (32)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- The role of arithmetic in fast parallel matrix inversion
- Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Parallel algorithms for certain matrix computations
- Specified precision polynomial root isolation is in NC
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
- On the complexity of inverting integer and polynomial matrices
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- Matrix structures in parallel matrix computations
- Algebraic and numerical techniques for the computation of matrix determinants
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Fast and efficient parallel solution of dense linear systems
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Title not available (Why is that?)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Parallel solution of Toeplitzlike linear systems
- Successive matrix squaring algorithm for computing the Drazin inverse
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Algebraic complexity of computing polynomial zeros
- Parallel solution of linear systems by repeated squaring
- Fast parallel band matrix arithmetic
- Title not available (Why is that?)
- Complexity of Computations with Matrices and Polynomials
- Work-Preserving Speed-Up of Parallel Matrix Computations
- Parallel evaluation of the determinant and of the inverse of a matrix
- Title not available (Why is that?)
- Parallel algorithms for matrix polynomial division
- On polynomial ideals, their complexity, and applications
This page was built for publication: Complexity of parallel matrix computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100892)
