DocumentCode
894994
Title
Modified Faddeeva algorithm for concurrent execution of linear algebraic operations
Author
Nash, J. Greg ; Hansen, Siegfried
Author_Institution
Hughes Res. Lab., Malibu, CA, USA
Volume
37
Issue
2
fYear
1988
fDate
2/1/1988 12:00:00 AM
Firstpage
129
Lastpage
137
Abstract
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 partitioned in a straightforward, numerically stable way. Numerous simulations have verified the algorithm´s correctness
Keywords
convergence of numerical methods; linear algebra; parallel algorithms; parallel architectures; concurrent execution; data flow architecture; full-rank matrix problems; linear algebraic operations; modified Faddeeva algorithm; numerically stable Given´s rotations; numerically-stable partitioning; systolic array; Application software; Computational modeling; Computer architecture; Hardware; Image processing; Linear algebra; Linear systems; Partitioning algorithms; Signal processing algorithms; Systolic arrays;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.2142
Filename
2142
Link To Document