Pages that link to "Item:Q4172855"

The following pages link to The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix (Q4172855):

Displaying 9 items.

• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems (Q500356) (← links)
• Global infimum of strictly convex quadratic functions with bounded perturbations (Q604811) (← links)
• Evaluation of matrix functions with the block Lanczos algorithm (Q678426) (← links)
• On convergence of iterative projection methods for symmetric eigenvalue problems (Q730577) (← links)
• A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems (Q1062424) (← links)
• Lanczos method of tridiagonalization, Jacobi matrices and physics (Q1155942) (← links)
• On conjugate gradient-like methods for eigen-like problems (Q1923871) (← links)
• RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES (Q3146523) (← links)
• Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices (Q3886737) (← links)