default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Izgin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Thomas Izgin, Stefan Kopecz, Andreas Meister, Amandine Schilling:
On the non-global linear stability and spurious fixed points of MPRK schemes with negative RK parameters. Numer. Algorithms 96(3): 1221-1242 (2024)- [i12]Thomas Izgin:
A Unifying Theory for Runge-Kutta-like Time Integrators: Convergence and Stability. CoRR abs/2402.13788 (2024) - [i11]Thomas Izgin:
A Boot-Strapping Technique to Design Dense Output Formulae for Modified Patankar-Runge-Kutta Methods. CoRR abs/2406.16718 (2024) - 2023
- [i10]Thomas Izgin, Stefan Kopecz, Angela Martiradonna
, Andreas Meister:
Lyapunov Stability of First and Second Order GeCo and gBBKS Schemes. CoRR abs/2301.10658 (2023) - [i9]Thomas Izgin, David I. Ketcheson, Andreas Meister:
Order conditions for Runge-Kutta-like methods with solution-dependent coefficients. CoRR abs/2305.14297 (2023) - [i8]Thomas Izgin, Stefan Kopecz, Andreas Meister, Amandine Schilling:
On the non-global linear stability and spurious fixed points of MPRK schemes with negative RK parameters. CoRR abs/2309.01562 (2023) - [i7]Thomas Izgin, Hendrik Ranocha:
Using Bayesian Optimization to Design Time Step Size Controllers with Application to Modified Patankar-Runge-Kutta Methods. CoRR abs/2312.01796 (2023) - 2022
- [j2]Thomas Izgin, Stefan Kopecz, Andreas Meister:
On the Stability of Unconditionally Positive and Linear Invariants Preserving Time Integration Schemes. SIAM J. Numer. Anal. 60(6): 3029-3051 (2022) - [i6]Thomas Izgin, Stefan Kopecz, Andreas Meister:
On Lyapunov Stability of Positive and Conservative Time Integrators and Application to Second Order Modified Patankar-Runge-Kutta Schemes. CoRR abs/2202.01099 (2022) - [i5]Thomas Izgin, Stefan Kopecz, Andreas Meister:
On the Stability of Unconditionally Positive and Linear Invariants Preserving Time Integration Schemes. CoRR abs/2202.11649 (2022) - [i4]Juntao Huang, Thomas Izgin, Stefan Kopecz, Andreas Meister, Chi-Wang Shu:
On the stability of strong-stability-preserving modified Patankar Runge-Kutta schemes. CoRR abs/2205.01488 (2022) - [i3]Thomas Izgin, Philipp Öffner:
On the Stability of Modified Patankar Methods. CoRR abs/2206.07371 (2022) - [i2]Thomas Izgin, Stefan Kopecz, Andreas Meister:
A Stability Analysis of Modified Patankar-Runge-Kutta methods for a nonlinear Production-Destruction System. CoRR abs/2210.11845 (2022) - [i1]Thomas Izgin, Philipp Öffner, Davide Torlo:
A necessary condition for non oscillatory and positivity preserving time-integration schemes. CoRR abs/2211.08905 (2022) - 2021
- [j1]Amir Hashemi, Thomas Izgin, Daniel Robertz, Werner M. Seiler:
An Involutive GVW Algorithm and the Computation of Pommaret Bases. Math. Comput. Sci. 15(3): 419-452 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
