A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems (Q1146497): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0021-9991(79)90152-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1983537157
@@ Property / OpenAlex ID: W1983537157 / rank @@
+Normal rank
@@ Property / cites work @@
+Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
+Normal rank
@@ Property / cites work @@
+The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
+Normal rank
@@ Property / cites work @@
+Computational aspects of F. L. Bauer's simultaneous iteration method
+Normal rank
@@ Property / cites work @@
+The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
+Normal rank
@@ Property / cites work @@
+𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
+Normal rank
@@ Property / cites work @@
+The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
+Normal rank