11 citations · 23 across the 13 of their papers we have counts for
14 papers
On a family of low-rank algorithms for large-scale algebraic Riccati equations
Christian Bertram, Heike Faßbender
In [3] it was shown that four seemingly different algorithms for computing low-rank approximate solutions to the solution of large-scale continuous-time algebraic Riccati…
The Hamiltonian Extended Krylov Subspace Method
Peter Benner, Heike Faßbender, Michel-Niklas Senn
An algorithm for constructing a -orthogonal basis of the extended Krylov subspace $H^{2r-1}u, H^{-1}u, H^{-2}u,…
A rational Even-IRA algorithm for the solution of T-even polynomial eigenvalue problems
Peter Benner, Heike Fassbender, Philip Saltenberger
In this work we present a rational Krylov subspace method for solving real large-scale polynomial eigenvalue problems with T-even (that is, symmetric/skew-symmetric) structure. Our…
Riccati ADI: Existence, uniqueness and new iterative methods
Christian Bertram, Heike Faßbender
The approximate solution of large-scale algebraic Riccati equations is considered. We are interested in approximate solutions which yield a Riccati residual matrix of a particular…
Nearly optimal scaling in the SR decomposition
Heike Fassbender, Miroslav Rozloznik, Sanja Singer
In this paper we analyze the nearly optimal block diagonal scalings of the rows of one factor and the columns of the other factor in the triangular form of the SR decomposition. Th…
A link between gramian based model order reduction and moment matching
Christian Bertram, Heike Faßbender
We analyze a family of Runge-Kutta based quadrature algorithms for the approximation of the gramians of linear time invariant dynamical systems. The approximated gramians are used…