The eigenvalue problem (A- B)x = 0 for symmetric matrices of high order
From MaRDI portal
Publication:758850
Cites work
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- scientific article; zbMATH DE number 3690631 (Why is no real title available?)
- scientific article; zbMATH DE number 3278796 (Why is no real title available?)
- scientific article; zbMATH DE number 3307656 (Why is no real title available?)
- scientific article; zbMATH DE number 3349178 (Why is no real title available?)
- scientific article; zbMATH DE number 3194067 (Why is no real title available?)
- scientific article; zbMATH DE number 3083850 (Why is no real title available?)
- Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
- New iterative methods for solution of the eigenproblem
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
Cited in
(16)- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- An accelerated subspace iteration method
- A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
- Computational methods of linear algebra
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- Rustishauser's modified method for computing the eigenvalues of symmetric matrices
- Ein neues Gradientenverfahren zur simultanen Berechnung der kleinsten oder größten Eigenwerte des allgemeinen Eigenwertproblems
- Iterative eigenvalue algorithms based on convergent splittings
- Two algorithms for treating \(Ax=\lambda Bx\)
- Super-matrix methods
- The method of coordinate overrelaxation for \((A-\lambda B)x = 0\)
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx
This page was built for publication: The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758850)
