- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Chemnitz, Technische Universität Chemnitz, Dissertation, 2012
- Schlagwort
-
Algorithms
Symmetrische Matrix
Eigenwert
Numerisches Verfahren
QR-Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Chemnitz
- (wer)
-
Universitätsbibliothek Chemnitz
- (wann)
-
2012
- Urheber
-
Mach, Thomas
- Beteiligte Personen und Organisationen
-
Benner, Peter
Börm, Steffen
- URN
-
urn:nbn:de:bsz:ch1-qucosa-85308
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Mach, Thomas
- Benner, Peter
- Börm, Steffen
- Universitätsbibliothek Chemnitz
Entstanden
- 2012
Ähnliche Objekte (12)
Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix
Lanczos algorithms for large symmetric eigenvalue computations, Vol. 2.. Programs
Lanczos algorithms for large symmetric eigenvalue computations, Vol. 1.. Theory
Hierarchical matrices: algorithms and analysis
Bounds for the minimum eigenvalue of a symmetric Toeplitz matrix
Parallel Algorithms for the Solution of Banded Symmetric Generalized Eigenvalue Problems
Sufficient conditions for symmetric matrices to have exactly one positive eigenvalue
Flux-corrected transport algorithms preserving the eigenvalue range of symmetric tensor quantities
Iterative refinement for symmetric eigenvalue decomposition
Newton type methods for computing the smallest eigenvalue of a symmetric Toeplitz matrix
Hierarchical community detection via rank-2 symmetric nonnegative matrix factorization
LARSTRAN 80 [eighty] : solution of linear equations and linear eigenvalue problems with regular symmetric and non-symmetric matrices
Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix
Lanczos algorithms for large symmetric eigenvalue computations, Vol. 2.. Programs
Lanczos algorithms for large symmetric eigenvalue computations, Vol. 1.. Theory
Hierarchical matrices: algorithms and analysis
Bounds for the minimum eigenvalue of a symmetric Toeplitz matrix
Parallel Algorithms for the Solution of Banded Symmetric Generalized Eigenvalue Problems
Sufficient conditions for symmetric matrices to have exactly one positive eigenvalue
Flux-corrected transport algorithms preserving the eigenvalue range of symmetric tensor quantities
Iterative refinement for symmetric eigenvalue decomposition
Newton type methods for computing the smallest eigenvalue of a symmetric Toeplitz matrix
Hierarchical community detection via rank-2 symmetric nonnegative matrix factorization
LARSTRAN 80 [eighty] : solution of linear equations and linear eigenvalue problems with regular symmetric and non-symmetric matrices
Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix
Lanczos algorithms for large symmetric eigenvalue computations, Vol. 2.. Programs
Lanczos algorithms for large symmetric eigenvalue computations, Vol. 1.. Theory
Hierarchical matrices: algorithms and analysis
Bounds for the minimum eigenvalue of a symmetric Toeplitz matrix
Parallel Algorithms for the Solution of Banded Symmetric Generalized Eigenvalue Problems
Sufficient conditions for symmetric matrices to have exactly one positive eigenvalue
Flux-corrected transport algorithms preserving the eigenvalue range of symmetric tensor quantities
Iterative refinement for symmetric eigenvalue decomposition
Newton type methods for computing the smallest eigenvalue of a symmetric Toeplitz matrix
Hierarchical community detection via rank-2 symmetric nonnegative matrix factorization