Abstract
Among the Lanczos-type product methods, which are characterized by residual polynomials p n t n that are the product of the Lanczos polynomial p n and another polynomial t n of exact degree n with t n (0)=1, Zhang's algorithm GPBiCG has the feature that the polynomials t n are implicitly built up by a pair of coupled two-term recurrences whose coefficients are chosen so that the new residual is minimized in a 2-dimensional space. There are several ways to achieve this. We discuss here alternative algorithms that are mathematically equivalent (that is, produce in exact arithmetic the same results). The goal is to find one where the ultimate accuracy of the iterates x n is guaranteed to be high and the cost is at most slightly increased.
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.
