default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Kürschner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Patrick Kürschner:
Inexact linear solves in the low-rank ADI iteration for large Sylvester equations. CoRR abs/2312.02891 (2023)- 2021
- [j14]Davide Palitta
, Patrick Kürschner:
On the convergence of Krylov methods with low-rank truncations. Numer. Algorithms 88(3): 1383-1417 (2021) - [j13]Jeroen Vanderstukken, Patrick Kürschner, Ignat Domanov, Lieven De Lathauwer:
Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition. SIAM J. Matrix Anal. Appl. 42(2): 913-953 (2021) - 2020
- [j12]Christian Kuehn, Patrick Kürschner:
Combined error estimates for local fluctuations of SPDEs. Adv. Comput. Math. 46(1): 11 (2020) - [j11]Daniel Kressner, Patrick Kürschner, Stefano Massei:
Low-rank updates and divide-and-conquer methods for quadratic matrix equations. Numer. Algorithms 84(2): 717-741 (2020) - [j10]Peter Benner, Zvonimir Bujanovic, Patrick Kürschner, Jens Saak:
A Numerical Comparison of Different Solvers for Large-Scale, Continuous-Time Algebraic Riccati Equations and LQR Problems. SIAM J. Sci. Comput. 42(2): A957-A996 (2020) - [d1]Jens Saak, Patrick Kürschner, Zvonimir Bujanovic, Peter Benner:
Collected MATLAB solvers for large-scale AREs. Zenodo, 2020
2010 – 2019
- 2019
- [i2]Daniel Kressner, Patrick Kürschner, Stefano Massei:
Low-rank updates and divide-and-conquer methods for quadratic matrix equations. CoRR abs/1903.02343 (2019) - [i1]Davide Palitta, Patrick Kürschner:
On the convergence of Krylov methods with low-rank truncations. CoRR abs/1909.01226 (2019) - 2018
- [j9]Patrick Kürschner:
Balanced truncation model order reduction in limited time intervals for large systems. Adv. Comput. Math. 44(6): 1821-1844 (2018) - [j8]Melina A. Freitag, Patrick Kürschner, Jennifer Pestana:
GMRES Convergence Bounds for Eigenvalue Problems. Comput. Methods Appl. Math. 18(2): 203-222 (2018) - [j7]Peter Benner, Zvonimir Bujanovic, Patrick Kürschner, Jens Saak:
RADI: a low-rank ADI-type algorithm for large scale algebraic Riccati equations. Numerische Mathematik 138(2): 301-330 (2018) - [j6]Martin Redmann, Patrick Kürschner:
An output error bound for time-limited balanced truncation. Syst. Control. Lett. 121: 1-6 (2018) - 2016
- [j5]Peter Benner, Patrick Kürschner, Jens Saak:
Low-rank Newton-ADI methods for large nonsymmetric algebraic Riccati equations. J. Frankl. Inst. 353(5): 1147-1167 (2016) - [j4]Peter Benner, Patrick Kürschner, Jens Saak:
Frequency-Limited Balanced Truncation with Low-Rank Approximations. SIAM J. Sci. Comput. 38(1) (2016) - 2015
- [j3]Melina A. Freitag, Patrick Kürschner:
Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration. Numer. Linear Algebra Appl. 22(1): 175-196 (2015) - 2014
- [j2]Peter Benner, Patrick Kürschner:
Computing real low-rank solutions of Sylvester equations by the factored ADI method. Comput. Math. Appl. 67(9): 1656-1672 (2014) - 2013
- [j1]Peter Benner, Patrick Kürschner, Jens Saak:
Efficient handling of complex shift parameters in the low-rank Cholesky factor ADI method. Numer. Algorithms 62(2): 225-251 (2013)
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-20 20:33 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:
