Pages that link to "Item:Q3936103"
From MaRDI portal
The following pages link to Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization (Q3936103):
Displaying 13 items.
- A subspace preconditioning algorithm for eigenvector/eigenvalue computation (Q675699) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Solving sparse symmetric definite quadratic lambda-matrix problems (Q1161244) (← links)
- A refinement method for maximal deflating bases of regular pencils (Q1330474) (← links)
- Numerical solution of large nonsymmetric eigenvalue problems (Q1330635) (← links)
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices (Q1343049) (← links)
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem (Q1578093) (← links)
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (Q1855433) (← links)
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems (Q1923881) (← links)
- Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits (Q1965174) (← links)
- Quantum algorithm for Laplacian eigenmap via Rayleigh quotient iteration (Q2102192) (← links)
- A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems (Q4569317) (← links)
- Sparse matrices (Q5903172) (← links)