Abstract
The ideas of the method of fictitious domains and homotopy are combined with an aim to reduce the solution of boundary-value problems for multidimensional partial differential equations (PDE) in domains of any shape to an exponentially convergent sequence of PDE in a parallelepiped (or, in the 2D case, in a rectangle). This enables us to decrease the required computer time due to the elimination of the necessity of triangulation of the domain by a grid with N inner nodes (thus, the Delaunay algorithm in the 2D case requires $$ \mathcal{O} $$ (N log N) operations).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.