A gradient method for the matrix eigenvalue problem Ax = Bx
From MaRDI portal
A gradient method for the matrix eigenvalue problem \(Ax = \lambda Bx\)
Cites work
- scientific article; zbMATH DE number 3429996 (Why is no real title available?)
- scientific article; zbMATH DE number 3361187 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- $Ax = \lambda Bx$ and the Generalized Eigenproblem
- A general approach to one-step iterative methods with application to eigenvalue problems
- New iterative methods for solution of the eigenproblem
- On the Set of Subsequential Limit Points of Successive Approximations
- On the computation of selected eigenvalues
- Solution of eigenvalue problems in Hilbert spaces by a gradient method
Cited in
(11)- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- The method of closest approach for finding nonisolated zeros of functions
- A spectral problem for polynomial pencils of matrices
- Some convergence results on the method of gradients for \(Ax=\lambda Bx\)
- Computational methods of linear algebra
- A convergent gradient method for matrix eigenvector-eigentuple problems
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Connection between the spectral problem for linear matrix pencils and some problems of algebra
- A minimization method for the solution of large symmetriric eigenproblems
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
This page was built for publication: A gradient method for the matrix eigenvalue problem \(Ax = \lambda Bx\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560703)
