On generalized successive overrelaxation method for a class of block three-by-three double saddle point problems

Key Points

• The generalized successive overrelaxation method improves convergence for block three-by-three saddle point problems.
• Key evidence shows faster convergence rates, particularly in ill-posed linear systems, enhancing computational efficiency.
• This analysis employs iterative methods to assess the performance against existing algorithms in mathematical programming.
• These findings highlight potential for broader application in solving complex linear systems; further validation necessary.