Inverse iteration with (possibly shifted) solves for eigenpair refinement

MaRDI QIDQ6825361FDO

Solves linear systems with (A−σI) to accelerate convergence to an eigenpair near σ; often used after coarse estimates. Forms the basis of Rayleigh quotient iteration and modern refinement stages.

Described by source

• The Finite Element Method for Elliptic Problems

This page was built for algorithm: Inverse iteration with (possibly shifted) solves for eigenpair refinement