Computing the field of values and pseudospectra using the Lanczos method with continuation

Thierry Braconnier, Nicholas J. Higham

    Research output: Contribution to journalArticlepeer-review

    Abstract

    The field of values and pseudospectra are useful tools for understanding the behaviour of various matrix processes. To compute these subsets of the complex plane it is necessary to estimate one or two eigenvalues of a large number of parametrized Hermitian matrices; these computations are prohibitively expensive for large, possibly sparse, matrices, if done by use of the QR algorithm. We describe an approach based on the Lanczos method with selective reorthogonalization and Chebyshev acceleration that, when combined with continuation and a shift and invert technique, enables efficient and reliable computation of the field of values and pseudospectra for large matrices. The idea of using the Lanczos method with continuation to compute pseudospectra is not new, but in experiments reported here our algorithm is faster and more accurate than existing algorithms of this type.
    Original languageEnglish
    Pages (from-to)422-440
    Number of pages18
    JournalBIT Numerical Mathematics
    Volume36
    Issue number3
    Publication statusPublished - Sept 1996

    Keywords

    • Chebyshev acceleration
    • Continuation
    • Field of values
    • Lanczos method
    • Pseudospectra

    Fingerprint

    Dive into the research topics of 'Computing the field of values and pseudospectra using the Lanczos method with continuation'. Together they form a unique fingerprint.

    Cite this