Simple view
Full metadata view
Authors
Statistics
Efficient and generic algorithm for rigorous integration forward in time of dPDEs : part I
dissipative PDE
rigorous numerics
automatic differentiation
fast fourier transform
FFT
interval arithmetic
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.
cris.lastimport.wos | 2024-04-09T23:17:11Z | |
dc.abstract.en | 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. | pl |
dc.affiliation | Wydział Matematyki i Informatyki : Katedra Teorii Optymalizacji i Sterowania | pl |
dc.contributor.author | Cyranka, Jacek - 102918 | pl |
dc.date.accessioned | 2015-03-04T12:12:58Z | |
dc.date.available | 2015-03-04T12:12:58Z | |
dc.date.issued | 2014 | pl |
dc.date.openaccess | 0 | |
dc.description.accesstime | w momencie opublikowania | |
dc.description.number | 1 | pl |
dc.description.physical | 28-52 | pl |
dc.description.version | ostateczna wersja wydawcy | |
dc.description.volume | 59 | pl |
dc.identifier.doi | 10.1007/s10915-013-9749-1 | pl |
dc.identifier.eissn | 1573-7691 | pl |
dc.identifier.issn | 0885-7474 | pl |
dc.identifier.uri | http://ruj.uj.edu.pl/xmlui/handle/item/3522 | |
dc.language | eng | pl |
dc.language.container | eng | pl |
dc.rights | Udzielam licencji. Uznanie autorstwa 3.0 Polska | * |
dc.rights.licence | CC-BY | |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/pl/legalcode | * |
dc.share.type | inne | |
dc.subject.en | dissipative PDE | pl |
dc.subject.en | rigorous numerics | pl |
dc.subject.en | automatic differentiation | pl |
dc.subject.en | fast fourier transform | pl |
dc.subject.en | FFT | pl |
dc.subject.en | interval arithmetic | pl |
dc.subtype | Article | pl |
dc.title | Efficient and generic algorithm for rigorous integration forward in time of dPDEs : part I | pl |
dc.title.journal | Journal of Scientific Computing | pl |
dc.type | JournalArticle | pl |
dspace.entity.type | Publication |