A Numerical Study of Efficient Sampling Strategies for Randomized Singular Value Decomposition

Siriwan Intawichai, Saifon Chaturantabut

Abstract


The randomized singular value decomposition (rSVD) method is a powerful dimension reduction technique that uses random projection matrices to project the data onto lower dimensional subspace. A crucial step of rSVD algorithm is the sampling process, which will be used further to generate a lowdimensional basis for the subspace of available data. To improve computational performance, this paper incorporates rSVD with different efficient sampling strategies, which include Gaussian sampling, uniform sampling, sparse sampling and sampling with K-mean clustering. The numerical tests compare the accuracy and the execution time used in computing optimal low-rank basis by applying rSVD with each of these sampling methods for an image reconstruction application.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|