Optimal Scaling of Generalized and Polynomial Eigenvalue Problems

DOI10.1137/070704769zbMath1176.65038OpenAlexW1988256819MaRDI QIDQ3642834

Timo Betcke

Publication date: 6 November 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070704769

zbMATH Keywords

condition numberscalingbalancingbackward errorpolynomial eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (15)

An Algorithm for the Complete Solution of the Quartic Eigenvalue Problem ⋮ Parallel iterative refinement in polynomial eigenvalue problems ⋮ Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree ⋮ Backward error analysis of linearizing-balancing strategies for heavily damped quadratic eigenvalue problem ⋮ On the backward error incurred by the compact rational Krylov linearization ⋮ A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation ⋮ Perturbation, extraction and refinement of invariant pairs for matrix polynomials ⋮ A framework for analyzing nonlinear eigenproblems and parametrized linear systems ⋮ Structured eigenvalue condition numbers and linearizations for matrix polynomials ⋮ Krylov Approximation of Linear ODEs with Polynomial Parameterization ⋮ Backward error and conditioning of Fiedler companion linearizations ⋮ Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc ⋮ On the conditioning for heavily damped quadratic eigenvalue problem solved by linearizations ⋮ Tropical Roots as Approximations to Eigenvalues of Matrix Polynomials ⋮ Orthogonal iterations on companion-like pencils

This page was built for publication: Optimal Scaling of Generalized and Polynomial Eigenvalue Problems