Parallel algebraic reductions among numerical problems
From MaRDI portal
(Redirected from Parallel algebraic reductions among numerical problems)
This paper presents some preliminary results on parallel reducibility within approximation settings which apply to a number of linear algebra problems. Some approximation and transformation errors are shown as examples.
Recommendations
Cites work
- Fast parallel matrix and GCD computations
- Fast Parallel Matrix Inversion Algorithms
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- On computing the determinant in small parallel time using a small number of processors
- On Relating Time and Space to Size and Depth
- Oracle computations in parallel numerical linear algebra
Cited in
(5)- Oracle computations in parallel numerical linear algebra
- Parallel algorithms for certain matrix computations
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm
- Parallelism and algorithms for algebraic manipulation: current work
- Parallel algorithms for some algebraic operations on polynomial equations
This page was built for publication: Parallel algebraic reductions among numerical problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190636)