Abstract
Methods for updating the computational mesh have been studied for many years and there are mainly two kinds of mesh moving algorithms known as node connectivity based and no node connectivity based respectively. As the node connectivity based mesh moving methods are universal for both structured and unstructured mesh but of high computational cost at the same time, detailed attentions are paid to in this paper to balance its advantages and disadvantages. The format and the features of the derived linear equations in node connectivity algorithms are analyzed firstly and the choice of solver for these equations are considered subsequently. Finally, parallel models for node connectivity algorithms on different parallel architectures are proposed to accelerate these algorithms. Experiments have also been accomplished to match up the analysis procedures.
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.
