Matrix structures in parallel matrix computations (Q1122309): Difference between revisions

Survey of algorithmic complexity for parallel algorithms for triangular and banded Toeplitz matrices (constant value along a diagonal) and matrix multiplication. Communication is neglected and thus the author writes: ``Although this model is unrealistic, it allows us to analyse algorithms independently of a specific architecture''.