Abstract

A convergent iterative method is presented which is based on truncating the known function in the decomposed subdomain and using a projection procedure. The difference between the decomposition technique in this method and the spatial decomposition technique is that the unknown function is not decomposed in space and the solution is improved by means of an orthographic projection procedure. A series of suboperator equations defined on subdomains are solved in each step of the iterations, with much less computer memory and execution time than a direct method for the original equation. Two kinds of acceleration techniques are proposed; one employs a relaxation factor and the other is a multilevel technique like the multigrid method. Numerical results verify the computer efficiency of the proposed iteration method.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.