By Topic

New recursive algorithm for solving linear algebraic equations

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
$33 $33
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

3 Author(s)
X. Yu ; Dept. of Electr. Eng., Windsor Univ., Ont., Canada ; N. K. Loh ; W. C. Miller

The authors present a new recursive algorithm for solving linear algebraic equations Ax=b. With this algorithm, the ith step recursion can find one solution of the first i equations; the unique solution of the total n equations could be found after the nth step recursion. Because of this recursive property, the algorithm can be used not only in solving ill-conditioned equations but also in recursive identification, signal processing and many other areas.

Published in:

Electronics Letters  (Volume:28 ,  Issue: 22 )