Recommendations
Cites work
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Algebraic complexity of computing polynomial zeros
- An improved parallel processor bound in fast matrix inversion
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
- Fast algorithms for the characteristic polynomial
- Fast parallel matrix and GCD computations
- Fast Parallel Matrix Inversion Algorithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- How to multiply matrices faster
- scientific article; zbMATH DE number 3965444 (Why is no real title available?)
- scientific article; zbMATH DE number 3989401 (Why is no real title available?)
- scientific article; zbMATH DE number 4005454 (Why is no real title available?)
- scientific article; zbMATH DE number 3679047 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3566175 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- Improved processor bounds for combinatorial problems in RNC
- Matching is as easy as matrix inversion
- On the computational power of pushdown automata
- Parallel Algorithms for Algebraic Problems
- The complexity of partial derivatives
Cited in
(35)- Algebraic complexity of computing polynomial zeros
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Parallel evaluation of the determinant and of the inverse of a matrix
- Matrix structures in parallel matrix computations
- Parallel solution of Toeplitzlike linear systems
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Oracle computations in parallel numerical linear algebra
- Specified precision polynomial root isolation is in NC
- Fast parallel band matrix arithmetic
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Algebraic and numerical techniques for the computation of matrix determinants
- Parallel algorithms for certain matrix computations
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Successive matrix squaring algorithm for computing the Drazin inverse
- Fast and efficient parallel solution of dense linear systems
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Efficient parallel factorization and solution of structured and unstructured linear systems
- scientific article; zbMATH DE number 3934409 (Why is no real title available?)
- scientific article; zbMATH DE number 3965444 (Why is no real title available?)
- scientific article; zbMATH DE number 3967800 (Why is no real title available?)
- Complexity of Computations with Matrices and Polynomials
- scientific article; zbMATH DE number 1254016 (Why is no real title available?)
- scientific article; zbMATH DE number 1302051 (Why is no real title available?)
- scientific article; zbMATH DE number 741169 (Why is no real title available?)
- scientific article; zbMATH DE number 2069330 (Why is no real title available?)
- Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
- Work-Preserving Speed-Up of Parallel Matrix Computations
- On polynomial ideals, their complexity, and applications
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
- The role of arithmetic in fast parallel matrix inversion
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Parallel algorithms for matrix polynomial division
- On the complexity of inverting integer and polynomial matrices
- Parallel solution of linear systems by repeated squaring
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)
