Convergence behavior of generalized parameterized Uzawa method for singular saddle-point problems
详细信息    查看全文
文摘
In this paper, we will seek the least squares solution for singular saddle-point problems. The parameterized Uzawa (PU) method is further studied and a generalized PU (GPU) proper splitting is proposed. The convergence behavior of the corresponding GPU iteration is studied. It is proved that the GPU iteration method can converge to the best least squares solutions of the singular saddle-point problems. In addition, we prove that the GPU preconditioned GMRES for singular saddle-point problems will also determine the least squares solution at breakdown. The eigenvalue distributions of the GPU preconditioned matrix are derived. Numerical experiments are presented, which show that the convergence behavior of the singular preconditioning is significantly better than that of the corresponding nonsingular case and demonstrate that the GPU iteration has better convergence behavior than the PU iteration, both as a solver and a preconditioner of GMRES.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700