001     1018968
005     20231215201908.0
024 7 _ |a 10.34734/FZJ-2023-05038
|2 datacite_doi
037 _ _ |a FZJ-2023-05038
100 1 _ |a Baumann, Thomas
|0 P:(DE-Juel1)190575
|b 0
|e Corresponding author
111 2 _ |a 12th Parallel-in-Time Workshop
|c Hamburg
|d 2023-07-17 - 2023-07-21
|w Germany
245 _ _ |a pySDC: Prototyping Spectral Deferred Corrections
260 _ _ |c 2023
336 7 _ |a Conference Paper
|0 33
|2 EndNote
336 7 _ |a INPROCEEDINGS
|2 BibTeX
336 7 _ |a conferenceObject
|2 DRIVER
336 7 _ |a CONFERENCE_POSTER
|2 ORCID
336 7 _ |a Output Types/Conference Poster
|2 DataCite
336 7 _ |a Poster
|b poster
|m poster
|0 PUB:(DE-HGF)24
|s 1702637428_10473
|2 PUB:(DE-HGF)
|x Other
502 _ _ |c Hamburg University of Technology
520 _ _ |a Spectral deferred corrections (SDC) is a very malleable time-stepping scheme that is especially well-suited for stiff problems. A wide range of parallel-in-time (PinT) extensions exist, from small-scale parallelism across the method to the large-scale PinT algorithm PFASST. SDC iteratively solves fully-implicit Runge-Kutta (RK) schemes with low-order methods. pySDC is a Python library that allows interested users to test how well SDC works for their specific problem or algorithm with very little effort. It includes implementations of PinT algorithms in both simulated parallel versions as well as MPI-based parallel versions. In addition, implementations of many popular serial RK methods are part of pySDC to enable a quick and fair comparison in an internally consistent framework. The code is very actively developed by collaborators in Juelich, Hamburg and Wuppertal. pySDC is publicly hosted on GitHub and extensively tested with continuous integration to ensure reproducibility and maintainability of the code and the results obtained with it. Contribution guidelines and tutorials exist to invite and guide new users. The modular nature allows developers to work on specific features without awareness of all details in the code, which encourages also smaller projects, such as master's theses.
536 _ _ |a 5112 - Cross-Domain Algorithms, Tools, Methods Labs (ATMLs) and Research Groups (POF4-511)
|0 G:(DE-HGF)POF4-5112
|c POF4-511
|f POF IV
|x 0
536 _ _ |a TIME-X - TIME parallelisation: for eXascale computing and beyond (955701)
|0 G:(EU-Grant)955701
|c 955701
|f H2020-JTI-EuroHPC-2019-1
|x 1
700 1 _ |a Speck, Robert
|0 P:(DE-Juel1)132268
|b 1
700 1 _ |a Lunet, Thibaut
|0 P:(DE-HGF)0
|b 2
700 1 _ |a Ruprecht, Daniel
|0 P:(DE-HGF)0
|b 3
700 1 _ |a Wimmer, Lisa
|0 P:(DE-HGF)0
|b 4
856 4 _ |y OpenAccess
|u https://juser.fz-juelich.de/record/1018968/files/Poster12PinT2023.pdf
856 4 _ |y OpenAccess
|x icon
|u https://juser.fz-juelich.de/record/1018968/files/Poster12PinT2023.gif?subformat=icon
856 4 _ |y OpenAccess
|x icon-1440
|u https://juser.fz-juelich.de/record/1018968/files/Poster12PinT2023.jpg?subformat=icon-1440
856 4 _ |y OpenAccess
|x icon-180
|u https://juser.fz-juelich.de/record/1018968/files/Poster12PinT2023.jpg?subformat=icon-180
856 4 _ |y OpenAccess
|x icon-640
|u https://juser.fz-juelich.de/record/1018968/files/Poster12PinT2023.jpg?subformat=icon-640
909 C O |o oai:juser.fz-juelich.de:1018968
|p openaire
|p open_access
|p VDB
|p driver
|p ec_fundedresources
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)190575
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 1
|6 P:(DE-Juel1)132268
913 1 _ |a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|1 G:(DE-HGF)POF4-510
|0 G:(DE-HGF)POF4-511
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Enabling Computational- & Data-Intensive Science and Engineering
|9 G:(DE-HGF)POF4-5112
|x 0
914 1 _ |y 2023
915 _ _ |a OpenAccess
|0 StatID:(DE-HGF)0510
|2 StatID
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 0
980 _ _ |a poster
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)JSC-20090406
980 1 _ |a FullTexts


LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21