The Community for Technology Leaders
Green Image
An algorithm is described that provides an architectural framework for systematic execution of a wide class of linear algebraic operations using a single systolic array and simple data flow. The algorithm has been modified to use numerically stable Given's rotations and is therefore suited to any matrix problem of full rank. When the problem size exceeds that of the hardware array, it can be pa
modified Faddeeva algorithm; full-rank matrix problems; numerically-stable partitioning; data flow architecture; concurrent execution; linear algebraic operations; systolic array; numerically stable Given's rotations; convergence of numerical methods; linear algebra; parallel algorithms; parallel architectures.
J.G. Nash, S. Hansen, "Modified Faddeeva Algorithm for Concurrent Execution of Linear Algebraic Operations", IEEE Transactions on Computers, vol. 37, no. , pp. 129-137, February 1988, doi:10.1109/12.2142
90 ms
(Ver 3.3 (11022016))