An Algorithm for Ax = \lambda Bx with Symmetric and Positive-Definite A and B
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.
- An algorithm for the symmetric generalized eigenvalue problem
- HMDR and FMDR algorithms for the generalized eigenvalue problem
- Augmentation of the generalised \(n\times n\) eigenvalue equation to a generalised \((n+1)\times (n+1)\) eigenvalue equation
- Parallel reduction of four matrices to condensed form for a generalized matrix eigenvalue algorithm
- Continuous methods for symmetric generalized eigenvalue problems
- An alternative to the KQZ-algorithm
- scientific article; zbMATH DE number 4143343 (Why is no real title available?)
- scientific article; zbMATH DE number 4037034 (Why is no real title available?)
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
- An Efficient and Stable Algorithm for the Symmetric-Definite Generalized Eigenvalue Problem
- Efficient reduction of banded Hermitian positive definite generalized eigenvalue problems to banded standard eigenvalue problems
- Algorithm 646
- scientific article; zbMATH DE number 815446 (Why is no real title available?)
- An Algorithm for Quadratic Eigenproblems with Low Rank Damping
- An Algorithm for the Banded Symmetric Generalized Matrix
- Effect of Prestress on Pulse Waves in Arteries
- Symmetric-diagonal reductions as preprocessing for symmetric positive definite generalized eigenvalue solvers
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)