A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices

From MaRDI portal
Publication:433291

DOI10.1016/J.AMC.2012.01.013zbMATH Open1246.65065arXiv1001.3258OpenAlexW1973321137MaRDI QIDQ433291FDOQ433291

Datian Niu, Xuegang Yuan

Publication date: 13 July 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: This paper proposes a harmonic Lanczos bidiagonalization method for computing some interior singular triplets of large matrices. It is shown that the approximate singular triplets are convergent if a certain Rayleigh quotient matrix is uniformly bounded and the approximate singular values are well separated. Combining with the implicit restarting technique, we develop an implicitly restarted harmonic Lanczos bidiagonalization algorithm and suggest a selection strategy of shifts. Numerical experiments show that one can use this algorithm to compute interior singular triplets efficiently.


Full work available at URL: https://arxiv.org/abs/1001.3258




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433291)