The bit-cost of some algorithms for the solution of linear systems

DOI10.1016/0898-1221(88)90036-3zbMath0654.65027OpenAlexW1969720527MaRDI QIDQ1108740

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

zbMATH Keywords

Newton iterationGaussian eliminationJacobi iterationparallel processorscomputational costBit Parallel CostsBit Sequential Costtriangular Toeplitz linear system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• 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
• Complexity measures for matrix multiplication algorithms
• Fast multiplication of large numbers
• The bit-complexity of arithmetic algorithms
• Fast Multiple-Precision Evaluation of Elementary Functions
• Unnamed Item