A Parallel Implementation of Lanczos Algorithm in SVD Computation
نویسنده
چکیده
This work presents a parallel implementation of Lanczos algorithm for SVD Computation using MPI. We investigate execution time as a function of matrix sparsity, matrix size, and the number of processes. We observe speedup and slowdown for parallelized Lanczos algorithm. Reasons for the speedups and the slowdowns are discussed in the report.
منابع مشابه
Parallel One - Sided Block - Jacobi Svd Algorithm
A new dynamic ordering is presented for the parallel one-sided block Jacobi SVD algorithm. Similarly to the two-sided variant, which has been analyzed and implemented in last 10 years, the dynamic ordering takes into account the actual status of a matrix—this time of its block columns with respect to their mutual orthogonality. Using p processors, in each parallel iteration step the p mostly in...
متن کاملSome Software Packages for Partial SVD Computation
This technical report introduces some software packages for partial SVD computation, including optimized PROPACK, modified PROPACK for computing singular values above a threshold and the corresponding singular vectors, and block Lanczos with warm start (BLWS). The current version is preliminary. The details will be enriched soon.
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملA Robust and Efficient Parallel SVD Solver Based on Restarted Lanczos Bidiagonalization
Lanczos bidiagonalization is a competitive method for computing a partial singular value decomposition of a large sparse matrix, that is, when only a subset of the singular values and corresponding singular vectors are required. However, a straightforward implementation of the algorithm has the problem of loss of orthogonality between computed Lanczos vectors, and some reorthogonalization techn...
متن کاملRobust Parallel Implementation of a Lanczos-based Algorithm for an Structured Electromagnetic Eigenvalue Problem
This paper describes a parallel implementation of a Lanczos-based method to solve generalised eigenvalue problems related to the modal computation of arbitrarily shaped waveguides. This efficient implementation is intended for execution mainly in moderate-low cost workstations (2 to 4 processors). The problem under study has several features: the involved matrices are sparse with a certain stru...
متن کامل