The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers

DOI10.1080/00207169808804671zbMath0901.65017OpenAlexW2089827800MaRDI QIDQ4392335

No author found.

Publication date: 26 November 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804671

zbMATH Keywords

computational complexitysplittingperformancesshared memory parallel computersquadrant interlocking iterative methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Sufficient conditions for the convergence of asynchronous iterations
• Chaotic relaxation
• Parallel iterative methods for solving linear equations

This page was built for publication: The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers