Daniel Kreßner

4.8k total citations · 1 hit paper
148 papers, 2.8k citations indexed

About

Daniel Kreßner is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Computational Mathematics. According to data from OpenAlex, Daniel Kreßner has authored 148 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 115 papers in Computational Theory and Mathematics, 54 papers in Numerical Analysis and 43 papers in Computational Mathematics. Recurrent topics in Daniel Kreßner's work include Matrix Theory and Algorithms (110 papers), Tensor decomposition and applications (43 papers) and Numerical methods for differential equations (38 papers). Daniel Kreßner is often cited by papers focused on Matrix Theory and Algorithms (110 papers), Tensor decomposition and applications (43 papers) and Numerical methods for differential equations (38 papers). Daniel Kreßner collaborates with scholars based in Switzerland, Germany and Sweden. Daniel Kreßner's co-authors include Christine Tobler, Lars Grasedyck, Bart Vandereycken, Michael Steinlechner, Bo Kågström, André Uschmajew, Michael Karow, Peter Benner, Ralph Byers and Robert Granat and has published in prestigious journals such as IEEE Transactions on Image Processing, Computer Methods in Applied Mechanics and Engineering and Mathematics of Computation.

In The Last Decade

Daniel Kreßner

138 papers receiving 2.5k citations

Hit Papers

A literature survey of low‐rank tensor approximation tech... 2013 2026 2017 2021 2013 100 200 300

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Daniel Kreßner Switzerland 25 1.5k 950 777 738 628 148 2.8k
Marc Van Barel Belgium 23 1.3k 0.8× 364 0.4× 623 0.8× 419 0.6× 327 0.5× 220 2.3k
Boris N. Khoromskij Germany 35 1.6k 1.0× 2.0k 2.1× 311 0.4× 926 1.3× 600 1.0× 115 3.3k
Lars Grasedyck Germany 25 1.0k 0.7× 1.0k 1.1× 221 0.3× 781 1.1× 529 0.8× 64 2.7k
Karl Meerbergen Belgium 22 1.2k 0.8× 216 0.2× 790 1.0× 476 0.6× 523 0.8× 101 2.5k
Moody T. Chu United States 27 1.4k 0.9× 181 0.2× 840 1.1× 426 0.6× 356 0.6× 97 2.6k
Changfeng Ma China 24 1.4k 0.9× 211 0.2× 1.1k 1.4× 550 0.7× 162 0.3× 192 2.0k
Wen‐Wei Lin Taiwan 26 1.3k 0.8× 140 0.1× 781 1.0× 237 0.3× 507 0.8× 155 2.4k
Lek‐Heng Lim United States 19 1.1k 0.7× 2.1k 2.2× 267 0.3× 849 1.2× 331 0.5× 52 3.1k
P.-A. Absil Belgium 19 812 0.5× 291 0.3× 677 0.9× 1.3k 1.7× 413 0.7× 38 4.0k
Ren‐Cang Li United States 22 1.2k 0.8× 114 0.1× 719 0.9× 278 0.4× 276 0.4× 134 1.9k

Countries citing papers authored by Daniel Kreßner

Since Specialization
Citations

This map shows the geographic impact of Daniel Kreßner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Kreßner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Kreßner more than expected).

Fields of papers citing papers by Daniel Kreßner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Kreßner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Kreßner. The network helps show where Daniel Kreßner may publish in the future.

Co-authorship network of co-authors of Daniel Kreßner

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Kreßner. A scholar is included among the top collaborators of Daniel Kreßner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel Kreßner. Daniel Kreßner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sun, Bonan, et al.. (2024). Approximation in the extended functional tensor train format. Advances in Computational Mathematics. 50(3). 2 indexed citations
2.
Güttel, Stefan, Daniel Kreßner, & Bart Vandereycken. (2024). Randomized Sketching of Nonlinear Eigenvalue Problems. SIAM Journal on Scientific Computing. 46(5). A3022–A3043. 1 indexed citations
4.
Kreßner, Daniel, et al.. (2023). A mixed precision LOBPCG algorithm. Numerical Algorithms. 94(4). 1653–1671. 4 indexed citations
5.
Kreßner, Daniel, et al.. (2023). Streaming Tensor Train Approximation. SIAM Journal on Scientific Computing. 45(5). A2610–A2631. 4 indexed citations
6.
Kreßner, Daniel, et al.. (2023). Improved ParaDiag via low-rank updates and interpolation. Numerische Mathematik. 155(1-2). 175–209. 5 indexed citations
7.
Kreßner, Daniel, et al.. (2022). On randomized trace estimates for indefinite matrices with an application to determinants. CINECA IRIS Institutial research information system (University of Pisa). 20 indexed citations
8.
Kreßner, Daniel, et al.. (2021). Compress-and-restart block Krylov subspace methods for Sylvester matrix equations. CINECA IRIS Institutial research information system (University of Pisa). 3 indexed citations
9.
Beckermann, Bernhard, et al.. (2021). Low-rank updates of matrix functions II: Rational Krylov methods. CINECA IRIS Institutial research information system (University of Pisa). 6 indexed citations
10.
Kreßner, Daniel, et al.. (2020). Low-rank updates and divide-and-conquer methods for quadratic matrix equations. Lirias (KU Leuven). 2 indexed citations
11.
Kreßner, Daniel, et al.. (2020). On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices. CINECA IRIS Institutial research information system (University of Pisa). 9 indexed citations
12.
Kreßner, Daniel, et al.. (2020). Low-rank approximation in the Frobenius norm by column and row subset selection. CINECA IRIS Institutial research information system (University of Pisa). 16 indexed citations
13.
Güttel, Stefan, et al.. (2020). Limited‐memory polynomial methods for large‐scale matrix functions. GAMM-Mitteilungen. 43(3). 11 indexed citations
14.
Kreßner, Daniel, et al.. (2019). Low-rank updates and a divide-and-conquer method for linear matrix equations. ISTI Open Portal. 18 indexed citations
15.
Kreßner, Daniel, et al.. (2018). Multigrid methods combined with low-rank approximation for tensor-structured Markov chains. ETNA - Electronic Transactions on Numerical Analysis. Oesterreichisches Musiklexikon online (Institut für kunst- und musikhistorische Forschungen der Österreichischen Akademie der Wissenschaften). 2 indexed citations
16.
Kreßner, Daniel, et al.. (2017). Incremental computation of block triangular matrix exponentials with application to option pricing. ETNA - Electronic Transactions on Numerical Analysis. Oesterreichisches Musiklexikon online (Institut für kunst- und musikhistorische Forschungen der Österreichischen Akademie der Wissenschaften). 3 indexed citations
17.
18.
Benner, Peter, Matthias Bollhöfer, Daniel Kreßner, Christian Mehl, & Tatjana Stykel. (2015). Numerical algebra, matrix theory, differential-algebraic equations and control theory : Festschrift in honor of Volker Mehrmann. Springer eBooks. 3 indexed citations
19.
Perraudin, Nathanaël, et al.. (2015). Accelerated filtering on graphs using Lanczos method. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1 indexed citations
20.
Kreßner, Daniel. (2005). On the use of larger bulges in the QR algorithm. ETNA - Electronic Transactions on Numerical Analysis. 20. 50–63. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026