The bit-cost of some algorithms for the solution of linear systems
DOI10.1016/0898-1221(88)90036-3zbMATH Open0654.65027OpenAlexW1969720527MaRDI QIDQ1108740FDOQ1108740
Authors: Bruno Codenotti 
Publication date: 1988
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90036-3
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
Gaussian eliminationcomputational costNewton iterationJacobi iterationparallel processorsBit Parallel CostsBit Sequential Costtriangular Toeplitz linear system
Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Fast multiplication of large numbers
- Fast Multiple-Precision Evaluation of Elementary Functions
- Title not available (Why is that?)
- Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems
- Round-off error analysis of iterations for large linear systems
- The bit-complexity of arithmetic algorithms
- Complexity measures for matrix multiplication algorithms
Cited In (5)
- Improved Parallel Polynomial Division
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
- Title not available (Why is that?)
- The theoretical cost of sequential and parallel algorithms for solving linear systems of 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)
