A method for computing a few eigenpairs of large generalized eigenvalue problems
From MaRDI portal
Publication:2085682
Recommendations
- A Moment-Based Method for Large-Scale Generalized Eigenvalue Problems
- scientific article; zbMATH DE number 1113885
- scientific article; zbMATH DE number 3231496
- scientific article; zbMATH DE number 3978275
- An algorithm for solution of large eigenvalue problems
- scientific article; zbMATH DE number 63739
- scientific article; zbMATH DE number 3104957
- A numerical method of determining eigenvalues of matrices of arbitrary large size
- Computational methods for large eigenvalue problems
- A numerical method for computing eigenvectors of a large matrix
Cites work
- A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- A fast algorithm for solving regularized total least squares problems
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- A survey on variational characterizations for nonlinear eigenvalue problems
- Accelerating the LSTRS algorithm
- An Arnoldi method for nonlinear eigenvalue problems
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Efficient determination of the hyperparameter in regularized total least squares problems
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Krylov type subspace methods for matrix polynomials
- Numerical methods for large eigenvalue problems
- Numerical methods for large eigenvalue problems
- Perturbation analysis for palindromic and anti-palindromic nonlinear eigenvalue problems
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Tikhonov regularization based on generalized Krylov subspace methods
- Tikhonov regularization via flexible Arnoldi reduction
Cited in
(12)- scientific article; zbMATH DE number 7012553 (Why is no real title available?)
- A prediction-correction dynamic method for large-scale generalized eigenvalue problems
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- The two-phase method for finding a great number of eigenpairs of the symmetric or weakly non-symmetric large eigenvalue problems
- Generalized subspace iteration method for solving matrix pair eigenproblem
- scientific article; zbMATH DE number 3104957 (Why is no real title available?)
- Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem
- Augmentation of the generalised \(n\times n\) eigenvalue equation to a generalised \((n+1)\times (n+1)\) eigenvalue equation
- scientific article; zbMATH DE number 1507107 (Why is no real title available?)
- Computation of selected eigenvalues of generalized eigenvalue problem
- A Moment-Based Method for Large-Scale Generalized Eigenvalue Problems
- A numerical method of determining eigenvalues of matrices of arbitrary large size
This page was built for publication: A method for computing a few eigenpairs of large generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085682)
