Abstract
Preconditioned gradient type iterative techniques have been proved to be powerful methods for solving large systems of nonsymmetric linear equations. This paper, which is concerned with the truncated generalized conjugate residual algorithms for solving such problems, introduces an approximate preconditioning strategy. This strategy is particularly attractive for matrices resulting from high order numerical approximations applied to elliptic partial differential equations. Numerical results demonstrate that the preconditioned iterative scheme is efficient, and it requires the same amount of computational work per iteration as the preconditioned conjugate gradient method for symmetric and positive definite matrices.
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.
