Inverse subspace bi-iteration and bi-Newton methods for computing spectral projectors

Demyanko, K. V.; Nechepurenko, Yu. M.; Sadkane, Miloud

doi:10.1016/j.camwa.2015.02.002

Search citation statements

Order By: Relevance

Paper Sections

Select...

Compute the Schur Decomposition (33) 2 Set1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To minimize the number of iterations of Algorithm 3, the Schur decomposition computed at Step 1 of Algorithm 3 needs to have the diagonal entries of C k ordered in a non-increasing order of magnitude (see [3], p. 597).…”

Section: Compute the Schur Decomposition (33) 2 Setmentioning

confidence: 99%

“…The theory of its convergence was constructed in terms of the integral performance criteria for dichotomy. This method occurred to be quite efficient and has got further development by various authors (see, e.g., [3,4,9]). In particular, a variant of this method was proposed in [4] for computing the invariant pairs of regular linear matrix pencils of general form.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation