Abstract
This paper describes a generic algorithm for concurrently solving multiple sub-domains that are selectively discretized in space and time. The mathematical background for this approach is largely based upon the fundamental principles of domain decomposition methods (DDM) and Lagrange multipliers. A proof of stability is provided using energy method and overall efficiency, accuracy and stability of multiple sub-domain coupling is evaluated using a series of numerical examples. Numerical stability is verified by ensuring energy balance at global as well as component sub-domain level. Discussed examples highlight the greatest advantage of MGMT method; which is high simulation speedups (at the cost of reasonably small errors).
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.
