Abstract
The paper analyses the numerical performance of preconditioning with Gram matrix approximations for the solution of a convection–diffusion equation. The convection–diffusion equation is discretized on a rectangular grid by standard finite element methods with piecewise linear test and trial functions. The discrete linear system is solved by two different conjugate gradient algorithms: CGS and GMRES. The preconditioning with Gram matrix approximations consists of replacing the solving of the equation with the preconditioner by a few iterations of an appropriate iterative scheme. Two iterative algorithms are tested: incomplete Cholesky and multigrid. Numerical experiments indicate that these preconditioners are efficient at relatively small values of the Reynolds number.
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.
