Pages that link to "Item:Q2706278"

The following pages link to Thick-restart Lanczos method for large symmetric eigenvalue problems (Q2706278):

Displaying 50 items.

• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (Q2376857) (← links)
• Computational aspects of the stochastic finite element method (Q2383943) (← links)
• A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems (Q2430753) (← links)
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices (Q2494666) (← links)
• A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices (Q2638264) (← links)
• RP-LGMC: rating prediction based on local and global information with matrix clustering (Q2668644) (← links)
• Refined isogeometric analysis of quadratic eigenvalue problems (Q2674076) (← links)
• Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
• The infinite Lanczos method for symmetric nonlinear eigenvalue problems (Q2693970) (← links)
• GMRES algorithms over 35 years (Q2698151) (← links)
• Quantum spin solver near saturation: \(\mathrm{QS}^3\) (Q2701208) (← links)
• Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems (Q2790094) (← links)
• A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems (Q2818245) (← links)
• Feast eigensolver for non-Hermitian problems (Q2830645) (← links)
• Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems (Q2995496) (← links)
• A restarted Lanczos approximation to functions of a symmetric matrix (Q3058284) (← links)
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices (Q3447456) (← links)
• A new reorthogonalization in the Lanczos algorithm (Q3981725) (← links)
• (Q4499738) (← links)
• Numerical solution of linear eigenvalue problems (Q4608452) (← links)
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems (Q4632005) (← links)
• Two-Grid and Multiple-Grid Arnoldi for Eigenvalues (Q4691182) (← links)
• Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q4997345) (← links)
• Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
• Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q5161741) (← links)
• Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem (Q5218406) (← links)
• The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software (Q5230632) (← links)
• A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices (Q5230648) (← links)
• Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
• Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs (Q5254777) (← links)
• An invert-free Arnoldi method for computing interior eigenpairs of large matrices (Q5297939) (← links)
• An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems (Q5372017) (← links)
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems (Q5373928) (← links)
• Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides (Q5502423) (← links)
• Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides (Q5502424) (← links)
• Polynomial Preconditioned Arnoldi with Stability Control (Q5856683) (← links)
• Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems (Q5863874) (← links)
• External selective orthogonalization for the Lanczos algorithm in distributed memory environments (Q5941153) (← links)
• PairDiag: an exact diagonalization program for solving general pairing Hamiltonians (Q6045162) (← links)
• A compact heart iteration for low-rank approximations of large matrices (Q6049289) (← links)
• Limited‐memory polynomial methods for large‐scale matrix functions (Q6068267) (← links)
• A fast diagonal distance metric learning approach for large-scale datasets (Q6092062) (← links)
• Krylov-Aware Stochastic Trace Estimation (Q6094742) (← links)
• Bootstrapped block Lanczos for large-dimension eigenvalue problems (Q6112688) (← links)
• Thick-restarted joint Lanczos bidiagonalization for the GSVD (Q6126037) (← links)
• PairDiagSph: generalization of the exact pairing diagonalization program for spherical systems (Q6161939) (← links)
• Deflated and restarted Krylov subspace methods for Sylvester tensor equations (Q6166090) (← links)
• A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation (Q6491444) (← links)
• Parallel adaptive FETI-DP using lightweight asynchronous dynamic load balancing (Q6497677) (← links)
• An adaptive eigenfunction basis strategy to reduce design dimension in topology optimization (Q6554068) (← links)