Abstract
Based on full domain partition, parallel finite element algorithm based on three linearizations is designed to solve the stationary incompressible magnetohydrodynamics (MHD). In every algorithm, each processor is in charge of a subproblem which is linearized by three options: Stokes-type, Newton’s and Picard’s iterations. Each subproblem is defined in the whole domain with vast majority of the degrees of freedom associated with the particular subdomain. The error estimates of these proposed algorithms with respect to iterative step and small mesh sizes are analyzed. Finally, some numerical experiments are provided to show the validity and high efficiency of our algorithms.
Sign-in/Register to access full text options 
Free) 
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
