Block Krylov-Schur method for large symmetric eigenvalue problems
From MaRDI portal
Publication:925250
DOI10.1007/s11075-008-9192-9zbMath1153.65330OpenAlexW2123154475MaRDI QIDQ925250
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
Related Items
Block iterative eigensolvers for sequences of correlated eigenvalue problems, Correlations in sequences of generalized eigenproblems arising in density functional theory, Trace-penalty minimization for large-scale eigenspace computation, A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, Krylov--Schur-Type Restarts for the Two-Sided Arnoldi Method, Hybrid eigensolvers for nuclear configuration interaction calculations, Krylov-Aware Stochastic Trace Estimation, A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems, Weighted Trace-Penalty Minimization for Full Configuration Interaction, KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Deflated block Krylov subspace methods for large scale eigenvalue problems, Spectral recycling strategies for the solution of nonlinear eigenproblems in thermoacoustics, Order reduction of bilinear MIMO dynamical systems using new block Krylov subspaces, A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems, Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors, Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation, A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- 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
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- An adaptive block Lanczos algorithm
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- A Krylov--Schur Algorithm for Large Eigenproblems
- 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
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Forward Instability of Tridiagonal QR
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Computing rank-revealing QR factorizations of dense matrices
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- ARPACK Users' Guide
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Forward Stability and Transmission of Shifts in the $QR$ Algorithm
- Implicit Shifting in the QR and Related Algorithms
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Algorithm 827
