1973
DOI: 10.1093/imamat/12.3.261
|View full text |Cite
|
Sign up to set email alerts
|

On the Quadratic Convergence of an Algorithm which Diagonalizes a Complex Symmetric Matrix

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1975
1975
1995
1995

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…An efficient Jacobi iteration for complex symmetric matrices was given by Eberlein (1971). Anderson & Loizou (1973) show that Eberlein's method converges rapidly when the off-diagonal elements are small; an ALGOL implementation of the algorithm can be found in Anderson & Loizou (1976).…”
Section: S -T S -L = Kmentioning
confidence: 99%
“…An efficient Jacobi iteration for complex symmetric matrices was given by Eberlein (1971). Anderson & Loizou (1973) show that Eberlein's method converges rapidly when the off-diagonal elements are small; an ALGOL implementation of the algorithm can be found in Anderson & Loizou (1976).…”
Section: S -T S -L = Kmentioning
confidence: 99%