000878664 001__ 878664
000878664 005__ 20210130005718.0
000878664 0247_ $$2doi$$a10.1016/j.jcp.2020.109771
000878664 0247_ $$2ISSN$$a0021-9991
000878664 0247_ $$2ISSN$$a1090-2716
000878664 0247_ $$2Handle$$a2128/25825
000878664 0247_ $$2altmetric$$aaltmetric:88876892
000878664 0247_ $$2WOS$$aWOS:000588199000032
000878664 037__ $$aFZJ-2020-02985
000878664 041__ $$aEnglish
000878664 082__ $$a000
000878664 1001_ $$00000-0001-5118-5576$$aMartín-Vaquero, J.$$b0$$eCorresponding author
000878664 245__ $$aSolving nonlinear parabolic PDEs in several dimensions: Parallelized ESERK codes
000878664 260__ $$aAmsterdam$$bElsevier$$c2020
000878664 3367_ $$2DRIVER$$aarticle
000878664 3367_ $$2DataCite$$aOutput Types/Journal article
000878664 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal$$s1601884981_6316
000878664 3367_ $$2BibTeX$$aARTICLE
000878664 3367_ $$2ORCID$$aJOURNAL_ARTICLE
000878664 3367_ $$00$$2EndNote$$aJournal Article
000878664 520__ $$aThere is a very large number of very important situations which can be modeled with nonlinear parabolic partial differential equations (PDEs) in several dimensions. In general, these PDEs can be solved by discretizing in the spatial variables and transforming them into huge systems of ordinary differential equations (ODEs), which are very stiff. Therefore, standard explicit methods require a large number of iterations to solve stiff problems. But implicit schemes are computationally very expensive when solving huge systems of nonlinear ODEs. Several families of Extrapolated Stabilized Explicit Runge-Kutta schemes (ESERK) with different order of accuracy (3 to 6) are derived and analyzed in this work. They are explicit methods, with stability regions extended, along the negative real semi-axis, quadratically with respect to the number of stages s, hence they can be considered to solve stiff problems much faster than traditional explicit schemes. Additionally, they allow the adaptation of the step length easily with a very small cost.Two new families of ESERK schemes (ESERK3 and ESERK6) are derived, and analyzed, in this work. Each family has more than 50 new schemes, with up to 84.000 stages in the case of ESERK6. For the first time, we also parallelized all these new variable step length and variable number of stages algorithms (ESERK3, ESERK4, ESERK5, and ESERK6). These parallelized strategies allow to decrease times significantly, as it is discussed and also shown numerically in two problems. Thus, the new codes provide very good results compared to other well-known ODE solvers. Finally, a new strategy is proposed to increase the efficiency of these schemes, and it is discussed the idea of combining ESERK families in one code, because typically, stiff problems have different zones and according to them and the requested tolerance the optimum order of convergence is different.
000878664 536__ $$0G:(DE-HGF)POF3-511$$a511 - Computational Science and Mathematical Methods (POF3-511)$$cPOF3-511$$fPOF III$$x0
000878664 588__ $$aDataset connected to CrossRef
000878664 7001_ $$0P:(DE-Juel1)169421$$aKleefeld, A.$$b1
000878664 773__ $$0PERI:(DE-600)1469164-4$$a10.1016/j.jcp.2020.109771$$gp. 109771 -$$p109771$$tJournal of computational physics$$v423$$x0021-9991$$y2020
000878664 8564_ $$uhttps://juser.fz-juelich.de/record/878664/files/ESERK36_Rev.pdf$$yOpenAccess
000878664 8564_ $$uhttps://juser.fz-juelich.de/record/878664/files/ESERK36_Rev.pdf?subformat=pdfa$$xpdfa$$yOpenAccess
000878664 909CO $$ooai:juser.fz-juelich.de:878664$$pdnbdelivery$$pdriver$$pVDB$$popen_access$$popenaire
000878664 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)169421$$aForschungszentrum Jülich$$b1$$kFZJ
000878664 9131_ $$0G:(DE-HGF)POF3-511$$1G:(DE-HGF)POF3-510$$2G:(DE-HGF)POF3-500$$3G:(DE-HGF)POF3$$4G:(DE-HGF)POF$$aDE-HGF$$bKey Technologies$$lSupercomputing & Big Data$$vComputational Science and Mathematical Methods$$x0
000878664 9141_ $$y2020
000878664 915__ $$0StatID:(DE-HGF)0200$$2StatID$$aDBCoverage$$bSCOPUS$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0160$$2StatID$$aDBCoverage$$bEssential Science Indicators$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0600$$2StatID$$aDBCoverage$$bEbsco Academic Search$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0100$$2StatID$$aJCR$$bJ COMPUT PHYS : 2018$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0150$$2StatID$$aDBCoverage$$bWeb of Science Core Collection$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0110$$2StatID$$aWoS$$bScience Citation Index$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0111$$2StatID$$aWoS$$bScience Citation Index Expanded$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)9900$$2StatID$$aIF < 5$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
000878664 915__ $$0StatID:(DE-HGF)0030$$2StatID$$aPeer Review$$bASC$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)1150$$2StatID$$aDBCoverage$$bCurrent Contents - Physical, Chemical and Earth Sciences$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0300$$2StatID$$aDBCoverage$$bMedline$$d2020-01-02
000878664 915__ $$0StatID:(DE-HGF)0420$$2StatID$$aNationallizenz$$d2020-01-02$$wger
000878664 915__ $$0StatID:(DE-HGF)0199$$2StatID$$aDBCoverage$$bClarivate Analytics Master Journal List$$d2020-01-02
000878664 920__ $$lyes
000878664 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
000878664 980__ $$ajournal
000878664 980__ $$aVDB
000878664 980__ $$aUNRESTRICTED
000878664 980__ $$aI:(DE-Juel1)JSC-20090406
000878664 9801_ $$aFullTexts