A method for computing a few eigenpairs of large generalized eigenvalue problems
type: Item
instance of: scholarly article
title: A method for computing a few eigenpairs of large generalized eigenvalue problems
zbMATH Open document ID: 1505.65169
author: Maged Alkilayh
author: Qiang Ye
author: Lothar Reichel
published in: Applied Numerical Mathematics
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 7603731
zbMATH Keywords: generalized Krylov subspace method
zbMATH Keywords: generalized eigenvalue problem
zbMATH Keywords: large-scale problem
describes a project that uses: EIGIFP
describes a project that uses: MatrixMarket
MaRDI profile type: Publication
full work available at URL: j.apnum.2022.08.018
OpenAlex ID: W4293474932
cites work: Perturbation analysis for palindromic and anti-palindromic nonlinear eigenvalue problems
cites work: IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
cites work: The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
cites work: An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
cites work: A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
cites work: Krylov type subspace methods for matrix polynomials
cites work: A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
cites work: Accelerating the LSTRS Algorithm
cites work: A fast algorithm for solving regularized total least squares problems
cites work: Efficient determination of the hyperparameter in regularized total least squares problems
cites work: A survey on variational characterizations for nonlinear eigenvalue problems
cites work: A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
cites work: Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
cites work: A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
cites work: Tikhonov regularization based on generalized Krylov subspace methods
cites work: Tikhonov regularization via flexible Arnoldi reduction
cites work: Numerical Methods for Large Eigenvalue Problems
cites work: Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
cites work: Numerical methods for large eigenvalue problems
cites work: An Arnoldi method for nonlinear eigenvalue problems
DOI: 10.1016/J.APNUM.2022.08.018
Recommended article: A Moment-Based Method for Large-Scale Generalized Eigenvalue Problems
Recommended article: Q4375664
Recommended article: Q5519493
Recommended article: Q3742611
Recommended article: An algorithm for solution of large eigenvalue problems
Recommended article: Q4013076
Recommended article: Q5843704
Recommended article: A numerical method of determining eigenvalues of matrices of arbitrary large size
Recommended article: Computational methods for large eigenvalue problems
Recommended article: A numerical method for computing eigenvectors of a large matrix
description: scientific article; zbMATH DE number 7603731