Numerical Methods for Eigenvalue Problems

DOI10.1515/9783110250374zbMath1254.65046OpenAlexW602955464MaRDI QIDQ2996612

Christian Mehl, Steffen Börm

Publication date: 3 May 2011

Full work available at URL: https://doi.org/10.1515/9783110250374

zbMATH Keywords

algorithmconvergencetextbookeigenvectorscharacteristic polynomialsgeneralized eigenvalue probleminvariant subspacesJacobi iterationeigenvalue problemsKrylov subspace methodsLanczos algorithmbisection methodsSchur decompositionQR iterationArnoldi iterationlarge sparse matricesQZ algorithmpolynomial eigenvalue problemsGershgorin circlesHouseholder transfromationlinear operators in finite-dimensional spaces

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Orthogonalization in numerical linear algebra (65F25)

Related Items (3)

Flows generating nonlinear eigenfunctions ⋮ Distributed discrete‐time optimization algorithms with applications to resource allocation in epidemics control ⋮ Computation of lossy higher order modes in complex SRF cavities using Beyn’s and Newton’s methods on reduced order models

This page was built for publication: Numerical Methods for Eigenvalue Problems