H
Heike Faßbender
Researcher at Braunschweig University of Technology
Publications - 57
Citations - 627
Heike Faßbender is an academic researcher from Braunschweig University of Technology. The author has contributed to research in topics: Eigenvalues and eigenvectors & Matrix (mathematics). The author has an hindex of 14, co-authored 55 publications receiving 568 citations. Previous affiliations of Heike Faßbender include University of Bremen & Technische Universität München.
Papers
More filters
Journal ArticleDOI
Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems
TL;DR: In this article, Jacobi et al. developed a quaternion characterization of the 4×4 symplectic orthogonal group and the subspaces associated with a matrix in any one of the four classes under consideration.
Journal Article
Cholesky-like Factorizations of Skew-Symmetric Matrices
TL;DR: In this article, a stable O(n3)-approximation algorithm was proposed to compute an R that has the form of a permuted triangular matrix, which is a generalization of the eigenvalue problem with Hamiltonian structure.
Journal ArticleDOI
A fully adaptive rational global Arnoldi method for the model-order reduction of second-order MIMO systems with proportional damping
TL;DR: A new model reduction algorithm is concentrated on for second-order dynamical multi-input and multi-output MIMO systems which automatically generates a reduced system approximating the transfer function in the lower range of frequencies.
Journal ArticleDOI
The Symplectic Eigenvalue Problem, the Butterfly Form, the SR Algorithm, and the Lanczos Method
TL;DR: In this article, the authors discuss some aspects of the recently proposed symplectic butterfly form which is a condensed form for symplectic matrices, and present a Lanczos-like algorithm for reducing a symplectic matrix to butterfly form.
Journal ArticleDOI
A Hamiltonian Krylov―Schur-type method based on the symplectic Lanczos process
TL;DR: A Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm for the Hamiltonian eigenvalue problem is discussed, which allows to easily implement a purging and locking strategy in order to improve the convergence properties of the symp eclectic Lanczo algorithm.