Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
From MaRDI portal
Publication:5346754
DOI10.1137/16M1058534zbMATH Open1365.65096MaRDI QIDQ5346754FDOQ5346754
Authors: Zaiwen Wen, Yin Zhang
Publication date: 29 May 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- Block algorithms with augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations
- An accelerated subspace method for generalized eigenproblems
- Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
iterative algorithmconvergenceKrylov subspacesymmetric matricespower methodRayleigh-Ritz procedureextreme eigenpairslarge-scale eigenpair computation
Cites Work
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Title not available (Why is that?)
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- Numerical methods for large eigenvalue problems
- Title not available (Why is that?)
- An adaptive block Lanczos algorithm
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Title not available (Why is that?)
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Convergence of the block Lanczos method for eigenvalue clusters
- A Simultaneous Iteration Algorithm for Real Matrices
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Implicitly restarted Arnoldi methods and subspace iteration
- Title not available (Why is that?)
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Simultaneous iteration method for symmetric matrices
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
Cited In (7)
- Block algorithms with augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- A brief introduction to manifold optimization
- An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds
- Stochastic Gauss-Newton algorithms for online PCA
- Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations
- Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
Uses Software
This page was built for publication: Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346754)