On generalized relaxation method for linear saddle point problems

The preconditioned Arrow–Hurwicz algorithm is considered for solving a nonsingular system of the linear equations with a symmetric indefinite block matrix. Under the original assumption for invariant subspaces we solve an asymptotic optimization problem which depends on two spectral and two iterative parameters. For the optimal choice of iterative parameters the spectrum of the iteration operator is complex.