Abstract
We propose an efficient and generic algorithm for rigorous integration forward in time of partial differential equations written in the Fourier basis. By rigorous integration we mean a procedure which operates on sets and return sets which are guaranteed to contain the exact solution. The presented algorithm generates, in an efficient way, normalized derivatives which are used by the Lohner algorithm to produce a rigorous bound. The algorithm has been successfully tested on several partial differential equations (PDEs) including the Burgers equation, the Kuramoto-Sivashinsky equation, and the Swift-Hohenberg equation. The problem of rigorous integration in time of partial differential equations is a problem of large computational complexity and efficient algorithms are required to deal with PDEs on higher dimensional domains, like the Navier-Stokes equation. Technicalities regarding the various optimization techniques implemented in the software used in this paper will be reported elsewhere.
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.
