default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeike Faßbender
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Heike Faßbender, Martin Halwaß:
A note on the singular value decomposition of idempotent and involutory matrices. CoRR abs/2403.05214 (2024)- 2023
- [i8]Christian Bertram, Heike Faßbender:
On a family of low-rank algorithms for large-scale algebraic Riccati equations. CoRR abs/2304.01624 (2023) - [i7]Christian Bertram, Heike Faßbender:
A rational Krylov subspace based projection method for solving large-scale algebraic Riccati equations via low-rank approximations. CoRR abs/2312.08855 (2023) - 2022
- [i6]Peter Benner, Heike Faßbender, Michel-Niklas Senn:
The Hamiltonian Extended Krylov Subspace Method. CoRR abs/2202.12640 (2022) - 2021
- [j16]Peter Benner
, Heike Faßbender, Philip Saltenberger:
A Rational Even-IRA Algorithm for the Solution of T-Even Polynomial Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 42(3): 1172-1198 (2021) - 2020
- [j15]Tobias Damm, Heike Faßbender:
Simultaneous Hollowization, Joint Numerical Range, and Stabilization by Noise. SIAM J. Matrix Anal. Appl. 41(2): 637-656 (2020) - [i5]Christian Bertram, Heike Faßbender:
A link between gramian based model order reduction and moment matching. CoRR abs/2003.03101 (2020) - [i4]Heike Faßbender, Miroslav Rozlozník, Sanja Singer:
Nearly optimal scaling in the SR decomposition. CoRR abs/2004.03288 (2020) - [i3]Christian Bertram, Heike Faßbender:
Riccati ADI: Existence, uniqueness and new iterative methods. CoRR abs/2004.11212 (2020) - [i2]Peter Benner, Heike Faßbender, Philip Saltenberger:
A rational Even-IRA algorithm for the solution of T-even polynomial eigenvalue problems. CoRR abs/2009.01762 (2020)
2010 – 2019
- 2019
- [i1]Tobias Damm, Heike Faßbender:
Simultaneous hollowisation, joint numerical range, and stabilization by noise. CoRR abs/1910.08813 (2019) - 2018
- [j14]Peter Benner, Heike Faßbender, Michael Hinze, Tatjana Stykel, Ralf Zimmermann:
Model reduction of complex dynamical systems - Editorial of the special issue corresponding to a workshop held at SDU Odense, Denmark, January 11-13, 2017. Adv. Comput. Math. 44(6): 1687-1691 (2018) - [j13]Peter Benner, Heike Faßbender, Lars Grasedyck, Daniel Kressner, Beatrice Meini, Valeria Simoncini:
7th Workshop on Matrix Equations and Tensor Techniques. Numer. Linear Algebra Appl. 25(6) (2018) - 2016
- [j12]Heike Faßbender, Javier Pérez, Nikta Shayanfar:
Constructing symmetric structure-preserving strong linearizations. ACM Commun. Comput. Algebra 50(4): 167-169 (2016) - [j11]Thomas Bonin, Heike Faßbender, Andreas Soppa, Michael F. Zäh:
A fully adaptive rational global Arnoldi method for the model-order reduction of second-order MIMO systems with proportional damping. Math. Comput. Simul. 122: 1-19 (2016) - 2015
- [r1]Peter Benner, Heike Faßbender:
Model Order Reduction: Techniques and Tools. Encyclopedia of Systems and Control 2015 - 2011
- [j10]Peter Benner, Heike Faßbender:
On the numerical solution of large-scale sparse discrete-time Riccati equations. Adv. Comput. Math. 35(2-4): 119-147 (2011) - [j9]Heike Faßbender, Andreas Soppa:
Machine tool simulation based on reduced order FE models. Math. Comput. Simul. 82(3): 404-413 (2011)
2000 – 2009
- 2007
- [j8]Peter Benner, Heike Faßbender:
On the Solution of the Rational Matrix Equation X=Q+LX-1LT. EURASIP J. Adv. Signal Process. 2007 (2007) - [c1]José M. Badía, Peter Benner, Maribel Castillo, Heike Faßbender, Rafael Mayo, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí:
Strategies for Parallelizing the Solution of Rational Matrix Equations. PARCO 2007: 255-262 - 2006
- [j7]Heike Faßbender, Peter Benner:
Numerische Methoden zur passivitätserhaltenden Modellreduktion (Numerical Methods for Passivity Preserving Model Reduction). Autom. 54(4): 153-160 (2006) - 2001
- [j6]Heike Faßbender:
The parameterized SR algorithm for symplectic (butterfly) matrices. Math. Comput. 70(236): 1515-1541 (2001) - [j5]Peter Benner, Heike Faßbender:
An Implicitly Restarted Symplectic Lanczos Method for the Symplectic Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 22(3): 682-713 (2001) - 2000
- [j4]Birgit Bohnhorst, Angelika Bunse-Gerstner, Heike Faßbender:
On the Perturbation Theory for Unitary Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 21(3): 809-824 (2000)
1990 – 1999
- 1997
- [j3]Heike Faßbender:
On numerical methods for discrete least-squares approximation by trigonometric polynomials. Math. Comput. 66(218): 719-741 (1997) - [j2]Angelika Bunse-Gerstner, Heike Faßbender:
A Jacobi-like method for solving algebraic Riccati equations on parallel computers. IEEE Trans. Autom. Control. 42(8): 1071-1084 (1997) - 1991
- [j1]Angelika Bunse-Gerstner, Heike Faßbender:
On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation. SIAM J. Sci. Comput. 12(4): 911-939 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
