Show simple item record

dc.contributor.authorWen, Zaiwen
Zhang, Yin
dc.date.accessioned 2018-06-19T17:50:45Z
dc.date.available 2018-06-19T17:50:45Z
dc.date.issued 2016-01
dc.identifier.citation Wen, Zaiwen and Zhang, Yin. "Accelerating Convergence by Augmented Rayleigh-Ritz Projections For Large-Scale Eigenpair Computation." (2016) https://hdl.handle.net/1911/102241.
dc.identifier.urihttps://hdl.handle.net/1911/102241
dc.description.abstract Iterative algorithms for large-scale eigenpair computation are mostly based subspace projections consisting of two main steps: a subspace update (SU) step that generates bases for approximate eigenspaces, followed by a Rayleigh-Ritz (RR) projection step that extracts approximate eigenpairs. A predominant methodology for the SU step makes use of Krylov subspaces that builds orthonormal bases piece by piece in a sequential manner. On the other hand, block methods such as the classic (simultaneous) subspace iteration, allow higher levels of concurrency than what is reachable by Krylov subspace methods, but may suffer from slow convergence. In this work, we analyze the rate of convergence for a simple block algorithmic framework that combines an augmented Rayleigh-Ritz (ARR) procedure with the subspace iteration. Our main results are Theorem 4.5 and its corollaries which show that the ARR procedure can provide significant accelerations to convergence speed. Our analysis will offer useful guidelines for designing and implementing practical algorithms from this framework.
dc.format.extent 22 pp
dc.title Accelerating Convergence by Augmented Rayleigh-Ritz Projections For Large-Scale Eigenpair Computation
dc.type Technical report
dc.date.note January 2016
dc.identifier.digital TR16-01
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record