Fast Inexact Implicitly Restarted Arnoldi Method for Generalized Eigenvalue Problems with Spectral Transformation

DOI10.1137/100786599zbMath1263.65041OpenAlexW2057217612MaRDI QIDQ2910964

Publication date: 12 September 2012

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.7895

zbMATH Keywords

numerical experiments relaxation preconditioner tuning two-phase algorithm inner iteration outer iteration subspace recycling spectral information inexact implicitly restarted Arnoldi method non-Hermitian eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items (10)

Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems ⋮ Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration ⋮ On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Spectral algorithms for multiple scale localized eigenfunctions in infinitely long, slightly bent quantum waveguides ⋮ Computing the smallest singular triplets of a large matrix ⋮ Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method ⋮ Backward error analysis and inverse eigenvalue problems for Hankel and symmetric-Toeplitz structures ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems

Uses Software

This page was built for publication: Fast Inexact Implicitly Restarted Arnoldi Method for Generalized Eigenvalue Problems with Spectral Transformation