Numerical methods for eigenvalue problems.
convergenceKrylov subspace methodseigenvectorsalgorithmeigenvalue problemstextbookgeneralized eigenvalue problemcharacteristic polynomialsinvariant subspacesLanczos algorithmArnoldi iterationlarge sparse matricesJacobi iterationQZ algorithmSchur decompositionQR iterationpolynomial eigenvalue problemsbisection methodsGershgorin circlesHouseholder transfromationlinear operators in finite-dimensional spaces
Computational methods for sparse matrices (65F50) Eigenvalues, singular values, and eigenvectors (15A18) Factorization of matrices (15A23) Inequalities involving eigenvalues and eigenvectors (15A42) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
- scientific article; zbMATH DE number 52138 (Why is no real title available?)
- A complex-projected Rayleigh quotient iteration for targeting interior eigenvalues
- Symmetric structured finite element model updating with prescribed partial eigenvalues while maintaining no spillover
- Numerical analysis of generalised max-plus eigenvalue problems.
- Computation of lossy higher order modes in complex SRF cavities using Beyn’s and Newton’s methods on reduced order models
- Flows generating nonlinear eigenfunctions
- Numerical solution of linear eigenvalue problems
- Finite-time distributed topology design for optimal network resilience
- The Matrix Eigenvalue Problem
- scientific article; zbMATH DE number 432500 (Why is no real title available?)
- Distributed discrete-time optimization algorithms with applications to resource allocation in epidemics control
This page was built for publication: Numerical methods for eigenvalue problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996612)
