An Algorithm for Ax = \lambda Bx with Symmetric and Positive-Definite A and B

From MaRDI portal
Publication:3980609





An algorithm for computing the solution of the generalized eigenvalue problem \(Ax=\lambda Bx\) with real symmetric and positive \(n\times n\) matrices \(A\) and \(B\) is considered. By means of the Cholesky decompositions \(A=LL^ T\) and \(B=L_ BL^ T_ B\) the problem is reduced to the generalized singular value problem \(LL^ Tx= \lambda(L_ BL^ T_ B)x\). The problem of computing the generalized singular value decomposition is reduced to the computation of the \(CS\) decomposition of the matrix \(Q\) from the \(QR\) decomposition of \((L,L_ B)^ T=QR\). Finally, \(A\) and \(B\) are reduced to diagonal form by the singular value decomposition. The provided algorithm is faster than the \(QZ\) algorithm: if only the eigenvalues are desired then this algorithm requires \(3h^ 3\) flops in contrast to the \(QZ\) algorithm with \(15h^ 3\) flops. The algorithm is also stable. Numerical examples are presented.











This page was built for publication: An Algorithm for $Ax = \lambda Bx$ with Symmetric and Positive-Definite A and B

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980609)