Mach, Thomas; Reichel, Lothar; Van Barel, Marc; Vandebril, R.(Journal of Computational and Applied Mathematics, 2016-09-01)
Integral equations of the first kind with a smooth kernel and perturbed right-hand side, which represents available contaminated data, arise in many applications. Discretization gives rise to linear systems of equations ...
A unitary symplectic similarity transformation for a special class of Hamiltonian matrices to extended Hamiltonian Hessenberg form is presented. Whereas the classical Hessenberg form links to Krylov subspaces, the extended ...
Mach, Thomas; Pranić, Miroslav S.; Vandebril, Raf(Electronic Transactions on Numerical Analysis, 2014)
It has been shown that approximate extended Krylov subspaces can be computed, under certain assumptions, without any explicit inversion or system solves. Instead, the vectors spanning the extended Krylov space are retrieved ...
Benner, Peter; Börm, Steffen; Mach, Thomas; Reimer, Knut(Computing and Visualization in Science, 2015-03-04)
The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade (Knyazev et al. in Numerical solution of PDE eigenvalue problems, vol ...
Jagels, Carl; Mach, Thomas; Reichel, Lothar; Vandebril, Raf(Linear Algebra and Its Applications, 2016-12-01)
This article deduces geometric convergence rates for approximating matrix functions via inverse-free rational Krylov methods. In applications one frequently encounters matrix functions such as the matrix exponential or ...
Aurentz, Jared L.; Mach, Thomas; Vandebril, Raf; Watkins, David S.(SIAM Journal on Matrix Analysis and Applications, 2015)
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computing the eigenvalues of the associated companion matrix by Francis's implicitly shifted QR algorithm. A companion matrix is ...
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues. In this article we propose a new backward stable ...
Aurentz, Jared L.; Mach, Thomas; Vandebril, Raf; Watkins, David S.(Electronic Transactions on Numerical Analysis, 2015)
A fast Fortran implementation of a variant of Gragg's unitary Hessenberg QR algorithm is presented. It is proved, moreover, that all QR- And QZ-like algorithms for the unitary eigenvalue problems are equivalent. The algorithm ...
Mach, Thomas; Van Barel, Marc; Vandebril, Raf(Journal of Computational and Applied Mathematics, 2014-12-15)
In inverse eigenvalue problems one tries to reconstruct a matrix, satisfying some constraints, given some spectral information. Here, two inverse eigenvalue problems are solved. First, given the eigenvalues and the first ...
Mach, Thomas; Vandebril, Raf(SIAM Journal on Matrix Analysis and Applications, 2014)
In this paper we discuss the deflation criterion used in the extended QR algorithm based on the chasing of rotations. We provide absolute and relative perturbation bounds for this deflation criterion. Further, we present ...
Benner, Peter; Mach, Thomas(Computing (Vienna/New York), 2010-06-09)
The hierarchical ( backslashfancyscriptH -) matrix format allows storing a variety of dense matrices from certain applications in a special data-sparse way with linear-polylogarithmic complexity. Many operations from linear ...
Aurentz, Jared L.; Mach, Thomas; Robol, Leonardo; Vandebril, Raf; Watkins, David S.(arXiv, 2016-11-08)
Two generalizations of the companion QR algorithm by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analysis and Applications, 36(3): 942--973, 2015, to compute the roots of a polynomial are ...