Pseudospectra of rectangular matrices (Q4787671)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1850452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudospectra of rectangular matrices |
scientific article; zbMATH DE number 1850452 |
Statements
Pseudospectra of rectangular matrices (English)
0 references
12 May 2003
0 references
pseudoeigenvalue
0 references
pseudoeigenvector
0 references
pseudospectrum
0 references
algorithm
0 references
0 references
0 references
0.9028836
0 references
0.8981801
0 references
0.89415556
0 references
0.8929962
0 references
0.8876381
0 references
0.8844499
0 references
0 references
Let \(A \in \mathbb{C}^{m \times n}\) be an \(m \times n\) rectangular matrix , with \(m \geq n.\) For each \(\varepsilon > 0\), \(\lambda \in \mathbb{C}\) is called an \(\varepsilon\)-pseudoeigenvalue of \(A\), if for some \(n\)-vector \(v\), \(\| v \| = 1,\) we have: \(\| (A - \lambda \widetilde I)v \| \leq \varepsilon,\) where \(\widetilde I\) denotes the \(m \times n\) matrix, with \(1\) on the main diagonal and \(0\) elsewere; \(v\) is called a corresponding \(\varepsilon \)-pseudoeigenvector. The \(\varepsilon \)-pseudospectrum \(\Lambda_\varepsilon (A),\) of A is the set of all \(\varepsilon \)-pseudoeigenvectors of \(A\). When \(\varepsilon = 0 ,\) \(\Lambda_0 (A) \equiv\Lambda(A)\) is called the set of eigenvalues of \(A\), hence \(\Lambda(A) \subseteq \Lambda_\varepsilon (A),\forall\varepsilon > 0.\) It is interesting that, for each \(\varepsilon > 0,\) the \(\varepsilon \)-pseudospectrum, \(\Lambda_\varepsilon (A),\) of \(A\) depends continuously on \(A\), a feature that the eigenvalues of \(A\) do not have. In this paper, the authors give an efficient algorithm for the computation of the \(\varepsilon \)-pseudospectra, and some applications.
0 references