By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gotze, J. ; Inst. of Network Theory & Circuit Design, Tech. Univ. Munich, West Germany ; Schwiegelshohn, U.

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

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989