The bit-cost of some algorithms for the solution of linear systems
From MaRDI portal
Publication:1108740
Recommendations
- The theoretical cost of sequential and parallel algorithms for solving linear systems of equations
- scientific article; zbMATH DE number 4076454
- Parallel Solution of Certain Toeplitz Linear Systems
- On the cost of sequential and parallel algorithms for solving linear system of equations
- scientific article; zbMATH DE number 17430
Cites work
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- Complexity measures for matrix multiplication algorithms
- Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems
- Fast Multiple-Precision Evaluation of Elementary Functions
- Fast multiplication of large numbers
- Round-off error analysis of iterations for large linear systems
- The bit-complexity of arithmetic algorithms
Cited in
(5)- scientific article; zbMATH DE number 3970525 (Why is no real title available?)
- The theoretical cost of sequential and parallel algorithms for solving linear systems of equations
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
- Improved Parallel Polynomial Division
- Bit-complexity of solving systems of linear evolutionary partial differential equations
This page was built for publication: The bit-cost of some algorithms for the solution of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108740)