The method of coordinate overrelaxation for \((A-\lambda B)x = 0\)
From MaRDI portal
Publication:1394085
DOI10.1007/BF01459947zbMath0278.65038MaRDI QIDQ1394085
Publication date: 1974
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132294
Related Items
A partial preconditioned conjugate gradient method for large eigenproblems, Computational methods of linear algebra, Two algorithms for treating \(Ax=\lambda Bx\)
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
- New iterative methods for solution of the eigenproblem
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
- Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
- Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
- On the Solution of Singular and Semidefinite Linear Systems by Iteration
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- Algorithms for the Nonlinear Eigenvalue Problem
