Abstract

AbstractAn element‐wise locally conservative Galerkin (LCG) method is employed to solve the conservation equations of diffusion and convection–diffusion. This approach allows the system of simultaneous equations to be solved over each element. Thus, the traditional assembly of elemental contributions into a global matrix system is avoided. This simplifies the calculation procedure over the standard global (continuous) Galerkin method, in addition to explicitly establishing element‐wise flux conservation. In the LCG method, elements are treated as sub‐domains with weakly imposed Neumann boundary conditions. The LCG method obtains a continuous and unique nodal solution from the surrounding element contributions via averaging. It is also shown in this paper that the proposed LCG method is identical to the standard global Galerkin (GG) method, at both steady and unsteady states, for an inside node. Thus, the method, has all the advantages of the standard GG method while explicitly conserving fluxes over each element.Several problems of diffusion and convection–diffusion are solved on both structured and unstructured grids to demonstrate the accuracy and robustness of the LCG method. Both linear and quadratic elements are used in the calculations. For convection‐dominated problems, Petrov–Galerkin weighting and high‐order characteristic‐based temporal schemes have been implemented into the LCG formulation. Copyright © 2007 John Wiley & Sons, Ltd.

Full Text
Paper version not known

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 call

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.