Abstract
A very simple and efficient algorithm called randomised pseudo-skeleton approximation is proposed for the decomposition of a low-rank matrix. The complexity of the algorithm is O(r3), where r is the rank of the matrix. Comparison with the adaptive cross-approximation method is presented to show its validity and efficiency.
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
