Two algorithms for treating \(Ax=\lambda Bx\)
From MaRDI portal
Publication:1240521
DOI10.1016/0045-7825(77)90011-1zbMath0363.65026OpenAlexW2052659155MaRDI QIDQ1240521
Publication date: 1977
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(77)90011-1
Related Items (5)
A partial preconditioned conjugate gradient method for large eigenproblems ⋮ Bisection for Ax=lambdaBx with matrices of variable band width ⋮ Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3926873 Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme] ⋮ Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
- The method of coordinate overrelaxation for \((A-\lambda B)x = 0\)
- Solution of symmetric and unsymmetric band equations and the calculation of eigenvectors of band matrices
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- Eigenvalues of Ax = Bx with band symmetric A and B
- Solution of eigenvalue problems by sturm sequence method
- Eigenproblem solution by a combined Sturm sequence and inverse iteration technique
This page was built for publication: Two algorithms for treating \(Ax=\lambda Bx\)