2008
DOI: 10.1016/j.crma.2007.11.028
|View full text |Cite
|
Sign up to set email alerts
|

Computing the matrix sign and absolute value functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…It is possible to diagonalize A and to compute jAj using (35), but in practice this method is extremely costly. A more interesting method has been proposed in [29], which consists in computing a sequence of polynomial iterations based on the exact knowledge of the eigenvalues (or at last an explicit bound), and converging to the matrix sign if all the eigenvalues are real. However, this method also becomes costly when N A grows.…”
Section: An Efficient Methods For Approximating the Absolute Value Of mentioning
confidence: 99%
“…It is possible to diagonalize A and to compute jAj using (35), but in practice this method is extremely costly. A more interesting method has been proposed in [29], which consists in computing a sequence of polynomial iterations based on the exact knowledge of the eigenvalues (or at last an explicit bound), and converging to the matrix sign if all the eigenvalues are real. However, this method also becomes costly when N A grows.…”
Section: An Efficient Methods For Approximating the Absolute Value Of mentioning
confidence: 99%