Abstract
This article presents an URV-based matrix decomposition, the truncated URV decomposition, and an updating algorithm for it. The complexity of the updating is for an m-by- n matrix of rank r. The theoretical and numerical results presented shows that the decomposition can be a good alternative to the singular value decomposition.
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
