arXiv subjects

Henrik Eisenmann

Publications and source records attributed to Henrik Eisenmann.

11 recordsLinked to original sources

arXiv2026

Numerically stable variants of overrelaxation for operator Sinkhorn iteration

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 alternating fixed point iteration, it has been recently proposed to achieve acceleration by means of nonlinear successive overrelaxation (SOR), e.g.~with respect to geodesics in Hilbert metric. The direct implementation of the proposed SOR algorithms, however, can be numerically unstable for ill-conditioned instances, limiting the achievable accuracy. Here we derive equivalent versions of OSI with SOR where, similar to the original OSI formulation, scalings are applied on the fly in order to take advantage of preconditioning effects. Numerical experiments confirm that this modification allows for numerically stable SOR-acceleration of OSI even in ill-conditioned cases.

math.OC↗

arXiv2025

Dynamical low-rank tensor approximations to high-dimensional parabolic problems: existence and convergence of spatial discretizations

We consider dynamical low-rank approximations to parabolic problems on higher-order tensor manifolds in Hilbert spaces. In addition to existence of solutions and their stability with respect to perturbations to the problem data, we show convergence of spatial discretizations. Our framework accommodates various standard low-rank tensor formats for multivariate functions, including tensor train and hierarchical tensors.

math.NA↗

arXiv2025

A convergent adaptive finite element stochastic Galerkin method based on multilevel expansions of random fields

The subject of this work is an adaptive stochastic Galerkin finite element method for parametric or random elliptic partial differential equations, which generates sparse product polynomial expansions with respect to the parametric variables of solutions. For the corresponding spatial approximations, an independently refined finite element mesh is used for each polynomial coefficient. The method relies on multilevel expansions of input random fields and achieves error reduction with uniform rate. In particular, the saturation property for the refinement process is ensured by the algorithm. The results are illustrated by numerical experiments, including cases with random fields of low regularity.

math.NA↗

arXiv2025

Adaptive stochastic Galerkin finite element methods: Optimality and non-affine coefficients

Near-optimal computational complexity of an adaptive stochastic Galerkin method with independently refined spatial meshes for elliptic partial differential equations is shown. The method takes advantage of multilevel structure in expansions of random diffusion coefficients and combines operator compression in the stochastic variables with error estimation using finite element frames in space. A new operator compression strategy is introduced for nonlinear coefficient expansions, such as diffusion coefficients with log-affine structure.

math.NA↗

arXiv2025

A Newton method for solving locally definite multiparameter eigenvalue problems by multiindex

We present a new approach to compute eigenvalues and eigenvectors of locally definite multiparameter eigenvalue problems by its signed multiindex. The method has the interpretation of a semismooth Newton method applied to certain functions that have a unique zero. We can therefore show local quadratic convergence, and for certain extreme eigenvalues even global linear convergence of the method. Local definiteness is a weaker condition than right and left definiteness, which is often considered for multiparameter eigenvalue problems. These conditions are naturally satisfied for multiparameter Sturm-Liouville problems that arise when separation of variables can be applied to multidimensional boundary eigenvalue problems.

math.NA↗

arXiv2022

Riemannian thresholding methods for row-sparse and low-rank matrix recovery

In this paper, we present modifications of the iterative hard thresholding (IHT) method for recovery of jointly row-sparse and low-rank matrices. In particular a Riemannian version of IHT is considered which significantly reduces computational cost of the gradient projection in the case of rank-one measurement operators, which have concrete applications in blind deconvolution. Experimental results are reported that show near-optimal recovery for Gaussian and rank-one measurements, and that adaptive stepsizes give crucial improvement. A Riemannian proximal gradient method is derived for the special case of unknown sparsity.

math.OC↗

arXiv2022

Maximum relative distance between real rank-two and rank-one tensors

It is shown that the relative distance in Frobenius norm of a real symmetric order-$d$ tensor of rank two to its best rank-one approximation is upper bounded by $\sqrt{1-(1-1/d)^{d-1}}$. This is achieved by determining the minimal possible ratio between spectral and Frobenius norm for symmetric tensors of border rank two, which equals $\left(1-{1}/{d}\right)^{(d-1)/{2}}$. These bounds are also verified for arbitrary real rank-two tensors by reducing to the symmetric case.

math.AG↗

arXiv2022

The Geometries of Jordan nets and Jordan webs

A Jordan net (resp. web) is an embedding of a unital Jordan algebra of dimension $3$ (resp. $4$) into the space $\mathbb{S}^n$ of symmetric $n\times n$ matrices. We study the geometries of Jordan nets and webs: we classify the congruence-orbits of Jordan nets (resp. webs) in $\mathbb{S}^n$ for $n\leq 7$ (resp. $n\leq 5$), we find degenerations between these orbits and list obstructions to the existence of such degenerations. For Jordan nets in $\mathbb{S}^n$ for $n\leq5$, these obstructions show that our list of degenerations is complete. For $n=6$, the existence of one degeneration is still undetermined. To explore further, we used an algorithm that indicates numerically whether a degeneration between two orbits exists. We verified this algorithm using all known degenerations and obstructions, and then used it to compute the degenerations between Jordan nets in $\mathbb{S}^7$ and Jordan webs in $\mathbb{S}^n$ for $n=4,5$.

math.AG↗

arXiv2021

Jordan Algebras of Symmetric Matrices

We study linear spaces of symmetric matrices whose reciprocal is also a linear space. These are Jordan algebras. We classify such algebras in low dimensions, and we study the associated Jordan loci in the Grassmannian.

math.RA↗

arXiv2021

Solving two-parameter eigenvalue problems using an alternating method

We present a new approach to compute selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. Our method requires computing generalized eigenvalue problems of the same size as the matrices of the initial two-parameter eigenvalue problem. The method is applicable for right definite problems, possibly after performing an affine transformation. This includes a class of Helmholtz equations when separation of variables is applied. We provide a convergence proof for extremal eigenvalues and empirical evidence along with a local convergence proof for other eigenvalues.

math.NA↗

arXiv2020

Existence of dynamical low-rank approximations to parabolic problems

The existence and uniqueness of weak solutions to dynamical low-rank evolution problems for parabolic partial differential equations in two spatial dimensions is shown, covering also non-diagonal diffusion in the elliptic part. The proof is based on a variational time-stepping scheme on the low-rank manifold. Moreover, this scheme is shown to be closely related to practical methods for computing such low-rank evolutions.

math.NA↗