A fully parallel symmetric matrix transformation
A parallel algorithm for the transformation LALT of an nxn symmetric A through a nonsingular triangular L is presented. Speedup and efficiency successively are of O((n3+n2)/(1+[log n])) and O(1/(1+[log n])) with O(1+[log n]) parallel time.
Unable to display preview. Download preview PDF.