Block Krylov-Schur method for large symmetric eigenvalue problems
From MaRDI portal
Publication:925250
DOI10.1007/S11075-008-9192-9zbMATH Open1153.65330OpenAlexW2123154475MaRDI QIDQ925250FDOQ925250
Authors: Yunkai Zhou, Y. Saad 
Publication date: 3 June 2008
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-008-9192-9
Recommendations
- A Krylov--Schur algorithm for large eigenproblems
- scientific article; zbMATH DE number 238289
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- A periodic Krylov-Schur algorithm for large matrix products
Cites Work
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Algorithm 827
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- Numerical methods for large eigenvalue problems
- Computing rank-revealing QR factorizations of dense matrices
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Krylov--Schur algorithm for large eigenproblems
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- An adaptive block Lanczos algorithm
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- Forward Instability of Tridiagonal QR
- Title not available (Why is that?)
- Forward Stability and Transmission of Shifts in the $QR$ Algorithm
- Implicit Shifting in the QR and Related Algorithms
Cited In (34)
- Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation
- A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems.
- Randomized block Krylov methods for approximating extreme eigenvalues
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- Title not available (Why is that?)
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Krylov-Aware Stochastic Trace Estimation
- Krylov-Schur-type restarts for the two-sided Arnoldi method
- Hybrid eigensolvers for nuclear configuration interaction calculations
- A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems
- Spectral recycling strategies for the solution of nonlinear eigenproblems in thermoacoustics.
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- Title not available (Why is that?)
- Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems
- Weighted Trace-Penalty Minimization for Full Configuration Interaction
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- Order reduction of bilinear MIMO dynamical systems using new block Krylov subspaces
- KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners
- Block iterative eigensolvers for sequences of correlated eigenvalue problems
- Correlations in sequences of generalized eigenproblems arising in density functional theory
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- A periodic Krylov-Schur algorithm for large matrix products
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
- Title not available (Why is that?)
- Trace-penalty minimization for large-scale eigenspace computation
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- A Krylov--Schur algorithm for large eigenproblems
Uses Software
This page was built for publication: Block Krylov-Schur method for large symmetric eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925250)
