Abstract

We present a non-iterative scheme for solving general linear stationary primal boundary value problems with an arbitrary number of degrees of freedom. The main goal is to combine the finite element method performance for domains with arbitrary geometry with the finite difference method efficiency related to its low computational cost. We apply a domain decomposition scheme to define rectangular subdomains (2D case) or rectangular hexahedral subdomains (3D case). A finite element mesh is generated in such a way that the elements in the regular regions are squares (2D case) or cubes (3D case). A suitable overlap scheme allows the finite element method to be used in regions of non-regular elements, while the finite difference method can be used in regions with regular elements (squares for 2D case or cubes for 3D case). We present six computational simulations showing the best performance in the CPU time of the proposed scheme compared to the classic finite element method while maintaining solution accuracy. • Reduction in the computational cost of assembling the matrices. • Solution time of the system of equations is preserved. • Feasible for problems with arbitrary degrees of freedom and non-homogeneous media. • Able to deal with several regular finite difference subdomains.

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.