7 citations · 13 across the 8 of their papers we have counts for
8 papers
Solving the Parametric Eigenvalue Problem by Taylor Series and Chebyshev Expansion
Thomas Mach, Melina A. Freitag
We discuss two approaches to solving the parametric (or stochastic) eigenvalue problem. One of them uses a Taylor expansion and the other a Chebyshev expansion. The parametric eige…
From Hyperbolic Geometry Back to Word Embeddings
Sultan Nurmukhamedov, Thomas Mach, Arsen Sheverdin +1
We choose random points in the hyperbolic disc and claim that these points are already word representations. However, it is yet to be uncovered which point corresponds to which wor…
Adaptive cross approximation for Tikhonov regularization in general form
Thomas Mach, Lothar Reichel, Marc Van Barel
Many problems in Science and Engineering give rise to linear integral equations of the first kind with a smooth kernel. Discretization of the integral operator yields a matrix, who…
Continuous Adaptive Cross Approximation for Ill-posed Problems with Chebfun
Abdulaziz Alqahtani, Thomas Mach, Lothar Reichel
The analysis of linear ill-posed problems often is carried out in function spaces using tools from functional analysis. However, the numerical solution of these problems typically…
Pole-swapping algorithms for alternating and palindromic eigenvalue problems
Thomas Mach, Thijs Steel, Raf Vandebril +1
Pole-swapping algorithms are generalizations of bulge-chasing algorithms for the generalized eigenvalue problem. Structure-preserving pole-swapping algorithms for the palindromic a…
On pole-swapping algorithms for the eigenvalue problem
Daan Camps, Thomas Mach, Raf Vandebril +1
Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence…
Fast and backward stable computation of the eigenvalues and eigenvectors of matrix polynomials
Jared Aurentz, Thomas Mach, Leonardo Robol +2
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigen…
Computing the eigenvalues of symmetric H2-matrices by slicing the spectrum
Peter Benner, Steffen Börm, Thomas Mach +1
The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorit…