Efficient computation of the extreme solutions of ๐‘‹+๐ด*๐‘‹โปยน๐ด=๐‘„ and ๐‘‹-๐ด*๐‘‹โปยน๐ด=๐‘„

Beatrice Meini ยท Mathematics of Computation ยท 2001

We propose a new quadratically convergent algorithm, having a low computational cost per step and good numerical stability properties, which allows the simultaneous approximation of the extreme solutions of the matrix equations X + A โˆ— X โˆ’ 1 A = Q X+A^* X^{-1}A=Q and X โˆ’ A โˆ— X โˆ’ 1 A = Q X-A^*X^{-1}A=Q . The algorithm is based on the cyclic reduction method.

Read the paper ยท More papers on PaperTik