Abstract
This paper develops bounds on the computational complexity of the FAC algorithm which is a multi-level adaptive method for discretization and solution of partial differential equations. The estimates include the cost of the complete scheme, including the dynamic grid refinement process. They show that, for many applications, FAC has computational complexity of the order of the number of points in the final adapted grid. This is significant because adaptive methods that are not based on multi-level techniques generally have much higher complexity.
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.
