Speedup of linear stationary iteration processes in multiprocessor computers. I

DOI10.1007/BF01078050zbMath0545.65017OpenAlexW2005448443MaRDI QIDQ3334868

Ya. E. Romm

Publication date: 1982

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01078050

zbMATH Keywords

accelerationmultiprocessor systemsstationary iterative processes

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (3)

Machine error of parallel algorithms ⋮ Acceleration of linear stationary iterative processes in multiprocessor computers: II ⋮ Deterministic organization of index-based numerical parallel processing

Cites Work

• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• The Complexity of Parallel Evaluation of Linear Recurrences
• Iterative Solution of Linear Equations on a Parallel Processor System
• Generalizations of Horner's Rule for Polynomial Evaluation
• On Division by Functional Iteration
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Speedup of linear stationary iteration processes in multiprocessor computers. I