An algorithm to compute sepλ

Research output: Contribution to journalArticle

Abstract

The following problem is addressed: given square matrices A and B, compute the smallest ε such that A + E and B + F have a common eigenvalue for some E, F with max(∥E∥, ∥F∥2) ≤ ε. An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.

Original languageEnglish (US)
Pages (from-to)348-359
Number of pages12
JournalSIAM Journal on Matrix Analysis and Applications
Volume28
Issue number2
DOIs
StatePublished - 2006

Fingerprint

Eigenvalue
Square matrix

Keywords

  • Eigenvalue perturbation
  • Eigenvalue separation
  • Pencil
  • Pseudospectra

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics
  • Analysis

Cite this

An algorithm to compute sepλ. / Gu, Ming; Overton, Michael L.

In: SIAM Journal on Matrix Analysis and Applications, Vol. 28, No. 2, 2006, p. 348-359.

Research output: Contribution to journalArticle

@article{b9a29cec739046efaf96df2b4d7a857d,
title = "An algorithm to compute sepλ",
abstract = "The following problem is addressed: given square matrices A and B, compute the smallest ε such that A + E and B + F have a common eigenvalue for some E, F with max(∥E∥, ∥F∥2) ≤ ε. An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.",
keywords = "Eigenvalue perturbation, Eigenvalue separation, Pencil, Pseudospectra",
author = "Ming Gu and Overton, {Michael L.}",
year = "2006",
doi = "10.1137/050622584",
language = "English (US)",
volume = "28",
pages = "348--359",
journal = "SIAM Journal on Matrix Analysis and Applications",
issn = "0895-4798",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - An algorithm to compute sepλ

AU - Gu, Ming

AU - Overton, Michael L.

PY - 2006

Y1 - 2006

N2 - The following problem is addressed: given square matrices A and B, compute the smallest ε such that A + E and B + F have a common eigenvalue for some E, F with max(∥E∥, ∥F∥2) ≤ ε. An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.

AB - The following problem is addressed: given square matrices A and B, compute the smallest ε such that A + E and B + F have a common eigenvalue for some E, F with max(∥E∥, ∥F∥2) ≤ ε. An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.

KW - Eigenvalue perturbation

KW - Eigenvalue separation

KW - Pencil

KW - Pseudospectra

UR - http://www.scopus.com/inward/record.url?scp=34247362921&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247362921&partnerID=8YFLogxK

U2 - 10.1137/050622584

DO - 10.1137/050622584

M3 - Article

VL - 28

SP - 348

EP - 359

JO - SIAM Journal on Matrix Analysis and Applications

JF - SIAM Journal on Matrix Analysis and Applications

SN - 0895-4798

IS - 2

ER -