activity
20032025
most citedAsymptotic upper bounds for the entropy of orthogonal polynomials in the Szegő class

18 citations · 41 across the 15 of their papers we have counts for

collaborators

21 papers

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.NA2021★ 1 cited

On the rational approximation of Markov functions,with applications to the computation of Markovfunctions of Toeplitz matrices

Bernhard Beckermann, Joanna Bisch, Robert Luce

We investigate the problem of approximating the matrix function by , with a Markov function, a rational interpolant of , and a symmetric Toeplitz matrix…

math.NA2020

Low-rank updates of matrix functions II: Rational Krylov methods

Bernhard Beckermann, Alice Cortinovis, Daniel Kressner +1

This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this c…

math.CV2018

Perturbations of Christoffel-Darboux kernels. I: detection of outliers

Bernhard Beckermann, Mihai Putinar, Edward B. Saff +1

Two central objects in constructive approximation, the Christoffel-Darboux kernel and the Christoffel function, are encoding ample information about the associated moment data and…

math.NA2017

On the sharpness of the weighted Bernstein-Walsh inequality, with applications to the superlinear convergence of conjugate gradients

Bernhard Beckermann, Thomas Helart

In this paper we show that the weighted Bernstein-Walsh inequality in logarithmic potential theory is sharp up to some new universal constant, provided that the external field is g…

math.NA2017

Low-rank updates of matrix functions

Bernhard Beckermann, Daniel Kressner, Marcel Schweitzer

We consider the task of updating a matrix function when the matrix is subject to a low-rank modification. In other words, we aim at approximat…