An orthogonal method for solving systems of linear equations without square roots and with few divisions

An algorithm is presented that requires only multiplications, additions, and a single division for the orthogonal solution of a system of linear equations. For that purpose the QR-decomposition of an extended system matrix, called the orthogonal Faddeeva algorithm, is computed by a square-root- and division-free Givens rotation, called scaled standard Givens rotation (SSGR). A special kind of number description, which is tailored to the standard Givens rotation, allows the execution of the SSGR solely by application of multiplications and additions. Therefore, the SSGR is highly suited for VLSI implementation. The roundoff error of the SSGR is as stable as the roundoff error of any available square-root-free Givens rotation, and its deviation factor is better.<<ETX>>

[1]  H. T. Kung,et al.  Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors , 1984 .

[2]  H. T. Kung,et al.  Matrix Triangularization By Systolic Arrays , 1982, Optics & Photonics.

[3]  Henry Y. H. Chuang,et al.  A size-independent systolic array for matrix triangularization and eigenvalue computation , 1988 .

[4]  W. E. Gentleman.  Least Squares Computations by Givens Transformations Without Square Roots , 1973 .

[5]  U. Schwiegelshohn,et al.  One- and two-dimensional systolic arrays for least-squares problems , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  Ilse C. F. Ipsen,et al.  Scaled givens rotations for the solution of linear least squares problems on systolic arrays , 1987 .

[7]  Ilse C. F. Ipsen,et al.  Systolic Networks for Orthogonal Decompositions , 1983 .

[8]  Ed F. Deprettere,et al.  Pipelined cordic architectures for fast VLSI filtering and array processing , 1984, ICASSP.

[9]  Franklin T. Luk,et al.  A Rotation Method for Computing the QR-Decomposition , 1986 .

[10]  J. Greg Nash,et al.  Modified Faddeeva Algorithm for Concurrent Execution of Linear Algebraic Operations , 1988, IEEE Trans. Computers.

[11]  S. Hammarling.  A Note on Modifications to the Givens Plane Rotation , 1974 .

[12]  Edward A. Lee,et al.  Least squares computation at arbitrarily high speeds , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[13]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[14]  Jean-Marc Delosme,et al.  Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[15]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .