activity
20142026
most citedRandomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding

1 citations · 2 across the 24 of their papers we have counts for

collaborators

26 papers

math.NA2026

Stochastic trace estimation for positive trace-class operators

Zvonimir Bujanović, Luka Grubišić, Daniel Kressner +1

Implicit trace estimation aims to approximate the trace of a matrix or linear operator accessible only through matrix-vector or operator-vector products. In the matrix setting, the…

stat.ML2026

Stochastic trace estimation with tensor train random vectors

Zvonimir Bujanović, Daniel Kressner, Hrvoje Olić

Stochastic trace estimation is a standard tool for approximating the trace of a large-scale matrix available only through matrix-vector products. However, in tensor-structured sett…

math.NA2026

Kernel-based linear system identification using augmented Krylov subspaces

Fabio Matti, Martin Skovgaard Andersen, Tianshi Chen +1

We propose a novel Krylov subspace method for estimating the finite impulse response (FIR) of a one-dimensional linear time-invariant systems. The method approximates the system's…

math.NA2026

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop

Noah Amsel, Yves Baumann, Paul Beckman +33

This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the w…

math.NA2026

A novel Krylov subspace method for approximating Fréchet derivatives of large-scale matrix functions

Daniel Kressner, Peter Oehme

We present a novel Krylov subspace method for approximating $L_f(A, E) \vc{b}$, the matrix-vector product of the Fréchet derivative of a large-scale matrix function $f(…

math.NA2026

Restoring similarity in randomized Krylov methods with applications to eigenvalue problems and matrix functions

Laura Grigori, Daniel Kressner, Nian Shao +1

The randomized Arnoldi process has been used in large-scale scientific computing because it produces a well-conditioned basis for the Krylov subspace more quickly than the standard…

math.NA2025

RJD-BASE: Multi-Modal Spectral Clustering via Randomized Joint Diagonalization

Haoze He, Artemis Pados, Daniel Kressner

We revisit the problem of spectral clustering in multimodal settings, where each data modality is encoded as a graph Laplacian. While classical approaches--including joint diagonal…

math.NA2025

On the randomized SVD in infinite dimensions

Daniel Kressner, David Persson, André Uschmajew

Randomized methods, such as the randomized SVD (singular value decomposition) and Nyström approximation, are an effective way to compute low-rank approximations of large matrices.…

math.NA2025

Lanczos with compression for symmetric matrix Lyapunov equations

Angelo A. Casulli, Francesco Hrobat, Daniel Kressner

This work considers large-scale Lyapunov matrix equations of the form , where is a symmetric positive definite matrix and $\boldsymbol…

math.NA2025

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation

Fabio Matti, Haoze He, Daniel Kressner +1

Stochastic trace estimation is a well-established tool for approximating the trace of a large symmetric matrix . Several applications involve a matrix that depends…

math.NA2025

Compression Properties for large Toeplitz-like matrices

Bernhard Beckermann, Daniel Kressner, Heather Wilber

Toeplitz matrices are abundant in computational mathematics, and there is a rich literature on the development of fast and superfast algorithms for solving linear systems involving…

math.NA2024

A preconditioned inverse iteration with an improved convergence guarantee

Foivos Alimisis, Daniel Kressner, Nian Shao +1

Preconditioned eigenvalue solvers offer the possibility to incorporate preconditioners for the solution of large-scale eigenvalue problems, as they arise from the discretization of…

math.NA2024

Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation

Alice Cortinovis, Daniel Kressner

We derive a new adaptive leverage score sampling strategy for solving the Column Subset Selection Problem (CSSP). The resulting algorithm, called Adaptive Randomized Pivoting, can…

math.NA2024★ 1 cited

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding

Haoze He, Daniel Kressner, Bor Plestenjak

It is well known that a family of commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular…

math.NA2024

Preconditioned Low-Rank Riemannian Optimization for Symmetric Positive Definite Linear Matrix Equations

Ivan Bioli, Daniel Kressner, Leonardo Robol

This work is concerned with the numerical solution of large-scale symmetric positive definite matrix equations of the form $A_1XB_1^\top + A_2XB_2^\top + \dots + A_\ell X B_\ell^\t…

math.NA2024

On a randomized small-block Lanczos method for large-scale null space computations

Daniel Kressner, Nian Shao

Computing the null space of a large sparse matrix is a challenging computational problem, especially if the nullity -- the dimension of the null space -- is not small. When app…

math.NA2024

Subspace embedding with random Khatri-Rao products and its application to eigensolvers

Zvonimir Bujanović, Luka Grubišić, Daniel Kressner +1

Various iterative eigenvalue solvers have been developed to compute parts of the spectrum for a large sparse matrix, including the power method, Krylov subspace methods, contour in…

math.NA2024

A simple, randomized algorithm for diagonalizing normal matrices

Haoze He, Daniel Kressner

We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the…

math.NA2024

Randomized Nyström approximation of non-negative self-adjoint operators

David Persson, Nicolas Boullé, Daniel Kressner

The randomized singular value decomposition (SVD) has become a popular approach to computing cheap, yet accurate, low-rank approximations to matrices due to its efficiency and stro…

math.NA2024

Computing Functions of Symmetric Hierarchically Semiseparable Matrices

Angelo A. Casulli, Daniel Kressner, Leonardo Robol

The aim of this work is to develop a fast algorithm for approximating the matrix function of a square matrix that is symmetric and has hierarchically semiseparable (HSS)…

math.NA2024

A randomized algorithm for simultaneously diagonalizing symmetric matrices by congruence

Haoze He, Daniel Kressner

A family of symmetric matrices is SDC (simultaneous diagonalization by congruence, also called non-orthogonal joint diagonalization) if there is an invertible mat…

math.NA2021

Solving a Class of Infinite-Dimensional Tensor Eigenvalue Problems by Translational Invariant Tensor Ring Approximations

Roel Van Beeumen, Lana Periša, Daniel Kressner +1

We examine a method for solving an infinite-dimensional tensor eigenvalue problem , where the infinite-dimensional symmetric matrix exhibits a translational invariant…

math.NA2019

Low-rank approximation in the Frobenius norm by column and row subset selection

Alice Cortinovis, Daniel Kressner

A CUR approximation of a matrix is a particular type of low-rank approximation , where and consist of columns and rows of , respectively. One way to…

math.NA2016

Fast computation of spectral projectors of banded matrices

Daniel Kressner, Ana Susnjara

We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of l…