Abstract
We consider here iterative methods for the generalized least squares problem defined as min (Ax−b) TW −1, (Ax−b) withW symmetric and positive definite. We develop preconditioned SOR methods specially devised also for the augmented systems of the problem. We establish the convergence region for the relaxation parameter and discuss, for one of the resulting SOR methods, the optimal value of this parameter. The convergence analysis and numerical experiments show that the preconditioned block SOR methods are very good alternatives for solving the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.