AbstractWe present a Cholesky LR algorithm with Laguerre’s shift for computing the eigenvalues of a positive definite symmetric diagonal-plus-semiseparable matrix. By exploiting the semiseparable structure, each step of the method can be performed in linear time
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
For a given symmetric positive definite matrix A {element_of} R{sup N x N}, we develop a fast and ba...
For a given symmetric positive definite matrix A {element_of} R{sup nxn}, we develop a fast and back...
AbstractWe present a Cholesky LR algorithm with Laguerre’s shift for computing the eigenvalues of a ...
A dense symmetric matrix can be reduced into a similar diagonal-plus-semiseparable one by means of o...
We present a new fast algorithm for solving the generalized eigenvalue problem Tx = lambda Sx, in wh...
A standard method for solving the symmetric definite generalized eigenvalue problem $Ax = \lambda Bx...
SIGLEAvailable from British Library Document Supply Centre-DSC:6184.6725(no 360) / BLDSC - British L...
AbstractIn this paper, we present a novel method for solving the unitary Hessenberg eigenvalue probl...
Let H = DAD where A is a positive definite matrix and D is diagonal and nonsingular. We show that if...
We consider algorithms for three problems in numerical linear algebra: computing the pivoted Cholesk...
We investigate the use of Rutishauser’s LR-Cholesky transformation [8] to com-pute all eigenvalues o...
AbstractA new method is presented for the solution of the matrix eigenvalue problem Ax=λBx, where A ...
AbstractThis paper deals with the eigenproblem of positive definite matrices. A numerical algorithm,...
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If ...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
For a given symmetric positive definite matrix A {element_of} R{sup N x N}, we develop a fast and ba...
For a given symmetric positive definite matrix A {element_of} R{sup nxn}, we develop a fast and back...
AbstractWe present a Cholesky LR algorithm with Laguerre’s shift for computing the eigenvalues of a ...
A dense symmetric matrix can be reduced into a similar diagonal-plus-semiseparable one by means of o...
We present a new fast algorithm for solving the generalized eigenvalue problem Tx = lambda Sx, in wh...
A standard method for solving the symmetric definite generalized eigenvalue problem $Ax = \lambda Bx...
SIGLEAvailable from British Library Document Supply Centre-DSC:6184.6725(no 360) / BLDSC - British L...
AbstractIn this paper, we present a novel method for solving the unitary Hessenberg eigenvalue probl...
Let H = DAD where A is a positive definite matrix and D is diagonal and nonsingular. We show that if...
We consider algorithms for three problems in numerical linear algebra: computing the pivoted Cholesk...
We investigate the use of Rutishauser’s LR-Cholesky transformation [8] to com-pute all eigenvalues o...
AbstractA new method is presented for the solution of the matrix eigenvalue problem Ax=λBx, where A ...
AbstractThis paper deals with the eigenproblem of positive definite matrices. A numerical algorithm,...
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If ...
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The n...
For a given symmetric positive definite matrix A {element_of} R{sup N x N}, we develop a fast and ba...
For a given symmetric positive definite matrix A {element_of} R{sup nxn}, we develop a fast and back...
DOI
Add to ORKG