A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems
From MaRDI portal
Publication:4569317
DOI10.1137/17M112141XzbMath1391.65092OpenAlexW2809685926MaRDI QIDQ4569317
No author found.
Publication date: 28 June 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m112141x
preconditioninglocal convergencenonlinear eigenproblemthick restartharmonic projectionsoft deflation
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Matrix pencils (15A22)
Related Items
The infinite Lanczos method for symmetric nonlinear eigenvalue problems, Nonlinearizing Two-parameter Eigenvalue Problems
Uses Software
Cites Work
- Unnamed Item
- PRIMME
- An integral method for solving nonlinear eigenvalue problems
- Nonlinear Rayleigh functionals
- A linear eigenvalue algorithm for the nonlinear eigenvalue problem
- Perturbation, extraction and refinement of invariant pairs for matrix polynomials
- A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
- Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems
- Chebyshev interpolation for nonlinear eigenvalue problems
- Computing interior eigenvalues of large matrices
- A block Newton method for nonlinear eigenvalue problems
- Nonlinear Rayleigh-Ritz iterative method for solving large scale nonlinear eigenvalue problems
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Preconditioning eigensolvers -- an Oxymoron?
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
- Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems. I. Classical algorithms
- Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems: II. Accelerated algorithms
- The Quadratic Eigenvalue Problem
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- Robust Successive Computation of Eigenpairs for Nonlinear Eigenvalue Problems
- Computing a Partial Schur Factorization of Nonlinear Eigenvalue Problems Using the Infinite Arnoldi Method
- A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems
- Solving Rational Eigenvalue Problems via Linearization
- NLEVP
- Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The nonlinear eigenvalue problem
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Rational Krylov Method Based on Hermite Interpolation for Nonlinear Eigenvalue Problems
- A Krylov Method for the Delay Eigenvalue Problem
- Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- The Infinite Bi-Lanczos Method for Nonlinear Eigenvalue Problems
- Vector Spaces of Linearizations for Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Several properties of invariant pairs of nonlinear algebraic eigenvalue problems
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
