Add to ORKGWe investigate the use of Rutishauser’s LR-Cholesky transformation [8] to com-pute all eigenvalues of symmetric hierarchical (H-) matrices. Historically, the LR transformation was the first algorithm of the class of GR algorithms [11]
In this thesis we address the computation of a spectral decomposition for symmetric banded matrices....
In this paper we present a new stable algorithm for the parallel QR-decomposition of ”tall and skinn...
AbstractA brief and practical algorithm is introduced to solve symmetric inverse eigenvalue problems...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
The standard algorithms for dense matrices become expensive for large matrices, since the number of ...
AbstractWe present a Cholesky LR algorithm with Laguerre’s shift for computing the eigenvalues of a ...
in accordance with the requirements for the degree Dr. rer. nat.-6-4-2-1 0 1 2 4 6 a0 = −6.5 b0 = 5....
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations ...
In this paper we consider a class of hierarchically rank structured matrices, including some of the ...
the theory of orthogonal polynomials, there are a lot of similarities between measures on the real l...
Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays...
Abstract. In this paper, we consider a class of hierarchically rank structured matrices that include...
The hierarchical (H-) matrix format allows storing a variety of dense matrices from certain applicat...
This self-contained monograph presents matrix algorithms and their analysis. The new technique enabl...
In this thesis we address the computation of a spectral decomposition for symmetric banded matrices....
In this paper we present a new stable algorithm for the parallel QR-decomposition of ”tall and skinn...
AbstractA brief and practical algorithm is introduced to solve symmetric inverse eigenvalue problems...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
The standard algorithms for dense matrices become expensive for large matrices, since the number of ...
AbstractWe present a Cholesky LR algorithm with Laguerre’s shift for computing the eigenvalues of a ...
in accordance with the requirements for the degree Dr. rer. nat.-6-4-2-1 0 1 2 4 6 a0 = −6.5 b0 = 5....
The computation of eigenvalues of large-scale matrices arising from finite element discretizations h...
The computation of eigenvalues of large-scale matrices arising from finite ele-ment discretizations ...
In this paper we consider a class of hierarchically rank structured matrices, including some of the ...
the theory of orthogonal polynomials, there are a lot of similarities between measures on the real l...
Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays...
Abstract. In this paper, we consider a class of hierarchically rank structured matrices that include...
The hierarchical (H-) matrix format allows storing a variety of dense matrices from certain applicat...
This self-contained monograph presents matrix algorithms and their analysis. The new technique enabl...
In this thesis we address the computation of a spectral decomposition for symmetric banded matrices....
In this paper we present a new stable algorithm for the parallel QR-decomposition of ”tall and skinn...
AbstractA brief and practical algorithm is introduced to solve symmetric inverse eigenvalue problems...