Abstract
The convergence properties of the Arrow–Hurwicz algorithm for solving mixed finite-element problems are studied. Using a purely algebraic technique, the convergence factor of the algorithm will be estimated. The iteration parameters depending on the smallest and greatest eigenvalues of some generalized eigenvalue problems can be chosen optimally. For special cases, the convergence factor of the preconditioned Arrow–Hurwicz Algorithm is independent of the discretization parameter. Finally, a quite general method that allows us to construct preconditioning operators of the Arrow–Hurwicz Algorithm for a wide class of problems is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
