activity
20142026
most citedA new convergence proof for the higher-order power method and generalizations

36 citations · 61 across the 23 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

math.NA2026

A stable rank-adaptive step-and-truncate finite volume method for Vlasov transport on domains with piecewise linear boundaries

André Uschmajew, Andreas Zeiser

We consider the numerical solution of the linear Vlasov transport equation on bounded spatial domains with inflow boundary conditions based on low-rank approximation. We combine a…

math.OC2026

Stochastic Optimization of Tree Tensor Networks

Marius Willner, Maximilian Scharf, André Uschmajew +2

Tensor networks, originally developed for quantum many-body physics, are promising models for machine learning. We derive stochastic Riemannian optimizers for tree tensor networks…

math.NA2026

On low-rank tensor train approximability for linear nearest neighbor systems

Patrick Gelß, Sebastian Matera, Reinhold Schneider +1

Low-rank tensor methods are an important tool in the numerical treatment of equations with a high-dimensional state space. Nearest neighbor interaction systems like the Ising model…

math.OC2026

Natural Riemannian gradient for learning functional tensor networks

Nikolas Klug, Michael Ulbrich, André Uschmajew +1

We consider machine learning tasks with low-rank functional tree tensor networks (TTN) as the learning model. While in the case of least-squares regression, low-rank functional TTN…

math.OC2026

Numerically stable variants of overrelaxation for operator Sinkhorn iteration

Henrik Eisenmann, Tasuku Soma, Xun Tang +1

We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternati…