sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation

sparsified randomization monte carlo (srmc) algorithms introduced in our recent paper [60] for solving systems of linear algebraic equations are extended to construct the svd-based randomized low rank approximations for large matrices. we suggest some efficient implementations of srmc based on low rank approximations, and give different applications. in particular, an important application we present in this paper is a fast simulation algorithm for a randomized approximation of non-homogeneous random fields based on a discrete version of the karhunen-loéve expansion. we present two examples of non-homogeneous random field simulation which include a long-correlated lorenzian random field and the fractional wiener process. another application we deal in this paper concerns the randomized solvers for large linear systems. we suggest a hybrid method which combines srmc with an algorithm for solving boundary integral equations based on a separation representation of the kernel. this method is illustrated in this paper by solving a 2d boundary integral equation from potential theory governing the dirichlet problem for the laplace equation.