Abstract
The rank revealing QR factorization is a useful tool in many signal processing applications; since it explicitly yields all the necessary information to solve rank deficient least-squares problems and subset selection problems, to compute signal and noise subspaces, etc. The authors present a systolic algorithm for computing a rank revealing QR factorization, and consider the performance of the algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
