2013
DOI: 10.1016/j.laa.2013.02.004
|View full text |Cite
|
Sign up to set email alerts
|

A condensed representation of almost normal matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Indeed, if A is an almost-normal matrix such that ∆(A) = CA − AC then B = A + γI, with a complex constant γ, is almost normal as well and ∆(B) = ∆(A) = CB − BC. In [1] the structure of almost normal matrices with rank-one perturbation is studied by showing that a blocktridiagonal matrix with 2 × 2 blocks can be determined to satisfy (1) for a certain C of rank one. Here we take a different look at the problem by asking whether a solution of (1) for a given C can be reduced to block tridiagonal form.…”
Section: Denote By ∆(A) : = [Amentioning
confidence: 99%
See 2 more Smart Citations
“…Indeed, if A is an almost-normal matrix such that ∆(A) = CA − AC then B = A + γI, with a complex constant γ, is almost normal as well and ∆(B) = ∆(A) = CB − BC. In [1] the structure of almost normal matrices with rank-one perturbation is studied by showing that a blocktridiagonal matrix with 2 × 2 blocks can be determined to satisfy (1) for a certain C of rank one. Here we take a different look at the problem by asking whether a solution of (1) for a given C can be reduced to block tridiagonal form.…”
Section: Denote By ∆(A) : = [Amentioning
confidence: 99%
“…In [1] the class of almost normal matrices is introduced, that is the class of matrices for which [A, A H ] = A H A − AA H = CA − AC for a low rank matrix C. In the framework of operator theory conditions upon the commutator [A, A H ] are widely used in the study of structural properties of hypernormal operators [18]. Our interest in the class of almost normal matrices stems from the analysis of fast eigenvalue algorithms for rank-structured matrices.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation